PSO-Optimized Hopfield Neural Network-Based Multipath Routing for Mobile Ad-hoc Networks

References

• Sheu , T. L. and Wu , Y. J. 2007 . Jamming-based medium access control with dynamic priority adjustment in wireless adhoc networks . IET Commun. , 1 ( 1 ) : 34 – 40 .
   Web of Science ®Google Scholar
• Huang , Y. M. and Chiang , T. C. 2006 . A partition network model for ad hoc networks in overlay environments . Wirel. Commun.Mobile Comput. , 6 ( 5 ) : 711 – 725 .
   Web of Science ®Google Scholar
• Liu , Y. and Huang , J. 2009 . A novel fast multi-objective evolutionary algorithm for QoS multicast routing in MANET . Int. J. Computational Intelligence Systems , 2 ( 3 ) : 288 – 297 .
   Web of Science ®Google Scholar
• Saleema , M. , Ullah , I. , Khayamc , S. A. and Farooq , M. 2011 . On the reliability of ad hoc routing protocols for loss-anddelay sensitive applications . Ad Hoc Netw. , 9 ( 3 ) : 285 – 299 .
   Web of Science ®Google Scholar
• Anantapalli , M. K. and Li , W. 2010 . Multipath multihop routing analysis in mobile ad hoc networks . Wirel. Netw. , 16 ( 1 ) : 79 – 94 .
   Web of Science ®Google Scholar
• Dana , A. , Khadem Zadeh , A. and Sadat , A. A. 2008 . Backup path set selection in ad hoc wireless network using link expiration time . Comput. Electr.Eng. , 34 ( 6 ) : 503 – 519 .
   Web of Science ®Google Scholar
• Das , S. K. , Mukherjee , A. , Bandyopadhyay , S. , Saha , D. and Paul , K. 2003 . An adaptive framework for QoS routing through multiple paths in ad-hoc wireless networks . J. Parallel Distr. Comput. , 63 ( 2 ) : 141 – 153 .
   Web of Science ®Google Scholar
• 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 .
   Google Scholar
• 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 .
   Google Scholar
• Raman , V. 1991 . Finding the best edge-packing for twoterminal reliability is NP-hard . J. Combinatorial Math. Comb. Comput. , 9 : 91 – 96 .
   Google Scholar
• Magdalena , L. 2010 . What is soft computing? Revisiting possible answers . Int. J. Computational Intelligence Systems , 3 ( 2 ) : 148 – 159 .
   Web of Science ®Google Scholar
• Seising , R. 2010 . What is soft computing? Bridging gaps for 21st century science . Int. J. Computational Intelligence Systems , 3 ( 2 ) : 160 – 175 .
   Web of Science ®Google Scholar
• Ruspini , E. H. 2010 . Soft computing: coping with complexity . Int. J. Computational Intelligence Systems , 3 ( 2 ) : 190 – 196 .
   Web of Science ®Google Scholar
• Kacprzyk , J. 2010 . Computational intelligence and soft computing: some thoughts on already explored and not yet explored paths . Int. J. Computational Intelligence Systems , 3 ( 2 ) : 223 – 236 .
   Web of Science ®Google Scholar
• Bonissone , P. P. 2010 . Soft Computing: A Continuously Evolving Concept . Int. J. Computational Intelligence Systems , 3 ( 2 ) : 237 – 248 .
   Web of Science ®Google Scholar
• Hopfield , J. 1984 . Neurons with graded response have collective computational properties like those of twostate neurons . Proc. Nat. Acad. Sci. , 81 ( 10 ) : 3088 – 3092 .
   PubMed Web of Science ®Google Scholar
• Hopfield , J. and Tank , D. 1985 . Neural's computation of decisions in optimization problems . Biol. Cybern. , 52 ( 3 ) : 141 – 152 .
   PubMed Web of Science ®Google Scholar
• Rauch , H. E. and Winarske , T. 1988 . Neural networks for routing communication traffic . IEEE Cont. Syst. Mag. , 8 ( 2 ) : 26 – 31 .
   Google Scholar
• Ali , M. K. M. and Kamoun , F. 1993 . Neural networks for shortest path computation and routing in computer networks . IEEE Trans. Neural Networks , 4 ( 6 ) : 941 – 954 .
   PubMed Web of Science ®Google Scholar
• Venkataram , P. , Ghosal , S. and Vijay Kumar , B. P. 2002 . Neural network based optimal routing algorithm for communication networks . Neural Networks , 15 ( 10 ) : 1289 – 1298 .
   PubMed Web of Science ®Google Scholar
• Gao , J. and Chen , R. 2011 . A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem . Int. J. Computational Intelligence Systems , 4 ( 4 ) : 497 – 508 .
   Web of Science ®Google Scholar
• Kumar , R. S. and Alagumurthi , N. 2010 . Integrated total cost and tolerance optimization with genetic algorithm . Int. J. Computational Intelligence Systems , 3 ( 3 ) : 325 – 333 .
   Web of Science ®Google Scholar
• Kumar , P. G. 2010 . Fuzzy classifier design using modified genetic algorithm . Int. J. Computational Intelligence Systems , 3 ( 3 ) : 334 – 342 .
   Web of Science ®Google Scholar
