基于计时器的最小连通支配集生成算法  

Timer based algorithm for minimum connected dominating set construction

作　　者：杨阳[1] 芮兰兰[1] 郭少勇[1] 邱雪松[1] 亓峰[1] 

机构地区：[1]北京邮电大学网络与交换技术国家重点实验室,北京100876

出　　处：《通信学报》2013年第2期100-108,共9页Journal on Communications

基　　金：国家自然科学基金创新研究群体科学基金资助项目(61121061);国家科技重大专项基金资助项目(2011ZX03005-004-02);国家高技术研究发展计划("863"计划)基金资助项目(2011AA01A102);国家科技支撑计划基金资助项目(2012BAH06B02)~~

摘　　要：在分簇的MANET中,基于计时器思想提出最小连通支配集生成算法,实现动态拓扑下骨干网构建与重构,证明了算法正确性。仿真结果表明,该算法能以少量消息开销,生成较小连通支配集,快速调整骨干网适应拓扑变化。In clustered MANET, a timer theory based MCDS algorithm was proposed to construct and reconstruct visual backbone quickly under dynamic topologies. The validity of this MCDS algorithm was established. The simulation re- sults demonstrate that our algorithm produces a CDS of competitive size with low message overhead and adjusts the vis- ual backbone fast to adapt to dynamic network topologies.

关 键 词：移动自组网 虚拟骨干网 连通支配集 启发式分簇 动态拓扑 

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