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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Younisa, M., Akkaya, K.: Strategies and techniques for node placement in wireless sensor networks: A survey. Journal Ad Hoc Networks Archive 6(4) (June 2008)
Bartolini, N., Calamoneri, T., La Porta, T., Massini, A., Silvestri, S.: Autonomous deployment of heterogeneous mobile sensors. In: ICNP 2009, pp. 42–51 (2009)
Ghosh, A., Das, S.K.: Coverage and connectivity issues in wireless sensor networks: A survey. Pervasive and Mobile Computing 4(3), 303–334 (2008)
Bartolini, N., Calamoneri, T., La Porta, T.F., Silvestri, S.: Mobile Sensor Deployment in Unknown Fields. In: INFOCOM 2010, pp. 471–475 (2010)
Wang, G., Irwin, M.J., Fu, H., Berman, P., Zhang, W., La Porta, T.: Optimizing sensor movement planning for energy efficiency. TOSN 7(4), 33 (2011)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage Problems in Wireless Ad-hoc Sensor Networks. IEEE INFOCOM 3, 1380–1387 (2001)
Marden, J.R., Wierman, A.: Distributed welfare games with applications to sensor coverage. In: Proc. CDC, pp. 1708–1713 (2008)
Bai, X., Yun, Z., Xuan, D., Chen, B., Zhao, W.: Optimal Multiple-Coverage of Sensor Networks. In: Proc. of IEEE International Conference on Computer Communications (INFOCOM) (to appear, April 2011)
Wang, G., Cao, G., La Porta, T.F., Zhang, W.: Sensor relocation in mobile sensor networks. In: INFOCOM 2005, pp. 2302–2312 (2005)
Monderer, D., Shapley, L.S.: Potential games. Games and Economic Behavior 14, 124–143 (1996)
Banerjee, B., Peng, J.: Efficient No-Regret Multiagent Learning. In: AAAI 2005, pp. 41–46 (2005)
Greenwald, A., Jafari, A.: A General Class of No-Regret Algorithms and Game-Theoretic Equilibria. In: Proceedings of the 2003 Computational Learning Theory Conference, pp. 1–11 (August 2003)
Nash, J.F.: Equilibrium points in n-person games. Proc. of National Academy of Sciences 36, 48–49 (1950)
Fudenberg, D., Tirole, J.: Game Theory. MIT Press (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, J., Zhang, C., Liu, W.Y., Yue, K. (2011). No Regret Learning for Sensor Relocation in Mobile Sensor Networks. In: Liu, B., Chai, C. (eds) Information Computing and Applications. ICICA 2011. Lecture Notes in Computer Science, vol 7030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25255-6_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-25255-6_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25254-9
Online ISBN: 978-3-642-25255-6
eBook Packages: Computer ScienceComputer Science (R0)