低占空比无线传感器网络邻居发现算法研究

低占空比(low duty cycle,LDC)无线传感器网络邻居发现算法是当前无线传感器网络领域的研究热点之一。当前LDC无线传感器网络的邻居发现算法大致可分为同步邻居发现算法和异步邻居发现算法，其中异步发现算法又可分为基于法定人数的调度算法（Grid quorum和 U-connect）和基于中国剩余定理的调度方法(Disco算法)。针对发现延迟和能量消耗，通过仿真实验对当前LDC无线传感器网络邻居发现领域里的典型算法进行了对比分析,在此基础上得出LDC无线传感器网络邻居发现算法新的研究方向。

Neighbor discovery in wireless sensor networks with low duty cycle

Neighbor discovery with low duty cycle in wireless sensor networks is one of the hot points in the fields of the current wireless sensor networks research. The wireless sensor network LDC neighbor discovery algorithms can be divided into synchronous neighbor discovery algorithm and asynchronous neighbor discovery algorithm, and the asynchronous discovery algorithms can be divided into scheduling algorithm based on the quorum (Grid quorum and U-connect) and scheduling method based on Chinese Remainder Theorem (Disco algorithm). Simulation experiments were made to compare the strengths and weaknesses of the current algorithm. Based on those results, new research directions could be derived from neighbor discovery algorithms with low duty cycle in wireless sensor networks.