Pharos: A Rapid Neighbor Discovery Algorithm for Power-Restricted Wireless Sensor Networks
Yuchen Zhu, Bo Yang, Min Liu, Zhongcheng Li · 2019
As it is difficult for power-restricted wireless sensor nodes to achieve rapid neighbor discovery under the scenarios of asynchronous clocks, misaligned time slots, and asymmetric duty-cycle (i.e., wake-up/sleep) scheduling periods, we propose a low-power neighbor discovery algorithm termed Pharos by alternately utilizing the fully and the partially awake time slots. The partially awake time slots of one node are certain to detect the counterpart's awake slots while reducing the power consumption as compared to the fully awake time slots. We analyze the theoretical neighbor discovery latency and derive the optimal parameters for both symmetric and asymmetric duty-cycle schedules. We also verify the effectiveness of the Pharos algorithm through extensive simulations. Evaluation results display that Pharos costs much less discovery latency and power than the state-of-the-art neighbor discovery algorithms.