Distributed Power Control Routing Algorithm Based on Shortest Path Tree
LingXiao Ge · Chuangan jishu xuebao · 2012
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.