On constructing minimum-energy path-preserving graphs for ad-hoc wireless networks
Ashikur Rahman, Paweł Gburzyński · 2005
We consider the power control problem in ad-hoc wireless networks. Local decisions regarding the transmission power level induce a subgraph of the maximum powered graph, G/sub max/, in which edges represent direct reachability at maximum power. We propose a new algorithm for constructing minimum-energy path-preserving subgraphs of G/sub max/. Its superiority over previous solutions demonstrates once again that strict protocol layering in wireless networks tends to be detrimental to performance.