高级搜索

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

一种基于最短路径树的无线Ad hoc网络拓扑维护算法

沈中 常义林 崔灿 张新

沈中, 常义林, 崔灿, 张新. 一种基于最短路径树的无线Ad hoc网络拓扑维护算法[J]. 电子与信息学报, 2007, 29(2): 323-327. doi: 10.3724/SP.J.1146.2005.00600
引用本文: 沈中, 常义林, 崔灿, 张新. 一种基于最短路径树的无线Ad hoc网络拓扑维护算法[J]. 电子与信息学报, 2007, 29(2): 323-327. doi: 10.3724/SP.J.1146.2005.00600
Shen Zhong, Chang Yi-lin, Cui Can, Zhang Xin. A Topology Maintenance Algorithm Based on Shortest Path Tree for Wireless Ad hoc Networks[J]. Journal of Electronics & Information Technology, 2007, 29(2): 323-327. doi: 10.3724/SP.J.1146.2005.00600
Citation: Shen Zhong, Chang Yi-lin, Cui Can, Zhang Xin. A Topology Maintenance Algorithm Based on Shortest Path Tree for Wireless Ad hoc Networks[J]. Journal of Electronics & Information Technology, 2007, 29(2): 323-327. doi: 10.3724/SP.J.1146.2005.00600

一种基于最短路径树的无线Ad hoc网络拓扑维护算法

doi: 10.3724/SP.J.1146.2005.00600
基金项目: 

综合业务网理论与关键技术国家重点实验室基金(00JS63.2.1.DZ01)资助课题

A Topology Maintenance Algorithm Based on Shortest Path Tree for Wireless Ad hoc Networks

  • 摘要: 该文主要研究了无线Ad hoc网络中节点失效的情况下,如何维护网络的连通性和拓扑的性能,并且尽可能地降低拓扑维护的开销。提出了基于最短路径树的拓扑维护算法。该算法在拓扑变化时首先触发失效节点的邻节点响应(即重新运行拓扑控制算法),在不增加额外通信开销的情况下,响应的节点根据相互发送的Hello分组来判断网络是否连通;如果不能确定网络是连通的,再触发失效节点的其它可达邻近节点响应。仿真研究表明,算法显著地减少了拓扑维护的开销,维护后的拓扑结构在功率有效性和功率扩展因子等方面也取得了好的性能。
  • [1] Goldsmith A J and Wicker S B. Design challenges for energy- constrained Ad hoc wireless networks. IEEE Wireless Communications, 2002, 9(4): 8-27. [2] Shen C C, Srisathapornphat C, and Liu R, et al.. CLTC: A cluster-based topology control framework for ad hoc networks[J].IEEE Trans. on Mobile Computing.2004, 3(1):18-32 [3] Li N, Hou J C, and Sha L. Design and analysis of an MST-Based topology control algorithm. Proc. INFOCOM 2003, San Franciso, 2003: 1702-1712. [4] Rodoplu V and Meng T H. Minimum energy mobile wireless networks[J].IEEE J. on Select. Areas Commun.1999, 17(8):1333-1344 [5] Li X Y and Wan P J. Constructing minimum energy mobile wireless networks. Proc. ACM MOBIHOC, Florence, 2001: 283-286. [6] Li L and Halpern J Y. A minimum-energy path-preserving topology-control algorithm[J].IEEE Trans. on Wireless Communications.2004, 3(3):910-921 [7] Liu J and Li B. Distributed topology control in wireless sensor networks with asymmetric links. GLOBECOM, San Francisco, 2003: 1257-1262. Ogier R, Lewis M, and Templin F. Topology dissemination based on reverse-path forwarding (TBRPF). MANET Internet Draft, 2003. Wang S C, Wei D S L, and Kuo S Y. A topology control algorithm for constructing power efficient wireless Ad hoc networks. GLOBECOM, San Francisco, 2003: 1290-1295. Sedgewick R. Algorithm in C Parts 5: Graph Algorithms (Third Edition). Boston, Addison-Wesley Publishing Company, 2003: 280-300. [8] Liu J. Topology control in wireless sensor and mobile Ad hoc networks. [Master thesis], University of Toronto, 2002: 42-44.
  • 加载中
计量
  • 文章访问数:  2977
  • HTML全文浏览量:  86
  • PDF下载量:  1036
  • 被引次数: 0
出版历程
  • 收稿日期:  2005-05-30
  • 修回日期:  2005-11-28
  • 刊出日期:  2007-02-19

目录

    /

    返回文章
    返回