Skip to main content
Erschienen in: Wireless Personal Communications 4/2017

29.05.2017

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

verfasst von: Abdelhak Bentaleb, Saad Harous, Abdelhak Boubetra

Erschienen in: Wireless Personal Communications | Ausgabe 4/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
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.
 
Literatur
1.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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.CrossRef 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.CrossRef
8.
Zurück zum Zitat Bentaleb, A., Boubetra, A., & Harous, S. (2013). Survey of clustering schemes in mobile ad hoc networks. Communications and Network, 5(2B), 8–14.CrossRef Bentaleb, A., Boubetra, A., & Harous, S. (2013). Survey of clustering schemes in mobile ad hoc networks. Communications and Network, 5(2B), 8–14.CrossRef
9.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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.CrossRef 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.CrossRef
11.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat Caragliu, A., Del Bo, C., & Nijkamp, P. (2009). Smart cities in Europe. Serie Research Memoranda 0048. Caragliu, A., Del Bo, C., & Nijkamp, P. (2009). Smart cities in Europe. Serie Research Memoranda 0048.
14.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
16.
Zurück zum Zitat Corson, S., & Macker J. (1999). Mobile ad hoc networking (MANET). In IETF RFC2501. Corson, S., & Macker J. (1999). Mobile ad hoc networking (MANET). In IETF RFC2501.
17.
Zurück zum Zitat Crawley, E., Nair, R., Rajagopalan, B., & Sandick, H. (1998). A framework for QoS based Routing in the Internet. In IETF RFC2386. Crawley, E., Nair, R., Rajagopalan, B., & Sandick, H. (1998). A framework for QoS based Routing in the Internet. In IETF RFC2386.
18.
Zurück zum Zitat 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.CrossRef 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.CrossRef
20.
21.
Zurück zum Zitat Guizani, B., Ayeb, B., & Koukam, A. (2011). Impact of stability in cluster based link state routing protocol for self-organizing networks. In 7th ICWMC. 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.
Zurück zum Zitat Hong, X., Xu, K., & Gerla, M. (2002). Scalable routing protocols for mobile ad hoc networks. IEEE Network magazine, 16(4), 11–21.CrossRef Hong, X., Xu, K., & Gerla, M. (2002). Scalable routing protocols for mobile ad hoc networks. IEEE Network magazine, 16(4), 11–21.CrossRef
23.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
25.
Zurück zum Zitat Mitton, N., Busson, A., & Fleury, E. (2004). Self-organization in large scale ad Hoc networks. Med-Hoc-Net (pp. 14–23). Turkey: Brodum. Mitton, N., Busson, A., & Fleury, E. (2004). Self-organization in large scale ad Hoc networks. Med-Hoc-Net (pp. 14–23). Turkey: Brodum.
26.
Zurück zum Zitat 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.CrossRef 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.CrossRef
28.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
31.
Zurück zum Zitat Tseng, C. C., & Chen, K. C. (2005). Clustering wireless ad hoc networks with boundary nodes. IST mobile and wireless communications summit. Tseng, C. C., & Chen, K. C. (2005). Clustering wireless ad hoc networks with boundary nodes. IST mobile and wireless communications summit.
32.
Zurück zum Zitat Woo Lee, Y. (2013). Ubiquitous (Smart) City. In EU parliament seminar. Woo Lee, Y. (2013). Ubiquitous (Smart) City. In EU parliament seminar.
33.
Zurück zum Zitat 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. 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.
Zurück zum Zitat Yang, Y., & Kravets, R. (2005). Contention-aware admission control for ad hoc networks. IEEE Transactions on Mobile Computing, 4(4), 363–377.CrossRef Yang, Y., & Kravets, R. (2005). Contention-aware admission control for ad hoc networks. IEEE Transactions on Mobile Computing, 4(4), 363–377.CrossRef
35.
Zurück zum Zitat 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.CrossRef 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.CrossRef
Metadaten
Titel
A k-hop Scalable Management Scheme for Large Scale Mobile Ad Hoc Networks
verfasst von
Abdelhak Bentaleb
Saad Harous
Abdelhak Boubetra
Publikationsdatum
29.05.2017
Verlag
Springer US
Erschienen in
Wireless Personal Communications / Ausgabe 4/2017
Print ISSN: 0929-6212
Elektronische ISSN: 1572-834X
DOI
https://doi.org/10.1007/s11277-017-4475-x

Weitere Artikel der Ausgabe 4/2017

Wireless Personal Communications 4/2017 Zur Ausgabe

Neuer Inhalt