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

本文提出一种新的路由协议ASTR（Ad hoc Subarea Tree Routing），用于支持多跳无线Ad hoc网络。ASTR属于分级路由协议，通过建立分区树，在逻辑上将网络划分为多个分区，每个分区由一棵树组成。由于分区树具有路由选择功能，所以ASTR结合了先应式路由协议和按需路由协议的优点。文中给出了ASTR协议的建立过程，证明了ASTR协议的正确性，并对其路由存储代价和路由更新代价进行了分析，相比其他分级路由协议，ASTR在路由更新代价方面具有明显的优势。

ASTR: A New Routing Protocol for Multi-hop Wireless Ad hoc Networks

In this paper, we propose a new routing protocol, the Ad hoc Subarea Tree Routing (ASTR), for supporting multi-hop wireless Ad hoc networks. ASTR belongs to hierarchical routing protocol: it divides the whole network into many subareas logically through establishing subarea trees and each subarea is composed of a tree. ASTR combines the merits of proactive routing protocol and on-demand routing protocol because subarea tree has the function of routing selection. In this paper, we also provide the correction of ASTR and analyze the routing storage overhead and routing updating overhead. We compare ASTR with CGSR, HSR, ZRP and LANMAR and find that ASTR has obvious advantage in routing updating overhead.