When the nodes can not get the distance to neighbor nodes, to solve the problem that node consumes excessive energy,fails prematurely and leads to reduce the network lifetime,distributed power control routing algorithm based on shortest path tree( DPCRA_SPT) is proposed. Considering energy for transmitting data and neighbor nodes' residual energy, the new weight function and linear power attenuation model are introduced. Finally distributed asynchronous Bellman-Ford algorithm is used to construct the shortest path tree. All nodes transmit data along the shortest path tree to Sink node. Simulation results show that in the densely distributed wireless sensor networks, by adjusting the parameters, DPCRA_SPT can prolong network lifetime and remain energy consumption at a lower level. Under certain conditions,DPCRA_SPT outperforms Ratio_w_FTP,BFFTP,BFSAM and BFPAM algorithms.%当节点不能获知与邻居节点的距离时,为解决节点能量消耗过快而过早失效,从而减少网络生存时间的问题,提出基于最短路径树的分布式功率控制路由算法( DPCRA_SPT).该算法综合考虑网络中节点间传输数据的能耗和邻居节点的剩余能量,引入新的权值函数和功率线性衰减模型.运用分布式非同步Bellman-Ford算法构建最短路径树,所有节点沿着最短路径树将数据汇集到Sink节点.仿真结果表明:在密集分布的无线传感网中,通过调整参数,DPCRA_STT算法可以延长网络生存时间,将能耗保持在较低的水平.在一定的条件下,DPCRA_SPT算法比Ratio_w_FTP、BFFTP、BFSAM、BFPAM算法更优.
展开▼
