Ad hoc虚拟骨干网中一种费率优先分布式CDS算法  

A Cost-Priority Distributed Algorithm for Connected Dominating Set in Virtual Backbone-Based Mobile Ad hoc Networks

作　　者：程胜[1] 张勖[1] 冯美玉[1] 丁炜[1] 

机构地区：[1]北京邮电大学宽带通信网络实验室,北京100876

出　　处：《北京邮电大学学报》2004年第3期88-92,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(60372101);教育部博士学科点专项科研基金(20020013011)

摘　　要：移动Adhoc网络可以通过构建虚拟骨干网来减少参与路由计算的节点数量.虚拟骨干网可以由近似的最小连接主节点集(MCDS)组成.本文对几种经典的分布式近似MCDS查找算法进行了比较,提出了一种新的费率优先的分布式近似MCDS查找算法,详细介绍了该算法的流程,并对算法的性能进行了分析,仿真结果显示该算法的性能优于经典算法.Building of virtual backbone in mobile Ad hoc networks can effectively reduce the numbers of nodes used to run routing protocols. The virtual backbone consists of minimum connected dominating set (MCDS). Classical MCDS algorithms were compared with in several. A newly cost-priority distributed approximation MCDS algorithm was proposed, in which the flow was introduced. Simulation shows that the performance of the proposed algorithm has advantage over the existed ones.

关 键 词：移动AD hoe网络 虚拟骨干网 最小连接主节点集 

分 类 号：TN929.5[电子电信—通信与信息系统]