DocumentCode :
2078865
Title :
On the route refresh frequency for on-demand battery life routing in ad hoc networks
Author :
Meghanathan, Natarajan ; Farago, Andras
Author_Institution :
Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA
Volume :
3
fYear :
2005
fDate :
22-24 Aug. 2005
Firstpage :
291
Abstract :
Loss of connectivity to even node is significant in peer-to-peer ad hoc networks as any node can become a source or destination. Accordingly, we define the network lifetime as the time by which the first node runs out of battery power. Conditional min-max battery cost routing (CMMBCR) [C.K. Toh, 2001] is a generic power-aware routing algorithm proposed to strike a balance between the contrasting objectives of maximizing the node lifetimes and minimizing the energy consumption. CMMBCR works by defining a battery protection threshold γ to switch between a routing scheme in which the total energy consumption is minimized and a routing scheme in which the minimum residual energy of any node on the route is maximized. In an on-demand power-aware routing protocol, existing routes have to be changed/refreshed to take into account of the available battery power of the nodes and extend the time at which the nodes run out of their battery power. Very few works have studied the performance of an on-demand distributed version of CMMBCR. We claim that the route refresh frequency is critical to the performance of CMMBCR and it has to be chosen depending on the battery protection threshold γ and the level of node mobility. We also claim that when the network topology changes dynamically (moderate to high mobility), there is no need to do route discovery to refresh an existing route. Mobility itself guarantees that an existing route is short-lived and the residual battery levels of the nodes can be learnt when a route discovery is done due to route failures. Our simulation results are based on implementing CMMBCR on the top of DSR in ns-2 [K, Fall et al, 2001]. We study the impact of the route refresh frequency on the network lifetime and end-to-end delay per packet under different values of γ, node mobility and offered traffic load. The results presented in this paper can aid in the on-demand performance study of existing power aware routing algorithms in mobile ad hoc networks.
Keywords :
ad hoc networks; mobile radio; routing protocols; telecommunication network topology; battery protection; conditional min-max battery cost routing; end-to-end delay; energy consumption; minimum residual energy; mobile ad hoc networks; network lifetime; network topology; ondemand battery life routing; ondemand power-aware routing protocol; peer-to-peer networks; route refresh frequency; Ad hoc networks; Batteries; Costs; Energy consumption; Frequency; Network topology; Peer to peer computing; Protection; Routing protocols; Switches;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless And Mobile Computing, Networking And Communications, 2005. (WiMob'2005), IEEE International Conference on
Print_ISBN :
0-7803-9181-0
Type :
conf
DOI :
10.1109/WIMOB.2005.1512916
Filename :
1512916
Link To Document :
بازگشت