Block combination–based asynchronous wake-up schedule in wireless sensor networks

In wireless sensor networks, when sensor nodes are operated with different ratios of active slots, this is called asymmetric duty cycles. Furthermore, cycles with the same ratio of active slots per cycle for all nodes are called symmetric duty cycles. In wireless sensor networks, most applications r...

Full description

Saved in:
Bibliographic Details
Main Authors: Woosik Lee, Teukseob Song
Format: Article
Language:English
Published: Wiley 2017-10-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1177/1550147717736026
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832547257581305856
author Woosik Lee
Teukseob Song
author_facet Woosik Lee
Teukseob Song
author_sort Woosik Lee
collection DOAJ
description In wireless sensor networks, when sensor nodes are operated with different ratios of active slots, this is called asymmetric duty cycles. Furthermore, cycles with the same ratio of active slots per cycle for all nodes are called symmetric duty cycles. In wireless sensor networks, most applications require both symmetric and asymmetric duty cycles. The balanced incomplete block design–based wake-up schedule is known to be the optimal solution for symmetric duty cycles. However, because this schedule cannot support asymmetric duty cycles, the balanced incomplete block design–based wake-up schedule is not suitable for wireless sensor networks. Herein, we propose a new scheme called the block combination–based asynchronous wake-up schedule to resolve this issue for asymmetric duty cycles. Block combination–based asynchronous wake-up schedule combines different blocks using a block combination operation. The combined schedule guarantees common active slots between sensor nodes in asymmetric duty cycles. To demonstrate the superior performance of block combination–based asynchronous wake-up schedule, we implement a TOSSIM-based simulation and compare the experimental results with recent neighbor discovery protocols such as balanced incomplete block design, prime-based block design, Disco, U-Connect, SearchLight, Hedis, and Todis. We then prove that block combination–based asynchronous wake-up schedule outperforms the others.
format Article
id doaj-art-ead520b845ec4a7281cef7571a47650f
institution Kabale University
issn 1550-1477
language English
publishDate 2017-10-01
publisher Wiley
record_format Article
series International Journal of Distributed Sensor Networks
spelling doaj-art-ead520b845ec4a7281cef7571a47650f2025-02-03T06:45:32ZengWileyInternational Journal of Distributed Sensor Networks1550-14772017-10-011310.1177/1550147717736026Block combination–based asynchronous wake-up schedule in wireless sensor networksWoosik Lee0Teukseob Song1Major of Computer Science, Kyonggi University, Suwon, Republic of KoreaDivision of Convergence Computer and Media, Mokwon University, Daejeon, Republic of KoreaIn wireless sensor networks, when sensor nodes are operated with different ratios of active slots, this is called asymmetric duty cycles. Furthermore, cycles with the same ratio of active slots per cycle for all nodes are called symmetric duty cycles. In wireless sensor networks, most applications require both symmetric and asymmetric duty cycles. The balanced incomplete block design–based wake-up schedule is known to be the optimal solution for symmetric duty cycles. However, because this schedule cannot support asymmetric duty cycles, the balanced incomplete block design–based wake-up schedule is not suitable for wireless sensor networks. Herein, we propose a new scheme called the block combination–based asynchronous wake-up schedule to resolve this issue for asymmetric duty cycles. Block combination–based asynchronous wake-up schedule combines different blocks using a block combination operation. The combined schedule guarantees common active slots between sensor nodes in asymmetric duty cycles. To demonstrate the superior performance of block combination–based asynchronous wake-up schedule, we implement a TOSSIM-based simulation and compare the experimental results with recent neighbor discovery protocols such as balanced incomplete block design, prime-based block design, Disco, U-Connect, SearchLight, Hedis, and Todis. We then prove that block combination–based asynchronous wake-up schedule outperforms the others.https://doi.org/10.1177/1550147717736026
spellingShingle Woosik Lee
Teukseob Song
Block combination–based asynchronous wake-up schedule in wireless sensor networks
International Journal of Distributed Sensor Networks
title Block combination–based asynchronous wake-up schedule in wireless sensor networks
title_full Block combination–based asynchronous wake-up schedule in wireless sensor networks
title_fullStr Block combination–based asynchronous wake-up schedule in wireless sensor networks
title_full_unstemmed Block combination–based asynchronous wake-up schedule in wireless sensor networks
title_short Block combination–based asynchronous wake-up schedule in wireless sensor networks
title_sort block combination based asynchronous wake up schedule in wireless sensor networks
url https://doi.org/10.1177/1550147717736026
work_keys_str_mv AT woosiklee blockcombinationbasedasynchronouswakeupscheduleinwirelesssensornetworks
AT teukseobsong blockcombinationbasedasynchronouswakeupscheduleinwirelesssensornetworks