21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07) Minimum Energy Range Assignment in Heterogeneous Ad-Hoc Networks Niagara Falls, Ontario, Canada May 21-May 23 ISBN: 0-7695-2847-3
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 log-arithmic approximation factor [4].
Citation:
Miriam Di Ianni, Gianluca Rossi, "Minimum Energy Range Assignment in Heterogeneous Ad-Hoc Networks," ainaw, vol. 2, pp.121-126, 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||