Title :
On constructing minimum-energy path-preserving graphs for ad-hoc wireless networks
Author :
Rahman, Ashikur ; Gburzynski, Pawel
Author_Institution :
Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada
Abstract :
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, Gmax, in which edges represent direct reachability at maximum power. We propose a new algorithm for constructing minimum-energy path-preserving subgraphs of Gmax. Its superiority over previous solutions demonstrates once again that strict protocol layering in wireless networks tends to be detrimental to performance.
Keywords :
access protocols; ad hoc networks; graph theory; power control; routing protocols; telecommunication control; telecommunication network topology; MAC layer; ad-hoc networks; ad-hoc wireless networks; direct reachability; maximum powered graph; minimum-energy path-preserving graph construction; power control problem; subgraphs; topology control; Access protocols; Ad hoc networks; Computer networks; Media Access Protocol; Network topology; Power control; Shape; Spread spectrum communication; Wireless application protocol; Wireless networks;
Conference_Titel :
Communications, 2005. ICC 2005. 2005 IEEE International Conference on
Print_ISBN :
0-7803-8938-7
DOI :
10.1109/ICC.2005.1494964
