An Energy-Balanced Geographic Routing Algorithm for Mobile Ad Hoc Networks

An Energy-Balanced Geographic Routing Algorithm for Mobile Ad Hoc Networks

Blog Article

To mitigate the frequent link breakage and node death caused by node mobility and energy constraints in mobile ad-hoc networks, we propose an energy-balanced routing algorithm for energy and mobility greedy perimeter stateless routing (EM-GPSR) based on geographical location.In the proposed algorithm, the forward region is divided into four sub-regions.Then, according to suspension the remaining lifetime of each node and the distance between the source node and the destination node, we select the next-hop node in the candidate sub-regions.

Since the energy consumption rate of the node is taken into account, the next-hop selection favors the nodes with longer remaining lifetimes.Simulation results show that compared with conventional greedy perimeter stateless routing (GPSR) and speed up-greedy perimeter stateless routing (SU-GPSR) routing algorithms, the proposed algorithm can lead Display Console to a lower end-to-end delay, longer service time, and higher transmission efficiency for the network.