Power-aware localized routing in wireless networks

TLDR

A cost‑aware metric based on remaining battery power was proposed for shortest‑cost routing assuming constant transmission power, and later power‑aware metrics that adjust transmission power with distance were also introduced. The study introduces a power‑cost metric and develops localized routing algorithms that aim to minimize total transmission power while extending node battery life and avoiding short‑lifetime nodes. The authors design a power‑cost metric combining node lifetime and distance, analyze its properties to achieve linear power scaling with distance via intermediate nodes, and use this metric to construct localized routing algorithms that rely solely on neighbor location and destination information. They prove the localized power, cost, and power‑cost algorithms are loop‑free and demonstrate their efficiency through experiments.

Abstract

A cost aware metric for wireless networks based on remaining battery power at nodes was proposed for shortest-cost routing algorithms, assuming constant transmission power. Power-aware metrics, where transmission power depends on distance between nodes and corresponding shortest power algorithms were also proposed. We define a power-cost metric based on the combination of both node's lifetime and distance-based power metrics. We investigate some properties of power adjusted transmissions and show that, if additional nodes can be placed at desired locations between two nodes at distance d, the transmission power can be made linear in d as opposed to d/sup /spl alpha// dependence for /spl alpha/ /spl ges/ 2. This provides basis for power, cost, and power-cost localized routing algorithms where nodes make routing decisions solely on the basis, of location of their neighbors and destination. The power-aware routing algorithm attempts to minimize the total power needed to route a message between a source and a destination. The cost-aware routing algorithm is aimed at extending the battery's worst-case lifetime at each node. The combined power-cost localized routing algorithm attempts to minimize the total power needed and to avoid nodes with a short battery's remaining lifetime. We prove that the proposed localized power, cost, and power-cost efficient routing algorithms are loop-free and show their efficiency by experiments.