The routing information is hard to maintain and the energy is limited in highly dynamic wireless sensor network. To solve these problems, energy-saving geographic routing (ESGR) is proposed, which does not maintain the network topology and can save energy. A node broadcast its position information to its neighboring nodes before transmitting data. The neighboring nodes compute the position of the virtual relay node using the data transmitter position, the base station position and the energy consumption for circuits and propagation. The neighboring nodes determine whether to become the relay node through competition based on its position, the destination position and the virtual relay node position. The neighboring nodes compute the delay time distributedly according to the competition strategy. The neighboring node with the shortest delay time can respond to the data sender first and become the sole relay node. The handshake mechanism efficiently prevents the collision among the neighboring nodes during competition, which is of high communication efficiency. When a routing hole is found, the relay region is changed and an approaching destination relay strategy is adopted, which reduces the impact of routing holes. The simulation shows that the proposed algorithm is better than BLR, because of the lower energy consumption and lower packet loss ratio. The ESGR algorithm is more appropriate for highly dynamic wireless network.

No abstract

No abstract