一种HCTRP协议下PEGASIS最优路径算法  

AN OPTIMAL PATH ALGORITHM UNDER HIERARCHICAL CHAIN-TREE ROUTING PROTOCOL BASED ON PEGASIS

作　　者：丁绪星[1] 王婷婷[1] 褚浩 李磊 

机构地区：[1]安徽师范大学物理与电子信息学院,安徽芜湖241000

出　　处：《计算机应用与软件》2017年第10期174-179,共6页Computer Applications and Software

基　　金：国家自然科学基金项目(61401004);安徽师范大学创新基金项目(2015cxsj121)

摘　　要：WSNs区域内节点随机分布不均匀,采用HCTRP-PEGASIS路由算法建链时仅参考节点彼此之间的距离,致使部分传感器节点做过多无用功,造成网络能源浪费、节点过早衰竭死亡。给出新算法使建链时除了参照节点彼此之间的距离,同时考虑实际传感器通信半径、相邻节点的当前能量、当前节点密度,进而确定下一个接替节点;以此类推在每个子区域内,最终形成一条数据冗余少、能耗低的数据传输链。仿真显示,相对于LEACH、PEGASIS、HCTRP-PEGASIS,网络生存周期改进算法提高约20%;网络平均总能耗平均到每个节点,改进算法至少降低9 J。故子区域内建链时,结合节点实际通信范围及节点密度等因素来选择链上组员,可以进一步降低网络功耗,提高网络能量利用率,并且延迟第一个节点死亡时间。In WSNs,the nodes have uneven distribution. When the hierarchical chain-tree routing protocol based on PEGASIS is used to build the chain,only the distance between nodes is referred to each other. Resulting in some of the sensor nodes do too much power,resulting in waste of network energy,node premature failure of death. In addition to the distance between the nodes,our approach also considered the actual sensor communication radius,the adjacent node＇s current energy,the current node density,so as to determine the next successor node. By analogy,a data transmission chain with less data redundancy and low energy consumption was developed in each sub region. The simulation results showed that the proposed algorithm improved by about 20% in network lifetime and could reduce energy consumption of network among each node by at least 9 J compared with LEACH,PEGASIS,HCTRP-PEGASIS.Therefore,it is possible to reduce the network power consumption,enhance the energy efficiency and delay the first nodes death time by combining the node＇s actual communication range and node density when the sub region is built into the chain.

关 键 词：WSNS HCTRP协议 PEGASIS协议 路由算法 

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