Game Theory Applications in CSMA Methods

Ghazvini, Mahdieh; Movahedinia, Naser; Jamshidi, Kamal; Moghim, Neda

doi:10.1109/surv.2012.111412.00167

Cited by 47 publications

(35 citation statements)

References 83 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The expected payoff provided by NE and CE is the same, following the expression in (11), as shown in Reference [8].…”

Section: Correlated Equilibrium Conceptmentioning

confidence: 93%

“…An option to study these attacks consists in using game theory tools, which find many applications in the wireless networks field [9] and is a popular choice when it comes to multiple access attacks. In Reference [10], there is a survey on game theory approaches to multiple access situations in wireless networks and Reference [11] contains another survey more concretely focused on CSMA. Other works studying wireless networks under backoff attacks are References [12][13][14].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Repeated Game Analysis of a CSMA/CA Network under a Backoff Attack

Parras

Zazo

2019

Sensors

View full text Add to dashboard Cite

We study a CSMA/CA (Carrier Sense Medium Access with Collision Avoidance) wireless network where some stations deviate from the defined contention mechanism. By using Bianchi’s model, we study how this deviation impacts the network throughput and show that the fairness of the network is seriously affected, as the stations that deviate achieve a larger share of the resources than the rest of stations. Previously, we modeled this situation using a static game and now, we use repeated games, which, by means of the Folk theorem, allow all players to have better outcomes. We provide analytical solutions to this game for the two player case using subgame perfect and correlated equilibria concepts. We also propose a distributed algorithm based on communicating candidate equilibrium points for learning the equilibria of this game for an arbitrary number of players. We validate approach using numerical simulations, which allows comparing the solutions we propose and discussing the advantages of using each of the methods we propose.

show abstract

“…The expected payoff provided by NE and CE is the same, following the expression in (11), as shown in Reference [8].…”

Section: Correlated Equilibrium Conceptmentioning

confidence: 93%

Section: Introductionmentioning

confidence: 99%

Repeated Game Analysis of a CSMA/CA Network under a Backoff Attack

Parras

Zazo

2019

Sensors

View full text Add to dashboard Cite

show abstract

“…We have found a significant number of contributions applying GT in wireless networks. A lot of this work reviews scenarios of single-hop access [101], namely: network-layered perspective [102]; multiple access [103]; random carrier sense multiple access [104]; radio resource management and admission control [105]; repeated games [23]; reputation-based network selection [47]; evolutionary games [35]; uplink resource allocation [106]; and network selection [107]. In addition, we have found related work with multi-hop wireless access such as ad hoc networks [108] and games to stimulate cooperation [52].…”

Section: Review Of Theoretical Model Gamesmentioning

confidence: 99%

Game Theory for Multi-Access Edge Computing: Survey, Use Cases, and Future Trends

Moura

Hutchison

2019

IEEE Commun. Surv. Tutorials

182

108

View full text Add to dashboard Cite

Game Theory (GT) has been used with significant success to formulate, and either design or optimize, the operation of many representative communications and networking scenarios. The games in these scenarios involve, as usual, diverse players with conflicting goals. This paper primarily surveys the literature that has applied theoretical games to wireless networks, emphasizing use cases of upcoming Multi-Access Edge Computing (MEC). MEC is relatively new and offers cloud services at the network periphery, aiming to reduce service latency backhaul load, and enhance relevant operational aspects such as Quality of Experience or security. Our presentation of GT is focused on the major challenges imposed by MEC services over the wireless resources. The survey is divided into classical and evolutionary games. Then, our discussion proceeds to more specific aspects which have a considerable impact on the game's usefulness, namely: rational vs. evolving strategies, cooperation among players, available game information, the way the game is played (single turn, repeated), the game's model evaluation, and how the model results can be applied for both optimizing resource-constrained resources and balancing diverse trade-offs in real edge networking scenarios. Finally, we reflect on lessons learned, highlighting future trends and research directions for applying theoretical model games in upcoming MEC services, considering both network design issues and usage scenarios.

show abstract

“…Therefore, the max-log-likelihood problem below is a convex optimization problem with r as the variables to be solved and θ as the parameters: max r F ( r; θ ) (Maximize log-likelihood). (15) It is then shown in [11] that the max-log-likelihood problem in (15) is the dual problem of the max-entropy problem in (16), where − s∈S p s log e p s is the entropy of the distribution vector − → p , whose element p s is the state probability for the state s, ∀ s ∈ S. The max-entropy problem is also a convex optimization problem, with − → p as the variables and θ as the parameters.…”

Section: B Transmission Aggressivenessmentioning

confidence: 99%

“…Since all the constraints in (16) are linear equalities and inequalities, we only need to verify that there exists a feasible − → p in the relative interior [24, pp. 23] of the domain D of the objective…”

Section: B Transmission Aggressivenessmentioning

confidence: 99%

A Stackelberg Game Model for Overlay D2D Transmission With Heterogeneous Rate Requirements

Lyu¹,

Chew²,

Wong³

2016

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

This paper studies the performance of overlay device-to-device (D2D) communication links via carrier sense multiple access (CSMA) protocols. We assume that the D2D links have heterogeneous rate requirements and different willingness to pay, and each of them acts non-altruistically to achieve its target rate while maximizing its own payoff. Spatial reuse is allowed if the links are not interfering with each other. A non-cooperative game model is used to address the resource allocation among the D2D links, at the same time leveraging on the ideal CSMA network (ICN) model to address the physical channel access issue. We propose a Stackelberg game in which the base station in the cellular network acts as a Stackelberg leader to regulate the individual payoff by modifying the unit service price so that the total D2D throughput is maximized. The problem is shown to be quasi-convex and can be solved by a sequence of equivalent convex optimization problems. The pricing strategies are designed so that the network always operates within the feasible throughput region. The results are verified by simulations.

show abstract

Game Theory Applications in CSMA Methods

Cited by 47 publications

References 83 publications

Repeated Game Analysis of a CSMA/CA Network under a Backoff Attack

Repeated Game Analysis of a CSMA/CA Network under a Backoff Attack

Game Theory for Multi-Access Edge Computing: Survey, Use Cases, and Future Trends

A Stackelberg Game Model for Overlay D2D Transmission With Heterogeneous Rate Requirements

Contact Info

Product

Resources

About