Skip to main content
SpringerLink
Log in

A k-hop Scalable Management Scheme for Large Scale Mobile Ad Hoc Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The recent rapid growth of cities, the evolution of wireless/mobile technologies and diverse demanding applications, the world is becoming more and more urban. Today, wireless and mobile networks as well multimedia applications play an essential challenging role within urban environment and they are take a considerable attention to improve and render the urban environment increasingly sustainable and livable. The main purpose of wireless and mobile networks is to share the fresh updated information collected around the urban environment between the stakeholders and the citizen constantly. However, it’s very difficult to achieve this task in a complex, distributed, large (billions of heterogeneous connected devices) and diverse innovative demanding applications and services in urban environment. It is noteworthy that these demanding applications and services require constructing a wireless network that satisfies the scalability and QoS in this environment. In this paper, we propose an efficient k-hop scalability and QoS topology management scheme for large scale Mobile Ad Hoc Networks which is suitable for demanding application in urban environment. Our proposed scheme meets the scalability needs of urban environment as well the QoS of demanding applications like multimedia applications, by constructing a two hierarchical topology level based on trade-off between the clustering and virtual backbone mechanisms. To achieve and supports network scalability when network size increases (thousands of nodes) and satisfy the QoS of demanding applications, we propose in the first level, an efficient weight based clustering approach which considers a trade-off between the clustering metrics such as trust, density, mobility and energy, and QoS requirements like available bandwidth and link quality. In the second level, we based on connected dominating set algorithm to build a virtual backbone. Simulation results show that our scheme is able to reduce the number of cluster heads, the number of cluster heads re-affiliations, the total overheads and the number of dominating set, and increase the clusters stability, packets delivery ration and the network life time compared to other topology management schemes.

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
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23

Similar content being viewed by others

Notes

  1. The Flag F field in HELLO packet used to define the type of the HELLO message (D-HELLO , E-HELLO, NCH-HELLO).

  2. Node \(v_{i}\) joins the neighbor cluster head that has the largest weight value

  3. \(\star\) represents Cluster Head, \(*\) represents Gateway and \(\triangleleft\) represents Connector

  4. The connectivity between the partial virtual backbones ensured by gateways of each cluster

  5. In our implementation, we have fixed the Trust Threshold at 0.3. In the Illustrative example, \(T_{10},T_{5}, T_{9},T_{11}\) less than Trust Threshold (0.3).

  6. Our algorithm generates large cluster radius compared to the other schemes.

  7. This mechanism leads to reduce the number exchanging messages during topology re-construction which leads to increase life time of the network.

