Subarea Tree Routing (STR), a new routing protocol for multi-hop wireless ad hoc networks, is proposed. The novelty of the STR protocol is to divide the whole network into many subareas constructed as a result of establishing subarea trees. Its main idea is to identify root nodes by manual configuration or auto-discovery process firstly, then the root nodes originate the process of establishing subarea trees, and finally each node either joins in a subarea tree or become an interconnect node. STR belongs to hierarchical routing protocol and does not attempt to consistently maintain routing information in every node. Furthermore, through the use of tree’s intrinsic routing function, the STR protocol exhibits hybrid behavior of proactive and on-demand routing protocols. We prove the correctness of STR, and our simulation results show that the pro-posed scheme achieves lower route discovery delays, lower route discovery load and better performance of normalized routing load in large, mobile, ad hoc networks as compared with AODV.
G. Y. Pei, M. Gerla, and X. Hong, “LANMAR: Landmark routing for large scale wireless ad hoc networks with group mobility,” Proceedings of IEEE/ ACM Workshop on Mobile Ad hoc networking & Computing, MobiHOC’00, Boston, MA, USA, MA, USA, pp. 11-18, 2000.
C. K. Toh, “Associativity-based routing for ad hoc mobile networks,” WLPersonal Communications Journal, Special Issue on Mobile Networking and Computing Systems, Kluwer, Vol. 4, No. 2, pp. 103-139, March 1997.