2011 | OriginalPaper | Buchkapitel
No Regret Learning for Sensor Relocation in Mobile Sensor Networks
verfasst von : Jin Li, Chi Zhang, Wei Yi Liu, Kun Yue
Erschienen in: Information Computing and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Sensor relocation is a critical issue because it affects the coverage quality and capability of a mobile sensor network. In this paper, the problem of sensor relocation is formulated as a repeated multi-player game. At each step of repeated interactions, each node uses a distributed no-regret algorithm to optimize its own coverage while minimizing the locomotion energy consumption. We prove that if all nodes adhere to this algorithm to play the game, collective behavior converges to a pure Nash equilibrium. Simulation results show that a good coverage performance can be obtained when a pure Nash equilibrium is achieved.