(Bharathiyar University, India)(2) Rajesh Ramachandran
(CHRIST (Deemed to be university), Bangalore, India)*corresponding author
AbstractThe paper delves into the complexities of Mobile Ad hoc Networks (MANETs), which consist of a diverse array of wireless nodes. In such networks, routing packets poses a significant challenge due to their dynamic nature. Despite the variety of techniques available for optimizing routing in MANETs, persistent issues like packet loss, routing overhead, and End-to-End Delay (EED) remain prevalent. In response to these challenges, the paper proposes a novel approach for efficient Data Communication (DC) by introducing a Link Stability (LS)-based optimal routing path. This approach leverages several advanced techniques, including Pearson Correlation Coefficient SWIFFT (PCC-SWIFFT), Galois-based Digital Signature Algorithm (G-DSA), and Entropy-based Gannet Optimization Algorithm (E-GOA). The proposed methodology involves a systematic process. Initially, the nodes in the MANET are initialized to establish the network infrastructure. Subsequently, the Canberra-based K Means (C-K Means) algorithm is employed to identify Neighboring Nodes (NNs), which are pivotal for creating communication links within the network. To ensure secure communication, secret keys (SK) are generated for both the Sender Node (SN) and the Receiver Node (RN) using Galois Theory. Following this, PCC-SWIFFT methodologies are utilized to generate hash codes, serving as unique identifiers for data packets or routing information. Signatures are created and verified at the SN and RN using the G-DSA. Verified nodes are subsequently added to the routing entry table, facilitating the establishment of multiple paths within the network. The Optimal Path (OP) is selected using the E-GOA, considering factors such as link stability and network congestion. Finally, Data Communication (DC) is initiated, continuously monitoring LS to ensure optimal routing performance. Comparative analysis with existing methodologies demonstrates the superior performance of the proposed model. In summary, the proposed approach offers a comprehensive solution to enhance routing efficiency in MANETs by addressing critical issues and leveraging advanced algorithms for key generation, signature verification, and path optimization
KeywordsMobile Ad Hoc Network (MANET); Optimal routing path; C-K Means; SWIFFT; Digital signature Algorithm (DSA); Gannet Optimization Algorithm (GOA); Data communication and link stability
|
DOIhttps://doi.org/10.26555/ijain.v10i3.1558 |
Article metricsAbstract views : 292 | PDF views : 33 |
Cite |
Full Text Download
|
References
[1] A. Srivastava, S. K. Gupta, M. Najim, N. Sahu, G. Aggarwal, and B. D. Mazumdar, “DSSAM: digitally signed secure acknowledgement method for mobile ad hoc network,” EURASIP J. Wirel. Commun. Netw., vol. 2021, no. 1, p. 12, Dec. 2021, doi: 10.1186/s13638-021-01894-7.
[2] P. Theerthagiri, “FUCEM: futuristic cooperation evaluation model using Markov process for evaluating node reliability and link stability in mobile ad hoc network,” Wirel. Networks, vol. 26, no. 6, pp. 4173–4188, Aug. 2020, doi: 10.1007/s11276-020-02326-y.
[3] U. Srilakshmi, N. Veeraiah, Y. Alotaibi, S. A. Alghamdi, O. I. Khalaf, and B. V. Subbayamma, “An Improved Hybrid Secure Multipath Routing Protocol for MANET,” IEEE Access, vol. 9, pp. 163043–163053, 2021, doi: 10.1109/ACCESS.2021.3133882.
[4] D. E. M. Ahmed and O. O. Khalifa, “An overview of MANETs: Applications, characteristics, challenges and recent issues,” Int. J. Eng. Adv. Technol., vol. 6, no. 4, pp. 128–133, 2017, [Online]. Available at: https://csit.ust.edu.sd/files/2018/06/D4927046417-1.pdf.
[5] P. K. Pattnaik, B. K. Panda, and M. Sain, “Design of Novel Mobility and Obstacle-Aware Algorithm for Optimal MANET Routing,” IEEE Access, vol. 9, pp. 110648–110657, 2021, doi: 10.1109/ACCESS.2021.3101850.
[6] V. Tilwari et al., “MCLMR: A Multicriteria Based Multipath Routing in the Mobile Ad Hoc Networks,” Wirel. Pers. Commun., vol. 112, no. 4, pp. 2461–2483, Jun. 2020, doi: 10.1007/s11277-020-07159-8.
[7] A. Alshehri, A.-H. A. Badawy, and H. Huang, “FQ-AGO: Fuzzy Logic Q-Learning Based Asymmetric Link Aware and Geographic Opportunistic Routing Scheme for MANETs,” Electronics, vol. 9, no. 4, p. 576, Mar. 2020, doi: 10.3390/electronics9040576.
[8] S. Patel and H. Pathak, “A mathematical framework for link failure time estimation in MANETs,” Eng. Sci. Technol. an Int. J., vol. 25, p. 100984, Jan. 2022, doi: 10.1016/j.jestch.2021.04.003.
[9] M. B. Dsouza and D. H. Manjaiah, “Energy and Congestion Aware Simple Ant Routing Algorithm for MANET,” in 2020 4th International Conference on Electronics, Communication and Aerospace Technology (ICECA), Nov. 2020, pp. 744–748, doi: 10.1109/ICECA49313.2020.9297470.
[10] B. K. Tripathy, S. K. Jena, P. Bera, and S. Das, “An Adaptive Secure and Efficient Routing Protocol for Mobile Ad Hoc Networks,” Wirel. Pers. Commun., vol. 114, no. 2, pp. 1339–1370, Sep. 2020, doi: 10.1007/s11277-020-07423-x.
[11] P. K. Shrivastava and L. K. Vishwamitra, “Comparative analysis of proactive and reactive routing protocols in VANET environment,” Meas. Sensors, vol. 16, p. 100051, Aug. 2021, doi: 10.1016/j.measen.2021.100051.
[12] N. Veeraiah and B. T. Krishna, “An approach for optimal-secure multi-path routing and intrusion detection in MANET,” Evol. Intell., vol. 15, no. 2, pp. 1313–1327, Jun. 2022, doi: 10.1007/s12065-020-00388-7.
[13] S. Sankar Ganesh and G. Ravi, “Retracted Article: Real time link quality based route selection and transmission in industrial Manet for improved QoS,” J. Ambient Intell. Humaniz. Comput., vol. 12, no. 7, pp. 6873–6883, Jul. 2021, doi: 10.1007/s12652-020-02331-1.
[14] S. R and A. H, “Adaptive fuzzy logic inspired path longevity factor-based forecasting model reliable routing in MANETs,” Sensors Int., vol. 3, p. 100201, Jan. 2022, doi: 10.1016/j.sintl.2022.100201.
[15] B. U. I. Khan et al., “Exploring Manet Security Aspects: Analysis Of Attacks And Node Misbehaviour Issues,” Malaysian J. Comput. Sci., vol. 35, no. 4, pp. 307–338, Oct. 2022, doi: 10.22452/mjcs.vol35no4.2.
[16] U. Srilakshmi, S. A. Alghamdi, V. A. Vuyyuru, N. Veeraiah, and Y. Alotaibi, “A Secure Optimization Routing Algorithm for Mobile Ad Hoc Networks,” IEEE Access, vol. 10, pp. 14260–14269, 2022, doi: 10.1109/ACCESS.2022.3144679.
[17] K. Karthick and R. Asokan, “Mobility Aware Quality Enhanced Cluster Based Routing Protocol for Mobile Ad-Hoc Networks Using Hybrid Optimization Algorithm,” Wirel. Pers. Commun., vol. 119, no. 4, pp. 3063–3087, Aug. 2021, doi: 10.1007/s11277-021-08387-2.
[18] T.-N. Tran, T.-V. Nguyen, K. Shim, D. B. Da Costa, and B. An, “A New Deep Q-Network Design for QoS Multicast Routing in Cognitive Radio MANETs,” IEEE Access, vol. 9, pp. 152841–152856, 2021, doi: 10.1109/ACCESS.2021.3126844.
[19] N. Fareena and S. Sharmila Kumari, “Retracted Article: A distributed fuzzy multicast routing protocol (DFMCRP) for maximizing the network lifetime in mobile ad-hoc networks,” J. Ambient Intell. Humaniz. Comput., vol. 12, no. 5, pp. 4967–4978, May 2021, doi: 10.1007/s12652-020-01936-w.
[20] Z. Chen, W. Zhou, S. Wu, and L. Cheng, “An Adaptive on-Demand Multipath Routing Protocol With QoS Support for High-Speed MANET,” IEEE Access, vol. 8, pp. 44760–44773, 2020, doi: 10.1109/ACCESS.2020.2978582.
[21] B. Velusamy, K. Karunanithy, D. Sauveron, R. N. Akram, and J. Cho, “Multi-Objective Function-Based Node-Disjoint Multipath Routing for Mobile Ad Hoc Networks,” Electronics, vol. 10, no. 15, p. 1781, Jul. 2021, doi: 10.3390/electronics10151781.
[22] V. Matre and P. A. Vikhar, “Routing Selection Policy on Mobile Ad-Hoc Network using Trust based Mechanism Through AODV Routing Protocol,” Int. J. Intell. Syst. Appl. Eng., vol. 12, no. 8s, pp. 683–694, Dec. 2023. [Online]. Available at: https://ijisae.org/index.php/IJISAE/article/view/4261.
[23] S. A. Almazok and B. Bilgehan, “A novel dynamic source routing (DSR) protocol based on minimum execution time scheduling and moth flame optimization (MET-MFO),” EURASIP J. Wirel. Commun. Netw., vol. 2020, no. 1, p. 219, Dec. 2020, doi: 10.1186/s13638-020-01802-5.
[24] J. Y. Hande and R. Sadiwala, “Optimization of energy consumption and routing in MANET using Artificial Neural Network,” J. Integr. Sci. Technol., vol. 12, no. 1, pp. 718–718, 2024. [Online]. Available at: https://pubs.thesciencein.org/journal/index.php/jist/article/view/a718.
[25] K. Kandali, L. Bennis, and H. Bennis, “A New Hybrid Routing Protocol Using a Modified K-Means Clustering Algorithm and Continuous Hopfield Network for VANET,” IEEE Access, vol. 9, pp. 47169–47183, 2021, doi: 10.1109/ACCESS.2021.3068074.
[26] M. Usama et al., “Unsupervised Machine Learning for Networking: Techniques, Applications and Research Challenges,” IEEE Access, vol. 7, pp. 65579–65615, 2019, doi: 10.1109/ACCESS.2019.2916648.
[27] A. M. Ikotun, A. E. Ezugwu, L. Abualigah, B. Abuhaija, and J. Heming, “K-means clustering algorithms: A comprehensive review, variants analysis, and advances in the era of big data,” Inf. Sci. (Ny)., vol. 622, pp. 178–210, Apr. 2023, doi: 10.1016/j.ins.2022.11.139.
[28] S. J. Ahmad, I. Unissa, M. S. Ali, and A. Kumar, “Enhanced security to MANETs using digital codes,” J. Inf. Secur. Appl., vol. 66, p. 103147, May 2022, doi: 10.1016/j.jisa.2022.103147.
[29] I. Stewart, “Galois Theory, Fifth Edition,” Galois Theory, Fifth Ed., pp. 1–351, Jan. 2022, doi: 10.1201/9781003213949-1.
[30] R. P. Salim and R. R, “A Framework for Integrating the Distributed Hash Table (DHT) with an Enhanced Bloom’s Filter in Manet,” Int. J. Adv. Comput. Sci. Appl., vol. 13, no. 2, pp. 440–448, 2022, doi: 10.14569/IJACSA.2022.0130252.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
___________________________________________________________
International Journal of Advances in Intelligent Informatics
ISSN 2442-6571 (print) | 2548-3161 (online)
Organized by UAD and ASCEE Computer Society
Published by Universitas Ahmad Dahlan
W: http://ijain.org
E: info@ijain.org (paper handling issues)
andri.pranolo.id@ieee.org (publication issues)
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0