Abstract
Mobile ad-hoc network (MANET) is a dynamic collection of mobile computers without the need for any existing infrastructure. Nodes in a MANET act as hosts and routers. Designing of robust routing algorithms for MANETs is a challenging task. Disjoint multipath routing protocols address this problem and increase the reliability, security and lifetime of network. However, selecting an optimal multipath is an NP-complete problem. In this paper, Hopfield neural network (HNN) which its parameters are optimized by particle swarm optimization (PSO) algorithm is proposed as multipath routing algorithm. Link expiration time (LET) between each two nodes is used as the link reliability estimation metric. This approach can find either node-disjoint or link-disjoint paths in single-phase route discovery. Simulation results confirm that PSO-HNN routing algorithm has better performance as compared to backup path set selection algorithm (BPSA) in terms of the path set reliability and number of paths in the set.
Article PDF
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
T. L. Sheu and Y. J. Wu, Jamming-based medium access control with dynamic priority adjustment in wireless adhoc networks, IET Commun. 1(1) (2007) 34–40.
Y. M. Huang and T. C. Chiang, A partition network model for ad hoc networks in overlay environments, Wirel. Commun. Mobile Comput. 6(5) (2006) 711–725.
Y. Liu and J. Huang, A novel fast multi-objective evolutionary algorithm for QoS multicast routing in MANET, Int. J. Computational Intelligence Systems 2(3) (2009) 288–297.
M. Saleema, I. Ullah, S. A. Khayamc and M. Farooq, On the reliability of ad hoc routing protocols for loss-and-delay sensitive applications, Ad Hoc Netw. 9(3) (2011) 285–299.
M. K. Anantapalli and W. Li, Multipath multihop routing analysis in mobile ad hoc networks, Wirel. Netw. 16(1) (2010) 79–94.
A. Dana, A. Khadem Zadeh and A. A. Sadat, Backup path set selection in ad hoc wireless network using link expiration time, Comput. Electr. Eng. 34(6) (2008) 503–519.
S. K. Das, A. Mukherjee, S. Bandyopadhyay, D. Saha and K. Paul, An adaptive framework for QoS routing through multiple paths in ad-hoc wireless networks, J. Parallel Distr. Comput. 63(2) (2003) 141–153.
S. J. Lee and M. Gerla, Split multi-path routing with maximally disjoint paths in ad hoc networks, in Proc. IEEE Int. Conf. Commun. (2001) Helsinki, Finland, pp. 3201–3205.
M. R. Pearlman, Z. J. Haas, P. Sholander and S. S. Tabrizi, On the impact of alternate path routing for load balancing in mobile ad hoc networks, in Proc. 1st Workshop Mobile and Ad-hoc Networking and Computing (2000) Boston, MA, pp. 3–10.
V. Raman, Finding the best edge-packing for two-terminal reliability is NP-hard, J. Combinatorial Math. Comb. Comput. 9 (1991) 91–96.
L. Magdalena, What is soft computing? Revisiting possible answers, Int. J. Computational Intelligence Systems 3(2) (2010) 148–159.
R. Seising, What is soft computing? Bridging gaps for 21st century science, Int. J. Computational Intelligence Systems 3(2) (2010) 160–175.
E. H. Ruspini, Soft computing: coping with complexity, Int. J. Computational Intelligence Systems 3(2) (2010) 190–196.
J. Kacprzyk, Computational intelligence and soft computing: some thoughts on already explored and not yet explored paths, Int. J. Computational Intelligence Systems 3(2) (2010) 223–236.
P. P. Bonissone, Soft Computing: A Continuously Evolving Concept, Int. J. Computational Intelligence Systems 3(2) (2010) 237–248.
J. Hopfield, Neurons with graded response have collective computational properties like those of two-state neurons, Proc. Nat. Acad. Sci. 81(10) (1984) 3088–3092.
J. Hopfield and D. Tank, Neural’s computation of decisions in optimization problems, Biol. Cybern. 52(3) (1985) 141–152.
H. E. Rauch and T. Winarske, Neural networks for routing communication traffic, IEEE Cont. Syst. Mag. 8(2) (1988) 26–31.
M. K. M. Ali and F. Kamoun, Neural networks for shortest path computation and routing in computer networks, IEEE Trans. Neural Networks 4(6) (1993) 941–954.
P. Venkataram, S. Ghosal and B. P. Vijay Kumar, Neural network based optimal routing algorithm for communication networks, Neural Networks 15(10) (2002) 1289–1298.
J. Gao and R. Chen, A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem, Int. J. Computational Intelligence Systems 4(4) (2011) 497–508.
R. S. Kumar and N. Alagumurthi, Integrated total cost and tolerance optimization with genetic algorithm, Int. J. Computational Intelligence Systems 3(3) (2010) 325–333.
P. G. Kumar, Fuzzy classifier design using modified genetic algorithm, Int. J. Computational Intelligence Systems 3(3) (2010) 334–342.
N. Mohammadi, M. R. Malek and A. A. Alesheikh, A new GA based solution for capacitated multi source Weber problem, Int. J. Computational Intelligence Systems 3(5) (2010) 514–521.
L. S. Coelho and D. L. A. Bernert, A modified ant colony optimization algorithm based on differential evolution for chaotic synchronization, Expert System with Applications 37(6) (2010) 4198–4203.
M. Hosseinabadi Farahani and L. Hosseini, An ant colony optimization approach for the machine-part cell formation problem, Int. J. Computational Intelligence Systems 4(4) (2011) 486–496.
X. Wang, X. Z. Gao and S. J. Ovaska, A hybrid artificial immune optimization method, Int. J. Computational Intelligence Systems 2(3) (2009) 248–255.
Y. S. Wang and C. Tap, Particle swarm optimization with novel processing strategy and its application, Int. J. Computational Intelligence Systems 4(1) (2011) 100–111.
X. Zheng and H. Liu, A scalable coevolutionary multi-objective particle swarm optimizer, Int. J. Computational Intelligence Systems 3(5) (2010) 590–600.
L. Hu, X. Che and X. Cheng, Bandwidth prediction based on Nu-support vector regression and parallel hybrid particle swarm optimization, Int. J. Computational Intelligence Systems 3(1) (2010) 70–83.
H. Modares, A. Alfi and M. M. Fateh, Parameter identification of chaotic dynamic systems through an improved particle swarm optimization. Expert System with Applications 37(5) (2010) 3714–3720.
W. Wang, Q. Sun, X. Zhao and F. Yang, An improved particle swarm optimization algorithm for QoS-aware web service selection in service oriented communication, Int. J. Computational Intelligence Systems 3(Supplement 1) (2010) 18–30.
L. Gao and A. Hailu, Comprehensive learning particle swarm optimizer for constrained mixed-variable optimization problems, Int. J. Computational Intelligence Systems 3(6) (2010) 832–842.
L. S. Coelho and D. L. A. Bernert, An improved harmony search algorithm for synchronization of discrete-time chaotic systems, Chaos, Solitons & Fractals 41(5) (2009) 2526–2532.
J. Kennedy and R. C. Eberhart, Particle swarm optimization, in Proc. IEEE Int. Conf. Neural Networks (1995) Perth, Australia, vol. 4, pp. 1942–1948.
H. B. Gao, C. Zhou and L. Gao, Generalized model of particle swarm optimization, Chinese J. Comput. 28(12) (2005) 1980–1987.
C. J. A. Bastos-Filho, W. H. Schuler, A. L. I. Oliveira and L. N. Vitorino, Routing algorithm based on swarm intelligence and Hopfield neural network applied to communication networks, Electr. Lett. 44(16) (2008) 995–997.
E. Hemmati and M. Sheikhan, Hopfield neural network for disjoint path set selection in mobile ad-hoc networks, in Proc. 6th Int. Conf. Wireless Communication and Sensor Networks (2010) Allahabad, India, pp. 140–144.
E. Hemmati and M. Sheikhan, Reliable disjoint path set selection in mobile ad-hoc networks using noisy Hopfield neural network, in Proc. 5th Int. Symp. Telecommunications (2010) Tehran, Iran, pp. 496–501.
D. W. Tank and J. J. Hopfield, Simple neural optimization networks: an A/D converter, signal decision circuit, and a linear programming circuit, IEEE Trans. Circuits Syst. 33(5) (1986) 533–541.
Y. Shi and R. Eberhart, Parameter selection in particle swarm optimization, in Proc. 7th Int. Conf. Evolutionary Programming (1998) London, UK, pp. 591–601.
C. R. Mouser and S. A. Dunn, Comparing genetic algorithms and particle swarm optimization for an inverse problem exercise, Australian & New Zealand Industrial and Applied Mathematics Journal 46(E) (2005) 89–101.
R. Hassan, B. Cohanim, O. De Weck and G. Venter, A comparison of particle swarm optimization and the genetic algorithm, in Proc. 46th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conf. (2005) Austin, Texas, pp. 1138–1150.
T. Rappaport, Wireless Communications: Principles and Practice (Prentice Hall, PTR Upper Saddle River, NJ, 2001).
W. Su, S. Lee and M. Gerla, Mobility prediction in wireless networks, in Proc. 21st Century Military Communications Conf. (2000) Los Angeles, USA, vol. 1, pp. 491–495.
T. Camp, J. Boleng and V. Davies, A survey of mobility models for ad-hoc network research, Wirel. Commun. Mobile Comput. 2(5) (2002) 483–502.
S. Pierre, H. Said and W. G. Probst, An artificial neural network approach for routing in distributed computer networks, Engineering Applications of Artificial Intelligence 14(1) (2001) 51–60.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
About this article
Cite this article
Sheikhan, M., Hemmati, E. PSO-Optimized Hopfield Neural Network-Based Multipath Routing for Mobile Ad-hoc Networks. Int J Comput Intell Syst 5, 568–581 (2012). https://doi.org/10.1080/18756891.2012.696921
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1080/18756891.2012.696921