Title :
Minimum Energy Range Assignment in Heterogeneous Ad-Hoc Networks
Author :
Di Ianni, M. ; Rossi, Gianluca
Author_Institution :
Dipt. di Mat., Univ. degli Studi di Roma, Rome
Abstract :
In this paper we provide a polynomial-time 2-approximation algorithm for the all-to-all minimum cost range assignment problem in ad-hoc wireless networks that can be modelled by generic directed weighted graphs. The best already known approximation algorithm has a logarithmic approximation fact.
Keywords :
ad hoc networks; approximation theory; computational complexity; directed graphs; ad-hoc wireless networks; all-to-all minimum cost range assignment problem; generic directed weighted graph; heterogeneous ad-hoc networks; logarithmic approximation fact; minimum energy range assignment; polynomial-time 2-approximation algorithm; Ad hoc networks; Approximation algorithms; Costs; Erbium; Monitoring; Polynomials; Safety; Telecommunication network reliability; Wireless networks; Wireless sensor networks;
Conference_Titel :
Advanced Information Networking and Applications Workshops, 2007, AINAW '07. 21st International Conference on
Conference_Location :
Niagara Falls, Ont.
Print_ISBN :
978-0-7695-2847-2
DOI :
10.1109/AINAW.2007.249
