Progress and Location Based Localized Power Aware Routing for ad hoc and Sensor Wireless Networks

Abstract

In this article we propose several new progress based, localized, power, and cost aware algorithms for routing in ad hoc wireless networks. These algorithms attempt to minimize the total power and/or cost needed to route a message from source to destination. In localized algorithms, each node makes routing decisions solely on the basis of location of itself, its neighbors and destination. The new algorithms are based on the notion of proportional progress. A node currently holding the packet will forward it to a neighbor, closer to destination than itself, which minimizes the ratio of power and/or cost to reach that neighbor, and the progress made, measured as the reduction in distance to destination, or projection along the line to destination. First, we propose Power Progress, Iterative Power Progress, Projection Power Progress, and Iterative Projection Power Progress algorithms, where the proportional progress is defined in terms of power measure. The power metrics are then replaced by cost or power-cost metrics to define the proportional progress in terms of cost or power-cost measure, resulting in the cost and power-cost variants of the above algorithms. All the new proposed methods are implemented and their performances are compared with other competitive localized algorithms, shortest path. NC (Nearest Closer), and greedy schemes. The new power and cost localized schemes are conceptually simpler than existing schemes, and have similar or somewhat better performance in our experiments. Our localized schemes are shown to be competitive with globalized shortest weighted path based schemes.

Keywords:

• Ad hoc Wireless Networks
• Sensor Networks
• Greedy Routing
• Energy Aware Routing

Notes

6. G.G. Finn, “Routing and addressing in large metropolitan-scale internetworks,” ISI Research Report, ISU/RR-87–180, March 1987