Subarea Tree Routing (STR) in Multi-hop Wireless Ad hoc Networks

DOI: 10.4236/wsn.2009.11006   PDF   HTML     4,894 Downloads   8,917 Views   Citations


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.

Share and Cite:

G. LIU, C. SHAN, G. WEI and H. WANG, "Subarea Tree Routing (STR) in Multi-hop Wireless Ad hoc Networks," Wireless Sensor Network, Vol. 1 No. 1, 2009, pp. 36-42. doi: 10.4236/wsn.2009.11006.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] C. E. Perkins, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,” Proceedings of ACM SIGCOMM, pp. 234-244, 1994.
[2] G. Pei, M. Gerla, and T. W. Chen, “Fisheye state routing in mobile ad hoc networks,” in Proceedings of the 2000 ICDCS Workshops, Taipei, Taiwan, pp. D71-D78, April 2000.
[3] J. J. Garcia-Luna-Aceves and M. Spohn, “Source-tree routing in wireless networks,” Proceedings of IEEE International Conference on Network Protocols (ICNP), pp. 273-282, 1999.
[4] 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.
[5] T. Clausen and P. Jacquet, “Optimized link state routing protocol (OLSR),” IETF Internet RFC3626, October 2003.
[6] R. Ogier, F. Templin, and M. Lewis, “Topology broadcast based on reverse-path forwarding (TBRPF),” IETF Internet RFC3684, February 2004.
[7] C. E. Perkins, E. M. Belding-Royer, and I. Chakeres, “Ad hoc on demand distance vector (AODV) routing,” IETF Internet RFC3561, July 2003.
[8] D. Johnson, Y. Hu, and D. Maltz, “The dynamic source routing protocol (DSR) for mobile ad hoc networks for IPv4,” IETF Internet RFC4728, February 2007.
[9] V. Park and S. Corson, “Temporally-ordered routing algorithm (TORA) Version 1 functional specification,” IETF Internet draft (draft-ietf-manet-tora-spec-04.txt), July 2001.
[10] 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.
[11] Z. J. Haas and M. R. Peariman, “The performance of query control schemes for the zone routing protocol,” IEEHACM Transactions on Networking, Vol. 9, No. 4, pp. 427-438, August 2001.
[12] C. C. Chiang and M. Gerla, “Routing and multicast in multihop, mobile wireless networks,” Proceedings of IEEE ICUPC ’97, San Diego, CA, pp. 546-551, October 1997.
[13] G. Pei, M. Gerla, and X. Y. Hong, et al., “A wireless hierarchical routing protocol with group mobility,” Proceedings of IEEE WCNC’99, New Orleans, LA, pp. 1538-1542, September 1999.

comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.