Tightening the upper bound for the minimum energy broadcasting

被引:8
|
作者
Flammini, Michele [1 ]
Klasing, Ralf [2 ]
Navarra, Alfredo [1 ]
Perennes, Stephane [3 ]
机构
[1] Univ Aquila, Dept Comp Sci, I-67100 Laquila, Italy
[2] Univ Bordeaux 1, LaBRI, CNRS, F-33405 Talence, France
[3] Univ Nice, MASCOTTE Project I3S, CNRS, INRIA, F-06108 Nice 2, France
关键词
minimums panning tree; approximation factor; multi-hop; ad hoc networks;
D O I
10.1007/s11276-006-0007-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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). 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 [4], almost closing the gap with the lower bound of 6 [12].
引用
下载
收藏
页码:659 / 669
页数:11
相关论文
共 50 条