{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T08:33:07Z","timestamp":1723019587048},"reference-count":27,"publisher":"Wiley","issue":"14","license":[{"start":{"date-parts":[[2014,7,22]],"date-time":"2014-07-22T00:00:00Z","timestamp":1405987200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Communication"],"published-print":{"date-parts":[[2015,9,25]]},"abstract":"Summary<\/jats:title>A mobile ad hoc networks (MANET) is a decentralized, self\u2010organizing, infrastructure\u2010less network and adaptive gathering of independent mobile nodes. Because of the unique characteristics of MANET, the major issues to develop a routing protocol in MANET are the security aspect and the network performance. In this paper, we propose a new secure protocol called Trust Ad Hoc<\/jats:italic> On\u2010demand Distance Vector (AODV) using trust mechanism. Communication packets are only sent to the trusted neighbor nodes. Trust calculation is based on the behaviors and activities information of each node. It is divided in to trust global (TG) and trust local (TL). TG is a trust calculation based on the total of received routing packets and the total of sending routing packets. TL is a comparison between total received packets and total forwarded packets by neighbor node from specific nodes. Nodes conclude the total trust level of its neighbors by accumulating the TL and TG values. The performance of Trust AODV is evaluated under denial of service\/distributed denial of service (DOS\/DDOS) attack using network simulator NS\u20102. It is compared with the Trust Cross Layer Secure (TCLS) protocol. Simulation results show that the Trust AODV has a better performance than TCLS protocol in terms of end\u2010to\u2010end delay, packet delivery ratio, and overhead. Next, we improve the performance of Trust AODV using ant algorithm. The proposed protocol is called Trust AODV\u2009+\u2009Ant. The implementation of ant algorithm in the proposed secure protocol is by adding an ant agent to put the positive pheromone in the node if the node is trusted. Ant agent is represented as a routing packet. The pheromone value is saved in the routing table of the node. We modified the original routing table by adding the pheromone value field. The path communication is selected based on the pheromone concentration and the shortest path. Trust AODV\u2009+\u2009Ant is compared with simple ant routing algorithm (SARA), AODV, and Trust AODV under DOS\/DDOS attacks in terms of performance. Simulation results show that the packet delivery ratio and throughput of the Trust AODV increase after using ant algorithm. However, in terms of end\u2010to\u2010end delay, there is no significant improvement. Copyright \u00a9 2014 John Wiley & Sons, Ltd.<\/jats:p>","DOI":"10.1002\/dac.2837","type":"journal-article","created":{"date-parts":[[2014,7,22]],"date-time":"2014-07-22T06:33:06Z","timestamp":1406010786000},"page":"2003-2019","source":"Crossref","is-referenced-by-count":11,"title":["Security and performance enhancement of AODV routing protocol"],"prefix":"10.1002","volume":"28","author":[{"given":"Harris","family":"Simaremare","sequence":"first","affiliation":[{"name":"MIPS\u2010GRTC laboratory University of Haute Alsace Colmar France"},{"name":"Network laboratory, Department of Electrical Engineering Universitas Indonesia Depok Indonesia"}]},{"given":"Abdelhafid","family":"Abouaissa","sequence":"additional","affiliation":[{"name":"MIPS\u2010GRTC laboratory University of Haute Alsace Colmar France"}]},{"given":"Riri Fitri","family":"Sari","sequence":"additional","affiliation":[{"name":"Network laboratory, Department of Electrical Engineering Universitas Indonesia Depok Indonesia"}]},{"given":"Pascal","family":"Lorenz","sequence":"additional","affiliation":[{"name":"MIPS\u2010GRTC laboratory University of Haute Alsace Colmar France"}]}],"member":"311","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"key":"e_1_2_9_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/surv.2008.080407"},{"key":"e_1_2_9_3_1","unstructured":"MarneridesA.Working with the gridkit overlay framework the secure\u2010anthocnet overlay. PhD Thesis Lancaster University2007."},{"key":"e_1_2_9_4_1","unstructured":"YuX.A defense system on DDOS attacks in mobile ad hoc networks. PhD Thesis Auburn University Alabama2007."},{"key":"e_1_2_9_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/dac.1162"},{"key":"e_1_2_9_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2007.4396947"},{"key":"e_1_2_9_7_1","doi-asserted-by":"crossref","unstructured":"ThanigaivelG KumarN YogeshP.Truncman: trust based routing mechanism using non\u2010cooperative movement in mobile ad\u2010hoc network.Second International Conference on Digital Information and Communication Technology and it's Applications (DICTAP) 2012;261\u2013266 DOI:10.1109\/DICTAP.2012.6215430.","DOI":"10.1109\/DICTAP.2012.6215430"},{"key":"e_1_2_9_8_1","unstructured":"AhmedTHAENA.Modeling and simulation of a routing protocol for ad hoc networks combining queuing network analysis and ant colony algorithms. PhD Thesis University Duisburg\u2010Essen 2005."},{"key":"e_1_2_9_9_1","doi-asserted-by":"crossref","unstructured":"GunesM SorgesU BouaziziI.ARA\u2010the ant\u2010colony based routing algorithm for MANETs.Proceedings International Conference on Parallel Processing Workshops 2002;79\u201385 DOI:10.1109\/ICPPW.2002.1039715.","DOI":"10.1109\/ICPPW.2002.1039715"},{"key":"e_1_2_9_10_1","doi-asserted-by":"crossref","unstructured":"LiKH LeuJS HoekJ.Ant\u2010based on\u2010demand clustering routing protocol for mobile ad\u2010hoc networks.Seventh International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS) 2013;354\u2013359 DOI:10.1109\/IMIS.2013.66.","DOI":"10.1109\/IMIS.2013.66"},{"key":"e_1_2_9_11_1","unstructured":"OngDGC.Ant intelligence routing algorithm for mobile ad hoc networks. PhD Thesis Malaysia University of Science and Technology2004."},{"key":"e_1_2_9_12_1","doi-asserted-by":"crossref","unstructured":"LiX LyuM LiuJ.A trust model based routing protocol for secure ad hoc networks.Proceedings of the IEEE Aerospace Conference vol.2 2004;1286\u20131295 DOI:10.1109\/AERO.2004.1367726.","DOI":"10.1109\/AERO.2004.1367726"},{"key":"e_1_2_9_13_1","doi-asserted-by":"crossref","unstructured":"RazaI HussainS.A trust based security framework for pure AODV network. International Conference on Information and Emerging Technologies ICIET 2007;1\u20136 DOI:10.1109\/ICIET.2007.4381316.","DOI":"10.1109\/ICIET.2007.4381316"},{"key":"e_1_2_9_14_1","doi-asserted-by":"crossref","unstructured":"LiuZ LuS YanJ.Secure routing protocol based trust for ad hoc networks.Eighth ACIS International Conference on Software Engineering Artificial Intelligence Networking and Parallel\/Distributed Computing SNPD vol.1 2007;279\u2013283 DOI:10.1109\/SNPD.2007.138.","DOI":"10.1109\/SNPD.2007.138"},{"key":"e_1_2_9_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11599463_30"},{"key":"e_1_2_9_16_1","doi-asserted-by":"crossref","unstructured":"RajaramA PalaniswamiS.A trust based cross layer security protocol for mobile Ad hoc networks. ArXiv e\u2010prints Nov2009.","DOI":"10.1109\/WICOM.2010.5600904"},{"key":"e_1_2_9_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978\u20103\u2010540\u201085257\u20105_11"},{"key":"e_1_2_9_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978\u20103\u2010642\u201031513\u20108_78"},{"issue":"6","key":"e_1_2_9_19_1","article-title":"Trust based secure AODV in MANET","volume":"13","author":"Pankaj S","year":"2012","journal-title":"Journal of Global Research in Computer Science"},{"key":"e_1_2_9_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/dac.1296"},{"key":"e_1_2_9_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2010.03.024"},{"key":"e_1_2_9_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.168"},{"key":"e_1_2_9_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/dac.1323"},{"key":"e_1_2_9_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.948"},{"key":"e_1_2_9_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2008.2010049"},{"key":"e_1_2_9_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2010.03.003"},{"key":"e_1_2_9_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2012.07.018"},{"key":"e_1_2_9_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.07.062"}],"container-title":["International Journal of Communication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fdac.2837","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/dac.2837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T22:35:46Z","timestamp":1696631746000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/dac.2837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,22]]},"references-count":27,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2015,9,25]]}},"alternative-id":["10.1002\/dac.2837"],"URL":"https:\/\/doi.org\/10.1002\/dac.2837","archive":["Portico"],"relation":{},"ISSN":["1074-5351","1099-1131"],"issn-type":[{"value":"1074-5351","type":"print"},{"value":"1099-1131","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,22]]}}}