面向博弈的无线传感器网络自适应路由算法  

Game-oriented Adaptive Routing Algorithm in Wireless Sensor Network

作　　者：杨云[1] 孔秀平[1] 颜然[1] 徐文春[1] 杨安驹 

机构地区：[1]扬州大学信息工程学院,江苏扬州225009

出　　处：《小型微型计算机系统》2013年第10期2281-2285,共5页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(610702101/F020801)资助;江苏省自然科学基金项目(BK2010683)资助

摘　　要：在无线传感器网络聚簇路由算法基础上,提出了一种面向博弈的自适应路由优化算法.网络中以总体通信能耗最小和延长个体寿命为首要原则,建立源簇到基站的路径;簇首之间相互通信时,在直接、中继以及协作通信方式中,自适应选择路径策略;在路由建立过程中,引入基于博弈论的路由选择算法和路由转发算法,通过两两博弈找出最可靠的下一跳节点,自组织地建立可靠有效的路由路径.仿真实验表明,所提出的路由算法能有效减少通信能耗,延长网络生命周期.On the basis of conventional clustering routing algorithm, a Game-oriented algorithm is proposed for adaptively optimizing the routing in wireless sensor network. In this network, the routing path is built from source cluster to base station according to the primary principles of both minimizing the overall energy consumption and prolonging individual life span. The communication mode between cluster heads can be self-adaptively selected among the direct, relaying and collaborative ways. During the routing process, routing selection and routing forwarding algorithms are introduced so that our algorithm cannot only identify the most reliable next-hop node through pairwise game but also adaptively select the most energy-efficient means of communication. Simulation results show that the proposed routing algorithm can effectively reduce communication energy consumption and prolong network lifetime.

关 键 词：传感器网络 节能 簇间通信 路由 博弈 

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