Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks

Mobile ad hoc networks (MANETs) are wireless networks that are subject to severe attacks, such as the black hole attack. One of the goals in the research is to find a method to prevent black hole attacks without decreasing network throughput or increasing routing overhead. The routing mechanism in...

Full description

Saved in:

Bibliographic Details
Main Author:	Ghathwan, Khalil Ibrahim
Format:	Thesis
Language:	eng eng
Published:	2016
Subjects:	QA Mathematics
Online Access:	https://etd.uum.edu.my/5777/1/depositpermission_93453.pdf https://etd.uum.edu.my/5777/2/s93453_01.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uum-etd.5777
record_format	uketd_dc
institution	Universiti Utara Malaysia
collection	UUM ETD
language	eng eng
advisor	Yaakub, Abdul Razak Budiarto, Rahmat
topic	QA Mathematics
spellingShingle	QA Mathematics Ghathwan, Khalil Ibrahim Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
description	Mobile ad hoc networks (MANETs) are wireless networks that are subject to severe attacks, such as the black hole attack. One of the goals in the research is to find a method to prevent black hole attacks without decreasing network throughput or increasing routing overhead. The routing mechanism in define uses route requests (RREQs; for discovering routes) and route replies (RREPs; for receiving paths). However, this mechanism is vulnerable to attacks by malicious black hole nodes. The mechanism is developed to find the shortest secure path and to reduce overhead using the information that is available in the routing tables as an input to propose a more complex nature-inspired algorithm. The new method is called the Daddy Long-Legs Algorithm (PGO-DLLA), which modifies the standard AODV and optimizes the routing process. This method avoids dependency exclusively on the hop counts and destination sequence numbers (DSNs) that are exploited by malicious nodes in the standard AODV protocol. The experiment by performance metrics End-to-End delay and packet delivery ratio are compared in order to determine the best effort traffic. The results showed the PGO-DLLA improvement of the shortest and secure routing from black hole attack in MANET. In addition, the results indicate better performance than the related works algorithm with respect to all metrics excluding throughput which AntNet is best in routing when the pause time be more than 40 seconds. PGODLLA is able to improve the route discovery against the black hole attacks in AODV. Experiments in this thesis have shown that PGO-DLLA is able to reduce the normalized routing load, end-to-end delay, and packet loss and has a good throughput and packet delivery ratio when compared with the standard AODV protocol, BAODV protocol, and the current related protocols that enhance the routing security of the AODV protocols.
format	Thesis
qualification_name	Ph.D.
qualification_level	Doctorate
author	Ghathwan, Khalil Ibrahim
author_facet	Ghathwan, Khalil Ibrahim
author_sort	Ghathwan, Khalil Ibrahim
title	Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
title_short	Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
title_full	Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
title_fullStr	Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
title_full_unstemmed	Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
title_sort	algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
granting_institution	Universiti Utara Malaysia
granting_department	Awang Had Salleh Graduate School of Arts & Sciences
publishDate	2016
url	https://etd.uum.edu.my/5777/1/depositpermission_93453.pdf https://etd.uum.edu.my/5777/2/s93453_01.pdf
_version_	1747827979829903360
spelling	my-uum-etd.57772021-04-05T02:21:26Z Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks 2016 Ghathwan, Khalil Ibrahim Yaakub, Abdul Razak Budiarto, Rahmat Awang Had Salleh Graduate School of Arts & Sciences Awang Had Salleh Graduate School of Arts and Sciences QA Mathematics Mobile ad hoc networks (MANETs) are wireless networks that are subject to severe attacks, such as the black hole attack. One of the goals in the research is to find a method to prevent black hole attacks without decreasing network throughput or increasing routing overhead. The routing mechanism in define uses route requests (RREQs; for discovering routes) and route replies (RREPs; for receiving paths). However, this mechanism is vulnerable to attacks by malicious black hole nodes. The mechanism is developed to find the shortest secure path and to reduce overhead using the information that is available in the routing tables as an input to propose a more complex nature-inspired algorithm. The new method is called the Daddy Long-Legs Algorithm (PGO-DLLA), which modifies the standard AODV and optimizes the routing process. This method avoids dependency exclusively on the hop counts and destination sequence numbers (DSNs) that are exploited by malicious nodes in the standard AODV protocol. The experiment by performance metrics End-to-End delay and packet delivery ratio are compared in order to determine the best effort traffic. The results showed the PGO-DLLA improvement of the shortest and secure routing from black hole attack in MANET. In addition, the results indicate better performance than the related works algorithm with respect to all metrics excluding throughput which AntNet is best in routing when the pause time be more than 40 seconds. PGODLLA is able to improve the route discovery against the black hole attacks in AODV. Experiments in this thesis have shown that PGO-DLLA is able to reduce the normalized routing load, end-to-end delay, and packet loss and has a good throughput and packet delivery ratio when compared with the standard AODV protocol, BAODV protocol, and the current related protocols that enhance the routing security of the AODV protocols. 2016 Thesis https://etd.uum.edu.my/5777/ https://etd.uum.edu.my/5777/1/depositpermission_93453.pdf text eng public https://etd.uum.edu.my/5777/2/s93453_01.pdf text eng public Ph.D. doctoral Universiti Utara Malaysia [1] J. Zutt, A. J. C. van Gemund, M. M. de Weerdt, and C. Witteveen, “Dealing with Uncertainty in Operational Transport Planning,” in Intelligent Infrastructures, vol. 42, R. R. Negenborn, Z. Lukszo, and H. Hellendoorn, Eds. Springer, 2010, pp. 355–382. [2] L. Tamilselvan and V. Sankaranarayanan, “Prevention of Co-operative Black Hole Attack in MANET,” J. Networks, vol. 3, no. 5, pp. 13–20, May 2008. [3] D. Medhi and K. Ramasamy, Network Routing Algorithms, Protocols, and Architectures. Morgan Kaufmann Publishers is an imprint of Elsevier, 2010, p. 848. [4] S. Agrawal, S. Jain, and S. Sharma, “A Survey of Routing Attacks and Security Measures in Mobile Ad-hoc Networks,” arXiv Prepr. arXiv1105.5623, 2011. [5] C. Perkins, Elding-Royer, and S. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” IETF RFC 3561, pp. 1–37, 2003. [6] C. Perkins, E. Royer, S. R. Das, and M. K. Marina, “Performance Comparison of Two On-demand Routing Protocols for Ad hoc Networks,” IEEE Pers. Commun., vol. 8, no. 1, pp. 16–28, 2001. [7] D. B. Johnson and D. A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks. Springer, 1996, pp. 153–181. [8] L. Zhou and Z. J. Haas, “Securing Ad Hoc Networks,” Network, IEEE, vol. 13, no. 6, pp. 24–30, 1999. [9] C.-K. Toh, “Associativity-based Routing for Ad Hoc Mobile Networks,” Wirel. Pers. Commun., vol. 4, no. 2, pp. 103–139, 1997. [10] V. D. Park and M. S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” in INFOCOM’97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution., Proceedings IEEE, 1997, vol. 3, pp. 1405–1413. [11] I. Chakeres and C. Perkins, “Dynamic MANET On-demand (DYMO) Routing,” Draft. (work progress), 2008. [12] E. M. Royer and C.-K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks,” Pers. Commun. IEEE, vol. 6, no. 2, pp. 46–55, 1999. [13] S.-J. Lee, M. Gerla, and C.-K. Toh, “A Simulation Study of Table-driven and Ondemand Routing Protocols for Mobile Ad Hoc Networks,” Network, IEEE, vol. 13, no. 4, pp. 48–54, 1999. [14] K. Akkaya and M. Younis, “A Survey on Routing Protocols for Wireless Sensor Networks,” Ad hoc networks, Elsevier, vol. 3, no. 3, pp. 1–38, 2010. [15] C. E. Perkins and P. Bhagwat, “Highly Dynamic Destination-sequenced Distancevector Routing (DSDV) for Mobile Computers,” in Proc. ACM Conference on Communications Architectures, Protocols and Applications (SIGCOMM'94), 1994, vol. 24, no. 4, pp. 234–244. [16] T. Clausen, G. Hansen, L. Christensen, and G. Behrmann, “The Optimized Link State Routing Protocol, Evaluation Through Experiments and Simulation,” in IEEE Symposium on" Wireless Personal Mobile Communications, 2001. [17] S. Murthy and J. J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks,” Mob. Networks Appl. Springer, vol. 1, no. 2, pp. 183–197, 1996. [18] C.-C. Chiang, H.-K. Wu, W. Liu, and M. Gerla, “Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel,” in proceedings of IEEE SICON, 1997, vol. 97, no. 1997.4, pp. 197–211. [19] M. Abolhasan, T. Wysocki, and E. Dutkiewicz, “A Review of Routing Protocols for Mobile Ad Hoc Networks,” Ad hoc networks, Elsevier, vol. 2, no. 1, pp. 1–22, 2004. [20] Z. J. Haas, M. R. Pearlman, and P. Samar, “The Zone Routing Protocol (ZRP) for Ad Hoc Networks,” Draft. txt, 2002. [21] R. Sivakumar, P. Sinha, and V. Bharghavan, “CEDAR: A Core-extraction Distributed Ad Hoc Routing Algorithm,” Sel. Areas Commun. IEEE J., vol. 17, no. 8, pp. 1454–1465, 1999. [22] T. Hamma, T. Katoh, B. B. Bista, and T. Takata, “An Efficient Zhls Routing Protocol for Mobile Ad Hoc Networks,” in Database and Expert Systems Applications, 2006. DEXA’06. 17th International Workshop on, 2006, pp. 66–70. [23] H. Weerasinghe and H. Fu, “Preventing Cooperative Black Hole Attacks in Mobile Ad Hoc Networks: Simulation Implementation and Evaluation,” in Future Generation Communication and Networking (FGCN 2007), 2007, vol. 2, pp. 362–367. [24] C. S. R. Murthy and B. S. Manoj, Ad Hoc Wireless Networks Architectures and Protocols. Prentice Hall, 2004. [25] H. Deng, W. Li, and D. P. Agrawal, “Routing Security in Wireless Ad Hoc Networks,” Commun. Mag. IEEE, vol. 40, no. 10, pp. 70–75, 2002. [26] M. Ilyas and R. C. Dorf, Eds., The Handbook of Ad Hoc Wireless Networks. Boca Raton, FL, USA: CRC Press, Inc., 2003. [27] B. Kannhavong, H. Nakayama, Y. Nemoto, N. Kato, and A. Jamalipour, “A Survey of Routing Attacks in Mobile Ad Hoc Networks,” IEEE Wirel. Commun., vol. 14, no. 5, pp. 85–91, 2007. [28] B. Wu, J. Chen, J. Wu, and M. Cardei, “A Survey of Attacks and Countermeasures in Mobile Ad Hoc Networks,” in Wireless Network Security, Springer, 2007, pp. 103–135. [29] Y.-R. Tsai and S.-J. Wang, “Two-tier Authentication for Cluster and Individual Sets in Mobile Ad Hoc Networks,” Comput. Network, Elsevier North-Holland, Inc., vol. 51, no. 3, pp. 883–900, 2007. [30] P. Narula, S. K. Dhurandher, S. Misra, and I. Woungang, “Security in Mobile Ad-hoc Networks Using Soft Encryption and Trust-based Multi-path Routing,” Comput. Commun., Elsevier Sci. Publ. B. V., vol. 31, no. 4, pp. 760–769, 2008. [31] Y. Liang, H. V. Poor, and L. Ying, “Secrecy Throughput of MANETs Under Passive and Active Attacks,” Inf. Theory, IEEE Trans., vol. 57, no. 10, pp. 6692–6702, 2011. [32] X. Wang, Ed., Mobile Ad-Hoc Networks: Applications. InTech, 2011. [33] D. Glynos, P. Kotzanikolaou, and C. Douligeris, “Preventing Impersonation Attacks in MANET with Multi-factor Authentication,” in Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2005. WIOPT 2005. Third International Symposium on, 2005, pp. 59–64. [34] S. Misra, I. Woungang, and S. C. Misra, Guide to Wireless Ad hoc Networks. Springer, 2009. [35] A. K. Rai, R. R. Tewari, and S. K. Upadhyay, “Different Types of Attacks on Integrated MANET-Internet Communication,” Int. J. Comput. Sci. Secur., vol. 4, no. 3, pp. 265–274, 2010. [36] Y. Desmedt, “Man-in-the-middle attack,” in Encyclopedia of Cryptography and Security, Springer, 2011, p. 759. [37] M.-Y. Su, “Prevention of Selective Black Hole Attacks on Mobile Ad Hoc Networks Through Intrusion Detection Systems,” Comput. Commun. Elsevier B.V., vol. 34, no. 1, pp. 107–117, 2011. [38] S. Tan and K. Kim, “Secure Route Discovery for Preventing Black Hole Attacks on AODV-based MANETs,” in Proceedings - 2013 IEEE International Conference on High Performance Computing and Communications, HPCC 2013 and 2013 IEEE International Conference on Embedded and Ubiquitous Computing, EUC 2013, 2014, pp. 1159–1164. [39] Z. Xu, S. Dai, and J. J. Garcia-Luna-Aceves, “A More Efficient Distance Vector Routing Algorithm,” in MILCOM 97 Proceedings, 1997, vol. 2, pp. 993–997. [40] R. V Boppana and S. P. Konduru, “An Adaptive Distance Vector Routing Algorithm for Mobile Ad Hoc Networks,” in INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, 2001, vol. 3, pp. 1753–1762. [41] F.-H. Tseng, L.-D. Chou, and H.-C. Chao, “A Survey of Black Hole Attacks in Wireless Mobile Ad Hoc Networks,” Human-centric Comput. Inf. Sci. Springer Open Ltd, vol. 1, no. 1, p. 4, 2011. [42] H. Nakayama and S. Kurosawa, “A Dynamic Anomaly Detection Scheme for AODVbased Mobile Ad Hoc Networks,” IEEE Trans. Veh. Technol., vol. 58, no. 5, pp. 2471–2481, 2009. [43] S. Kurosawa, H. Nakayama, and N. Kato, “Detecting Blackhole Attack on AODVbased Mobile Ad Hoc Networks by Dynamic Learning Method.,” Int. J. Netw. Secur., vol. 5, no. 3, pp. 338–346, 2007. [44] X. Zhang, Y. Sekiya, and Y. Wakahara, “Proposal of a Method to Detect Black Hole Attack in MANET,” in Proceedings - 2009 International Symposium on Autonomous Decentralized Systems, ISADS 2009, 2009, pp. 149–154. [45] Y. Zhang and W. Lee, “Intrusion Detection in Wireless Ad-hoc Networks,” in Proceedings of the 6th annual international conference on Mobile computing and networking - MobiCom ’00, 2000, pp. 275–283. [46] K. Sanzgiri, B. Dahill, B. N. Levine, C. Shields, and E. M. Belding-Royer, “A Secure Routing Protocol for Ad Hoc Networks,” in 10th IEEE International Conference on Network Protocols, 2002. Proceedings., 2002, pp. 78–87. [47] S. Yi, P. Naldurg, and R. Kravets, “A Security-aware Routing Protocol for Wireless Ad Hoc Networks,” Urbana, vol. 51, p. 61801, 2002. [48] H. S. Jassim, S. Yussof, T. S. Kiong, S. P. Koh, and R. Ismail, “A Routing Protocol based on Trusted and shortest Path selection for Mobile Ad hoc Network,” in Communications (MICC), 2009 IEEE 9th Malaysia International Conference on, 2009, pp. 547–554. [49] A. Sherif, M. Elsabrouty, and A. Shoukry, “A Novel Taxonomy of Black-Hole Attack Detection Techniques in Mobile Ad-hoc Network (MANET),” in 2013 IEEE 16th International Conference on Computational Science and Engineering, 2013, pp. 346–352. [50] S. K. Tiong and H. S. Jassim, “EMNet: Electromagnetic-like Mechanism Based Routing Protocol for Mobile Ad Hoc Network,” Trendas Appl. Sci. Res., vol. 7, no. 11, pp. 881–900, Nov. 2012. [51] G. F. Luger, Artificial Intelligence: Structures and Strategies for Complex Problem Solving. Pearson education, 2005. [52] S. Russell and P. Norvig, A Modern Approach, vol. 25. Englewood Cliffs, New Jersey: Alan Apt, 1995. [53] R. W. Floyd, “Algorithm 97: Shortest Path,” Commun. ACM, vol. 5, no. 6, p. 345, 1962. [54] A. Singh, C. R. Ramakrishnan, and S. A. Smolka, “A Process Calculus for Mobile Ad Hoc Networks,” Sci. Comput. Program. Elsevier, vol. 75, no. 6, pp. 440–469, 2010. [55] H. Yang, H. Luo, F. Ye, S. Lu, and L. Zhang, “Security in Mobile Ad Hoc Networks: Challenges and Solutions,” Wirel. Commun. IEEE, vol. 11, no. 1, pp. 38–47, 2004. [56] P. Papadimitratos and Z. J. Haas, “Secure Routing for Mobile Ad Hoc Networks,” in Proceedings of the SCS Commnication Networks and Distributed Systems Modeling and Simulation Conference (CNDS), 2002, pp. 193–204. [57] D. W. Carman, P. S. Kruus, and B. J. Matt, “Constraints and Approaches for Distributed Sensor Network Security,” DARPA Proj. report,(Cryptographic Technol. Group, Trust. Inf. Syst. NAI Labs), vol. 1, p. 1, 2000. [58] K. Lakshmi, S. Manju Priya, A. Jeevarathinam, K. Rama, and K. Thilagam, “Modified AODV Protocol Against Blackhole Attacks in MANET,” Int. J. Eng. Technol., vol. 2, no. 6, pp. 444–449, 2010. [59] H. Xiao, W. K. G. Seah, A. Lo, and K. C. Chua, “A Flexible Quality of Service Model for Mobile Ad-hoc Networks,” in Vehicular Technology Conference Proceedings, 2000. VTC 2000-Spring Tokyo. 2000 IEEE 51st, 2000, vol. 1, pp. 445–449. [60] B. Sun, L. Osborne, Y. Xiao, and S. Guizani, “Intrusion Detection Techniques in Mobile Ad Hoc and Wireless Sensor Networks,” Wirel. Commun. IEEE, vol. 14, no. 5, pp. 56–63, 2007. [61] D.-Z. Du Yang Xiao, Xuemin (Sherman) Shen, Wireless Network Security. Boston, MA: Springer US, 2007. [62] W. Lou, W. Liu, and Y. Fang, “SPREAD: Enhancing Data Confidentiality in Mobile Ad Hoc Networks,” in INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, 2004, vol. 4, pp. 2404–2413. [63] K. S. Ng and W. K. G. Seah, “Routing Security and Data Confidentiality for Mobile Ad Hoc Networks,” in Vehicular Technology Conference, 2003. VTC 2003-Spring. The 57th IEEE Semiannual, 2003, vol. 3, pp. 1821–1825. [64] A.-S. K. Pathan, Security of Self-organizing Networks: MANET, WSN, WMN, VANET. CRC press, 2010. [65] V. R. Ghorpade, Y. V Joshi, and R. R. Manthalkar, “Efficient Public Key Authentication in MANET,” in Proceedings of the International Conference on Advances in Computing, Communication and Control, 2009, pp. 106–112. [66] T. R. Andel and A. Yasinsac, “On the Credibility of MANET Simulations,” Comput. IEEE Comput. Soc., vol. 39, no. 7, pp. 48–54, 2006. [67] R. B. Bobba, L. Eschenauer, V. Gligor, and W. Arbaugh, “Bootstrapping Security Associations for Routing in Mobile Ad-hoc Networks,” in Global Telecommunications Conference, 2003. GLOBECOM’03. IEEE, 2003, vol. 3, pp. 1511–1515. [68] M. G. Zapata, “Secure Ad Hoc On-demand Distance Vector Routing,” ACM SIGMOBILE Mob. Comput. Commun. Rev., vol. 6, no. 3, pp. 106–107, 2002. [69] G. Vigna, S. Gwalani, K. Srinivasan, E. M. Belding-Royer, and R. A. Kemmerer, “An Intrusion Detection Tool for AODV-Based Ad Hoc Wireless Networks,” in Computer Security Applications Conference, 2004. 20th Annual, 2004, pp. 16–27. [70] J.-M. Kim and J.-W. Jang, “AODV Based Energy Efficient Routing Protocol for Maximum Lifetime in MANET,” in Telecommunications, 2006. AICT-ICIW’06. International Conference on Internet and Web Applications and Services/Advanced International Conference on, 2006, p. 77. [71] T. Hara, “Quantifying Impact of Mobility on Data Availability in Mobile Ad Hoc Networks,” Mob. Comput. IEEE Trans., vol. 9, no. 2, pp. 241–258, 2010. [72] S. Kumar, V. S. Raghavan, and J. Deng, “Medium Access Control Protocols for Ad Hoc Wireless Networks: A Survey,” Ad hoc networks, Elsevier, vol. 4, no. 3, pp. 326–358, 2006. [73] S.-L. Wu, Y.-C. Tseng, and J.-P. Sheu, “Intelligent Medium Access for Mobile Ad Hoc Networks with Busy Tones and Power Control,” Sel. Areas Commun. IEEE J., vol. 18, no. 9, pp. 1647–1657, 2000. [74] P. M. Jawandhiya, M. M. Ghonge, M. S. Ali, and J. S. Deshpande, “A Survey of Mobile Ad Hoc Network Attacks,” Int. J. Eng. Sci. Technol., vol. 2, no. 9, pp. 4063–4071, 2010. [75] A. Mishra, K. Nadkarni, and A. Patcha, “Intrusion Detection in Wireless Ad Hoc Networks,” Wirel. Commun. IEEE, vol. 11, no. 1, pp. 48–60, 2004. [76] Y. Xiao, X. S. Shen, and D.-Z. Du, Eds., Wireless Network Security. Boston, MA: Springer US, 2007. [77] C. Perkins and E. Royer, “Ad-hoc On-demand Distance Vector Routing,” in Proceedings WMCSA’99. Second IEEE Workshop on Mobile Computing Systems and Applications, 1999, pp. 90–100. [78] W. Kozma and L. Lazos, “REAct: Resource-efficient Accountability for Node Misbehavior in Ad Hoc Networks Based on Random Audits,” in Proceedings of the second ACM conference on Wireless network security, 2009, pp. 103–110. [79] K. Chadha and S. Jain, “Impact of Black Hole and Gray Hole Attack in AODV Protocol,” in International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014), 2014, pp. 1–7. [80] Y.-C. Hu, A. Perrig, and D. B. Johnson, “Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks,” Wirel. networks, Springer-Verlag New York, Inc., vol. 11, no. 1–2, pp. 21–38, Jan. 2005. [81] X. Zeng, R. Bagrodia, and M. Gerla, “GloMoSim: A Library for Parallel Simulation of Large-scale Wireless Networks,” in Parallel and Distributed Simulation, 1998. PADS 98. Proceedings. Twelfth Workshop on, 1998, pp. 154–161. [82] H. W. Hesiri Weerasinghe and H. F. Huirong Fu, “Preventing Cooperative Black Hole Attacks in Mobile Ad Hoc Networks: Simulation Implementation and Evaluation,” Int. J. Softw. Eng. its Appl., vol. 2, no. 3, pp. 39–54, 2008. [83] G. Wahane, A. M. Kanthe, and D. Simunic, “Technique for Detection of Cooperative Black Hole Attack Using True-link in Mobile Ad-hoc Networks,” in Information and Communication Technology, Electronics and Microelectronics (MIPRO), 2014 37th International Convention on, 2014, pp. 1428–1434. [84] R. Yerneni and A. K. Sarje, “Enhancing Performance of AODV Against Black Hole Attack,” in Proceedings of the CUBE International Information Technology Conference, 2012, pp. 857–862. [85] N. Sharma and A. Sharma, “The Black-hole Node Attack in MANET,” in Advanced Computing & Communication Technologies (ACCT), 2012 Second International Conference on, 2012, pp. 546–550. [86] S. Lu, L. Li, K.-Y. Lam, and L. Jia, “SAODV: A MANET Routing Protocol that can Withstand Black Hole Attack,” in 2009 International Conference on Computational Intelligence and Security, 2009, vol. 2, pp. 421–425. [87] K. S. Sujatha, V. Dharmar, and R. S. Bhuvaneswaran, “Design of Genetic Algorithm Based IDS for MANET,” in Recent Trends In Information Technology (ICRTIT), 2012 International Conference on, 2012, pp. 28–33. [88] Kulbhushan and J. Singh, “Fuzzy Logic Based Intrusion Detection System against Blackhole Attack on AODV in MANET,” IJCA Spec. Issue Netw. Secur. Cryptogr., no. 2, pp. 28–35, 2011. [89] G. Indirani and K. Selvakumar, “Swarm based Intrusion Detection and Defense Technique for Malicious Attacks in Mobile Ad Hoc Networks,” Int. J. Comput. Appl., vol. 50, no. 19, pp. 1–7, 2012. [90] M. Dorigo and L. M. Gambardella, “Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem,” Evol. Comput. IEEE Trans., vol. 1, no. 1, pp. 53–66, 1997. [91] W. Wang, B. Bhargava, and M. Linderman, “Defending Against Collaborative Packet Drop Attacks on MANETs,” in 2nd International Workshop on Dependable Network Computing and Mobile Systems (DNCMS 2009)(in Conjunction with IEEE SRDS 2009), New York, USA, 2009, vol. 27. [92] K. Vishnu and A. J. Paul, “Detection and Removal of Cooperative Black/Gray hole attack in Mobile AdHoc Networks,” Int. J. Comput. Appl., vol. 1, no. 22, pp. 40–44, 2010. [93] J. Kennedy and R. Eberhart, “Particle Swarm Optimization,” Proc. ICNN’95 - Int. Conf. Neural Networks, vol. 4, pp. 1942–1948, 1995. [94] A. Chatterjee, K. Pulasinghe, K. Watanabe, and K. Izumi, “A Particle-swarmoptimized Fuzzy-neural Network for Voice-controlled Robot Systems,” IEEE Trans. Ind. Electron., vol. 52, no. 6, pp. 1478–1489, 2005. [95] K. Manikantan, A. B. V, and D. K. S. Yaradoni, “Optimal Multilevel Thresholds based on Tsallis Entropy Method using Golden Ratio Particle Swarm Optimization for Improved Image Segmentation,” Procedia Eng. Elsevier, vol. 30, pp. 364–371, Jan. 2012. [96] F. Zhao, J. Tang, J. Wang, and Jonrinaldi, “An Improved Particle Swarm Optimization with Decline Disturbance Index (DDPSO) for Multi-objective Job-shop Scheduling Problem,” Comput. Oper. Res. Elsevier, vol. 45, pp. 38–50, 2014. [97] Y. G. Petalas, K. E. Parsopoulos, and M. N. Vrahatis, “Improving Fuzzy Cognitive Maps Learning Through Memetic Particle Swarm Optimization,” Soft Comput. Springer, vol. 13, no. 1, pp. 77–94, 2009. [98] X. Li, J. Branke, and T. Blackwell, “Particle Swarm with Speciation and Adaptation in a Dynamic Environment,” in Proceedings of the 8th annual conference on Genetic and evolutionary computation - GECCO ’06, ACM Press, 2006, p. 51. [99] W. Jatmiko, K. Sekiyama, and T. Fukuda, “A PSO-based Mobile Robot for Odor Source Localization in Dynamic Advection-diffusion with Obstacles Environment: Theory, Simulation and Measurement,” Comput. Intell. Mag. IEEE, vol. 2, no. 2, pp. 37–51, 2007. [100] Q. Bai, “Analysis of Particle Swarm Optimization Algorithm,” Comput. Inf. Sci., vol. 3, no. 1, pp. 180–184, 2010. [101] Y.-C. Wu, W.-P. Lee, C.-W. Chien, and others, “Modified the Performance of Differential Evolution Algorithm with Dual Evolution Strategy,” in International Conference on Machine Learning and Computing, IPCSIT, 2011, vol. 3, pp. 57–63. [102] R. Storn and K. Price, “Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces,” J. Glob. Optim. Springer Kluwer Acad. Publ., vol. 11, no. 4, pp. 341–359, 1997. [103] S. Das and A. Konar, “Automatic Image Pixel Clustering with an Improved Differential Evolution,” Appl. Soft Comput. Elsevier, vol. 9, no. 1, pp. 226–236, 2009. [104] C. Erbao and L. Mingyong, “A Hybrid Differential Evolution Algorithm to Vehicle Routing Problem with Fuzzy Demands,” J. Comput. Appl. Math. Elsevier B.V, vol. 231, no. 1, pp. 302–310, 2009. [105] U. Maulik and I. Saha, “Modified Differential Evolution Based Fuzzy Clustering for Pixel Classification in Remote Sensing Imagery,” Pattern Recognition, Elsevier Sci. Inc., vol. 42, no. 9, pp. 2135–2149, 2009. [106] X. Yang, Nature-Inspired Metaheuristic Algorithms Second Edition. Luniver Press, 2010, p. 115. [107] X. S. Yang, “A New Metaheuristic Bat-inspired Algorithm: Nature Inspired Cooperative Strategies for Optimization,” in NICSO 2010, Springer, 2010, pp. 65–74. [108] X. S. Yang and X. He, “Bat Algorithm: Literature Review and Applications,” Int. J. Bio-Inspired Comput., vol. 5, no. 3, p. 141, 2013. [109] E. Cuevas and M. Cienfuegos, “A New Algorithm Inspired in the Behavior of the Social-Spider for Constrained Optimization,” Expert Syst. with Appl. Elsevier Ltd, vol. 41, no. 2, pp. 412–425, 2014. [110] I. Fister, D. Fister, and X.-S. Yang, “A Hybrid Bat Algorithm,” Electrotech. Rev. ArXiv, vol. 80, no. 1–2, pp. 1–7, 2013. [111] S. Marwaha, C. K. Tham, and D. Srinivasan, “Mobile Agents Based Routing Protocol for Mobile Ad Hoc Networks,” in Global Telecommunications Conference, 2002. GLOBECOM’02. IEEE, 2002, vol. 1, pp. 163–167. [112] D. Câmara and A. A. F. Loureiro, “A Novel Routing Algorithm for Ad Hoc Networks,” in System Sciences, 2000. Proceedings of the 33rd Annual Hawaii International Conference on, 2000, p. 8–pp. [113] N. Mazhar and M. Farooq, “Vulnerability Analysis and Security Framework (BeeSec) for Nature Inspired MANET Routing Protocols,” in Proceedings of the 9th annual conference on Genetic and evolutionary computation, 2007, pp. 102–109. [114] N. Mazhar and M. Farooq, “BeeAIS: Artificial Immune System Security for Nature Inspired, MANET Routing Protocol, BeeAdHoc,” in Artificial Immune Systems, Springer, 2007, pp. 370–381. [115] L. T. M. Blessing and A. Chakrabarti, DRM, a Design Research Methodology. London: Springer London, 2009. [116] S. Edelkamp and S. Schroedl, Heuristic Search: Theory and Applications. Elsevier Inc, 2012. [117] K. Herrmann and M. A. Jaeger, “PayFlux - Secure Electronic Payment in Mobile Ad Hoc Networks,” J. Lopez, S. Qing, and E. Okamoto, Eds. Springer Berlin Heidelberg, 2004, pp. 66–78. [118] R. Baumann, S. Heimlicher, M. Strasser, and A. Weibel, “A Survey on Routing Metrics,” TIK Rep., vol. 262, 2007. [119] S. R. Das, R. Castaneda, J. Y. J. Yan, and R. Sengupta, “Comparative Performance Evaluation of Routing Protocols for Mobile Ad Hoc Networks,” Proc. 7th Int. Conf. Comput. Commun. Networks (Cat. No.98EX226), pp. 153–161, 1998. [120] S. Corson and J. Macker, “Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations", RFC 2501,” 1999. [121] N. A. Husieen, “A Reliable Multipath Dynamic Source Routing Protocol for Multimedia Applications in Mobile Ad-hoc Networks,” PhD Thesis, Universiti Utara Malaysia, 2013. [122] S. M. Abdule, “Predictive Divert Failure Route Protocol For Mobile Ad-hoc Networks Based on Ad-hoc On Demand Distance Vector,” PhD Thesis, Universiti Utara Malaysia, 2012. [123] H. Simaremare and R. Sari, “Performance Evaluation of AODV variants on DDOS, Blackhole and Malicious attacks,” Int. J. Comput. Sci. Netowrk Secur., vol. 11, no. 6, pp. 277–287, 2011. [124] C. Grosan and A. Abraham, Intelligent Systems, vol. 17. Springer Berlin Heidelberg, 2011, pp. 131–147. [125] W.-K. Chen, Theory of nets: Flows in networks. Wiley-Interscience, 1990, p. 493. [126] A. E. Wignall and M. E. Herberstein, “Male Courtship Vibrations Delay Predatory Behaviour in Female Spiders.,” Sci. Rep., vol. 3, p. 3557, 2013. [127] E. Bechinski, D. Schotzko, and C. Baird, “Homeowner Guide to Spiders Around the Home and Yard,” 2010. [128] J. Kennedy and R. Mendes, “Population Structure and Particle Swarm Performance,” in Proceedings of the 2002 Congress on Evolutionary Computation CEC ’02, IEEE, 2002, vol. 2, pp. 1671–1676. [129] C. Grosan, A. Abraham, and M. Chis, Swarm Intelligence in Data Mining. Springer Berlin Heidelberg, 2006. [130] M. Jamil and X. S. Yang, “A Literature Survey of Benchmark Functions for Global Optimisation Problems,” Int. J. Math. Model. Numer. Optimisation, Inderscience Publ. Ltd, vol. 4, no. 2, p. 150, 2013. [131] X.-S. Yang, Nature-Inspired Optimization Algorithms. Elsevier, 2014. [132] R. Mitchell and I.-R. Chen, “A Survey of Intrusion Detection in Wireless Network Applications,” Comput. Commun. Elsevier B.V., vol. 42, pp. 1–23, 2014. [133] S. Horibe, “Robert Hooke, Hooke’s Law & the Watch Spring,” 2011. [134] M. H. Niemz, Laser-Tissue Interactions. Springer Berlin Heidelberg, 2007, p. 218. [135] G. L. Lucas, F. W. Cooke, and E. A. Friis, A Primer of Biomechanics. New York, NY: Springer New York, 1999. [136] K. Fall and K. Varadhan, “The Network Simulator (NS-2),” URL http//www.isi.edu/nsnam/ns, 2007. [137] T. Issariyaku and E. Hossain, Introduction to Network Simulator NS2. 2009. Springer. [138] G. Di Caro and M. Dorigo, “AntNet: Distributed Stigmergetic Control for Communications Networks,” J. Artif. Intell. Res., vol. 9, pp. 317–365, 1998. [139] H. Huang, H.-B. Xie, J.-Y. Guo, and H.-J. Chen, “Ant Colony Optimization-based Feature Selection Method for Surface Electromyography Signals Classification,” Comput. Biol. Med. Elsevier, vol. 42, no. 1, pp. 30–8, 2012. [140] C. Sarr and I. Guérin-Lassous, “Estimating Average End-to-End Delays in IEEE 802.11 Multihop Wireless Networks,” INRIA TR, 2007. [141] P. Li, Y. Fang, and J. Li, “Throughput, Delay, and Mobility in Wireless Ad Hoc Networks,” in 2010 Proceedings IEEE INFOCOM, 2010, no. 1, pp. 1–9. [142] T. Issariyakul and E. Hossain, Introduction to Network Simulator NS2. Springer US, 2009.

Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks

Similar Items