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].
机构:
Hong Kong Inst Educ, Dept Math & Informat Technol, Tai Po, Hong Kong, Peoples R ChinaHong Kong Inst Educ, Dept Math & Informat Technol, Tai Po, Hong Kong, Peoples R China
Chan, Wai Hong
Xu, Shou-Jun
论文数: 0引用数: 0
h-index: 0
机构:
Lanzhou Univ, Sch Math & Stat, Lanzhou 730000, Gansu, Peoples R ChinaHong Kong Inst Educ, Dept Math & Informat Technol, Tai Po, Hong Kong, Peoples R China