Skip to main content
Erschienen in: Neural Computing and Applications 6/2012

01.09.2012 | Original Article

Transient chaotic neural network-based disjoint multipath routing for mobile ad-hoc networks

verfasst von: Mansour Sheikhan, Ehsan Hemmati

Erschienen in: Neural Computing and Applications | Ausgabe 6/2012

Einloggen

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

search-config
loading …

Abstract

Due to mobility of wireless hosts, routing in mobile ad-hoc networks (MANETs) is a challenging task. Multipath routing is employed to provide reliable communication, load balancing, and improving quality of service of MANETs. Multiple paths are selected to be node-disjoint or link-disjoint to improve transmission reliability. However, selecting an optimal disjoint multipath set is an NP-complete problem. Neural networks are powerful tools for a wide variety of combinatorial optimization problems. In this study, a transient chaotic neural network (TCNN) is presented as multipath routing algorithm in MANETs. Each node in the network can be equipped with a neural network, and all the network nodes can be trained and used to obtain optimal or sub-optimal high reliable disjoint paths. This algorithm can find both node-disjoint and link-disjoint paths with no extra overhead. The simulation results show that the proposed method can find the high reliable disjoint path set in MANETs. In this paper, the performance of the proposed algorithm is compared to the shortest path algorithm, disjoint path set selection protocol algorithm, and Hopfield neural network (HNN)-based model. Experimental results show that the disjoint path set reliability of the proposed algorithm is up to 4.5 times more than the shortest path reliability. Also, the proposed algorithm has better performance in both reliability and the number of paths and shows up to 56% improvement in path set reliability and up to 20% improvement in the number of paths in the path set. The proposed TCNN-based algorithm also selects more reliable paths as compared to HNN-based algorithm in less number of iterations.

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

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!

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!

