基于Grover搜索思想的无线自组网络路由算法研究  

Research on Routing Algorithm for Mobile Ad Hoc Networks Based on Grover Searching Theory

作　　者：孟利民[1,2] 周凯[1,2] 沈鑫宇[1,2] 徐志江[1,2] 

机构地区：[1]浙江工业大学信息学院,杭州310032 [2]浙江省光纤通信技术重点研究实验室,杭州310032

出　　处：《传感技术学报》2010年第2期251-255,共5页Chinese Journal of Sensors and Actuators

基　　金：国家自然科学基金项目资助(60872020)

摘　　要：无线自组网络是近年来无线网络研究的热点领域,路由算法设计作为无线自组网络的核心层技术而备受关注。在深入分析已有算法存在的诸多不足的基础上,本文提出了一种基于Grover搜索思想的无线自组网络路由算法。该算法首先分析了Grover算法的原理,给出了适合无线自组网络的概率扩散矩阵和解径矩阵的构造方式,然后在此基础上定义了概率计算公式计算每个节点的概率,通过选择高概率节点进行数据转发,从而减少网络计算量,使得路由尽快收敛。仿真结果表明:相比经典的DSR路由协议,该算法得到的路由跳数性能上接近最短跳数,但是建立路由过程中转发节点个数得以大大降低。Ad Hoc networks is recently a hot spot in wireless network researching domain.The design of routing algorithm,which is as the core layer technology in Ad Hoc networks,has drawn great concern.After analyzing the drawbacks of the existing algorithms,this paper puts forward a routing algorithm based on the idea of quantum Grover algorithm.First,this paper explains the principle of Grover algorithm,and gives the way to construct probability branch matrix and solution-path matrix which are fit for Ad Hoc networks.On that basis,it defines probability computational formula to compute the probability of each node.In the process of routing searching,we select nodes with high probability to forward data packets.Results of simulation show that comparing with DSR,performance of routing hops simulated with this algorithm is close to the minimum number of hops,while,number of relay nodes is reduced significantly in the process of routing setup.

关 键 词：无线自组网络 Grover搜索思想 扩散矩阵 高概率节点 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]