Prime Block Design for Asynchronous Wake-Up Schedules in Wireless Sensor Networks

Abstract

Due do the various requirements of sensor applications, it is desired to design a neighbor discovery protocol that supports both symmetric and asymmetric duty cycles. This letter proposes a new block-based neighbor discovery protocol for asymmetric sensor networks by adapting the theory of balanced incomplete block designs and the Chinese remainder theorem. Through the simulation study, it is demonstrated that the proposed block-based neighbor discovery protocol outperforms other neighbor discovery methods, such as Disco, U-Connect, SearchLight, Hedis, and Todis.

A Fast Neighbor Discovery Algorithm in WSNs

“…Many asynchronous neighbor discovery algorithms have emerged in recent years. Based on whether the discovery latency is finite or not, existing pairwise asynchronous protocols are divided into the probabilistic algorithms [12,19,20] and deterministic ones [8,[21][22][23][24][25][26][27][28].…”

“…Searchlight-Striped [7], Non-integer [25] and Lightning [26] are included. There are other related methods, i.e., block-based methods [8,27] and Nihao [28]. In block-based methods, block theory is used to obtain a wakeup schedule.…”

“…As a prerequisite for networking and routing, neighbor discovery is a key procedure [7]. Neighbor discovery is indispensable not only in the initial phase but also at any time when the network is beginning to work, since new sensors may be placed [8,9]. In addition, the neighbors of nodes change quickly in mobile WSNs.…”

Asymmetric Neighbor Discovery Protocol for Wireless Sensor Networks using Block Design

“…In [14], Lee et al, introduced a new approach called an OR-based neighbor discovery protocol that can support both symmetric and asymmetric neighbor discovery in sensor networks. In [15], they further extended the block design based method using a prime number in order to support a network with asymmetric duty cycles. However, the method extends the length of the discovery cycle significantly, and the discovery latency may increase considerably in the worst case.…”

“…In [14,15], it was shown that ( )-BIBD cannot support asymmetric duty cycle. In order to solve this problem, we propose the new NDP method that combines several ( )-BIBD blocks using a bitwise exclusive OR (XOR) operation.…”