SCIENCE@home

Pharos: A Rapid Neighbor Discovery Algorithm for Power-Restricted Wireless Sensor Networks

Yuchen Zhu,Bofu Yang,Min Liu,Zhongcheng Li

Published 2019 in Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

ABSTRACT

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.

PUBLICATION RECORD

  • Publication year

    2019

  • Venue

    Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

  • Publication date

    2019-06-01

  • Fields of study

    Computer Science, Engineering

  • Identifiers
    DOI 10.1109/SAHCN.2019.8824821
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-21 of 21 references · Page 1 of 1

CITED BY