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 条
  • [1] Tightening the upper bound for the minimum energy broadcasting
    Michele Flammini
    Ralf Klasing
    Alfredo Navarra
    Stephane Perennes
    [J]. Wireless Networks, 2008, 14 : 659 - 669
  • [2] Upper bound of the minimum energy cost for controlling complex networks
    Duan, Gaopeng
    Li, Aming
    Meng, Tao
    Zhang, Guofeng
    Wang, Long
    [J]. PROCEEDINGS OF THE 38TH CHINESE CONTROL CONFERENCE (CCC), 2019, : 5393 - 5398
  • [3] An upper bound for the minimum rank of a graph
    Berman, Avi
    Friedland, Shmuel
    Hogben, Leslie
    Rothblum, Uriel G.
    Shader, Bryan
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2008, 429 (07) : 1629 - 1638
  • [4] Tighter bounds for the minimum energy broadcasting problem
    Navarra, A
    [J]. Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2005, : 313 - 322
  • [5] 3-D minimum energy broadcasting
    Navarra, Alfredo
    [J]. STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2006, 4056 : 240 - 252
  • [6] Upper bound on the minimum distance of turbo codes
    Breiling, M
    Huber, JB
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2001, 49 (05) : 808 - 815
  • [7] AN UPPER BOUND ON THE MINIMUM DISTANCE OF A CONVOLUTIONAL CODE
    ROBINSON, JP
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1965, 11 (04) : 567 - 571
  • [8] Minimum energy broadcasting algorithm in wireless sensor networks
    College of Computing Science and Engineering, UESTC, Chengdu 610054, China
    [J]. Tongxin Xuebao, 2007, 4 (80-86):
  • [9] Improved Approximation Results for the Minimum Energy Broadcasting Problem
    Michele Flammini
    Ralf Klasing
    Alfredo Navarra
    Stephane Perennes
    [J]. Algorithmica, 2007, 49 : 318 - 336
  • [10] Minimum energy broadcasting in wireless networks (extended abstract)
    Yamada, Toshinori
    [J]. PROCEEDINGS OF 2008 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-10, 2008, : 201 - 204