.png){kind=icon}
返回
Bandwidth-efficient geographic multicast routing protocol for wireless sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1109/JSEN.2007.894149.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present geographic multicast routing (GMR), a new multicast routing protocol for wireless sensor networks. It is a fully localized algorithm that efficiently delivers multicast data messages to multiple destinations. It does not require any type of flooding throughout the network. Each node propagating a multicast data message needs to select a subset of its neighbors as relay nodes towards destinations. GMR optimizes the cost over progress ratio where the cost is equal to the number of neighbors selected for relaying and the progress is the overall reduction of the remaining distances to destinations. Such neighbor selection achieves a good tradeoff between the bandwidth of the multicast tree and the effectiveness of the data distribution. Our cost-aware neighbor selection is based on a greedy set merging scheme achieving a O(Dn min(D, n)(3)) computation time, where n is the number of neighbors of current node and D is the number of destinations. As in traditional geographic routing algorithms, delivery to all destinations is guaranteed by applying face routing when necessary. Our simulation results show that GMR outperforms position based multicast in terms of cost of the trees and computation time over a variety of networking scenarios.
Keyword:
geographic routing
multicast
wireless sensor networks (WSNs)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
2.2W
被引数:
7.3W
机构
暂无机构信息
引用论文
分享收藏What Is the Ability Emotional Intelligence Test (MSCEIT) Good for? An Evaluation Using Item Response Theory.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏Comparison of Energy and Nutrient Intake vs. Estimated Needs in Warfighters: an Update战士能量和营养素摄入量与估计需求量的比较：更新
PREAI
分享收藏
查看更多内容