Skip to main content
Erschienen in: Mobile Networks and Applications 3/2018

06.09.2017

Regional Route Maintenance Protocol Based on Local Pheromone Diffusion for Mobile Ad Hoc Networks

verfasst von: Hyun-Ho Choi, Bongsoo Roh, Myounghun Han, Jung-Ryun Lee

Erschienen in: Mobile Networks and Applications | Ausgabe 3/2018

Einloggen

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

search-config
loading …

Abstract

Route maintenance protocol has a tradeoff between the amount of control overhead and the provision of useful alternative paths. To break through this tradeoff, we consider a bio-inspired approach based on the natural phenomena of ant pheromone. The pheromone is accumulated on the shortest path between the nest and the food, and then diffused into its vicinity over time. Thus, the ants can find another route along this locally diffused pheromone when the shortest path in use is blocked. Based on this local pheromone diffusion and rerouting behavior, we propose a new route maintenance protocol for mobile ad hoc networks. First, pheromones (i.e., routing information) are locally diffused around the shortest path between the source and the destination (i) by overhearing at the one-hop neighbors from the shortest path and (ii) by sharing the overheard pheromone information among the one-hop neighbors. Thereafter, a probabilistic path exploration is executed within the one-hop region based on the locally diffused pheromone and so useful alternative paths around the shortest path are discovered. Through intensive simulations, we verify that the proposed regional route maintenance protocol outperforms the conventional routing protocols in terms of disruption frequency, delivery ratio, delay, and jitter, while reducing the control overhead.

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

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 "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"

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!

Weitere Produktempfehlungen anzeigen
Anhänge
Nur mit Berechtigung zugänglich
Fußnoten
1
The pheromone information is a stochastic value to estimate the goodness of the route and is inversely proportional to the distance vector. Its use is a key feature of bio-inspired routing protocols [7].
 
2
Details on how to determine the one-hop neighbors will be explained in Section 4.2.
 
3
In general, δ is set to a value between 1.5 and 2 because too small δ can cause network partitioning and too large δ can cause more collisions and interference in the network [28, 29].
 
4
Agent packets used for control in the bio-inspired routing protocols are often called ant.
 
5
In this study, the same flooding mechanism as AODV is used for the fast initial route setup.
 
6
It is worth noting that the periodic exchange of forward and backward exploitation ants can be omitted if the data packets are transmitted bidirectionally or the end-to-end acknowledgement packets are generated from the destination, with the inclusion of the total cost value in their headers like the exploitation ant. In this case, the local pheromone diffusion is possible without the periodic transmission of exploitation ants; thus, reducing the overhead.
 
7
Note that the exchange of exploitation ants also plays an important role for the local pheromone diffusion by overhearing, as described in Section 4.2.
 
8
Although two overhead merics are closely related, the overhead in number of packets is important in measuring the medium access control (MAC) efficiency because it causes MAC layer overhead, and the overhead in number of bytes is important in measuring the channel occupancy and the energy consumption of nodes.
 
