首页 | 本学科首页   官方微博 | 高级检索  
     

移动自组网的容错拓扑控制技术
引用本文:时锐,左德承,张展,杨孝宗.移动自组网的容错拓扑控制技术[J].北京邮电大学学报,2005,28(5):110-113.
作者姓名:时锐  左德承  张展  杨孝宗
作者单位:哈尔滨工业大学 计算机科学与技术学院, 哈尔滨 150001
基金项目:科技部专项基金,国家科技攻关项目,黑龙江省科技攻关项目
摘    要:对移动自组网中面临的邻居信息过时问题(包括邻居坐标过时与邻居集合过时)进行了研究,提出了保持移动自组网中任意2点之间,即K点(S点)和K路径(S路径)连通的容错拓扑控制 (MFTTC) 算法,并给出了算法有效性证明. 仿真结果表明,MFTTC在邻居信息过时的情况下仍能大大简化网络拓扑,根据K值可以调整网络拓扑容错能力,且MFTTC能够随节点最大移动速度调整网络拓扑,有助于保持移动网络的拓扑稳定性.

关 键 词:容错  拓扑控制  省能  移动自组网
文章编号:1007-5321(2005)05-0110-04
收稿时间:2005-05-12
修稿时间:2005年5月12日

Fault-Tolerant Topology Control in Mobile Ad Hoc Network
SHI Rui, ZUO De-cheng, ZHANG Zhan, YANG Xiao-zong.Fault-Tolerant Topology Control in Mobile Ad Hoc Network[J].Journal of Beijing University of Posts and Telecommunications,2005,28(5):110-113.
Authors:SHI Rui  ZUO De-cheng  ZHANG Zhan  YANG Xiao-zong
Affiliation:School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China
Abstract:Outdated neighbor information problems in mobile Ad Hoc network,including outdated neighbor coordinates and outdated neighbor sets,were studied.A localized fault-tolerant topology control algorithm MFTTC(mobile fault-tolerant topology control) was proposed,which guarantees that any two nodes in the network are both K-vertex (S-vertex) and K-paths(S-paths) connected under out-of-date neighbor information.MFTTC's validity was proved.Simulation results show that by(using) MFTTC,network topology can be simplified and by varying K,network reliability can be controlled even under outdated neighbor information.Also,the network topology could be adjusted according to the maximum speed of nodes,which is helpful to keep topology stability in a mobile network.
Keywords:fault tolerance  topology control  energy conservation  mobile Ad Hoc network
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《北京邮电大学学报》浏览原始摘要信息
点击此处可从《北京邮电大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号