Channel-Change Games for Highly Interfering Spectrum-Agile Wireless Networks

Wendorf, Roli G.; Blum, Howard

doi:10.1109/iswpc.2007.342676

Cited by 4 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Stankovicacute et al [ 98 ] considered the problem of distributed convergence to a NE based on minimal information about the underlying non-cooperative game. Interference problems for spectrum-agile networks were addressed by allowing the networks to dynamically change channel in literature [ 99 ]. For insight into dynamic channel-change strategies, authors modeled the networks as autonomous players in a multistage non-cooperative game-theoretic model.…”

Section: Typical Categories Of Game Theorymentioning

confidence: 99%

Game Theory for Wireless Sensor Networks: A Survey

Shi

Wang

Kwok

et al. 2012

Sensors

208

111

View full text Add to dashboard Cite

Game theory (GT) is a mathematical method that describes the phenomenon of conflict and cooperation between intelligent rational decision-makers. In particular, the theory has been proven very useful in the design of wireless sensor networks (WSNs). This article surveys the recent developments and findings of GT, its applications in WSNs, and provides the community a general view of this vibrant research area. We first introduce the typical formulation of GT in the WSN application domain. The roles of GT are described that include routing protocol design, topology control, power control and energy saving, packet forwarding, data collection, spectrum allocation, bandwidth allocation, quality of service control, coverage optimization, WSN security, and other sensor management tasks. Then, three variations of game theory are described, namely, the cooperative, non-cooperative, and repeated schemes. Finally, existing problems and future trends are identified for researchers and engineers in the field.

show abstract

Section: Typical Categories Of Game Theorymentioning

confidence: 99%

Game Theory for Wireless Sensor Networks: A Survey

Shi

Wang

Kwok

et al. 2012

Sensors

208

111

View full text Add to dashboard Cite

show abstract

“…In DFS each radio transmits only over a single channel and always at the maximum power. The analysis in [25,27] 1 Table 1.2: Game matrix for the DFS game [25] The authors of [25,27] do not link the strategies S and C to the channel being used and the channel to be used. Therefore, players randomly change to another channel.…”

Section: Repeated Gamesmentioning

confidence: 99%

“…Thus, the case of two players with two channels is the worse scenario in terms of probability of overlapping. Assuming a game with two channels and a certain probability (say ρ) that a user changes its channel, the authors of [25,27] derived the solution of the game in terms of such probability. They provide the optimal probability ρ * a user should adopt during the stages of the game.…”

Section: Repeated Gamesmentioning

confidence: 99%

“…Exploiting the fact that the game is infinitely repeated, an improvement based on the assumption that if a Pareto optimal strategy p This punishment policy can be seen as certain coordination between the players to improve the global performance (cooperative approach). It should be noted that no additional signaling is required once the players have set up their agreement.Other application of repeated games to OSA is presented by Wendorf et al in[25,27]. Therein, the problem of dynamic frequency selection (DFS), typical from IEEE 802.11 networks is studied.…”

mentioning

confidence: 99%

See 1 more Smart Citation