BlindDate: A Neighbor Discovery Protocol

Abstract

Many wireless applications urgently demand an efficient neighbor discovery protocol to build up bridges connecting user themselves or to some service providers. However, due to intrinsic constraints of wireless devices, e.g., limited energy and error of clock synchronization, there is still absence of effective and efficient neighbor discovery protocols in the literature. In this work, we propose neighbor discovery protocols for the following two problems. First, we study Asynchronous Symmetry Neighbor Discovery problem, in which potential neighbor devices with asynchronous time clocks but the same duty cycle aim to find each other. Second, we propose an efficient protocol (utilizing Bouncing strategy) named BlindDatewith guaranteed worst-case performance 9 10 ð1 þ dÞ 2 x 2 where d is a small fraction of the length of a time slot unit and 1x is the duty cycle. Third, we extend this strategy to address Asynchronous Asymmetry Neighbor Discovery problem, in which both the time clock and the duty cycles of potential neighbors are considered to be heterogeneous. We conduct extensive experiments and simulations to examine the feasibility and efficiency of the proposed protocols, and results show that BlindDate greatly outperforms existing approaches in average-case. Compared with known protocols, BlindDate also achieves a better worst-case discovery latency bound (e.g., 10 percent performance gain comparing with Searchlight [1]).

Neighbor Discovery Optimization for Big Data Analysis in Low-Power, Low-Cost Communication Networks

“…Two different types of slots, called static and dynamic slots, are used in BlindDate [16]. The static slot is approximately the same as the anchor slot in Searchlight.…”

Talk more listen less: Energy-efficient neighbor discovery in wireless sensor networks

“…The author also claims that striped probing is helpful to reduce worstcase latency, which has inspired us to transmit more beacons to reduce probes. BlindDate [9] achieves an even lower latency bound by adding two extra beacons, giving us the intuition that beacons are not necessarily placed in wakeup slots.…”

“…To eliminate the long tail with worst-case latency bounded, deterministic discovery protocols are proposed subsequently. The representative ones are Quorum [5], Disco [6], U-Connect [7], SearchLight [8], BlindDate [9], Hello [10], Hedis and Todis [11], which have continuously pushed the boundary of neighbor discovery protocol research.…”

On the Energy Efficiency and Performance of Neighbor Discovery Schemes for Low Duty Cycle IoT Devices

“…Indirect collaborative mechanisms are application-speci c and di cult to compare quantitatively, since nodes in geographical proximity, but not direct neighbors in the network, can be discovered by such schemes. erefore, in this paper we focus on direct schemes, which can be further classi ed into i) quorum-based [10], ii) prime number-based [11] [12], iii) dynamic listen slot [13] [14], iv) xed listen slot [15] [16], and v) stochastic [17]. ese schemes can work on one or multiple frequency channels [18] [19] [20], and they all follow a similar principle of dividing time into slots and le ing the node to be active in a slot based on a schedule de ned by the respective algorithm.…”

“…Searchlight [14] is an example of such an approach, where a node has a static slot in the beginning of each cycle and an active slot shi ed one slot to the right in each consecutive cycle. Similarly, Blinddate [13] uses one static slot in each cycle and two dynamic listen slots, one shi ed to the right and one to the le in each consecutive cycle. A xed schedule can also be used for listen slots.…”