{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:35:19Z","timestamp":1761863719069,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,3,11]],"date-time":"2017-03-11T00:00:00Z","timestamp":1489190400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s11276-017-1485-2","type":"journal-article","created":{"date-parts":[[2017,3,11]],"date-time":"2017-03-11T10:49:07Z","timestamp":1489229347000},"page":"2509-2519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["AODVCS, a new bio-inspired routing protocol based on cuckoo search algorithm for mobile ad hoc networks"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8868-8986","authenticated-orcid":false,"given":"Akram","family":"Kout","sequence":"first","affiliation":[]},{"given":"Said","family":"Labed","sequence":"additional","affiliation":[]},{"given":"Salim","family":"Chikhi","sequence":"additional","affiliation":[]},{"given":"El Bay","family":"Bourennane","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,11]]},"reference":[{"issue":"9","key":"1485_CR1","first-page":"954","volume":"3","author":"M Dash","year":"2014","unstructured":"Dash, M., & Balabantaray, M. (2014). Routing problem: MANET and ant colony algorithm. International Journal of Research in Computer and Communication Technology, 3(9), 954\u2013960.","journal-title":"International Journal of Research in Computer and Communication Technology"},{"key":"1485_CR2","doi-asserted-by":"crossref","unstructured":"Perkins, C., & Watson, T. (1994). Highly dynamic destination sequenced distance vector routing (DSDV) for mobile computers. In ACM SIGCOMM conference on communications architectures.","DOI":"10.1145\/190809.190336"},{"key":"1485_CR3","doi-asserted-by":"crossref","unstructured":"Jacquet, P., Muhlethaler, P., Clausen, T., Laouiti, A., Qayyum, A., & Viennot, L. (2001). Optimized link state routing protocol for ad hoc networks. In IEEE international multi topic conference\u00a0(INMIC) (pp. 62\u201368).","DOI":"10.1109\/INMIC.2001.995315"},{"key":"1485_CR4","doi-asserted-by":"crossref","unstructured":"Perkins, C., & Royer, E. (1999). Ad-hoc on-demand distance vector routing. In Proceeding of WMCSA (pp. 90\u2013100).","DOI":"10.1109\/MCSA.1999.749281"},{"key":"1485_CR5","doi-asserted-by":"crossref","unstructured":"Johnson, D. B., & Maltz, D. A. (1996). Dynamic source routing in ad hoc wireless networks. In Tomasz Imielinski (Ed.), The Kluwer International Series in Engineering and Computer Science, Series Vol. 353 of Mobile Computing (pp. 153\u2013181), Springer.","DOI":"10.1007\/978-0-585-29603-6_5"},{"key":"1485_CR6","unstructured":"Hass, Z., & Pearlman, R. (2002). Zone routing protocol for ad-hoc networks. IETF MANET, draft-ietf-manet-zone-zrp-04.txt."},{"key":"1485_CR7","unstructured":"Di Caro, G., Ducatelle, F., & Gambardella, L. M. (2004). AntHocNet: an ant-based hybrid routing algorithm for mobile adhoc networks. In Proceedings of parallel problem solving from nature (PPSNVIII), Series Vol. 3242 of LNCS (pp. 461\u2013470) Springer."},{"key":"1485_CR8","doi-asserted-by":"crossref","unstructured":"Yang, X., & Deb, S. (2009). Cuckoo search via L\u00e9vy flights. In Nature & biologically inspired computing\u00a0NaBIC\u20192009 (pp. 210\u2013214), Coimbatore.","DOI":"10.1109\/NABIC.2009.5393690"},{"issue":"2","key":"1485_CR9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.5573\/IEIESPC.2015.4.2.115","volume":"4","author":"SJ Chandra","year":"2015","unstructured":"Chandra, S. J., & Sivarama, P. R. (2015). Trust predicated routing framework with optimized cluster head selection using cuckoo search algorithm for MANET. IEIE Transactions on Smart Processing and Computing, 4(2), 115-125.","journal-title":"IEIE Transactions on Smart Processing and Computing"},{"issue":"8","key":"1485_CR10","first-page":"236","volume":"2","author":"J Kaur","year":"2014","unstructured":"Kaur, J., & Kaur, G. R. (2014). Performance analysis of AODV and DYMO routing protocols in MANETs using cuckoo search optimization. International Journal of Advance Research in Computer Science and Management Studies, 2(8), 236\u2013247.","journal-title":"International Journal of Advance Research in Computer Science and Management Studies"},{"issue":"2","key":"1485_CR11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.5121\/ijitmc.2013.1205","volume":"1","author":"AK Gupta","year":"2013","unstructured":"Gupta, A. K., Sadawarti, H., & Verma, A. K. (2013). Implementation of DYMO routing protocol. International Journal of Information Technology, Modeling and Computing (IJITMC), 1(2), 49\u201357.","journal-title":"International Journal of Information Technology, Modeling and Computing (IJITMC)"},{"key":"1485_CR12","doi-asserted-by":"crossref","unstructured":"Kout, A., Labed, S., & Chikhi, S. (2015). Netlogo, agent-based tool for modeling and simulation of routing problem in ad-hoc networks. In The second international conference on advances in information processing and communication technology\u2014IPCT 2015 (pp. 154\u2013160), Roma, Italy.","DOI":"10.15224\/978-1-63248-044-6-125"},{"key":"1485_CR13","unstructured":"http:\/\/www.isi.edu\/nsnam\/\/ . consulted on June 21st, 2016."}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-017-1485-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-017-1485-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-017-1485-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T12:48:33Z","timestamp":1568897313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-017-1485-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,11]]},"references-count":13,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["1485"],"URL":"https:\/\/doi.org\/10.1007\/s11276-017-1485-2","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"type":"print","value":"1022-0038"},{"type":"electronic","value":"1572-8196"}],"subject":[],"published":{"date-parts":[[2017,3,11]]}}}