Ad hoc网络中基于权值的连通支配集算法  

Weighted-based mobile Ad hoc networks with connecting dominating set algorithm

作　　者：张冰燕[1] 张远平[1] 

机构地区：[1]兰州理工大学计算机与通信学院,甘肃兰州730050

出　　处：《计算机工程与设计》2008年第6期1329-1330,1335,共3页Computer Engineering and Design

基　　金：兰州理工大学科研发展基金项目(SB20200402);甘肃省自然基金项目(3ZS051-A25-037)

摘　　要：移动Ad hoc网络是一种多跳、自组织网络,在该网络中可以通过构建虚拟骨干网来减少参与路由计算的节点数量,虚拟骨干网可以由近似的最小连接主节点集(MCDS)组成。提出了一种考虑节点权值的分布式近似MCDS查找算法,在网络拓扑结构发生变化时对MCDS进行维护。与几种经典的分布式近似MCDS查找算法相比较,结果表明,该算法具有更好的性能。Mobile Ad hoc network is a multi-hop,self-organized network.The building of virtual backbone in this network can efficiently reduce the number of nodes used in routing computing.The virtual backbone is constructed by the minimum connected dominating set（MCDS）.One distributed approximate MCDS algorithm considering the weight of the nodes is proposed,including how to maintain the MCDS when the topology changes.The analysis shows that the algorithm has better performance than some others.

关 键 词：ADHOC网络 虚拟骨干网 连通支配集 分布式算法 权值 

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