A  New Approach for Power-Aware Routing for Mobile Adhoc Networks Using Cluster Head With Gateway Table

A New Approach for Power-Aware Routing for Mobile Adhoc Networks Using Cluster Head With Gateway Table

Pawan, Susheela Hooda
DOI: 10.4018/IJWLTT.20210701.oa4
Article PDF Download
Open access articles are freely available for download

Abstract

Wireless ad-hoc networks have become the most vibrant and vital area of research over the past years. Most devices in MANET are power operated. Therefore, the need of the hour is to design a protocol that will not only saves the battery life but also increase the lifetime of participating nodes in the ad-hoc network. In this paper, a new power-aware routing protocol has been proposed which selects the best gateway node for sending the data packets from source to destination. Additionally, the proposed routing protocol extends the battery lifetime of a mobile node and also minimizes the power consumption of an entire network. Moreover, this paper also presents an experimental evaluation of the proposed routing protocol by using three parameters (remaining power path, remaining battery power, and hop count) and provide the best path.
Article Preview
Top

Nodes in mobile ad hoc network are power operated and they are located in such an environment where information needs to be relayed from one point to another point in the absence of a base station. Sometimes, it is impossible to charge the batteries of remotely located nodes .Therefore, power saving nodes are to be needed to increase the lifetime of the network.

Due to availability of less number of resources and power capacity, maintaining an ad-hoc network becomes a significant technical challenge before the researchers(Hannan et al., 2000)(Sharma et al., 2015). Moreover, these characterstic impose restrictions on the network in terms of connectivity of nodes and efficiency of packet transmission. Numerous researchers have been focusing on designing various routing protocols those extend the lifetime of a mobile node and minimize the power consumption of entire network(Wu & Harms, 2001)(Perkins & Hughes, 2002)(Punde et al., 2003)(Johnson & Maltz, 1996)(Sharma & Goel, 2005)(Pathak & Kumar, 2017). In the existing power routing protocols, the maximum number of nodes participate for packet transmission from source node to destination node and minimum number of nodes remain in idle mode. These algorithms and schemes are collectively known as ‘power-aware routing’ protocols. Some of the power-aware existing routing protocols have been described below:

Power-aware source routing (PSR) is one of the power aware routing protocol which is based on dynamic source routing (DSR) protocol(Sharma et al., 2015). It balances the traffic load inside the network. This protocol tries to balance the load in the network.Therefore, it may choose the path, whose power consumption may be high. Moreover, PSR uses DSR, therefore, there will be time wastage in forming the route.

Minimum Total Power Protocol (MTPR) is another power routing protocol which selects the next node on the basis of shortest path between its neighboring nodes. The neighbor node is the node which is selected to be the next node. Thus, the total transmission power consumption is minimized for sending the data packet from source node to destination node (Johnson & Maltz, 1996). Therefore, maximum numbers of nodes participate for data transmission in MTPR.It always selects its nearest neighbor node.Therefore, it leads to network congestion problem.

Complete Article List

Search this Journal:
Reset
Volume 19: 1 Issue (2024)
Volume 18: 2 Issues (2023)
Volume 17: 8 Issues (2022)
Volume 16: 6 Issues (2021)
Volume 15: 4 Issues (2020)
Volume 14: 4 Issues (2019)
Volume 13: 4 Issues (2018)
Volume 12: 4 Issues (2017)
Volume 11: 4 Issues (2016)
Volume 10: 4 Issues (2015)
Volume 9: 4 Issues (2014)
Volume 8: 4 Issues (2013)
Volume 7: 4 Issues (2012)
Volume 6: 4 Issues (2011)
Volume 5: 4 Issues (2010)
Volume 4: 4 Issues (2009)
Volume 3: 4 Issues (2008)
Volume 2: 4 Issues (2007)
Volume 1: 4 Issues (2006)
View Complete Journal Contents Listing