No regret learning for sensor relocation in mobile sensor networks

Authors:
Jin Li;Chi Zhang;Wei Yi Liu;Kun Yue
Affiliations:
School of Information Science, Yunnan University, Kunming, China;School of Software, Yunnan University, Kunming, China;School of Information Science, Yunnan University, Kunming, China;School of Information Science, Yunnan University, Kunming, China
Venue:
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Year:
2011

Citing 5
Cited 0

Strategies and techniques for node placement in wireless sensor networks: A survey

Ad Hoc Networks
Review: Coverage and connectivity issues in wireless sensor networks: A survey

Pervasive and Mobile Computing
Efficient no-regret multiagent learning

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Mobile sensor deployment in unknown fields

INFOCOM'10 Proceedings of the 29th conference on Information communications
Optimizing sensor movement planning for energy efficiency

ACM Transactions on Sensor Networks (TOSN)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.