Power and cost aware localized routing with guaranteed delivery in wireless networks

Abstract

In a localized routing algorithm, each node currently holding message makes routing decision solely based on the 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. A localized routing algorithm that guarantees delivery in connected unit graphs has been described previously. Also, several power, cost and power-cost aware metrics and localized loop-free routing algorithms for wireless networks based on the exact power needed for transmission between two nodes, and/or remaining battery power at nodes were proposed. However, these algorithms did not guarantee the delivery of a message in connected unit graphs. This paper proposes such 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. 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 (which depend mainly on network density and maximum transmission radius) are obtained.