{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T10:08:01Z","timestamp":1771668481758,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T00:00:00Z","timestamp":1642032000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T00:00:00Z","timestamp":1642032000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s11227-021-04258-6","type":"journal-article","created":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T08:03:31Z","timestamp":1642061011000},"page":"8830-8851","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Clustering with a high-performance secure routing protocol for mobile ad hoc networks"],"prefix":"10.1007","volume":"78","author":[{"given":"Maganti","family":"Srinivas","sequence":"first","affiliation":[]},{"given":"M. Ramesh","family":"Patnaik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,13]]},"reference":[{"key":"4258_CR1","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1007\/s11590-021-01717-0","volume":"15","author":"N Wei","year":"2021","unstructured":"Wei N, Walteros JL, Worden MR, Ortiz-Pe\u00f1a HJ (2021) A resiliency analysis of information distribution policies over mobile ad hoc networks. Optim Lett 15:1081","journal-title":"Optim Lett"},{"key":"4258_CR2","doi-asserted-by":"publisher","first-page":"21735","DOI":"10.1109\/ACCESS.2021.3055422","volume":"9","author":"KS Sankaran","year":"2021","unstructured":"Sankaran KS, Vasudevan N, Devabalaji KR, Babu TS, Alhelou HH, Yuvaraj T (2021) A recurrent reward based learning technique for secure neighbor selection in mobile AD-HOC networks. IEEE Access 9:21735\u201321745","journal-title":"IEEE Access"},{"key":"4258_CR3","doi-asserted-by":"crossref","unstructured":"Swain J, Pattanayak BK, Pati B (2021) A systematic study and analysis of security issues in mobile ad-hoc networks. In: Research anthology on securing mobile technologies and applications, pp. 144\u2013150. IGI Global","DOI":"10.4018\/978-1-7998-8545-0.ch008"},{"key":"4258_CR4","doi-asserted-by":"crossref","unstructured":"Polastre J, Szewczyk R, Mainwaring A, Culler D, Anderson J (2004) Analysis of wireless sensor networks for habitat monitoring. In Wireless Sensor Networks. Springer: New York, pp. 399\u2013423","DOI":"10.1007\/1-4020-7884-6_18"},{"key":"4258_CR5","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S1389-1286(03)00284-6","volume":"43","author":"YC Tseng","year":"2003","unstructured":"Tseng YC, Hsu CS, Hsieh TY (2003) Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks. Comput Netw 43:317\u2013337","journal-title":"Comput Netw"},{"key":"4258_CR6","doi-asserted-by":"publisher","first-page":"12582","DOI":"10.1007\/s11227-021-03756-x","volume":"77","author":"M Arulprakash","year":"2021","unstructured":"Arulprakash M, Jebakumar R (2021) People-centric collective intelligence: decentralized and enhanced privacy mobile crowd sensing based on blockchain. J Supercomput 77:12582\u201312608. https:\/\/doi.org\/10.1007\/s11227-021-03756-x","journal-title":"J Supercomput"},{"key":"4258_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-021-03922-1","author":"R Sahay","year":"2021","unstructured":"Sahay R, Geethakumari G, Mitra B (2021) A holistic framework for prediction of routing attacks in IoT-LLNs. J Supercomput. https:\/\/doi.org\/10.1007\/s11227-021-03922-1","journal-title":"J Supercomput"},{"key":"4258_CR8","doi-asserted-by":"publisher","first-page":"4778","DOI":"10.1007\/s11227-020-03471-z","volume":"77","author":"S Sharma","year":"2021","unstructured":"Sharma S, Verma VK (2021) Security explorations for routing attacks in low power networks on internet of things. J Supercomput 77:4778\u20134812. https:\/\/doi.org\/10.1007\/s11227-020-03471-z","journal-title":"J Supercomput"},{"key":"4258_CR9","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/581291.581300","volume":"6","author":"S Doshi","year":"2002","unstructured":"Doshi S, Bhandare S, Brown TX (2002) An on-demand minimum energy routing protocol for a wireless ad hoc network. ACM SIGMOBILE Mob Comput Commun Rev 6:50\u201366","journal-title":"ACM SIGMOBILE Mob Comput Commun Rev"},{"key":"4258_CR10","doi-asserted-by":"crossref","unstructured":"Misra A, Banerjee S (2002) MRPC: maximizing network lifetime for reliable routing in wireless environments. In: Proceedings of the 2002 IEEE Wireless Communications and Networking Conference (WCNC2002), Orlando, FL, USA, 17\u201321 March 2002; 2: 800\u2013806","DOI":"10.1109\/WCNC.2002.993371"},{"key":"4258_CR11","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.comnet.2009.10.024","volume":"54","author":"F Dressler","year":"2010","unstructured":"Dressler F, Akan OB (2010) A survey on bio-inspired networking. Comput Netw 54:881\u2013900","journal-title":"Comput Netw"},{"key":"4258_CR12","doi-asserted-by":"crossref","unstructured":"Bandgar AR. Thorat SA (2013) An improved location-aware ant colony optimization based routing algorithm for MANETs. In: Proceedings of the 2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT), Tiruchengode, India, 4\u20136 July 2013; pp. 1\u20136","DOI":"10.1109\/ICCCNT.2013.6726581"},{"key":"4258_CR13","unstructured":"Baras JS, Mehta H (2003) A probabilistic emergent routing algorithm for mobile Ad Hoc networks. In: Proceedings of the Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt\u201903), Antipolis, France, 3\u20135 March 2003; 10p"},{"key":"4258_CR14","doi-asserted-by":"crossref","unstructured":"Osagie E, Thulasiraman P, Thulasiram RK (2008) PACONET: improved ant colony optimization routing algorithm for mobile ad hoc networks. In: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (AINA 2008), Okinawa, Japan, 25\u201328 March 2008; pp. 204\u2013211","DOI":"10.1109\/AINA.2008.77"},{"key":"4258_CR15","first-page":"25","volume":"7","author":"B Bullnheimer","year":"1999","unstructured":"Bullnheimer B, Hartl R, Strauss C (1999) A new rank based version of the ant system: a computational study. Vienna Univ Econ Bus 7:25\u201338","journal-title":"Vienna Univ Econ Bus"},{"key":"4258_CR16","doi-asserted-by":"crossref","unstructured":"Woungang I, Dhurandher SK, Obaidat MS, Ferworn A, Shah W (2013) An ant-swarm inspired energy-efficient ad hoc on-demand routing protocol for mobile ad hoc networks. In: Proceedings of the 2013 IEEE International Conference on Communications (ICC), udapest, Hungary, 9\u201313 June 2013; pp. 3645\u20133649","DOI":"10.1109\/ICC.2013.6655119"},{"key":"4258_CR17","doi-asserted-by":"crossref","unstructured":"de Figueiredo Marques V, Kniess J, Parpinelli RS (2018) An energy efficient mesh LNN routing protocol based on ant colony optimization. In: Proceedings of the 2018 IEEE 16th International Conference on Industrial Informatics (INDIN), Porto, Portugal, 18\u201320 July 2018; Volume 1, pp. 43\u201348","DOI":"10.1109\/INDIN.2018.8471965"},{"key":"4258_CR18","doi-asserted-by":"crossref","unstructured":"Zhou J, Wang X, Tan H, Deng Y (2015) Ant colony-based energy control routing protocol for mobile ad hoc networks. In: Proceedings of the International Conference on Wireless Algorithms, Systems, and Applications, Qufu, China, 10\u201312 August 2015; Springer: New York, NY, USA, 2015; pp. 845\u2013853","DOI":"10.1007\/978-3-319-21837-3_83"},{"key":"4258_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2016\/8932896","volume":"2016","author":"AM Mohsen","year":"2016","unstructured":"Mohsen AM (2016) Annealing ant colony optimization with mutation operator for solving TSP. Comput Intell Neurosci 2016:1","journal-title":"Comput Intell Neurosci"},{"issue":"10","key":"4258_CR20","doi-asserted-by":"publisher","first-page":"12180","DOI":"10.1016\/j.eswa.2011.03.053","volume":"38","author":"WH Liao","year":"2011","unstructured":"Liao WH, Kao Y, Li YS (2011) A sensor deployment approach using glowworm swarm optimization algorithm in wireless sensor networks. Expert Syst Appl 38(10):12180\u201312188","journal-title":"Expert Syst Appl"},{"key":"4258_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.ijar.2020.08.010","volume":"127","author":"D Wang","year":"2020","unstructured":"Wang D, Chen H, Li T, Wan J, Huang Y (2020) A novel quantum grasshopper optimization algorithm for feature selection. Int J Approx Reason 127:33\u201353","journal-title":"Int J Approx Reason"},{"key":"4258_CR22","doi-asserted-by":"publisher","first-page":"101923","DOI":"10.1016\/j.adhoc.2019.101923","volume":"93","author":"Y Xiuwu","year":"2019","unstructured":"Xiuwu Y, Qin L, Yong L, Mufang H, Ke Z, Renrong X (2019) Uneven clustering routing algorithm based on glowworm swarm optimization. Ad Hoc Netw 93:101923","journal-title":"Ad Hoc Netw"},{"key":"4258_CR23","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadi-Pour H, Saeid S (2009) GSA: a gravitational search algorithm. Inform Sci 179:2232\u201348","journal-title":"Inform Sci"},{"issue":"3","key":"4258_CR24","doi-asserted-by":"publisher","first-page":"578","DOI":"10.20965\/jaciii.2006.p0578","volume":"10","author":"HR Tizhoosh","year":"2006","unstructured":"Tizhoosh HR (2006) Opposition-based reinforcement learning. J Adv Comput Intell Intell Inform 10(3):578\u2013585","journal-title":"J Adv Comput Intell Intell Inform"},{"issue":"1","key":"4258_CR25","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ijepes.2011.08.012","volume":"35","author":"B Shaw","year":"2012","unstructured":"Shaw B, Mukherjee V, Ghoshal SP (2012) A novel opposition-based gravitational search algorithm for combined economic and emission dispatch problems of power systems. Int J Electr Power Energy Syst 35(1):21\u201333","journal-title":"Int J Electr Power Energy Syst"},{"key":"4258_CR26","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s11277-020-07705-4","volume":"116","author":"M Selvi","year":"2020","unstructured":"Selvi M, Kumar SS, Ganapathy S, Ayyanar A, Nehemiah HK, Kannan A (2020) An energy efficient clustered gravitational and fuzzy based routing algorithm in WSNs. Wireless Personal Commun 116:61","journal-title":"Wireless Personal Commun"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-04258-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-04258-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-04258-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T14:13:57Z","timestamp":1648822437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-04258-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,13]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["4258"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-04258-6","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,13]]},"assertion":[{"value":"21 December 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflicts of interest to report regarding the present study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}