Skip to main content
SpringerLink
Log in

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

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

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.

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

Similar content being viewed by others

References

  1. 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–336

    Article  Google Scholar 

  2. Sun B, Li L (2006) A QoS multicast routing optimization algorithms based on genetic algorithm. J Commun Netw 8:116–122

    Google Scholar 

  3. 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. Royer EM, Toh C-K (1999) A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Pers Commun Mag 6:46–55

    Article  Google Scholar 

  5. Perkins CE, Royer EM (2003) Ad hoc on-demand distance vector routing (AODV). IETF RFC 3561

  6. 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. 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. 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. Raman V (1991) Finding the best edge-packing for two-terminal reliability is NP-hard. J Comb Math Comb Comput 9:91–96

    MathSciNet  MATH  Google Scholar 

  10. 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. 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. 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. 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. 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

  15. Aihara K, Takabe T, Toyoda M (1990) Chaotic neural networks. Phys Lett A 144:333–340

    Article  MathSciNet  Google Scholar 

  16. Kwok T, Smith KA (1999) A unified framework for chaotic neural-network approaches to combinatorial optimization. IEEE Trans Neural Netw 10:978–981

    Article  Google Scholar 

  17. Chen L, Aihara K (2000) Strange attractors in chaotic neural networks. IEEE Trans Circuits Syst 47:1455–1468

    Article  MathSciNet  MATH  Google Scholar 

  18. Wang L, Liu W, Shi H (2009) Delay-constrained multicast routing using the noisy chaotic neural networks. IEEE Trans Comput 58:82–89

    Article  MathSciNet  Google Scholar 

  19. Chen L, Aihara K (1995) Chaotic simulated annealing by a neural network model with transient chaos. Neural Netw 8:915–930

    Article  Google Scholar 

  20. Hopfield JJ, Tank DW (1985) Neural computation of decisions in optimization problems. Biol Cybern 52:141–152

    MathSciNet  MATH  Google Scholar 

  21. Gee AH, Prager RW (1995) Limitations of neural networks for solving travelling salesman problems. IEEE Trans Neural Netw 6:280–282

    Article  Google Scholar 

  22. Wilson GV, Pawley GS (1988) On the stability of the travelling salesman problem algorithm of Hopfield and Tank. Biol Cybern 58:63–70

    Article  MathSciNet  MATH  Google Scholar 

  23. 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. 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

Download references

Author information

Authors and Affiliations

  1. Department of Communication Engineering, Islamic Azad University, South Tehran Branch, Tehran, Iran

    Mansour Sheikhan

  2. Department of Electronic Engineering, Faculty of Engineering, Islamic Azad University, South Tehran Branch, P.O. Box: 11365-4435, Tehran, Iran

    Mansour Sheikhan & Ehsan Hemmati

Authors
  1. Mansour Sheikhan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ehsan Hemmati
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mansour Sheikhan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sheikhan, M., Hemmati, E. Transient chaotic neural network-based disjoint multipath routing for mobile ad-hoc networks. Neural Comput & Applic 21, 1403–1412 (2012). https://doi.org/10.1007/s00521-011-0594-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-011-0594-6

Keywords

Search

Navigation