期刊
IEEE-ACM TRANSACTIONS ON NETWORKING
卷 21, 期 4, 页码 1322-1331出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNET.2012.2223483
关键词
Approximation algorithms; broadcasting; energy consumption; wireless networks
类别
资金
- European Union [STREP FP7-258307 EULER]
- PRIN 2008 research project COGENT (COmputational and GamE-theoretic aspects of uncoordinated NeTworks)
- Italian Ministry of University and Research
We present a new approximation algorithm for the Minimum Energy Broadcast Routing (MEBR) problem in ad hoc wireless networks that achieves an exponentially better approximation factor compared to the well-known Minimum Spanning Tree (MST) heuristic. Namely, for any instance where a minimum spanning tree of the set of stations is guaranteed to cost at most rho >= 2 times the cost of an optimal solution for MEBR, we prove that our algorithm achieves an approximation ratio bounded by 2ln rho - 2ln 2 + 2. This result is particularly relevant for its consequences on Euclidean instances where we significantly improve previous results. In this respect, our experimental analysis confirms the better performance of the algorithm also in practice.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据