一种高效的多跳无线网络广播协议  

Efficient Broadcast Protocol in Multihop Wireless Networks

作　　者：占小利[1] 谭连生[1] 赵甫哲[1] 王汉武[1] 

机构地区：[1]华中师范大学计算机科学系,湖北武汉430079

出　　处：《小型微型计算机系统》2005年第9期1459-1461,共3页Journal of Chinese Computer Systems

基　　金：国家自然科学基金(60174043)资助;湖北省自然科学基金重点项目(2002AB025)资助.

摘　　要：广播操作是无线网络中一种常用的、重要的操作,通常采用泛洪来实现.无控制的泛洪会引起严重的竞争、冲突和拥塞,称为广播风暴问题.鉴此,本文提出了一种高效的无线网络广播协议.该协议通过根据网络拓扑图的最多叶子最短生成树来确定路由选择.分析和仿真结果说明,本文所提出的广播协议不仅能够避免冲突而且能够大大减少冗余的广播消息和减小广播延时.Broadcast is a common and important operation in wireless networks. However, broadcasting by naive flooding causes severe contention, collision, and congestion, which is called the broadcast storm problem. This paper proposes an efficient protocol of broadcasts that can overcome the problem to some extent, The routing is determined on the basis of finding a maximum leaf shortest spanning tree of the network topology. Analyses and simulation results show that the broadcast protocol can not only avoid collision, but also highly reduce the redundant rebroadcasts and the broadcast latency.

关 键 词：广播 最多叶子最短生成树 无线网络 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]