Skip to main content
Log in

A Proposal of B-Tree Based Routing Algorithm for Monitoring Systems with Regular Movements in MANETs

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Routing Protocols in MANETs have been researched for peer-to-peer services in general. Furthermore, these protocols have been concerned with the fairness service amongst nodes’ peers. However, most of those protocols aren’t suitable for the data communication especially in hierarchical networks, where the most data flows are vertical like a monitoring system. Furthermore, for the monitoring system, amongst the nodes, one of them (a.k.a. root node) should be employed as a gateway to connect to Internet. Thus, most reporting data from certain nodes are delivered to the root node. Likewise, data should be delivered to the message originator nodes for responsibility. Therefore, a new routing protocol for such networks including the monitoring system is strongly required. This paper proposes a routing protocol based on the binary-tree shaped network, which derives from the general table driven methods’ routing manners with DSDV families of MANETs. In conclusion, we verify whether our protocol would be efficiently used in such networks through its performance evaluations with simulation results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Chlamtac, I., Conti, M., & Liu, J. J.-N. (2003). Mobile ad hoc networking: Imperatives and challenges. Ad Hoc Networks, 1(1), 13–64.

    Article  Google Scholar 

  2. Anastasi, G., Borgia, E., Conti, M., & Gregori, E. (2003). IEEE 802.11 ad hoc networks: Performance measurements. In Proceedings of the workshop on mobile and wireless networks (MWN 2003) in conjunction with ICDCS 2003, May 19, 2003.

  3. Perkins, C. E., & Bhagwat, P. (1994). Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers. In Proceedings of the SIGCOMM 94 conference on communications architectures, protocols and applications (pp. 234–244). http://www.cs.umd.edu/projects/mcml/papers/Sigcomm94.ps.

  4. Perkins, C. E., Belding-Royer, E. M., & Chakeres, I. (2003). Ad hoc on demand distance vector (AODV) routing. IETF Internet RFC3561, July 2003.

  5. Pandey, P. K., & Biswas, G. P. (2010). Design and implementation of binary tree based proactive routing protocols for large MANETS. LNCS, 6059, 397–408.

    Google Scholar 

  6. Liu, G., Shan, C., & Wei, G. (2008). Subarea tree routing (STR) in multi-hop wireless ad hoc networks. In ICCS 2008: IEEE Singapore international conference on communication systems (pp. 1695–1699).

  7. Jacquet, P., Muhlethaler, P., & Qayyum, A. (1998). Optimized link state routing protocol. Internet draft, November 1998.

  8. Ogier, R., Templin, F., & Lewis, M. (2004). Topology broadcast based on reverse-path forwarding (TBRPF). IETF Internet RFC3684, February, 2004.

  9. Elizabeth, B.-R. (2003). Routing approaches in mobile ad hoc networks. In S. Basagni, M. Conti, S. Giordano, & I. Stojmenovic (Eds.), Ad hoc networking. New York: IEEE Press, Wiley.

    Google Scholar 

  10. Pei, G., Gerla, M., & Hong, X. (2000). LANMAR: Landmark routing for large scale wireless ad hoc networks with group mobility. In Proceedings of IEEE/ACM workshop on mobile ad hoc networking & computing, MobiHOC’00 (pp. 11–18), Boston, MA, USA.

  11. Pei, G., Gerla, M., & Chen, T. W. (2000). Fisheye state routing in mobile ad hoc networks. In Proceedings of the 2000 ICDCS workshops (pp. 71–78), Taipei, Taiwan, Apr 2000.

  12. Pandey, P. K., & Biswas, G. P. (2010). Design of scalable routing protocol for wireless ad hoc network based on DSDV. In Proceedings of ICMIS (pp. 164–174), January 2010.

  13. Johnson, D., Hu, Y., & Maltz, D. (2007). The dynamic source routing protocol (DSR) for mobile ad hoc networks for IPv4. IETF Internet RFC4728, February 2007.

  14. Park, V. D., & Corson, M. S. (1997). A highly adaptive distributed routing algorithm for mobile wireless networks. In Proceedings of INFOCOM’97, April 1997.

  15. Dube, R., Rais, C., Wang, K.-Y., & Tripathi, S. (1997). Signal stability based adaptive routing for ad hoc mobile networks. IEEE Personal Communications, 36–45.

  16. Lu, X., & Chen, Y.-c. (2008). A novel mobility model from a heterogeneous military MANET trace. LNCS, 5198, 463–474.

  17. Specification of PRC-999K.

  18. Specification of MIL-STD-188-220B, 20th January 1998.

  19. Toh, C. K, Vassiliou, V, Guichal, G., & Shih, C. H. (2000). MARCH: A medium access control protocol for multihop wireless ad hoc networks. In MILCOM 2000. 21st century military communications conference (vol. 1, pp. 512–516).

  20. Talucci, F., & Gerla, M. (1997). MACA-BI (MACA by invitation): A wireless MAC protocol for high speed and hoc networking. In 6th international conference on IEEE (vol. 2, pp. 913–917).

  21. Bharghavan, V., Demers, A., Shenker, S., & Zhang, L. (1994). MACAW: A medium access protocol for wireless LANs. In SIGCOMM 1994 (pp. 212–225).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Byoung-Kug Kim.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kim, BK., Eom, DS. A Proposal of B-Tree Based Routing Algorithm for Monitoring Systems with Regular Movements in MANETs. Wireless Pers Commun 73, 517–534 (2013). https://doi.org/10.1007/s11277-013-1200-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-013-1200-2

Keywords

Navigation