Abstract
Mobile ad hoc networks (MANETs) comprise a collection of independent, compact-sized, and inexpensive sensor nodes, which are commonly used to sense the physical parameters in geographical locations and transmit them to base stations (BSs). Since clustering and routing are considered commonly used energy efficient techniques, several metaheuristic algorithms have been employed to determine optimal cluster heads (CHs) and routes to destinations. However, most metaheuristic techniques have failed to achieve effective clustering and routing solutions in a large search space, and the probability of generating optimal solutions is also considerably reduced. To resolve these issues, this paper presents a new metaheuristic quantum worm swarm optimization-based clustering with a secure routing protocol for MANETs, named QGSOC-SRP. The presented QGSOC-SRP technique follows a two-stage process, namely optimal CH selection and route selection. First, the QGSO algorithm derives a fitness function using four variables, the energy, distance, node degree, and trust factor, for the optimal selection of secure CHs. Second, the SRP using the oppositional gravitational search algorithm (OGSA) is applied for the optimal selection of routes to the BS. The traditional GSA is inspired by the law of gravity and interaction among masses. To improve the effectiveness of the GSA, the OGSA is derived based on the opposition-based learning concept for population initialization and generation jumping. To validate the results regarding the effectiveness of the presented OGSOC-SRP technique, a set of experiments was performed, and the results were determined using distinct measures such as the energy consumption, network lifetime, throughput, and end-to-end delay.
Similar content being viewed by others
Data availability
Not Applicable.
Code availability
Available based on request.
References
Wei N, Walteros JL, Worden MR, Ortiz-Peña HJ (2021) A resiliency analysis of information distribution policies over mobile ad hoc networks. Optim Lett 15:1081
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–21745
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–150. IGI Global
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–423
Tseng YC, Hsu CS, Hsieh TY (2003) Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks. Comput Netw 43:317–337
Arulprakash M, Jebakumar R (2021) People-centric collective intelligence: decentralized and enhanced privacy mobile crowd sensing based on blockchain. J Supercomput 77:12582–12608. https://doi.org/10.1007/s11227-021-03756-x
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
Sharma S, Verma VK (2021) Security explorations for routing attacks in low power networks on internet of things. J Supercomput 77:4778–4812. https://doi.org/10.1007/s11227-020-03471-z
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–66
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–21 March 2002; 2: 800–806
Dressler F, Akan OB (2010) A survey on bio-inspired networking. Comput Netw 54:881–900
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–6 July 2013; pp. 1–6
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’03), Antipolis, France, 3–5 March 2003; 10p
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–28 March 2008; pp. 204–211
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–38
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–13 June 2013; pp. 3645–3649
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–20 July 2018; Volume 1, pp. 43–48
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–12 August 2015; Springer: New York, NY, USA, 2015; pp. 845–853
Mohsen AM (2016) Annealing ant colony optimization with mutation operator for solving TSP. Comput Intell Neurosci 2016:1
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–12188
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–53
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
Rashedi E, Nezamabadi-Pour H, Saeid S (2009) GSA: a gravitational search algorithm. Inform Sci 179:2232–48
Tizhoosh HR (2006) Opposition-based reinforcement learning. J Adv Comput Intell Intell Inform 10(3):578–585
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–33
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
Funding
The authors received no specific funding for this study.
Author information
Authors and Affiliations
Contributions
MS was involved in article preparation, design, and implementation. MRP was involved in conceptual analysis, design, review and approval, and language editing.
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflicts of interest to report regarding the present study.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Srinivas, M., Patnaik, M.R. Clustering with a high-performance secure routing protocol for mobile ad hoc networks. J Supercomput 78, 8830–8851 (2022). https://doi.org/10.1007/s11227-021-04258-6
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-021-04258-6