基于动态邻居表的分簇路由协议
Clustering Routing Protocol Based on Dynamic Neighbor Table
-
摘要: 提出了一种基于动态邻居表的分簇协议(clustering routing protocol based on dynamic neighbor table,CRBONT).它以满足特定条件的节点为中心,根据约定的广播半径,动态的建立广播半径内,所有节点的剩余能量组成的邻居表,并以此为依据选取簇头.仿真结果表明,CRBONT算法的簇头分布非常均衡,各个节点的能量消耗差距细微,第一个节点死亡时间明显延迟,能较好地延长网络的生存周期.Abstract: Based on the clustering technology and cluster head election method of LEACH protocol,a new protocol based on dynamic residual energy neighbor table is proposed.Including ID and residual energy of nodes,the dynamic neighbor table is used to select the cluster head.Analysis and simulation results show that,new protocol can improve the shortcoming of LEACH,and equable the distribution of cluster head,and balance the energy consumption of node,and then prolong the lifetime of the network effectively.
下载:
