Journal of Systems Engineering and Electronics ›› 2010, Vol. 32 ›› Issue (9): 1991-1996.doi: 10.3969/j.issn.1001-506X.2010.09.43

• 软件、算法与仿真 • 上一篇    下一篇

相关邻近集合分布式多跳层次路由协议

汪秉文,汤强,胡晓娅,戴志诚,尹安   

  1. 华中科技大学控制科学与工程系, 湖北 武汉 430074
  • 出版日期:2010-09-06 发布日期:2010-01-03

Distributed multi-hop clustering routing protocol based on relative neighborhood set

WANG Bing-wen,TANG Qiang,HU Xiao-ya,DAI Zhi-cheng,YIN An   

  1. Dept. of Control Science and Engineering, Huazhong Univ. of Science and Technology, Wuhan 430074, China
  • Online:2010-09-06 Published:2010-01-03

摘要:

提出了基于相关邻近集合的能耗均衡多跳分簇路由协议(relative neighborhood set based distributed multihop clustering routing protocol, RNS-MCRP)。网络初始化阶段,基站计算若干个簇头节点以及所有节点的相关邻近集合,并广播簇头信息和所有节点的相关邻近集合。网络启动后,所有节点根据簇头节点的位置信息划分自己的邻居集合,并从邻居集合中选择剩余能量最大的节点作为下一跳节点。簇头节点推举本簇内部最大剩余能量的节点作为下一轮的簇头节点。实验结果显示,与LEACH (low energy adaptive clustering hierarchy)协议相比较,RNSMCRP具有更好的能耗均衡特性,提高了网络生命时间。

Abstract:

The relative neighborhood set based distributed multi-hop clustering routing protocol (RNS-MCRP) is proposed. In the initial stage, BS computes the cluster heads and all the nodes’ relative neighborhood sets and broadcasts the information on cluster heads as well as the relative neighborhood sets in the network. When the network is running, all the nodes divide its own relative neighborhood set according to the node’s position and the positions of the relative neighborhood nodes and the cluster heads’ positions. The node of the relative neighborhood set with the maximum energy is selected as the next hop of the node. The node with the maximum energy is selected as the cluster head of the next round by the cluster head of this round. The simulation results show that compared with low energy adaptive clustering hierarchy (LEACH), RNS-MCRP improves the energy consumption balance property of the network and prolongs the network lifetime.