Literatur
1.
Zurück zum Zitat Sun B, Pi S, Gui C, Zeng Y, Yan B, Wang W, Qin Q (2008) Multiple constraints QoS multicast routing optimization algorithm in MANET based on GA. Prog Nat Sci 18:331–336CrossRef Sun B, Pi S, Gui C, Zeng Y, Yan B, Wang W, Qin Q (2008) Multiple constraints QoS multicast routing optimization algorithm in MANET based on GA. Prog Nat Sci 18:331–336CrossRef
2.
Zurück zum Zitat Sun B, Li L (2006) A QoS multicast routing optimization algorithms based on genetic algorithm. J Commun Netw 8:116–122 Sun B, Li L (2006) A QoS multicast routing optimization algorithms based on genetic algorithm. J Commun Netw 8:116–122
3.
Zurück zum Zitat Marina MK, Das SR (2001) On-demand multipath distance vector routing in ad hoc networks. In: The proceedings of the ninth international conference on network protocols. pp 14–23 Marina MK, Das SR (2001) On-demand multipath distance vector routing in ad hoc networks. In: The proceedings of the ninth international conference on network protocols. pp 14–23
4.
Zurück zum Zitat Royer EM, Toh C-K (1999) A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Pers Commun Mag 6:46–55CrossRef Royer EM, Toh C-K (1999) A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Pers Commun Mag 6:46–55CrossRef
5.
Zurück zum Zitat Perkins CE, Royer EM (2003) Ad hoc on-demand distance vector routing (AODV). IETF RFC 3561 Perkins CE, Royer EM (2003) Ad hoc on-demand distance vector routing (AODV). IETF RFC 3561
6.
Zurück zum Zitat Johnson DJ, Maltz D, Hu YC (2004) The dynamic source routing protocol for mobile ad hoc networks (DSR). Internet Draft (draft-ietf-manet-dsr-10), IETF MANET Working Group Johnson DJ, Maltz D, Hu YC (2004) The dynamic source routing protocol for mobile ad hoc networks (DSR). Internet Draft (draft-ietf-manet-dsr-10), IETF MANET Working Group
7.
Zurück zum Zitat Perkins CE, Bhagwat P (1994) Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: The proceedings of the ACM SIGCOMM on communications architectures, protocols and applications. pp 234–244 Perkins CE, Bhagwat P (1994) Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: The proceedings of the ACM SIGCOMM on communications architectures, protocols and applications. pp 234–244
8.
Zurück zum Zitat Pei G, Gerla M, Chen TW (2000) Fisheye state routing: a routing scheme for ad hoc wireless networks. In: The proceedings of the IEEE international conference on communications. pp 70–74 Pei G, Gerla M, Chen TW (2000) Fisheye state routing: a routing scheme for ad hoc wireless networks. In: The proceedings of the IEEE international conference on communications. pp 70–74
9.
Zurück zum Zitat Raman V (1991) Finding the best edge-packing for two-terminal reliability is NP-hard. J Comb Math Comb Comput 9:91–96MathSciNetMATH Raman V (1991) Finding the best edge-packing for two-terminal reliability is NP-hard. J Comb Math Comb Comput 9:91–96MathSciNetMATH
10.
Zurück zum Zitat Lee SJ, Gerla M (2001) Split multi-path routing with maximally disjoint paths in ad hoc networks. In: The proceedings of the IEEE international conference on communications. pp 3201–3205 Lee SJ, Gerla M (2001) Split multi-path routing with maximally disjoint paths in ad hoc networks. In: The proceedings of the IEEE international conference on communications. pp 3201–3205
11.
Zurück zum Zitat Hauspie M, Simplot D, Carle J (2003) Partition detection in mobile ad-hoc networks using multiple disjoint paths set. In: The proceedings of the 2nd mediterranean workshop on ad-hoc networks, Mahdia, Tunisia Hauspie M, Simplot D, Carle J (2003) Partition detection in mobile ad-hoc networks using multiple disjoint paths set. In: The proceedings of the 2nd mediterranean workshop on ad-hoc networks, Mahdia, Tunisia
12.
Zurück zum Zitat Ducatelle F, Di Caro G, Maria GL (2005) Ant agents for hybrid multipath routing in mobile ad-hoc networks. In: The proceedings of the 2nd annual conference on wireless on demand network systems and services. pp 44–53 Ducatelle F, Di Caro G, Maria GL (2005) Ant agents for hybrid multipath routing in mobile ad-hoc networks. In: The proceedings of the 2nd annual conference on wireless on demand network systems and services. pp 44–53
13.
Zurück zum Zitat Papadimitratos P, Haas ZJ, Sirer EG (2002) Path set selection in mobile ad hoc networks. In: The proceedings of the third ACM symposium on mobile ad hoc networking and computing. pp 1–11 Papadimitratos P, Haas ZJ, Sirer EG (2002) Path set selection in mobile ad hoc networks. In: The proceedings of the third ACM symposium on mobile ad hoc networking and computing. pp 1–11
14.
Zurück zum Zitat Hemmati E, Sheikhan M (2010) Hopfield neural network for disjoint path set selection in mobile ad-hoc networks. In: The proceeding of 6th IEEE international conference on wireless communication and sensor networks. pp 140–144 Hemmati E, Sheikhan M (2010) Hopfield neural network for disjoint path set selection in mobile ad-hoc networks. In: The proceeding of 6th IEEE international conference on wireless communication and sensor networks. pp 140–144
16.
Zurück zum Zitat Kwok T, Smith KA (1999) A unified framework for chaotic neural-network approaches to combinatorial optimization. IEEE Trans Neural Netw 10:978–981CrossRef Kwok T, Smith KA (1999) A unified framework for chaotic neural-network approaches to combinatorial optimization. IEEE Trans Neural Netw 10:978–981CrossRef
18.
Zurück zum Zitat Wang L, Liu W, Shi H (2009) Delay-constrained multicast routing using the noisy chaotic neural networks. IEEE Trans Comput 58:82–89MathSciNetCrossRef Wang L, Liu W, Shi H (2009) Delay-constrained multicast routing using the noisy chaotic neural networks. IEEE Trans Comput 58:82–89MathSciNetCrossRef
19.
Zurück zum Zitat Chen L, Aihara K (1995) Chaotic simulated annealing by a neural network model with transient chaos. Neural Netw 8:915–930CrossRef Chen L, Aihara K (1995) Chaotic simulated annealing by a neural network model with transient chaos. Neural Netw 8:915–930CrossRef
20.
Zurück zum Zitat Hopfield JJ, Tank DW (1985) Neural computation of decisions in optimization problems. Biol Cybern 52:141–152MathSciNetMATH Hopfield JJ, Tank DW (1985) Neural computation of decisions in optimization problems. Biol Cybern 52:141–152MathSciNetMATH
21.
Zurück zum Zitat Gee AH, Prager RW (1995) Limitations of neural networks for solving travelling salesman problems. IEEE Trans Neural Netw 6:280–282CrossRef Gee AH, Prager RW (1995) Limitations of neural networks for solving travelling salesman problems. IEEE Trans Neural Netw 6:280–282CrossRef
22.
Zurück zum Zitat Wilson GV, Pawley GS (1988) On the stability of the travelling salesman problem algorithm of Hopfield and Tank. Biol Cybern 58:63–70MathSciNetMATHCrossRef Wilson GV, Pawley GS (1988) On the stability of the travelling salesman problem algorithm of Hopfield and Tank. Biol Cybern 58:63–70MathSciNetMATHCrossRef
23.
Zurück zum Zitat Su W, Lee S, Gerla M (2000) Mobility prediction in wireless networks. In: The proceedings of the MILCOM 2000, 21st century military communications conference, vol 1. pp 491–495 Su W, Lee S, Gerla M (2000) Mobility prediction in wireless networks. In: The proceedings of the MILCOM 2000, 21st century military communications conference, vol 1. pp 491–495
24.
Zurück zum Zitat Camp T, Boleng J, Davies V (2002) A survey of mobility models for ad-hoc network research. In: The proceedings of the wireless communications and mobile computing conference. pp 483–502 Camp T, Boleng J, Davies V (2002) A survey of mobility models for ad-hoc network research. In: The proceedings of the wireless communications and mobile computing conference. pp 483–502
Metadaten
Titel
Transient chaotic neural network-based disjoint multipath routing for mobile ad-hoc networks
verfasst von
Mansour Sheikhan
Ehsan Hemmati
Publikationsdatum
01.09.2012
Verlag
Springer-Verlag
Erschienen in
Neural Computing and Applications / Ausgabe 6/2012
Print ISSN: 0941-0643
Elektronische ISSN: 1433-3058
DOI
https://doi.org/10.1007/s00521-011-0594-6

Weitere Artikel der Ausgabe 6/2012

Neural Computing and Applications 6/2012 Zur Ausgabe