Tighter bounds for the minimum energy broadcasting problem

被引：15
|
作者：
Navarra, A [1 ]
机构：
[1] Univ Aquila, Dept Comp Sci, I-67100 Laquila, Italy
来源：
Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks | 2005年
关键词：
D O I：
10.1109/WIOPT.2005.51
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
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].
引用
收藏
页码：313 / 322
页数：10
相关论文
共 50 条
  • [41] Minimum Energy Problem on the Hypersphere
    Mykhailo Bilogliadov
    Potential Analysis, 2018, 48 : 49 - 84
  • [42] Minimum Energy Problem on the Hypersphere
    Bilogliadov, Mykhailo
    POTENTIAL ANALYSIS, 2018, 48 (01) : 49 - 84
  • [43] Distributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting
    Ciftlikli, Serkan
    Oztoprak, Figen
    Ercetin, Ozgur
    Bulbul, Kerem
    INTERNATIONAL JOURNAL OF INTERDISCIPLINARY TELECOMMUNICATIONS AND NETWORKING, 2009, 1 (02) : 46 - 65
  • [44] On minimum-energy broadcasting in all-wireless networks
    Li, FL
    Nikolaidis, L
    LCN 2001: 26TH ANNUAL IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS, PROCEEDINGS, 2001, : 193 - 202
  • [45] The "real" approximation factor of the MST heuristic for the minimum energy broadcasting
    Flammini, M
    Navarra, A
    Perennes, S
    EXPERIMENTAL AND EFFICIENT ALGORITHMS, PROCEEDINGS, 2005, 3503 : 22 - 31
  • [46] Adaptive Broadcast Consumption (ABC), a new heuristic and new bounds for the minimum energy broadcast routing problem
    Klasing, R
    Navarra, A
    Papadopoulos, A
    Pérennes, S
    NETWORKING 2004: NETWORKING TECHNOLOGIES, SERVICES, AND PROTOCOLS; PERFORMANCE OF COMPUTER AND COMMUNICATION NETWORKS; MOBILE AND WIRELESS COMMUNICATIONS, 2004, 3042 : 866 - 877
  • [47] Tighter bounds for graph Steiner tree approximation
    Robins, G
    Zelikovsky, A
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 19 (01) : 122 - 134
  • [48] Tighter limit cycle bounds for digital filters
    Osés-del Campo, JD
    Cruz-Roldán, F
    Utrilla-Manso, M
    IEEE SIGNAL PROCESSING LETTERS, 2006, 13 (03) : 149 - 152
  • [49] Bounds and observations on the transmission of data packets with minimum energy
    Uysal-Biyikoglu, Elif
    IEEE COMMUNICATIONS LETTERS, 2006, 10 (10) : 707 - 709
  • [50] Calculating the minimum bounds of energy consumption for cloud networks
    Buysse, Jens
    Georgakilas, Konstantinos
    Tzanakaki, Anna
    De Leenheer, Marc
    Dhoedt, Bart
    Develder, Chris
    Demeester, Piet
    2011 20TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS (ICCCN), 2011,
12345