Skip to main content
SpringerLink
Log in

Optimal cluster-based routing scheme using node mobility in ad hoc networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Ad hoc networks have a scalability problem. When the nodes of an ad hoc network increase in number or mobility, the amount of control traffic for routing increases and could cause traffic congestion. Cluster-based routing schemes have been proposed as a solution to this problem. Typical cluster-based ad hoc networks use a proactive routing scheme for intra-cluster routes and a reactive routing scheme for inter-cluster routes. In this study, we propose a new cluster-based routing scheme for ad hoc networks which makes use of the mobility of nodes. Nodes are divided into two groups on the basis of their mobility. For a route search within a cluster, a proactive routing scheme is used for low-mobility nodes and a flooding-based reactive routing scheme is used for high-mobility nodes. The required control traffic of the proposed scheme is analyzed and optimal parameters of the proposed scheme are derived from the analysis. The numerical results show that the proposed scheme produces far less control traffic than a typical cluster-based routing scheme.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

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

Similar content being viewed by others

References

  1. Perkins, C. E., & Bhagwat, P. (1994). Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. ACM SIGCOMM Computer Communication Review, 24(4), 234–244.

    Article  Google Scholar 

  2. Perkins, C. E., Royer, E. M., & Das, S. R. (2003). Ad hoc on-demand distance-vector (AODV) routing. IETF RFC 3561.

  3. Johnson, D. B., Maltz, D. A., & Broch, J. (2001). DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks, Ad hoc networking. Boston: Addison-Wesley.

    Google Scholar 

  4. Ryu, J. H., Song, S., & Cho, D. H. (2001). New clustering schemes for energy conservation in two-tiered mobile ad hoc networks. In Proceedings of IEEE ICC’01, pp. 862–866.

  5. Chiang, C. C., & Gerla, M. (1997). Routing and multicast in multihop, mobile wireless networks. In Proceedings of IEEE ICUPC ’97.

  6. Yu, J. Y., & Chong, P. H. J. (2005). A survey of clustering schemes for mobile ad hoc networks. IEEE Communications Surveys, 7(1), 32–48.

    Article  Google Scholar 

  7. Younis, O., & Fahmy, S. (2004). HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks. IEEE Tr. Mobile Computing, 3(4), 366–379.

    Article  Google Scholar 

  8. Pei, G., Gerla, M., Hong, X., & Chiang, C. C. (1999). A wireless hierarchical routing protocol with group mobility. In Proceedings of IEEE WCNC 1999, pp. 1538–1542.

  9. Haas, Z. J., & Pearlman, M. R. (2001). The zone routing protocol: A hybrid framework for routing in ad hoc networks, Ad hoc Networking. Boston: Addison-Wesley.

  10. Pearlman, M. R., & Haas, Z. J. (1999). Determining the optimal configuration for the zone routing protocol. IEEE JSAC, 17, 1395–1414.

    Google Scholar 

  11. Pei, G., Gerla, M., & Hong, X. (2000). LANMAR: Landmark routing for large scale wireless ad hoc networks with group mobility. MobiHOC 2000, pp. 11–18.

  12. MaDonald, A. B., & Znati, T. F. (1999). A mobility-based framework for adaptive clustering in wireless ad hoc networks. IEEE JSAC, 17, 1466–1487.

    Google Scholar 

  13. Heinzelman, W., Chandrakasan, A., & Balakrishana, H. (2002). An application-specific protocol architecture for wireless microsensor networks. IEEE Tr. Wireless Communication, 1(4), 660–670.

    Article  Google Scholar 

  14. Ohta, T., Inoue, S., & Kakuda, Y. (2003). An adaptive multihop clustering scheme for highly mobile ad hoc networks. In Proceedings of ISADS.

  15. Viennot, L., Jacquet, P., & Clausen, T. H. (2004). Analyzing control traffic overhead versus mobility and data traffic activity in mobile ad-hoc network protocols. Wireless Networks, 10, 447–455.

    Article  Google Scholar 

  16. Lopez, J., Gheorghiu, S., & Barcelo, J. M. (2007). Analytical evaluation of the overhead generated by a routing scheme with subnets for MANETs. Wireless and Mobility, LNCS, 4396, 126–143.

    Google Scholar 

  17. Skold, M., Choi, Y., & Nilsson, J. (2003). An analysis of mobile radio ad hoc networks using clustered architectures. In Proceedings of IEEE VTC 2003-Spring, pp. 181–185.

  18. Chan, K. S., Pishro-Nik, H., & Fekri, F. (2005). Analysis of hierarchical algorithms for wireless sensor network routing protocols. In Proceedings of IEEE WCNC 2005, pp. 1830–1835.

  19. Sucec, J., & Marsic, I. (2004). Hierarchical routing overhead in mobile ad hoc networks. IEEE Tr. Mobile Computing, 3(1), 46–56.

    Article  Google Scholar 

  20. Supeng, L., Liren, Z., Huirong, F., & Jianjun, Y. (2007). Mobility analysis of mobile hosts with random walking in ad hoc networks. Computer Networks, 51(10), 2514–2528.

    Article  MATH  Google Scholar 

  21. Chang, B.-J., & Hwang, R.-H. (2004). Performance analysis for hierarchical multirate loss networks. Networking, IEEE/ACM Transactions, 12(1), 187–199.

    Article  Google Scholar 

  22. Al-Karaki, J. N., & Kamal, A. E. (2005). End-to-end support for statistical quality of service in heterogeneous mobile ad hoc networks. Computer Communications, 28(18), 2119–2132.

    Article  Google Scholar 

  23. Jabbari, B. (1996). Teletraffic aspects of evolving and next-generation wireless communication networks. IEEE Personal Communications, 3, 4–9.

    Article  Google Scholar 

  24. Clausen, T., & Jacquet, P. (2003). Optimized link state routing protocol (OLSR), IETF RFC 3626.

  25. Takagi, H., & Kleinrock, L. (1984). Optimal transmission ranges for randomly distributed packet radio networks. IEEE Tr. Communications, 32, 246–257.

    Article  Google Scholar 

  26. Im, J. H., & Lee, D. J. (2009). Optimal number of 1-hop neighbor nodes considering routing overhead in ad hoc networks. In Proceedings of IEEE PIMRC.

Download references

Acknowledgments

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 (2007-0053615) and by the Industrial Strategic Technology Development Program (10035380, Development of Low Power Consumption Sensor Network) funded by the Ministry of Knowledge Economy (MKE) of Korea.

Author information

Authors and Affiliations

  1. Ubiquoss Inc., Seoul, Republic of Korea

    Ji-Hyuk Im

  2. School of Electronics, Telecommunications and Computer Engineering, Korea Aerospace University, Goyang, Kyunggido, Republic of Korea

    Hyuk Wu & Dong-Jun Lee

Authors
  1. Ji-Hyuk Im
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hyuk Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dong-Jun Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dong-Jun Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Im, JH., Wu, H. & Lee, DJ. Optimal cluster-based routing scheme using node mobility in ad hoc networks. Wireless Netw 17, 921–935 (2011). https://doi.org/10.1007/s11276-011-0325-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-011-0325-z

Keywords

Search

Navigation