Optimality and Complexity of Pure Nash Equilibria in the Coverage Game

In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goal is to partition these nodes into K sets. At any given time, nodes belonging to only one of these sets actively sense t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE journal on selected areas in communications Jg. 26; H. 7; S. 1170 - 1182
Hauptverfasser:	Xin Ai, Srinivasan, V., Chen-khong Tham
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.09.2008 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithm design and analysis Computational modeling Convergence coverage Game theory Nash equilibrium Partitioning algorithms Scattering Search problems Studies Wireless sensor networks Working environment noise
ISSN:	0733-8716, 1558-0008
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!