随机网络中邻居节点发现算法优化研究

Research on Optimal Neighbor Node Discovery Algorithm in Random Network

随机网络中节点与邻居节点持续保持联络会加大各节点的能耗。为此,提出一种最佳节能邻居节点算法(OEENDA),该算法在一个有界延迟时间内通过探测机制搜索邻居节点,使用最低连接错误概率实现节点的最低能量消耗。仿真结果表明,与QPS算法和AARP算法相比,OEENDA算法能提高节点发现邻居节点的有效通信,并降低节点自身能量消耗。

In random networks, it is necessary to keep contact between a node and its neighbor nodes to ensure communication. An Optimal Energy-efficient Neighbor Discovery Algorithm （OEENDA） is proposed. It discovers neighbor nodes through detection mechanisms within a delay bound. When the probability of connection error is minimum,a minimum energy consumption of nodes is achieved. Simulation results show that compared with Quorum- based Power Saving （QPS） algorithm and Adaptive and Asynchronous Rendezvous Protocol algorithm, OEENDA algorithm can improve the effectiveness of a node discovering its neighbor nodes, and can reduce the energy consumption of nodes.