.png){kind=icon}
返回
Distributed Lifetime-Maximized Target Coverage Game
.png){kind=icon}
PRE
AI
DOI：10.1145/2489253.2489263.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Wireless sensor nodes are usually densely deployed to completely cover (monitor) a set of targets. Consequently, redundant sensor nodes that are not currently needed in the covering task can be powered off to conserve energy. These sensors can take over the covering task later to prolong network lifetime. The coverage problem, concerns picking up a set of working sensors that collectively meet the coverage requirements. The problem is complicated by the possibility that targets may have different coverage requirements while sensor nodes may have different amounts of energy. This article proposes a game-theoretic approach to the coverage problem, where each sensor autonomously decides its state with a simple rule based on local information. We give rigorous proofs to show stability, correctness, and efficiency of the proposed game. Implementation variants of the game consider specific issues, such as game convergence time and different amounts of sensor energy. Simulation results show significant improvement in network lifetime by the proposed approach when compared with representative alternatives.
Keyword:
Design
Algorithms
Theory
Coverage
energy management
game theory
network protocols
wireless sensor networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.7
论文数:
1.0K
被引数:
2.0K
机构
引用论文
.png){kind=icon}
Fair multiuser channel allocation for OFDMA networks using nash bargaining solutions and coalitions
PREAI
分享收藏
查看更多内容