一种面向无线传感器网络数据融合的路由联盟博弈方法

A routing coalition game approach for data fusion in wireless sensor networks

在无线传感器网络为数据融合进行路由选择的过程中,减少电量消耗是一项重要的工作.由于节点对电量自私性保护,导致不会向其它节点转发数据,并且各个节点的电量消耗不均匀.这使得整个网络的性能和寿命受限.基于联盟博弈理论,对支持联盟博弈的W SN进行建模.使用特征函数描述联盟内节点发送数据过程中的收益和成本开销.针对大规模可能的解空间,基于特征函数并应用贪心策略算法搜索近似最优联盟结构,并得出结论该算法所得到的近似解在可接受的误差范围.实验结果表明,提出的路由联盟博弈模型能较大限度地延长W SN的工作寿命.

In the process of routing for data fusion in the wireless sensor network（WSN）,it is necessary to minimize energy consumption.Due to the selfishness of node for conserving energy,it is likely to make every node refuse to transmit others data and energy consumption unevenly.In this case,the performance and lifetime of WSN is restricted.Based on the coalition game theory,we give an approach for modeling the above problem.We adopt the characteristic function to describe the gain and cost from a coalition.Then,we design a greedy algorithm to search the sub-optimal coalition structure in a large-scale solution space,and conclude that the solution is acceptable with a scope of errors.Experimental results show that the proposed can be well used to prolong the WSN lifetime.