Skip to main content

Detecting and Resolving a Loop in the Tree-Based Mobility Management Protocol

  • Conference paper
Advances in Grid and Pervasive Computing (GPC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6104))

Included in the following conference series:

Abstract

A loop can take place in the process of managing tree topology for mobility management of mobile nodes in infrastructure-based mobile ad hoc networks. The formation of a loop degrades an effective bandwidth of the wireless network by passing the identical message repeatedly within the same loop. Therefore, the loop should be resolved quickly to revert the system back to the normal state. In this paper, we propose a simple and novel mechanism that detects and resolves a loop quickly by tracking the depth of trees. The performance of the proposed approach is compared with existing tree-based approaches as well as the hybrid approach. It is shown that the proposed approach shows the superiority of the new approach and far outperforms the other methods, and is robust against the rapid changes in network topology.

This research was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education, Science and Technology (2009-0076839).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Oh, H.: A tree-based approach for the Internet connectivity of mobile ad hoc networks. Journal of Communications and Networks 11(3), 261–270 (2009)

    Google Scholar 

  2. Jubin, J., Tornow, J.D.: The DARPA packet radio network protocols. The Proceedings of the IEEE 75(1), 21–32 (1987)

    Article  Google Scholar 

  3. Caleffi, M., Ferraiuolo, G., Paura, L.: Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks. In: The Proceedings of the IEEE Internatonal Conference Mobile Adhoc and Sensor Systems, MASS 2007, October 2007, pp. 1–6 (2007)

    Google Scholar 

  4. Ratanchandani, P., Kravets, R.: A hybrid approach to Internet connectivity for mobile ad hoc networks. In: The Proceedings of IEEE WCNC 2003, March 2003, pp. 1522–1527 (2003)

    Google Scholar 

  5. Han, T.D., Oh, H.: A Topology Management Routing Protocol for Mobile IP Support Mobile Ad Hoc Networks. In: Ruiz, P.M., Garcia-Luna-Aceves, J.J. (eds.) ADHOC-NOW 2009. LNCS, vol. 5793, pp. 341–346. Springer, Heidelberg (2009)

    Google Scholar 

  6. Peng, W., Li, Z., Haddix, F.: A Practical Spanning Tree Based MANET Routing Algorithm. In: The Proceedings of the 14th International Conference Computer Communications and Networks, ICCCN 2005, October 2005, pp. 19–24 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Han, TD., Oh, H. (2010). Detecting and Resolving a Loop in the Tree-Based Mobility Management Protocol . In: Bellavista, P., Chang, RS., Chao, HC., Lin, SF., Sloot, P.M.A. (eds) Advances in Grid and Pervasive Computing. GPC 2010. Lecture Notes in Computer Science, vol 6104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13067-0_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13067-0_60

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13066-3

  • Online ISBN: 978-3-642-13067-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics