The Research Of Routing Algorithm Based On Wireless Ad Hoc Quantum Communication Network

In recent years, the research of quantum communication network develops rapidly. So far, there are a lot of quantum communication networks have been built in our country and abroad. The field of research is not only wired network, but also wireless quantum communication network. Wireless ad hoc quantum communication network is a new concept put forward in 2012. Nodes in the network are mobile quantum devices that can also communicate with radio. Each of the nodes has equal status, freedom to move. Which connecting the nodes are quantum channel and wireless channel. The quantum channel is used to transfer quantum state which carrying information. As auxiliary channel, the wireless channel transmits measured results of Bell-state.The wireless ad hoc quantum communication network is similar to classic ad hoc network in topology, but in communication it uses quantum teleportation to transfer information. In the network, we can’t use routing algorithm for classic ad hoc network directly, because of the feature of quantum communication. It needs a routing algorithm which is designed for its feature reasonably.The routing algorithm based on AODV of wireless ad hoc quantum communication network evolved from classic AODV routing protocol. Different from algorithm of classic ad hoc network, this routing algorithm makes the number of entangled quantum pairs as routing metric. When there are several routing paths to choose, the algorithm would pick the one which has most entangled quantum pairs. Through simulation and analysis, we find this algorithm simple, easy to use and has high success rate. But there are too many nodes taking part in forwarding route request messages, and the path’s number of entangled quantum pairs is small. This algorithm needs to improve.For the disadvantages of routing algorithm based on AODV of wireless ad hoc quantum communication network, this paper proposes a new routing algorithm based on Grover of wireless ad hoc quantum communication network. This algorithm uses the searching thought of Grover in looking for destination node. The algorithm makes the number of entangled quantum pairs and the distance between nodes as constraint to expand the probability of target path and narrow the probability of other paths. After these operations, the algorithm would pick the next nodes with high probability to forwarding messages. This operation reduces the number of nodes participating in forwarding messages successfully and improves the number of entangled quantum pairs of the routing path. Through simulation and analysis, we find this algorithm can work well and stably when the network being expanded and some nodes failed...