ESAR: An energy saving ad hoc routing algorithm for MANET

Abstract

Mobile ad hoc networks (MANET) support multi hop routing in the absence of central base station. The change in network topology due to the node movement associated with the link failure and creation, scarce in radio resources and bandwidth, limited battery power and computing capability pose challenges in packet routing in MANET. The proposed Energy Saving Ad hoc Routing (ESAR) algorithm targets to achieve better energy efficient with a longer network life time. The algorithm selects a path for routing by considering the actual distance between the source and destination along with the minimum available energy of a node in the path. This selected path is chosen as the best path for packet transmission till any node in the path exhausts battery power beyond a threshold value. At this point of time, a backup path is selected as an alternate path for packet transmission. The process is repeated till all the paths from the same source to destination are exhausted with their battery power. The simulation result of the proposed algorithm ESAR indicates that the network life time is improved upon the existing routing algorithms.