Asynchronous Neighbor Discovery on Duty-cycled Mobile Devices

Abstract

Neighbor discovery is a fundamental problem in wireless networks. In this paper, we study asynchronous neighbor discovery between duty-cycled mobile devices. Each node is duty-cycled, i.e., its radio may only be active for a small fraction of the time. The duty cycles of the nodes can be the same or different, leading to symmetric or asymmetric cases of the neighbor discovery problem. In addition, the setting is asynchronous, i.e., clocks of different nodes may not be synchronized. Most existing studies assume an integer model (where time proceeds in discrete steps); two recent studies break away from this assumption, which allows them to develop significantly more efficient schemes. Our study improves the state-of-the-art in three main fronts. Firstly, we develop a generalized non-integer model (where time is continuous) that permits unified treatment of the assumptions in existing studies. We also provide a reduction that transforms any schedule in the basic integer model to a corresponding schedule in the generalized non-integer model while improving the performance by a factor of two. Applying this reduction, an optimal schedule in the integer model becomes an optimal schedule in the non-integer model. Thirdly, we establish a new family of lower bounds for the best achievable latency guarantee in the non-integer model. They are applicable to both symmetric and asymmetric settings, and encompass the lower bounds for the integer model as special cases. Finally, we develop a novel optimal construction based on Sidon sets for the symmetric setting. Our approach differs from the approaches taken by all existing studies, and provides a new direction for constructing neighbor discovery schedules.

ODM: A Neighbor Discovery Protocol Based on Optimal Discovery Model in WSNs

“…P slot is from 2-th to Researchers afterward find that assigning different sizes to active slots and sleep ones brings a great energy-efficiency improvement. Those studies include Searchlight-Striped [7] and Non-integer [17] protocols. Compared with Searchlight, for Striped-Searchlight each active slot overflows by δ, where δ is so small that only one packet can be sent, and it only probes every even slot from 1 to 2 t      …”

“…For comparison, the theoretical worst-case bounds for different protocols at same DC are given by Table 1. Since Searchlight-Trim is the best protocol in Non-integer [17], we only care Searchlight-Trim. We can see our method reduce the worst-case bound up to 43.89% in theory compared with Searchlight-Trim.…”

“…They assign different sizes to active slots and sleep ones to eliminate the redundancy partly or fully. As a result, their studies, including Searchlight-Striped [7] and Non-integer [17] (Non-integer can amend a series of protocols such as Disco [15], U-connect [16], Searchlight [7]. Searchlight-Trim is the best one in Non-integer), obtain a great energy-efficiency improvement.…”

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

“…BAND [4] and Nested Block Design [5] address the limitation of the BIBD NDP in supporting WSN with ultra-low duty cycles. In [6], the authors proposed an NDP using a non-integer model where nodes may become active or inactive at any point Manuscript in time. In [7], new code-based NDPs were introduced by constructing Diff-Codes for symmetric discovery problems.…”