计算机应用与软件2017，Vol.34Issue(10)：174-179,6.DOI:10.3969/j.issn.1000-386x.2017.10.030
一种HCTRP协议下PEGASIS最优路径算法
AN OPTIMAL PATH ALGORITHM UNDER HIERARCHICAL CHAIN-TREE ROUTING PROTOCOL BASED ON PEGASIS
摘要
Abstract
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协议/路由算法Key words
WSNs/HCTRP protocol/PEGASIS protocol/Routing Algorithm分类
信息技术与安全科学引用本文复制引用
丁绪星,王婷婷,褚浩,李磊..一种HCTRP协议下PEGASIS最优路径算法[J].计算机应用与软件,2017,34(10):174-179,6.基金项目
国家自然科学基金项目(61401004) （61401004）
安徽师范大学创新基金项目(2015cxsj121). （2015cxsj121）
