移动自组织网络中一种有效的广播技术  

An Efficient Broadcast in Mobile Ad Hoc Networks

作　　者：赵承利[1] 宋学军[1] 孙立华[2] 

机构地区：[1]天津大学电气与自动化工程学院,天津300072 [2]天津大学学报,天津300072

出　　处：《计算机仿真》2006年第8期134-137,152,共5页Computer Simulation

摘　　要：基于最小连通支配集(MCDS)的广播路由方法是一个很好的路由方法,它将路由过程简化到MCDS生成的较小的子网中。然而这一方法没有考虑网络中的节点的多样性和复杂性。针对实际情况中移动自组织网络中节点的复杂性问题,该文提出了一种基于极大权的最小连通支配集(MWMCDS)的有效广播途径。仿真结果表明,它能确保性能强的节点担任网关节点的角色,能更好地协调管理网络中其他的节点,从而保持MCDS的相对稳固性并为全网中的广播路由操作提供一个高效的通信基础。该算法能在保证生成权和极大的连通支配集的同时也确保它的极小性,因此是一种有效的广播路由算法。The broadcast routing scheme based on a minimum connected dominating set（MCDS） is a promising - apporach, where the searching space for a route is reduced to nodes in the set. But this method has not considered nodal variety and complexity in the network . In view of the problem of the nodal complexity in mobile ad hoc networks （MANETs）, an efficient broadcast scheme based on the concept of minimum connected dominating set with maximal weight （MWMCDS） is proposed. Simulation results show that it can ensure the most suitable nodes to be chosen for the role of gateway nodes so that they can properly coordinate all the other nodes in the network . As a result, it can keep the stability of the minimum connected dominating set （MCDS） and provide a highly effective communication base for broadcast and routing operation in the whole network. The proposed algorithm can ensure the maximality of connected dominating set （CDS） weight and the minimality of CDS size. So the scheme is an efficient broadcast routing algorithm .

关 键 词：广播 移动自组织网络 极大权最小连通支配集 仿真 

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