This paper puts forward a routing algorithm based on Grover searching theory for MANET. It first gives the Grover searching theory and the construction way of probability branch matrix and solution path matrix which are suitable for MANET. And then, on this basis, define probability computation equation to compute each node's probability. Select nodes with high probability to transmit datagram to reduce computation quantity in networks and make the routing converge quickly.
展开▼