Literatur
1.
Zurück zum Zitat Choi H-H, Lee J-R, Roh B, Hoh M, Choi HS (2015) Bio-inspired routing protocol based on pheromone diffusion in mobile ad hoc networks. In: Proceedings of international conference on bio-inspired information and communications technologies (BICT), pp 399–406, New York, US Choi H-H, Lee J-R, Roh B, Hoh M, Choi HS (2015) Bio-inspired routing protocol based on pheromone diffusion in mobile ad hoc networks. In: Proceedings of international conference on bio-inspired information and communications technologies (BICT), pp 399–406, New York, US
2.
Zurück zum Zitat Marina MK, Das SR (2005) Routing in mobile ad hoc networks, Ad Hoc networks technologies and protocols. Springer, Berlin, pp 63–90 Marina MK, Das SR (2005) Routing in mobile ad hoc networks, Ad Hoc networks technologies and protocols. Springer, Berlin, pp 63–90
3.
Zurück zum Zitat Perkins CE, Bhagwat P (1994) Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: SIGCOMM’94, ACM, pp 234–244 Perkins CE, Bhagwat P (1994) Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: SIGCOMM’94, ACM, pp 234–244
4.
Zurück zum Zitat Clausen T, Jacquet P, Laouiti A, Muhlethaler P, Qayyum A, Viennot L (2001) Optimized link state routing protocol. In: Proceedings of IEEE INMIC Clausen T, Jacquet P, Laouiti A, Muhlethaler P, Qayyum A, Viennot L (2001) Optimized link state routing protocol. In: Proceedings of IEEE INMIC
5.
Zurück zum Zitat Perkins CE (2003) Ad hoc On-Demand Distance Vector (AODV) Routing, IETF RFC 3561 Perkins CE (2003) Ad hoc On-Demand Distance Vector (AODV) Routing, IETF RFC 3561
6.
Zurück zum Zitat Johnson D, Hu Y, Maltz D (2007) The dynamic source routing protocol (DSR) for mobile ad hoc networks for IPv4, IETF RFC 728 Johnson D, Hu Y, Maltz D (2007) The dynamic source routing protocol (DSR) for mobile ad hoc networks for IPv4, IETF RFC 728
7.
Zurück zum Zitat Dressler F, Akan OB (2010) Bio-inspired networking: from theory to practice. IEEE Commun Mag 48(11):176–183CrossRefMATH Dressler F, Akan OB (2010) Bio-inspired networking: from theory to practice. IEEE Commun Mag 48(11):176–183CrossRefMATH
8.
Zurück zum Zitat Zhang Z, Long K, Wang J, Dressler F (2014) On swarm intelligence inspired self-organized networking: its bionic mechanisms, designing principles and optimization approaches. IEEE Commun Surv Tutorials 16(1):513–537CrossRef Zhang Z, Long K, Wang J, Dressler F (2014) On swarm intelligence inspired self-organized networking: its bionic mechanisms, designing principles and optimization approaches. IEEE Commun Surv Tutorials 16(1):513–537CrossRef
9.
10.
Zurück zum Zitat Jackson DE, Ratnieks FL (2006) Communication in ants. Curr Biol 16(15):R570–R574CrossRef Jackson DE, Ratnieks FL (2006) Communication in ants. Curr Biol 16(15):R570–R574CrossRef
11.
Zurück zum Zitat Bitam S, Mellouk A, Zeadally S (2015) Bio-Inspired routing algorithms survey for vehicular ad hoc networks. IEEE Commun Surv Tutorials 17(2):843–867CrossRef Bitam S, Mellouk A, Zeadally S (2015) Bio-Inspired routing algorithms survey for vehicular ad hoc networks. IEEE Commun Surv Tutorials 17(2):843–867CrossRef
12.
Zurück zum Zitat Di Caro G, Dorigo M (1998) AntNet: Distributed stigmergetic control for communications networks. J Artif Intell Res 9:317–365MATH Di Caro G, Dorigo M (1998) AntNet: Distributed stigmergetic control for communications networks. J Artif Intell Res 9:317–365MATH
13.
Zurück zum Zitat Di Caro G, Dorigo M (1998) Two ant colony algorithms for best-effort routing in datagram networks. In: Proceedings of the 10th IASTED international conference on parallel and distributed computing and systems (PDCS’98), pp 541–546 Di Caro G, Dorigo M (1998) Two ant colony algorithms for best-effort routing in datagram networks. In: Proceedings of the 10th IASTED international conference on parallel and distributed computing and systems (PDCS’98), pp 541–546
14.
Zurück zum Zitat Doi S, Yamamura M (2004) An experimental analysis of loop-free algorithms for scale-free networks. In: Proceedings of ANTS, vol. 3172 of lecture notes in computer science, pp 278–285. Springer-Verlag Doi S, Yamamura M (2004) An experimental analysis of loop-free algorithms for scale-free networks. In: Proceedings of ANTS, vol. 3172 of lecture notes in computer science, pp 278–285. Springer-Verlag
15.
Zurück zum Zitat Baran B, Sosa R (2000) A new approach for AntNet routing. In: Proceedings of the 9th international conference on computer communications networks, Las Vegas, USA Baran B, Sosa R (2000) A new approach for AntNet routing. In: Proceedings of the 9th international conference on computer communications networks, Las Vegas, USA
16.
Zurück zum Zitat Carrillo L, Guadall C, Marzo JL, Di Caro G, Ducatelle F, Gambardella LM (2005) Differentiated quality of service scheme based on the use of multi-classes of ant-like mobile agents. In: Proceedings of the ACM conference on emerging network experiment and technology. Toulouse, France Carrillo L, Guadall C, Marzo JL, Di Caro G, Ducatelle F, Gambardella LM (2005) Differentiated quality of service scheme based on the use of multi-classes of ant-like mobile agents. In: Proceedings of the ACM conference on emerging network experiment and technology. Toulouse, France
17.
Zurück zum Zitat Baras JS, Mehta H (2003) A probabilistic emergent routing algorithm for mobile ad hoc networks. In: Proceedings of WiOpt03: modeling and optimization in mobile, Ad Hoc and wireless networks Baras JS, Mehta H (2003) A probabilistic emergent routing algorithm for mobile ad hoc networks. In: Proceedings of WiOpt03: modeling and optimization in mobile, Ad Hoc and wireless networks
18.
Zurück zum Zitat Liu Z, Kwiatkowska M, Constantinou C (2005) A self-organised emergent routing mechanism for mobile ad hoc networks. Eur Trans Telecommun 16(5):457–470CrossRef Liu Z, Kwiatkowska M, Constantinou C (2005) A self-organised emergent routing mechanism for mobile ad hoc networks. Eur Trans Telecommun 16(5):457–470CrossRef
19.
Zurück zum Zitat Marwaha S, Tham CK, Srinivasan D (2002) Mobile agents based routing protocol for mobile ad hoc networks. In: Proceedings of IEEE Globecom Marwaha S, Tham CK, Srinivasan D (2002) Mobile agents based routing protocol for mobile ad hoc networks. In: Proceedings of IEEE Globecom
20.
Zurück zum Zitat Roth M, Wicker S (2005) Swarm intelligence and data mining, chapter termite: A swarm intelligence routing algorithm for mobile wireless ad-hoc networks. Springer, Berlin Roth M, Wicker S (2005) Swarm intelligence and data mining, chapter termite: A swarm intelligence routing algorithm for mobile wireless ad-hoc networks. Springer, Berlin
21.
Zurück zum Zitat Rajagopalan S, Shen C-C (2005) ANSI: A unicast routing protocol for mobile ad hoc networks using swarm intelligence. In: Proceedings of international conference on artificial intelligence (ICAI) Rajagopalan S, Shen C-C (2005) ANSI: A unicast routing protocol for mobile ad hoc networks using swarm intelligence. In: Proceedings of international conference on artificial intelligence (ICAI)
22.
Zurück zum Zitat Zheng X, Guo W, Liu R (2004) An ant-based distributed routing algorithm for ad-hoc networks. In: Proceedings of the international conference on communications, circuits and systems (ICCCAS), pp 412–417 Zheng X, Guo W, Liu R (2004) An ant-based distributed routing algorithm for ad-hoc networks. In: Proceedings of the international conference on communications, circuits and systems (ICCCAS), pp 412–417
23.
Zurück zum Zitat Di Caro G, Ducatelle F, Gambardella LM (2005) AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks. Eur Trans Telecommun 16(5):443–455CrossRef Di Caro G, Ducatelle F, Gambardella LM (2005) AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks. Eur Trans Telecommun 16(5):443–455CrossRef
24.
Zurück zum Zitat Ducatelle F, Di Caro G, Gambardella LM (2005) Using ant agents to combine reactive and proactive strategies for routing in mobile ad hoc networks. Int J Comp Intel Appl 5(2):169–184CrossRefMATH Ducatelle F, Di Caro G, Gambardella LM (2005) Using ant agents to combine reactive and proactive strategies for routing in mobile ad hoc networks. Int J Comp Intel Appl 5(2):169–184CrossRefMATH
25.
Zurück zum Zitat Ducatelle F (2007) Adaptive routing in ad hoc wireless multi-hop networks, Ph.D. Dissertation Ducatelle F (2007) Adaptive routing in ad hoc wireless multi-hop networks, Ph.D. Dissertation
26.
Zurück zum Zitat Lin G, Noubir G, Rajaraman R (2004) Mobility Models for Ad Hoc Network Simulation. In: Proceedings of IEEE Infocom, pp 454–463 Lin G, Noubir G, Rajaraman R (2004) Mobility Models for Ad Hoc Network Simulation. In: Proceedings of IEEE Infocom, pp 454–463
27.
Zurück zum Zitat Ranjan RR (2010) Handbook of mobile Ad Hoc networks for mobility models. Springer Science & Business Media, BerlinMATH Ranjan RR (2010) Handbook of mobile Ad Hoc networks for mobility models. Springer Science & Business Media, BerlinMATH
28.
Zurück zum Zitat Bollobas B, Kozma R, Miklos D (2000) Handbook of large-scale random networks. Springer, BerlinMATH Bollobas B, Kozma R, Miklos D (2000) Handbook of large-scale random networks. Springer, BerlinMATH
29.
Zurück zum Zitat Bettstetter C (2004) On the connectivity of Ad Hoc networks, the computer journal, special issue on mobile and pervasive computing. Oxford University Press 47:432–447 Bettstetter C (2004) On the connectivity of Ad Hoc networks, the computer journal, special issue on mobile and pervasive computing. Oxford University Press 47:432–447
30.
Zurück zum Zitat Hanzo L, Tafazolli R (2007) A survey of QoS routing solutions for mobile ad hoc networks. IEEE Commun Surv Tutorials 9(2):50–70CrossRef Hanzo L, Tafazolli R (2007) A survey of QoS routing solutions for mobile ad hoc networks. IEEE Commun Surv Tutorials 9(2):50–70CrossRef
31.
Zurück zum Zitat Chang X (1999) Network simulations with OPNET. In: The 31st conference on winter simulation: simulation–a bridge to the future-volume 1, ACM, pp 307–314 Chang X (1999) Network simulations with OPNET. In: The 31st conference on winter simulation: simulation–a bridge to the future-volume 1, ACM, pp 307–314
32.
Zurück zum Zitat Camp T, Boleng J, Davies V (2002) A survey of mobility models for ad hoc network research. Wirel Commun Mob Comput 2(5):483–502CrossRef Camp T, Boleng J, Davies V (2002) A survey of mobility models for ad hoc network research. Wirel Commun Mob Comput 2(5):483–502CrossRef
33.
Zurück zum Zitat King PJB, Etorban AA, Ibrahim IS (2007) A DSDV-based multipath routing protocol for mobile Ad-Hoc networks. In: Proceedings of PGnet, pp 93–98 King PJB, Etorban AA, Ibrahim IS (2007) A DSDV-based multipath routing protocol for mobile Ad-Hoc networks. In: Proceedings of PGnet, pp 93–98
34.
Zurück zum Zitat Jun M (2011) The study on multi-path DSDV in Ad Hoc. In: Proceedings of international conference on communication software and networks (ICCSN). IEEE, pp 299–303 Jun M (2011) The study on multi-path DSDV in Ad Hoc. In: Proceedings of international conference on communication software and networks (ICCSN). IEEE, pp 299–303
Metadaten
Titel
Regional Route Maintenance Protocol Based on Local Pheromone Diffusion for Mobile Ad Hoc Networks
verfasst von
Hyun-Ho Choi
Bongsoo Roh
Myounghun Han
Jung-Ryun Lee
Publikationsdatum
06.09.2017
Verlag
Springer US
Erschienen in
Mobile Networks and Applications / Ausgabe 3/2018
Print ISSN: 1383-469X
Elektronische ISSN: 1572-8153
DOI
https://doi.org/10.1007/s11036-017-0907-9

Weitere Artikel der Ausgabe 3/2018

Mobile Networks and Applications 3/2018 Zur Ausgabe

Neuer Inhalt