Research on routing algorithm for MANET based on Grover searching theory

Mobile Ad Hoc Networks (MANET) is a kind of network in which all the nodes can move randomly. As a new wireless communication network, MANET has attracted broad attention in recent years. But traditional distributed routing algorithm, which focuses on nodes, is complicated and huge in computation quantity, causes decline in performance of real-timing, throughput, ETE delay, network QoS, and etc. So, this routing algorithm is not suitable for MANET. Thus seeking a new MANET routing algorithm is of great significance for the research of MANET.