On heterogeneous neighbor discovery in wireless sensor networks

Abstract

Abstract-Neighbor discovery plays a crucial role in the formation of wireless sensor networks and mobile networks where the power of sensors (or mobile devices) is constrained. Due to the difficulty of clock synchronization, many asynchronous protocols based on wake-up scheduling have been developed over the years in order to enable timely neighbor discovery between neighboring sensors while saving energy. However, existing protocols are not fine-grained enough to support all heterogeneous battery duty cycles, which can lead to a more rapid deterioration of longterm battery health for those without support. Existing research can be broadly divided into two categories according to their neighbor-discovery techniques-the quorum based protocols and the co-primality based protocols. In this paper, we propose two neighbor discovery protocols, called Hedis and Todis, that optimize the duty cycle granularity of quorum and co-primality based protocols respectively, by enabling the finest-grained control of heterogeneous duty cycles. We compare the two optimal protocols via analytical and simulation results, which show that although the optimal co-primality based protocol (Todis) is simpler in its design, the optimal quorum based protocol (Hedis) has a better performance since it has a lower relative error rate and smaller discovery delay, while still allowing the sensor nodes to wake up at a more infrequent rate.

Maximizing Broadcast Throughput Under Ultra-Low-Power Constraints

“…Within this large body of work, most of the protocols do not explicitly account for different listen and transmit power consumption levels of the nodes [5,6,8,9,16,26,43,46,49,50,[52][53][54]59,60], or do not account for different power budgets [14,17,[52][53][54]59]. They mostly use a duty cycle during which nodes sleep to conserve energy and when nodes are simultaneously awake, a pre-determined listentransmit sequence with an unalterable power consumption level is used.…”

“…Groupput directly applies to tracking applications in which nodes utilize a neighbor discovery protocol to identify neighbors which are within wireless communication range [8,27,29,42,49,53,57,60].…”

Asymmetric Neighbor Discovery Protocol for Wireless Sensor Networks using Block Design

“…The following protocols were implemented for the performance comparison; the OR-based NDP [14], U-Connect [5], Disco [3], and Todis [19]. For the configurations of the simulation environment, we assume 50 sensors are randomly spread over a m sending field.…”

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

“…However, the worst-case discovery latency of the prime number-based methods is quite high, and the amount of battery wasted while listening to an advertisement message from neighboring sensors is significant. SearchLight [10] and Hedis [11] use an n×n matrix to construct neighbor discovery schedules. They choose some row elements and one column from the matrix to determine a set of active slots.…”