Progress Based Localized Power and Cost Aware Routing Algorithms for Ad Hoc and Sensor Wireless Networks
In this article we propose several new progress based, localized, power and cost aware algorithms for routing in ad hoc wireless networks. 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. 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. 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 also shown to be competitive with globalized shortest weighted path based schemes.
Unable to display preview. Download preview PDF.
- 1.Basagni, S., Conti, M., Giordano, S., Stojmenovic, I. (eds.): Mobile Ad Hoc Networking. IEEE Press/Wiley (2004) (to appear)Google Scholar
- 4.Finn, G.G.: Routing and addressing in large metropolitan-scale internetworks. ISI Research Report, ISU/RR-87-180 (March 1987) Google Scholar
- 7.Singh, S., Woo, M., Raghavendra, C.S.: Power-aware routing in mobile ad hoc networks. In: Proceedings MOBICOM, pp. 181–190 (1988)Google Scholar
- 8.W.: Energy efficient routing protocols for wireless microsensor networks. In: Proceedings Hawaii International Conference on System Sciences (January 2000)Google Scholar