AODV中基于能量的簇头选择算法  

Cluster head selection algorithm based on energy in AODV

作　　者：荆文礼[1] 乐红兵[1] 

机构地区：[1]江南大学物联网工程学院,江苏无锡214122

出　　处：《计算机工程与设计》2012年第10期3697-3701,3707,共6页Computer Engineering and Design

摘　　要：为了解决无线自组网按需平面距离矢量路由协议(AODV)网络生存时间短、节点死亡率高的问题,通过对现有的簇头选择算法的分析并利用网络仿真软件(NS2)进行了大量的仿真模拟,提出了一种基于能量的簇头选择算法。该方法与现有的簇头选择算法最大的不同在于:它是通过在邻居节点中选择一个剩余能量最大的节点当做簇头,而不是根据节点的地理位置。为防止节点能量被过度的消耗设置了能量阈值,只有节点剩余能量大于该阈值的节点才能当做簇头,对于簇头节点规定了它所能管理的最大节点数。NS2仿真结果表明,该方法可以延长网络的生存时间,降低节点的死亡率。To solve the network life short and node＇s death rate high problem in AODV, a cluster head selection algorithm based on energy is proposed through analysis other cluster head algorithm and network simulation. The biggest different between this method and other cluster head algorithm is that it can select a node whose dump energy is maximum as cluster head in neighbor list, instead of based on geographical locatioru To prevent node energy excessive consumption, a energy threshold is set. Only the residual energy of node is greater than the threshold can be a cluster head. A maximum number of managed nodes is provided for the cluster head. The algorithm can extend the network life and reduce node＇s death rate through the NS2 simution.

关 键 词：无线网络 无线自组网按需平面距离矢量路由协议 簇头选择 节省能量 网络仿真软件 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]