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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE journal on selected areas in communications Ročník 26; číslo 7; s. 1170 - 1182
Hlavní autori:	Xin Ai, Srinivasan, V., Chen-khong Tham
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.09.2008 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!