International Journal For Multidisciplinary Research

E-ISSN: 2582-2160   •   Impact Factor: 9.24

A Widely Indexed Open Access Peer Reviewed Multidisciplinary Bi-monthly Scholarly International Journal

Call for Paper Volume 8, Issue 5 (September-October 2026) Submit your research before last 3 days of October to publish your research paper in the issue of September-October.
Submit Research Paper Join as a Reviewer

Plagiarism is checked by the leading plagiarism checker TurnItIn

Call for Paper

Volume 8 Issue 5
September-October 2026

Submit your research paper

Indexing Partners
Academia Advanced Sciences Index Bielefeld Academic Search Engine CiteSeer DRJI Google Scholar Independent Search Engine & Directory Network ISI (International Scientific Indexing) Issuu Mendeley Research Networks
RefSeek ResearcherId - Thomson Reuters ResearchGate Scirus Scribd Semantic Scholar UTeM - Universiti Teknikal Malaysia Melaka Wiki for Call for Papers WorldCat Zenodo

Optimization of Cryptographically Secure Path Selection in Multi-hop Networks using Weighted Dijkstra’s Algorithm

Author(s) Dr. Mayala Nkumbieme Pélagie, Prof. Dr. Mayala Lemba Francis, Dr. Kossa Ngbanda Touby, Prof. Dr. Kafunda Katalayi Pierre, Prof. Dr. Kitondua Lubanzadio Richard
Country Congo (Democratic)
Abstract Multi-hop networks allow a source node to communicate with a destination node by routing data through several intermediate nodes. This architecture is particularly advantageous in distributed, mobile, and resource-constrained networks, but it also introduces vulnerabilities related to routing, node compromise, and communication security. Traditional routing mechanisms generally prioritize criteria such as distance, hop count, or latency, without sufficiently incorporating path security properties. However, securing IP communications requires considering services such as authentication, integrity, confidentiality, and security association management (Kent & Seo, 2005). This paper proposes an optimization approach for selecting cryptographically secure paths based on a weighted version of Dijkstra’s algorithm. The approach represents the network as a weighted graph and integrates several parameters into link costs, including latency, security level, capacity, reliability, and cryptographic cost. The goal is to determine a path that achieves the best compromise between security and performance. The proposed approach is evaluated through simulation and compared with the classical Dijkstra algorithm. The results analyze the influence of different weighting parameters on the quality of selected paths.
Keywords Multi-hop networks, Dijkstra, secure routing, cryptography, path selection, optimization, cybersecurity.
Field Computer Applications
Published In Volume 8, Issue 5, September-October 2026
Published On 2026-09-26
DOI https://doi.org/10.36948/ijfmr.2026.v08i05.88109
View / Download PDF File

Share this



E-ISSN 2582-2160
CrossRef

CrossRef DOI prefix of IJFMR is 10.36948/ijfmr

Downloads
Research Paper Format Copyright Permission Form and Undertaking Form

All research papers published on this website are licensed under Creative Commons Attribution-ShareAlike 4.0 International License, and all rights belong to their respective authors/researchers.

CC-BY-SA Open Access

About IJFMR
Fees & Payment
Current Issue
Publication Archive 		Submit Research Paper
Track Submission Status
Publication Guidelines
Publication Ethics
Peer Review & Plagiarism 		Join as a Reviewer
Editors & Reviewers
Reviewer Referral Program
Get Reviewer Membership Certi. 		Website/Journal Policies
Usage Policy
Content Policies
Privacy Policy
Contact Us +91-9687-828-838 editor@ijfmr.com
Powered by Sky Research Publication and Journals