.png){kind=icon}
.png){kind=icon}
Return
Distributed Lifetime-Maximized Target Coverage Game
.png){kind=icon}
PRE
AI
DOI：10.1145/2489253.2489263.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Design
Algorithms
Theory
Coverage
energy management
game theory
network protocols
wireless sensor networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.7
Papers:
995
Citations:
2.0K