DocumentCode
3034815
Title
Tighter bounds for the minimum energy broadcasting problem
Author
Navarra, Alfredo
Author_Institution
Dept. of Comput. Sci., L´´Aquila Univ., Italy
fYear
2005
fDate
3-7 April 2005
Firstpage
313
Lastpage
322
Abstract
In this paper we present a new upper bound on the approximation ratio of the minimum spanning tree heuristic for the basic problem on ad-hoc networks given by the minimum-energy broadcast routing (MEBR) problem. We introduce a new analysis allowing to establish a 6.33-approximation ratio in the 2-dimensional case, thus decreasing the previously known 7.6 upper bound (M. Flammini et al., 2004).
Keywords
ad hoc networks; approximation theory; broadcasting; telecommunication network routing; ad-hoc network; minimum energy broadcasting problem; minimum spanning tree heuristic; Ad hoc networks; Broadcasting; Computer networks; Computer science; Context; Costs; Electronic mail; Military computing; Routing; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2005. WIOPT 2005. Third International Symposium on
Print_ISBN
0-7695-2267-X
Type
conf
DOI
10.1109/WIOPT.2005.51
Filename
1421119
Link To Document