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
来源：
WIRELESS NETWORKS | 2008年 / 14卷 / 05期
关键词：
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 条
  • [31] An upper bound on the domination number of a graph with minimum degree 2
    Frendrup, Allan
    Henning, Michael A.
    Randerath, Bert
    Vestergaard, Preben Dahl
    DISCRETE MATHEMATICS, 2009, 309 (04) : 639 - 646
  • [32] An upper bound on the minimum distance of serially concatenated convolutional codes
    Perotti, A
    Benedetto, S
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 314 - 314
  • [33] Capacity Upper Bound and Minimum Energy-per- Bit for AWGN Relay Channel with Channel Side Information
    Pakravan, Saeid
    Tavakoli, Hassan
    2020 10TH INTERNATIONAL SYMPOSIUM ON TELECOMMUNICATIONS (IST), 2020, : 9 - 14
  • [34] Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks
    P.-J. Wan
    G. Călinescu
    X.-Y. Li
    O. Frieder
    Wireless Networks, 2002, 8 : 607 - 617
  • [35] Minimum-energy broadcasting in static ad hoc wireless networks
    Wan, PJ
    Calinescu, G
    Li, XY
    Frieder, O
    WIRELESS NETWORKS, 2002, 8 (06) : 607 - 617
  • [36] Localized minimum-energy broadcasting in ad-hoc networks
    Cartigny, J
    Simplot, D
    Stojmenovic, I
    IEEE INFOCOM 2003: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS, 2003, : 2210 - 2217
  • [37] Spin structure of hadrons and minimum energy of bound systems
    Zavada, Petr
    XVIII WORKSHOP ON HIGH ENERGY SPIN PHYSICS, DSPIN-2019, 2020, 1435
  • [38] A Low Bound on Graph Energy in Terms of Minimum Degree
    Ma, Xiaobin
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2019, 81 (02) : 393 - 404
  • [39] Entropic upper bound on gravitational binding energy
    Vignat, C.
    Plastino, A.
    Plastino, A. R.
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2011, 390 (13) : 2491 - 2496
  • [40] UPPER BOUND FOR THE ENERGY OF STRONGLY CONNECTED DIGRAPHS
    Ayyaswamy, Singaraj K.
    Balachandran, Selvaraj
    Gutman, Ivan
    APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 2011, 5 (01) : 37 - 45
12345