loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)
Tighter Bounds for the Minimum Energy Broadcasting Problem
Riva del Garda, Trentino, Italy
April 04-April 06
ISBN: 0-7695-2267-X
Alfredo Navarra, University of L?Aquila
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 [3].
Citation:
Alfredo Navarra, "Tighter Bounds for the Minimum Energy Broadcasting Problem," wiopt, pp.313-322, Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.