摘要

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 hybrid 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 hierarchical routing protocols.

全文