Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering

Previous Articles     Next Articles

Research on Optimal Neighbor Node Discovery Algorithm in Random Network

LIU Yun,CHEN Changkai   

  1. (School of Information Engineering and Automation,Kunming University of Science and Technology,Kunming 650500,China)
  • Received:2015-08-31 Online:2016-08-15 Published:2016-08-15

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

刘云,陈昌凯   

  1. (昆明理工大学 信息工程与自动化学院,昆明 650500)
  • 作者简介:刘云(1973-),男,副教授,主研方向为无线通信;陈昌凯(通讯作者),硕士研究生。
  • 基金资助:
    国家自然科学基金资助项目(61262040)。

Abstract: 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.

Key words: mobile Ad-hoc network, minimum probability of connection error, energy consumption, random network, OEENDA algorithm

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

关键词: 移动自组网, 最低连接错误概率, 能量消耗, 随机网络, OEENDA算法

CLC Number: