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 条
  • [21] Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
    Belyi, Alexander
    Sobolevsky, Stanislav
    Kurbatski, Alexander
    Ratti, Carlo
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2023, 98 (02) : 269 - 297
  • [22] Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
    Alexander Belyi
    Stanislav Sobolevsky
    Alexander Kurbatski
    Carlo Ratti
    Mathematical Methods of Operations Research, 2023, 98 (2) : 269 - 297
  • [23] Tighter Trail Bounds for Xoodoo
    Mella, Silvia
    Daemen, Joan
    Van Assche, Gilles
    IACR TRANSACTIONS ON SYMMETRIC CRYPTOLOGY, 2023, 2023 (04) : 187 - 214
  • [24] Minimum energy broadcasting algorithm in wireless sensor networks
    College of Computing Science and Engineering, UESTC, Chengdu 610054, China
    Tongxin Xuebao, 2007, 4 (80-86):
  • [25] Minimum energy broadcasting in wireless networks (extended abstract)
    Yamada, Toshinori
    PROCEEDINGS OF 2008 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-10, 2008, : 201 - 204
  • [26] Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds
    Zanette, Andrea
    Brunskill, Emma
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [27] Tighter Bounds on the Expressivity of Transformer Encoders
    Chiang, David
    Cholak, Peter
    Pillay, Anand
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 202, 2023, 202
  • [28] Tighter Variational Bounds are Not Necessarily Better
    Rainforth, Tom
    Kosiorek, Adam R.
    Tuan Anh Le
    Maddison, Chris J.
    Igl, Maximilian
    Wood, Frank
    Teh, Yee Whye
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 80, 2018, 80
  • [29] Tighter Fourier Transform Lower Bounds
    Ailon, Nir
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 14 - 25
  • [30] Tighter bounds of errors of numerical roots
    Tateaki Sasaki
    Japan Journal of Industrial and Applied Mathematics, 2007, 24 : 219 - 226
12345