Abstract This paper addresses the optimization of on-demand routing protocols for quantum wireless Ad Hoc network. This paper proposes an optimal quantum route metric algorithm that integrates quantum route metric and classic route metric to select a better route path for quantum communication. The paper also improves the route discovery protocol by proposing a "reverse synchronization method" which means after the route request is completed, the quantum entanglement channel is established synchronously when the reverse path is established. This method, better than general methods which builds quantum channels after the forward path establishment, reduces the time and the numbers of messages for quantum channel establishment, thus improving the efficiency. Accordingly, this paper elaborates the specific methods, procedures and related upgrading message formats involved in quantum route discovery, quantum channel establishment and quantum information transmission of on-demand routing protocols for quantum wireless Ad Hoc network. The advantage of the "reverse synchronization method" in reducing the time and the numbers of messages for quantum channel establishment is verified through analysis on protocol performance.
Abstract This paper addresses the optimization of on-demand routing protocols for quantum wireless Ad Hoc network. This paper proposes an optimal quantum route metric algorithm that integrates quantum route metric and classic route metric to select a better route path for quantum communication. The paper also improves the route discovery protocol by proposing a "reverse synchronization method" which means after the route request is completed, the quantum entanglement channel is established synchronously when the reverse path is established. This method, better than general methods which builds quantum channels after the forward path establishment, reduces the time and the numbers of messages for quantum channel establishment, thus improving the efficiency. Accordingly, this paper elaborates the specific methods, procedures and related upgrading message formats involved in quantum route discovery, quantum channel establishment and quantum information transmission of on-demand routing protocols for quantum wireless Ad Hoc network. The advantage of the "reverse synchronization method" in reducing the time and the numbers of messages for quantum channel establishment is verified through analysis on protocol performance.
A concept of wireless ad hoc quantum communication network is proposed and a routing protocol is designed for wireless quantum communicaiton network with complex structure. The routing protocol is on-demand and the routing metric is based on the number of entangled particle pairs. The node that wants to send information carried by quantum state can initiate a route request and establishment procedure. The destination node chooses path by the routing metric and sends route reply message along the selected path. During the information transmission, if the quantum channel or the wirless channel between any neighbors in the selected path is broken, a route discovery process is reinitiated to set up a new route. Nodes in the selected path use a both-end approximation algorithm to establish a quantum channel. After the quantum channel is established, the quantum state is transferred by quantum teleportation and the information transfer between any two nodes in wireless ad hoc quantum communication network is finished.
In wireless quantum communication networks, existing AODV routing protocols can guarantee the stability of quantum entangled channels.However, the protocol takes a long time to establish the quantum channel on average, and it also consumes many entanglement resources.In order to solve the above problems, a routing protocol for wireless quantum networks based on resource reservation is proposed in this paper.Before the source node sends the quantum state information to the destination node, the proposed protocol estimates the quantum state information to be transmitted and writes the resource estimation value into the routing request message.A broadcast routing request message can not only satisfy the requirement of quantum data transmission, but also ensure that the number of hops is as small as possible.Simulation results show that the proposed protocol can effectively shorten the time of establishing quantum channels, reduce the consumption of entanglement resources, and improve the communication efficiency of wireless quantum communication networks.It has good practical value.
This paper presents a novel approach to optimizing Grover’s algorithm for addressing the routing problem in quantum wireless communication networks. We begin by conducting a comprehensive analysis of key quantum communication technologies, including quantum teleportation and quantum entanglement swapping, and subsequently construct a quantum wireless communication network model grounded in these principles. Building on this foundation, we design and implement a multi-level quantum wireless network information transmission mechanism, incorporating quantum channels for identity authentication to ensure secure communication. Focusing on the routing challenges in quantum wireless communication networks, we propose innovative applications and optimizations of Grover’s quantum search algorithm. Specifically, we introduce an improved algorithm that efficiently searches for routing paths with maximal metrics within a limited number of hops. This enhancement not only significantly increases routing efficiency but also mitigates the risk of quantum channel disconnection caused by the depletion of entangled quantum pairs, thereby improving the overall success rate of communication. Simulation and experimental results demonstrate that the proposed optimization algorithm substantially enhances the routing performance of quantum wireless communication networks while maintaining robust security measures. This study offers a new solution to the routing challenges in quantum wireless communication networks and significantly optimizes Grover’s algorithm, contributing to the development of more efficient and reliable quantum communication networks.
In recent years, quantum communication networks have emerged as a promising alternative to classical communication networks for the transmission of quantum information. One of the challenges for achieving optimal performance in quantum communication networks is the efficient routing of quantum signals across multiple paths. To address this, a variety of routing protocols have been proposed, including multi-path routing protocols. Multi-path routing involves sending a quantum signal through multiple distinct paths simultaneously to reduce delays in the transmission of quantum information. By distributing the quantum information over multiple paths, this approach can provide significant performance improvements, including reduced latency and higher throughput. In addition, multi-path routing can enable new possibilities for the security of quantum communication networks, such as more secure entanglement swapping protocols and improved protection against eavesdropping. In this paper, we investigate the performance of multi-path routing protocols in multi-node quantum communication networks. We consider two approaches to multi-path routing, a basic routing approach based on shortest path optimization, and a more advanced approach based on graph partitions. We evaluate the performance of these protocols in a range of multi-node networks, with focus on the trade-off between latency and throughput. The results show that multi-path routing yields significant performance improvements in such networks and provides an efficient way for routing quantum signals across multiple paths.
Quantum network can provide end-to-end entanglements through quantum operations, supporting various quantum applications such as quantum key distribution and distributed quantum computing. However, many previous proposals for quantum networks assumed the division of quantum network into time slots and batch processing of network communication tasks, performing poorly in dynamic network scenarios and not fully utilizing network resources. This work focuses on the routing problem in entanglement quantum networks, aiming to provide more efficient end-to-end entanglement establishment for upper-layer applications. We propose an on-demand routing algorithm that dynamically adjusts the optimal path based on the current network conditions. Specifically, we consider the benefits of path width for quantum networks and propose an algorithm for finding the shortest wide path. Using this algorithm, each node establishes its own routing table. Additionally, to dynamically avoid network hotspots, we introduce the concept of traffic to reflect the busyness of nodes. Finally, using a dynamic cost calculation method as the routing metric, we select the optimal path for the current request. To evaluate the performance of the proposed quantum routing algorithm, we conducted simulation experiments on SimQN quantum simulation platform. The results show that our approach improves network throughput by 14 percent compared to existing solutions.
In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading performance and slow convergence rate, for basic Dynamic Source Routing (DSR), propose a new routing model based on improved Grover’s searching algorithm. In this paper, a hybrid approach that combines quantum walks with Grover search is proposed so that the search is accelerated and optimum is found with fewer numbers of iterations. By taking advantage of quantum tunneling effect, local barriers are overcome and better threshold values can be found, especially at the early stage of search process. The new algorithm based on the formalism of continuous-time quantum walk is demonstrated. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using improved Grover’s algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. The results between the new algorithm and the state-of-the-art Grover search method are also compared.