-
在实际的应用中, 无线传感器网络常常由大量电池资源有限的传感器节点组成. 如何降低网络功耗, 最大化网络生存时间, 是传感器网络拓扑控制技术的重要研究目标. 随着传感节点的运行, 节点的能量分布可能越来越不均衡, 需要在考虑该因素的情况下, 动态地调整节点的网络负载以均衡节点的能耗, 达到延长网络生存时间的目的. 该文引入博弈理论和势博弈的概念, 综合考虑节点的剩余能量和节点发射功率等因素, 设计了一种基于势博弈的拓扑控制模型, 并证明了该模型纳什均衡的存在性. 通过构造兼顾节点连通性和能耗均衡性的收益函数, 以确保降低节点功耗的同时维持网络的连通性. 通过提高邻居节点的平均剩余能量值以实现将剩余能量多的节点选择作为自身的邻居节点, 提高节点能耗的均衡性. 在此基础上, 提出了一种分布式的能耗均衡拓扑控制算法. 理论分析证明了该算法能保持网络的连通性. 与现有基于博弈理论的DIA算法和MLPT算法相比, 本算法形成的拓扑负载较重、剩余能量较小的瓶颈节点数量较少, 节点剩余能量的方差较小, 网络生存时间更长.In real-world applications, wireless sensor networks often consist of a large number of sensor nodes with constraint battery resources. How to reduce the power consumption of sensor nodes and maximize the network life, becomes the most important goal of topology control schemes in wireless sensor networks. During the operation of networks, sensor nodes may spend different levels of energy, and result in the uneven distribution of residual energy of sensor nodes. In order to extend the network life, it is essential to adjust the network burden of sensor nodes dynamically, so as to achieve energy balance among nodes under the consideration of different energy levels at nodes. In this paper, we introduce the game theory and the concept of game potential. By synthetically considering the factors of the residual energy and transmission power of nodes, a potential game based mathematical model of topology control is constructed. We prove the existence of Nash equilibrium. Through designing a payoff function, which takes into account both network connectivity and energy balance of nodes, the connectivity of sensor networks can be maintained while the power of sensor nodes is reduced. By increasing the average value of residual energy of neighbors, it enables to select nodes with more energy that reserves in neighborhood as neighbors, to improve the energy balance among nodes. Based on that, a distributed energy-balanced topology control algorithm (DEBA) is proposed. Theoretical analysis proves that the algorithm can maintain network connectivity. Compared with other existing game theory based algorithms DIA and MLPT, the topologies formed by the proposed algorithm have fewer bottleneck nodes which feature heavy traffic load and low residual energy, and smaller variance of node residual energy, thus achieving a longer life.
[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] -
[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25]
计量
- 文章访问数:8286
- PDF下载量:352
- 被引次数:0