华南理工大学学报(自然科学版) ›› 2009, Vol. 37 ›› Issue (5): 1-7.

• 电子、通信与自动控制 •    下一篇

多跳无线Ad hoc网络分区树路由协议ASTRP

刘桂开 单春丽 韦岗 王洪江   

  1. 华南理工大学 电子与信息学院, 广东 广州 510640
  • 收稿日期:2008-05-05 修回日期:2008-08-07 出版日期:2009-05-25 发布日期:2009-05-25
  • 通信作者: 刘桂开(1959-),男,博士,高级工程师,主要从事无线Adhoc网络、无线Mesh网络研究. E-mail:gkliu@scut.edu.cn
  • 作者简介:刘桂开(1959-),男,博士,高级工程师,主要从事无线Adhoc网络、无线Mesh网络研究.
  • 基金资助:

    国家“863”计划项目(2007AA012210)

ASTRP: A New Subarea-Tree Routing Protocol for Multi-Hop Wireless Ad hoc Networks

Liu Gui-kai  Shan Chun-li  Wei Gang  Wang Hong-jiang   

  1. School of Electronic and Information Engineering, South China University of Technology, Guangzhou 510640, Guangdong, China
  • Received:2008-05-05 Revised:2008-08-07 Online:2009-05-25 Published:2009-05-25
  • Contact: 刘桂开(1959-),男,博士,高级工程师,主要从事无线Adhoc网络、无线Mesh网络研究. E-mail:gkliu@scut.edu.cn
  • About author:刘桂开(1959-),男,博士,高级工程师,主要从事无线Adhoc网络、无线Mesh网络研究.
  • Supported by:

    国家“863”计划项目(2007AA012210)

摘要: 为了降低路由的更新代价和提高路由的有效性,提出了一种用于多跳无线Adhoc网络的路由协议ASTRP(Ad hoc Subarea Tree RoutingProtocol).ASTRP属于分级路由协议,通过建立分区树,在逻辑上将网络划分为多个分区,每个分区由一棵树组成.由于分区树具有路由选择功能,所以ASTRP具有先应式路由协议和按需路由协议的功能特点.文中还给出了ASTRP的建立过程,证明了ASTRP的正确性,并对其路由存储代价和路由更新代价进行了分析.结果表明,与其它分级路由协议相比,ASTRP将节点的失效影响限定在分区以内及有限的根节点之间,其路由更新代价明显降低.

关键词: Ad hoc网络, 路由协议, 分区树, 分级网络结构

Abstract:

In order to reduce the routing overhead and improve the routing efficiency, a new Ad hoc subarea-tree routing protocol (ASTRP)-a hierarchical routing protocol-is proposed for multi-hop wireless Ad hoc networks. It establishes subarea trees to divide the whole network into many subareas each composed of a tree, and exhibits hy- brid behavior of proactive and on-demand routing protocols due to the function of routing selection of subarea tree. This paper presents the establishment process of ASTRP, proves the correctness of ASTRP and analyzes the routing storage overhead and routing updating overhead. The results show that ASTRP limits the effect of node failure among limited root nodes in a local area, and is of a lower routing updating overhead, as compared with other hierar- chical routing protocols.

Key words: Ad hoc network, routing protocol, subarea tree, hierarchical network structure