一种最小连通支配集的分布式广播算法  

A Minimum Connected Dominating Sets Based Distributed Broadcast Algorithm

作　　者：王雷[1] 陈治平[1] 

机构地区：[1]福建工程学院计算机与信息科学系

出　　处：《计算机工程与应用》2006年第22期118-120,136,共4页Computer Engineering and Applications

基　　金：福建省自然科学基金资助项目(编号:A0510024);福建省青年科技人才创新基金资助项目(编号:2005J051)

摘　　要：研究移动自组网络中的广播算法,提出了一种适用于移动自组网络的基于最小连通支配集的分布式广播算法,并证明了新的广播算法与已有算法相比能够更加有效地解决网络采用洪泛(Flooding)方式进行广播时所可能产生的广播风暴问题。同时,算法是基于并行和分布式运行模式的,因此具有很好的扩展性和实用性。On the basis of the broadcast algorithms in the wireless ad hoc network,an efficient distributed broadcast algorithm based on the concept of minimum connected dominating sets is proposed.It is proved that this new broadcast algorithm can resolve the problem of broadcast storm that may be caused by the broadcast based on flooding algorithm more efficiently than other algorithms.Furthermore,this algorithm is also based on parallel and distributed model,so it has better expansibility and practicability.

关 键 词：最小连通支配集 广播 广播风暴 移动自组网络 

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