Efficient power aware routing algorithm for mobilead hocnetworks
G. Varaprasad · Wireless Communications and Mobile Computing · 2009
Abstract If the battery of a node is drained out, then it cannot be communicated with other nodes and the number of dead‐nodes makes the network partition. In order to overcome this problem, we propose a new routing algorithm for mobilead hocnetworks. It uses the residual battery capacity, transmission power, and hop‐count to route the data packet. Here the proposed model has simulated with the help of 100 mobile nodes using the network simulator and has tested under various conditions. It compares with thead hocon‐demand distance vector protocol, minimum total transmission power, and min–max battery cost routing models. The proposed model has shown better results in terms of node lifetime and network lifetime. The mobile nodes start to die at 400, 420, 440, 470, and 508 s for AODV, MTPR, MMBCR, CMMBCR, and proposed models, respectively. If the system has 145 J, then the AODV model transmits 38 000 of data packets, whereas the MTPR, MMBCR, CMMBCR, and proposed models will transmit 37 600, 47 240, 41 580, 42 700, and 42 955 of data packets, respectively. Copyright © 2009 John Wiley & Sons, Ltd.