Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Research on Path Planning and Location Optimization of Quantum Wireless Sensor Networks

Xincan Fan, Xiaojun Wen, Shaosheng Jiang

Published Oct 1, 2020• 3 citations
OpenAlex

Related papers

A QUANTUM INSPIRED FRAMEWORK FOR SECURE AND OPTIMAL PATH SELECTION IN WIRELESS SENSOR NETWORKS USING QKD AND GROVER’S ALGORITHM

Velpula Ravindra Reddy, V. Raghunatha Reddy

Wireless Sensor Networks (WSNs) have significant issues in routing, maintaining security against quantum interference, and achieving maximum performance in resource-constrained contexts. Existing methods, such as conventional encryption models and standalone Quantum Key Distribution protocols, focus on either secure transmission or efficient pathfinding while bypassing their integration. This research proposes an innovative combination framework that incorporates QKD based on the BB84 protocol with Grover’s quantum search technique to obtain secure and optimal routing.The BB84-based QKD generates information-theoretically secure keys for encryption and authenticating data packets, successfully combating quantum-capable adversaries. In parallel, Gover’s technique is used to accelerates optimal pathfinding by effectively analyzing the routing space, which reduces computational complexity when compared to traditional approaches. Unlike previous research, this confluence strategy assures both post-quantum security and routing optimality, addressing limitations in wireless sensor networks.

IJESRT•Feb 16, 2026•0 citations

Quantum Wireless Sensor Networks

Naya Nagy, Marius Nagy, Selim G. Akl

Lecture notes in computer science•Jan 1, 2008•6 citations

Wireless Sensor Networks Based on Quantum Communications

Hui Li, Yingpei Sun -

International Journal of Digital Content Technology and its Applications•Feb 14, 2013•1 citation

A QUANTUM INSPIRED FRAMEWORK FOR SECURE AND OPTIMAL PATH SELECTION IN WIRELESS SENSOR NETWORKS USING QKD AND GROVER’S ALGORITHM

Velpula Ravindra Reddy, V. Raghunatha Reddy

Wireless Sensor Networks (WSNs) have significant issues in routing, maintaining security against quantum interference, and achieving maximum performance in resource-constrained contexts. Existing methods, such as conventional encryption models and standalone Quantum Key Distribution protocols, focus on either secure transmission or efficient pathfinding while bypassing their integration. This research proposes an innovative combination framework that incorporates QKD based on the BB84 protocol with Grover’s quantum search technique to obtain secure and optimal routing.The BB84-based QKD generates information-theoretically secure keys for encryption and authenticating data packets, successfully combating quantum-capable adversaries. In parallel, Gover’s technique is used to accelerates optimal pathfinding by effectively analyzing the routing space, which reduces computational complexity when compared to traditional approaches. Unlike previous research, this confluence strategy assures both post-quantum security and routing optimality, addressing limitations in wireless sensor networks.

•Jan 1, 2026•0 citations

Secure Path Selection under Random Fading

Furqan Jameel, Faisal Ahmed Khan, M. Asif Ali Haider +1 more

Application-oriented Wireless Sensor Networks (WSNs) promises to be one of the most useful technologies of this century.However, secure communication between nodes in WSNs is still an unresolved issue.In this context, we propose two protocols (i.e.Optimal Secure Path (OSP) and Sub-optimal Secure Path (SSP)) to minimize the outage probability of secrecy capacity in the presence of multiple eavesdroppers.We consider dissimilar fading at the main and wiretap link and provide detailed evaluation of the impact of Nakagami-m and Rician-K factors on the secrecy performance of WSNs.Extensive simulations are performed to validate our findings.Although the optimal scheme ensures more security, yet the sub-optimal scheme proves to be a more practical approach to secure wireless links.

Advances in Science Technology and Engineering Systems Journal•May 1, 2017•0 citations

Quantum security in wireless sensor networks

Naya Nagy, Marius Nagy, Selim G. Akl

Natural Computing•Apr 21, 2010•12 citations
Wireless Sensor Networks (WSNs) have significant issues in routing, maintaining security against quantum interference, and achieving maximum performance in resource-constrained contexts. Existing methods, such as conventional encryption models and standalone Quantum Key Distribution protocols, focus on either secure transmission or efficient pathfinding while bypassing their integration. This research proposes an innovative combination framework that incorporates QKD based on the BB84 protocol with Grover’s quantum search technique to obtain secure and optimal routing.The BB84-based QKD generates information-theoretically secure keys for encryption and authenticating data packets, successfully combating quantum-capable adversaries. In parallel, Gover’s technique is used to accelerates optimal pathfinding by effectively analyzing the routing space, which reduces computational complexity when compared to traditional approaches. Unlike previous research, this confluence strategy assures both post-quantum security and routing optimality, addressing limitations in wireless sensor networks.
Wireless Sensor Networks (WSNs) have significant issues in routing, maintaining security against quantum interference, and achieving maximum performance in resource-constrained contexts. Existing methods, such as conventional encryption models and standalone Quantum Key Distribution protocols, focus on either secure transmission or efficient pathfinding while bypassing their integration. This research proposes an innovative combination framework that incorporates QKD based on the BB84 protocol with Grover’s quantum search technique to obtain secure and optimal routing.The BB84-based QKD generates information-theoretically secure keys for encryption and authenticating data packets, successfully combating quantum-capable adversaries. In parallel, Gover’s technique is used to accelerates optimal pathfinding by effectively analyzing the routing space, which reduces computational complexity when compared to traditional approaches. Unlike previous research, this confluence strategy assures both post-quantum security and routing optimality, addressing limitations in wireless sensor networks.
Application-oriented Wireless Sensor Networks (WSNs) promises to be one of the most useful technologies of this century.However, secure communication between nodes in WSNs is still an unresolved issue.In this context, we propose two protocols (i.e.Optimal Secure Path (OSP) and Sub-optimal Secure Path (SSP)) to minimize the outage probability of secrecy capacity in the presence of multiple eavesdroppers.We consider dissimilar fading at the main and wiretap link and provide detailed evaluation of the impact of Nakagami-m and Rician-K factors on the secrecy performance of WSNs.Extensive simulations are performed to validate our findings.Although the optimal scheme ensures more security, yet the sub-optimal scheme proves to be a more practical approach to secure wireless links.