Research on relay node placement based on greedy algorithm in wireless sensor networks
Wang Zh · Jisuanji yingyong yanjiu · 2014
To realize the long-distance wireless communication,relay nodes were added in wireless sensor network( WSN), and multi-hop routing was adopted to transmit the data. For the problem of relay node placement,this paper presented a relay node greedy placement algorithm on the basis of the characteristic of linear structure,which could make overall energy consumption of the network minimal. The algorithm used constraints methods,such as greedy strategy,relay node communication capacity and data forwarding hop count of sensor nodes,to astrict the locations of relay nodes. The theory and experiment verify the greedy algorithm can effectively reduce the energy consumption and extend the network lifetime.