• Mohammadi , N. , Malek , M. R. and Alesheikh , A. A. 2010 . A new GA based solution for capacitated multi source Weber problem . Int. J. Computational Intelligence Systems , 3 ( 5 ) : 514 – 521 .
   Web of Science ®Google Scholar
• Coelho , L. S. and Bernert , D. L. A. 2010 . A modified ant colony optimization algorithm based on differential evolution for chaotic synchronization . Expert System with Applications , 37 ( 6 ) : 4198 – 4203 .
   Web of Science ®Google Scholar
• Hosseinabadi Farahani , M. and Hosseini , L. 2011 . An ant colony optimization approach for the machine-part cell formation problem . Int. J. Computational Intelligence Systems , 4 ( 4 ) : 486 – 496 .
   Web of Science ®Google Scholar
• Wang , X. , Gao , X. Z. and Ovaska , S. J. 2009 . A hybrid artificial immune optimization method . Int. J. Computational Intelligence Systems , 2 ( 3 ) : 248 – 255 .
   Web of Science ®Google Scholar
• Wang , Y. S. and Tap , C. 2011 . Particle swarm optimization with novel processing strategy and its application . Int. J. Computational Intelligence Systems , 4 ( 1 ) : 100 – 111 .
   Web of Science ®Google Scholar
• Zheng , X. and Liu , H. 2010 . A scalable coevolutionary multiobjective particle swarm optimizer . Int. J. Computational Intelligence Systems , 3 ( 5 ) : 590 – 600 .
   Web of Science ®Google Scholar
• Hu , L. , Che , X. and Cheng , X. 2010 . Bandwidth prediction based on Nu-support vector regression and parallel hybrid particle swarm optimization . Int. J. Computational Intelligence Systems , 3 ( 1 ) : 70 – 83 .
   Web of Science ®Google Scholar
• Modares , H. , Alfi , A. and Fateh , M. M. 2010 . Parameter identification of chaotic dynamic systems through an improved particle swarm optimization . Expert System with Applications , 37 ( 5 ) : 3714 – 3720 .
   Web of Science ®Google Scholar
• Wang , W. , Sun , Q. , Zhao , X. and Yang , F. 2010 . An improved particle swarm optimization algorithm for QoS-aware web service selection in service oriented communication . Int. J. Computational Intelligence Systems , 3 ( Supplement 1 ) : 18 – 30 .
   Google Scholar
• Gao , L. and Hailu , A. 2010 . Comprehensive learning particle swarm optimizer for constrained mixed-variable optimization problems . Int. J. Computational Intelligence Systems , 3 ( 6 ) : 832 – 842 .
   Web of Science ®Google Scholar
• Coelho , L. S. and Bernert , D. L. A. 2009 . An improved harmony search algorithm for synchronization of discrete-time chaotic systems . Chaos, Solitons & Fractals , 41 ( 5 ) : 2526 – 2532 .
   Web of Science ®Google Scholar
• J. Kennedy and R. C. Eberhart , Particle swarm optimization , in Proc. IEEE Int. Conf. Neural Networks 1995 , Perth , , Australia , vol. 4 , pp. 1942 – 1948 .
   Google Scholar
• Gao , H. B. , Zhou , C. and Gao , L. 2005 . Generalized model of particle swarm optimization . Chinese J. Comput. , 28 ( 12 ) : 1980 – 1987 .
   Google Scholar
• Bastos-Filho , C. J. A. , Schuler , W. H. , Oliveira , A. L. I. and Vitorino , L. N. 2008 . Routing algorithm based on swarm intelligence and Hopfield neural network applied to communication networks . Electr. Lett. , 44 ( 16 ) : 995 – 997 .
   Web of Science ®Google Scholar
• 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 .
   Google Scholar
• 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 .
   Google Scholar
• Tank , D. W. and Hopfield , J. J. 1986 . Simple neural optimization networks: an A/D converter, signal decision circuit, and a linear programming circuit . IEEE Trans. Circuits Syst. , 33 ( 5 ) : 533 – 541 .
   Google Scholar
• Y. Shi and R. Eberhart , Parameter selection in particle swarm optimization , in Proc. 7th Int. Conf. Evolutionary Programming 1998 , London , , UK , pp. 591 – 601 .
   Google Scholar
• Mouser , C. R. and Dunn , S. A. 2005 . Comparing genetic algorithms and particle swarm optimization for an inverse problem exercise . Australian & New Zealand Industrial and Applied Mathematics Journal , 46 ( E ) : 89 – 101 .
   Google Scholar
• 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 .
   Google Scholar
• Rappaport , T. 2001 . Wireless Communications: Principles and Practice , NJ : Prentice Hall, PTR Upper Saddle River .
   Google Scholar
• 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 .
   Google Scholar
• Camp , T. , Boleng , J. and Davies , V. 2002 . A survey of mobility models for ad-hoc network research . Wirel. Commun. Mobile Comput. , 2 ( 5 ) : 483 – 502 .
   Web of Science ®Google Scholar
• Pierre , S. , Said , H. and Probst , W. G. 2001 . An artificial neural network approach for routing in distributed computer networks . Engineering Applications of Artificial Intelligence , 14 ( 1 ) : 51 – 60 .
   Web of Science ®Google Scholar