References

  1. Alzoubi, K., Wan, P., & Frieder, O. (2002). Message-optimal connected dominating sets in mobile ad hoc networks. In Proceedings of the third ACM international symposium on mobile ad hoc networking and computing, pp. 157–164.

  2. Anitha, V. S., Sebastian, M. P. (2009). SCAM: Scenario-based clustering algorithm for mobile ad hoc networks. In First international communication systems and networks and workshops, pp. 1–8.

  3. Anitha, V. S., Sebastian, M. P. (2009). Scenario-based diameter-bounded algorithm for cluster creation and management in mobile ad hoc networks. In 13th IEEE/ACM international symposium on distributed simulation and real time applications, pp. 97–104.

  4. Aug-Blum, I., Boussetta, K., Rivano, H. (2012). Capillary networks: A novel networking paradigm for urban environments. In The first workshop on Urban networking, pp. 25–30.

  5. Babu, S., Raha, A., & Naskar, K. (2011). Geometric mean based trust management system for WSNs (GMTMS). In IEEE proceedings of world congress on information and communication technologies (WICT 11) (pp. 444–449). India: Mumbai.

  6. Bao, L., & Garcia-Luna-Aceves, J. J. (2003). Topology management in ad hoc networks. In Proceedings of the 4th ACM international symposium on mobile ad hoc networking and computing, pp. 129–140.

  7. Basagni, S., Mastrogiovanni, M., Panconesi, A., & Petrioli, C. (2006). Localized protocols for ad hoc clustering and backbone formation: A performance comparison. IEEE Transactions on Parallel and Distributed Systems, 17(4), 292–306.

    Article  Google Scholar 

  8. Bentaleb, A., Boubetra, A., & Harous, S. (2013). Survey of clustering schemes in mobile ad hoc networks. Communications and Network, 5(2B), 8–14.

    Article  Google Scholar 

  9. Bentaleb, A., Harous, S., & Boubetra, A. (2013). A weight based clustering scheme for mobile ad hoc networks. In The 11th international conference on advances in mobile computing and multimedia (MoMM2013), Vienna, Austria, pp. 161–167.

  10. Bentaleb, A., Harous, S., & Boubetra, A. (2014). A scalable clustering scheme and its performance evaluation. International Journal of Pervasive Computing and Communications, 10(1), 27–42.

    Article  Google Scholar 

  11. Bentaleb, A., Harous, S., & Boubetra, A. (2015). A new topology management scheme for large-scale mobile ad hoc networks. In 2015 IEEE International Conference on Electro/Information Technology (EIT), USA, pp. 31–37.

  12. Butenko, S., Cheng, X., Zhu Du, D., & Pardalos, P. (2003). On the construction of virtual backbone for ad hoc wireless network. Book chapter : Cooperative control: Models, applications and algorithms, 1, pp. 43–54.

  13. Caragliu, A., Del Bo, C., & Nijkamp, P. (2009). Smart cities in Europe. Serie Research Memoranda 0048.

  14. Cokuslu, D., Erciyes, K., & Dagdeviren, O. (2006). A dominating set based clustering algorithm for mobile ad hoc networks. Book chapter: Computational science (ICCS), 3991, pp. 571–578.

  15. Correa, B. A., Hincapie, R. C., & Ospina, L. (2007). Survey on clustering techniques for mobile ad hoc networks. Revista Facultad de Ingenieria Universidad de Antioquia, 41, 145–161.

    Google Scholar 

  16. Corson, S., & Macker J. (1999). Mobile ad hoc networking (MANET). In IETF RFC2501.

  17. Crawley, E., Nair, R., Rajagopalan, B., & Sandick, H. (1998). A framework for QoS based Routing in the Internet. In IETF RFC2386.

  18. Dai, F., & Wu, J. (2004). An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transaction on Parallel Distributed Systems, 15(10), 908–920.

    Article  Google Scholar 

  19. European Smart Cities project. http://www.smart-cities.eu.

  20. Guha, S., & Khuller, S. (1998). Approximation algorithms for connected dominating sets. Algorithmica, 20(4), 374–387.

    Article  MathSciNet  MATH  Google Scholar 

  21. Guizani, B., Ayeb, B., & Koukam, A. (2011). Impact of stability in cluster based link state routing protocol for self-organizing networks. In 7th ICWMC.

  22. Hong, X., Xu, K., & Gerla, M. (2002). Scalable routing protocols for mobile ad hoc networks. IEEE Network magazine, 16(4), 11–21.

    Article  Google Scholar 

  23. Khandekar, R., Kortsarz, G., & Mirrokni, V. (2012). Advantage of overlapping clusters for minimizing conductance. In Proceedings of the 10th Latin American international conference on theoretical informatics (LATIN 12), pp. 494–505.

  24. Lee, B., Yu, C., & Moh, S. (2005). Issues in scalable clustered network architecture for mobile ad Hoc networks. Handbook of mobile computing (pp. 611–637). Boca Raton: CRC Press.

    Google Scholar 

  25. Mitton, N., Busson, A., & Fleury, E. (2004). Self-organization in large scale ad Hoc networks. Med-Hoc-Net (pp. 14–23). Turkey: Brodum.

  26. Ni, M., Zhong, Z., & Zhao, D. (2011). MPBC: A mobility prediction-based clustering scheme for ad hoc networks. IEEE Transactions on Vehicular Technology, 60(9), 4549–4559.

    Article  Google Scholar 

  27. Opnet technologies (2009). http://www.opnet.com.

  28. Piyatumrong, A., Bouvry, P., Guinand, F., Lavangnananda, K. (2008). Trusted spanning trees for Delay Tolerant Mobile Ad Hoc Networks. IEEE conference on soft computing in industrial applications (SMCia), pp. 131–136.

  29. Schleich, J. , Danoy, G., Bouvry, P., & Hoai An, L. T. (2010). on quantifying the quality of cds-based virtual backbones in mobile ad hoc networks. 8th ACM international symposium on mobility management and wireless access, pp. 21–28.

  30. Suman, P., Bisen, D., Tomar, P., Sejwar, V., & Shukla, R. (2009). Comparative study of routing protocols for mobile ad-hoc networks. International Journal of Information Technology and Knowledge Management, 4(1), 40–46.

    Google Scholar 

  31. Tseng, C. C., & Chen, K. C. (2005). Clustering wireless ad hoc networks with boundary nodes. IST mobile and wireless communications summit.

  32. Woo Lee, Y. (2013). Ubiquitous (Smart) City. In EU parliament seminar.

  33. Wu, J., & Li, H. (1999). On calculating connected dominating sets for efficient routing in ad hoc wireless networks. Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communication, pp. 7–14.

  34. Yang, Y., & Kravets, R. (2005). Contention-aware admission control for ad hoc networks. IEEE Transactions on Mobile Computing, 4(4), 363–377.

    Article  Google Scholar 

  35. Yu, J., Wang, N., Wang, G., & Yu, D. (2013). Connected dominating sets in wireless ad hoc and sensor networks: A comprehensive survey. Computer Communications, 36(2), 121–134.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Mohamed El Bachir El Ibrahimi, Bordj Bou Arreridj, Algeria

    Abdelhak Bentaleb & Abdelhak Boubetra

  2. College of Information Technology, United Arab Emirates University, P.O. Box 17551, Al Ain, UAE

    Saad Harous

Authors
  1. Abdelhak Bentaleb
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Saad Harous
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abdelhak Boubetra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abdelhak Bentaleb.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bentaleb, A., Harous, S. & Boubetra, A. A k-hop Scalable Management Scheme for Large Scale Mobile Ad Hoc Networks. Wireless Pers Commun 96, 6239–6271 (2017). https://doi.org/10.1007/s11277-017-4475-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-017-4475-x

Keywords

Search

Navigation