Power and cost aware localized routing with guaranteed delivery in unit graph based ad hoc networks

Abstract

In a localized routing algorithm, each node currently holding a message makes forwarding decision solely based on the position information about itself, its neighbors and destination. In a unit graph, two nodes can communicate if and only if the distance between them is no more than the transmission radius, which is the same for each node. This paper proposes localized routing algorithms, aimed at minimizing total power for routing a message or maximizing the total number of routing tasks that a network can perform before a partition. The algorithms are combinations of known greedy power and/or cost aware localized routing algorithms and an algorithm that guarantees delivery. A shortcut procedure is introduced in later algorithm to enhance its performance. Another improvement is to restrict the routing to nodes in a dominating set. These improvements require two-hop knowledge at each node. The efficiency of proposed algorithms is verified experimentally by comparing their power savings, and the number of routing tasks a network can perform before a node loses all its energy, with the corresponding shortest weighted path algorithms and localized algorithms that use fixed transmission power at each node. Significant energy savings are obtained, and feasibility of applying power and cost-aware localized schemes is demonstrated.

Power-aware semi-beaconless 3D georouting algorithms using adjustable transmission ranges for wireless ad hoc and sensor networks

“…Since all the above algorithms are deterministic algorithms which suffer from the local minimum problem, they do not guarantee the delivery of the message in a connected graph. Stojmenovic et al [38] propose guaranteed delivery algorithms in 2D space, which combine Power (P), Cost (C), and Power * Cost (PC) algorithms with Face routing algorithm, similar to the way Greedy algorithm is combined with Face to define the GFG algorithm. Those algorithms start with P, C, or PC forwarding decisions.…”

“…Several power-aware routing algorithms, that try to minimize the total energy consumed by the packet and also increase the average network lifetime, have been proposed [28,38,39]. Let the current node be X, A is a neighbor of X, and the destination is D. Let h ¼ distðX; AÞ; p ¼ distðX; DÞ and q ¼ distðA; DÞ, where q < p. Let the cost of transmitting a packet between two nodes at distance d be ad gðAÞ is the average value of g(l) for A and all neighbors l of A, R is the transmission radius.…”

“…Since there is no flooding it is the best choice to increase the network lifetime. Recent research in positionbased routing usually addresses such routing algorithms in two-dimensional space (2D) [30,28,38,39]. However, in real applications, nodes may be distributed in 3D space such as city landscape, hilly terrain and airborne.…”

Power-Aware 3D Position-based Routing Algorithms for Ad Hoc Networks

“…A general wireless model has been proposed in [14] in which the power consumption between two nodes at distance d is expressed as u(d) = d α + c for some constant α and c. In [12], [17], [18] several power aware routing algorithms, that try to minimize the total energy consumed by the packet and also increase the network life time, have been proposed.…”

“…Recent research in this field usually addresses such routing algorithms in two dimensional space (2D) [13], [12], [17], [18]. However, in real applications, nodes may be distributed in 3D space.…”