计算机应用研究2018，Vol.35Issue(1)：213-216,236,5.DOI:10.3969/j.issn.1001-3695.2018.01.045
一种消除传感网路由布雷斯悖论现象的算法
Algorithm to delete Braess paradox in routing protocols of WSN
摘要
Abstract
Braess paradox reduced the efficiency of game theory based routing in wireless sensor networks(WSN).However,previous approaches have ignored the study of this problem.This paper analyzed the effect of Braess paradox on WSN,and further proposed DBPX:an algorithm to delete Braess paradox in WSN routing.DBPX included the network model of Braess topology,the definition of minimum game unit,process of discover a Braess paradox through route historical information and heuristic rules to optimize transmission mode of the whole network.The algorithm started from all minimum game units and extended to the whole network in the end.Simulation shows that,DBPX can accurately find and eliminate Braess paradox in the network,improve route efficiency and network throughput.关键词
无线传感器网络/路由协议/效用函数/布雷斯悖论/博弈论Key words
wireless sensor network(WSN)/routing protocol/utility function/Braess paradox/game theory分类
信息技术与安全科学引用本文复制引用
洪璐,张彭,赵艳杰..一种消除传感网路由布雷斯悖论现象的算法[J].计算机应用研究,2018,35(1):213-216,236,5.基金项目
国家自然科学基金资助项目(61471269) （61471269）
