A New Energy Efficient Routing Algorithm Based on a New Cost Function in Wireless Ad hoc Networks

TL;DR

This paper introduces a novel energy-efficient routing algorithm for wireless ad hoc networks that uses a new cost function to extend network lifetime by avoiding low-energy, mobile, and congested nodes.

Contribution

The paper proposes a new cost function for routing that considers node energy, mobility, and buffer status, improving energy efficiency in ad hoc networks.

Findings

Enhanced network lifetime through the new routing algorithm

Reduced energy consumption by avoiding low-energy nodes

Decreased control packet overhead due to better route stability

Abstract

Wireless ad hoc networks are power constrained since nodes operate with limited battery energy. Thus, energy consumption is crucial in the design of new ad hoc routing protocols. In order to maximize the lifetime of ad hoc networks, traffic should be sent via a route that can be avoid nodes with low energy. In addition, considering that the nodes of ad hoc networks are mobile, it is possible that a created path is broken because of nodes mobility and establishment of a new path would be done again. This is because of sending additional control packets, accordingly, energy consumption increases. Also, it should avoid nodes which have more buffered packets. Maybe, because of long queue, some of these packets are dropped and transmitted again. This is the reason for wasting of energy. In this paper we propose a new energy efficient algorithm, that uses a new cost function and avoid nodes with characteristics which mentioned above. We show that this algorithm improves the network energy consumption by using this new cost function.