Abstract—Neighbor discovery is the key to achieve network connectivity in ad hoc networks. Wireless nodes usually work in low duty cycle state to prolong the node life cycle, but it will increase the latency of the neighbor discovery. The discovery latency of nodes with low duty cycle is the focus of this study. This paper analyzes four typical asynchronous neighbor discovery algorithms: Birthday, Disco, U-Connect, and SearchLight, and compare the discovery latency of four algorithms in simulation platform.
Index Terms—Ad hoc network, neighbor discovery, discovery latency, duty cycle.
Zhipeng Jia, Zhiqing Huang, Xiongye Su, and Mengjia Li are with the School of Software Engineering at Beijing University of Technology, Chaoyang District, Beijing China, 100124 (e-mail: s201425029@emails.bjut.edu.cn, zqhuang@bjut.edu.cn, 417984021@qq.com, 15011009295@163.com).
Huan Zhang is with the School of Software Technology at Zhejiang University, Hangzhou Zhejiang China, 310058 (e-mail: lumiahuan@163.com).
[PDF]
Cite:Zhipeng Jia, Zhiqing Huang, Xiongye Su, Mengjia Li, and Huan Zhang, "Research on Neighbor Discovery Latency of Low Duty Cycle Ad Hoc Network," Journal of Advances in Computer Networks vol. 4, no. 2, pp. 131-134, 2016.
