检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《东北大学学报(自然科学版)》2014年第5期659-662,共4页Journal of Northeastern University(Natural Science)
基 金:中央高校基本科研业务费专项资金资助项目(N110323007);河南省自然科学基金资助项目(F2014501082)
摘 要:为了在无线自组织网络中建立可用性和连续性更高的路由,路由发现过程中需要重复广播更多的路由请求(PREQ)分组,从而造成路由开销的明显增加,并严重制约了网络的可扩展性.针对以上问题,利用混合策略博弈对PREQ分组的转发过程进行建模,提出了一种基于混合策略博弈的路由开销控制算法,该算法在收到同一PREQ广播的邻居节点间进行博弈并由此决定各自转发PREQ的概率,在满足概率的情况下才可以继续广播收到的PREQ.仿真结果表明,提出的算法能够显著地减少路由开销,同时提高网络的整体性能.To increase the availability and the continuity of routes, nodes need to rebroadcast more RREQ packets during route discovery, hence routing overhead is increased and network scalability is limited. To release afore mentioned problem, the mix strategy game was used to model the rebroadcast of RREQ packets, then a mix strategy game-based routing overhead control algorithm was proposed. The algorithm received the same PREQ between neighboring nodes broadcast the game and thus the probability of each forwarded PREQ could be determined before they could continue to receive broadcast probability in the case of PREQ meet. The simulation results showed that the routing overhead could be reduced obviously, and the overall performance of network could be improved by the proposed routing overhead control algorithm.
关 键 词:无线自组织网络 路由开销控制 建模 混合策略博弈 仿真
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15