.png){kind=icon}
返回
Simple algorithm for solving broadcast storm in mobile ad hoc network
.png){kind=icon}
PRE
AI
DOI：10.1049/iet-com.2010.0341.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In recent years, mobile ad hoc network (MANET) has gained a lot of attention because of its self-organising and infrastructure-free characteristics. Unlike the traditional wireless networks, each node in MANET can act as a router to receive and forward packets. All nodes can randomly move around, leave the network or switch off. Hence, broadcasting has been widely used in diffusing data, routing or topology information in MANET. Unfortunately, MANET may be filled with a large number of redundant broadcasting packets. Furthermore, in order to transmit the broadcasting packets, each mobile node (MN) competes for the limited radio channels. Thus, packet collision is serious. All of these aforementioned conditions are called the 'Broadcast Storm Problem'. Not only does it occupy the network bandwidth but it also consumes the battery of MNs. In this study, the authors propose an algorithm that is different from previous works to solve the Broadcast Storm Problem. The algorithm is suitable for a dynamic MANET environment.
Keyword:
DOMINATING SETS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
1.6
论文数:
137
被引数:
2.9K
机构
引用论文
Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks无线网络中基于支配集和邻居消除的广播算法
OAAI
OAAI分享收藏Platelet transfusions in platelet consumptive disorders are associated with arterial thrombosis and in-hospital mortality.png)
Blood
OAAI
BloodIF0
OAAI分享收藏
查看更多内容