Optimal Routing Algorithms Based On Energy-efficient In Ad Hoc Networks

A wireless ad hoc network is an autonomous collection of mobile nodes that communicate over relatively bandwidth-constrained wireless links. Nevertheless, the limited battery power characteristic of wireless ad hoc networks limits the utilization time of wireless devices and the networks. Reducing energy consumption and extending network lifetime are two important issues in the study of wireless ad hoc networks. The study of energy-efficiency is relative to each layer of ad hoc networks. In particular, this paper focuses on the optimal energy routing protocol and topology control.Firstly, the paper analyses the models of node energy consumption and optimal energy routing mechanisms. To locate bottleneck node of a route, a new metric, the Power Cost Function (PCF), is proposed. The PCF metric is dynamically combined with the value of the residual battery capacity and using condition to determine which nodes can be part of an active route. Two optimal energy routing protocols E-DSR and E-AODV are proposed based on new route selection mechanisms and mobility prediction. The simulation results show that using the PCF for optimal energy routing protocols extend lifetime of nodes, enhance the efficiencies of the data forwarding and reduce energy consumption.A number of distributed algorithms have been proposed recently that are either focused on reducing energy consumption or focused on extending network lifetime. In this paper, a randomized distributed algorithm, R-REMiT (A Randomized distributed algorithm for Refining Energy-Efficient Multicast Trees in ad hoc Networks), is presented. The probability of refining energy-efficient multicast tree is decided by the difference of PCF between node and its neighbors. Our simulation results show that this nice integration well balances the two metrics of multicast trees, and improves the lifetime of multicast trees efficiently with little sacrifice on total energy cost.