.png){kind=icon}
返回
Approximation Algorithms for Data Broadcast in Wireless Networks
.png){kind=icon}
OA
AI
DOI：10.1109/TMC.2011.162.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interference at a node due to simultaneous transmissions from its neighbors makes it nontrivial to design a minimum-latency broadcast algorithm, which is known to be NP-complete. We present a simple 12-approximation algorithm for the one-to-all broadcast problem that improves all previously known guarantees for this problem. We then consider the all-to-all broadcast problem where each node sends its own message to all other nodes. For the all-to-all broadcast problem, we present two algorithms with approximation ratios of 20 and 34, improving the best result available in the literature. Finally, we report experimental evaluation of our algorithms. Our studies indicate that our algorithms perform much better in practice than the worst-case guarantees provided in the theoretical analysis and achieve up to 37 percent performance improvement over existing schemes.
Keyword:
Ad hoc networking
approximation algorithms
broadcast algorithms
wireless scheduling
期刊
IF:
9.2
论文数:
5.6K
被引数:
1.8W
机构
引用论文
分享收藏Lack of improvement in vitamin A status with increased consumption of dark-green leafy vegetables.png)
The Lancet
OAAI
The LancetIF0
OAAI分享收藏分享收藏Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks无线网络中基于支配集和邻居消除的广播算法OAAI
OAAI分享收藏
查看更多内容