| 基于计时器的最小连通支配集生成算法 |
| |
| 引用本文： | 杨 阳,芮兰兰,郭少勇,邱雪松,亓 峰.基于计时器的最小连通支配集生成算法[J].通信学报,2013,34(2):100-108. |
| |
| 作者姓名： | 杨 阳 芮兰兰 郭少勇 邱雪松 亓 峰 |
| |
| 作者单位： | 北京邮电大学 网络与交换技术国家重点实验室,北京 100876 |
| |
| 基金项目： | 国家自然科学基金创新研究群体科学基金资助项目(61121061);国家科技重大专项基金资助项目(2011ZX03005-004-02);国家高技术研究发展计划(“863”计划)基金资助项目(2011AA01A102);国家科技支撑计划基金资助项目(2012BAH06B02)~~ |
| |
| 摘 要： | 在分簇的MANET中,基于计时器思想提出最小连通支配集生成算法,实现动态拓扑下骨干网构建与重构,证明了算法正确性。仿真结果表明,该算法能以少量消息开销,生成较小连通支配集,快速调整骨干网适应拓扑变化。
|
| 关 键 词： | 移动自组网 虚拟骨干网 连通支配集 启发式分簇 动态拓扑 |
Timer based algorithm for minimum connected dominating set construction |
| |
| YANG Yang,RUI Lan-lan,GUO Shao-yong,QIU Xue-song,QI Feng.Timer based algorithm for minimum connected dominating set construction[J].Journal on Communications,2013,34(2):100-108. |
| |
| Authors: | YANG Yang RUI Lan-lan GUO Shao-yong QIU Xue-song QI Feng |
| |
| Institution: | State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing 100876,China |
| |
| Abstract: | 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 results demonstrate that our algorithm produces a CDS of competitive size with low message overhead and adjusts the visual backbone fast to adapt to dynamic network topologies. |
| |
| Keywords: | MANET virtual backbone connected dominating set heuristic clustering dynamic topology |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《通信学报》浏览原始摘要信息 |
| 点击此处可从《通信学报》下载免费的PDF全文 |
