Constrained Stochastic Games in Wireless Networks

Altaian, E.; Avratchenkov, K.; Bonneau, Nicolas; Debbah, Mérouane; El-Azouzi, Rachid; Menasché, Daniel Sadoc

doi:10.1109/glocom.2007.66

Cited by 37 publications

(37 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In summary, non-cooperative games are quite useful in formulating decentralized DTPC problems but finding the Nash Equilibrium in an error-prone wireless system is NP-hard [34]. Though cooperative games have been proposed, voluntary actions taken by an IDM in order to favour others, is difficult to motivate in real life [43].…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Power Control for Wireless Backbone Mesh Networks: a Survey

Olwal¹,

Wyk²,

Ntlatlapa³

et al. 2010

NPA

View full text Add to dashboard Cite

With the tremendous growth of wireless networks into the next generation to provide better services, Wireless Mesh Networks (WMNs) have emerged to offer ubiquitous communication and seamless broadband applications. WMNs are hybrid networks composed of a mixture of static Wireless Mesh Routers (WMRs) and mobile Wireless Mesh Clients (WMCs) interconnected via wireless links to form a multi-hop wireless Ad Hoc network (WANET). WMNs are self-organized, self-configured, and reliable against single points of failures, and robust against RF interference, obstacles or power outage. This is because WMRs forming wireless backbone mesh networks (WBMNs) are built on advanced physical technologies. Such nodes perform both accessing and forwarding functionality. They are expected to carry huge volumes of traffic and be "on power" at all times. While trying to increase network capacity, problems of the dynamic transmission power control (DTPC) arise in such networks. Such problems include RF Interference, Connectivity and energy-depletion. While there are numerous studies on this topic, contributions in the context of WBMNs are still challenging but interesting research areas. This paper provides an overview of the DTPC algorithms central to the WBMNs framework. The open issues are also highlighted.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Altman et al, [34] have considered the situation where N nodes share a common access point. With each node there is an associated buffer and channel state that change in time.…”

Section: Cooperative Game Based Algorithmsmentioning

confidence: 99%

Dynamic Power Control for Wireless Backbone Mesh Networks: a Survey

Olwal¹,

Wyk²,

Ntlatlapa³

et al. 2010

NPA

View full text Add to dashboard Cite

show abstract

“…[1] and references therein) and can be effectively exploited also in interference networks [2], [3].…”

Section: Introductionmentioning

confidence: 98%

Low complexity cross-layer design for dense interference networks

Akbarzadeh

Cottatellucci

Bonnet

2009

2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks

View full text Add to dashboard Cite

We considered a dense interference network with a large number (K -----+ (0) of transmitter-receiver pairs. Each transmitter is endowed with a finite buffer and accepts packets from an arrival process. Each transmitter-receiver link is a fading vector channel with N diversity paths whose statistics are described by a Markov chain. We investigate distributed algorithms for joint admission control, rate and power allocation aiming at maximizing the individual throughput defined as the average information rate successfully received. The decisions are based on the statistical knowledge of the channel and buffer states of the other communication pairs and on the exact knowledge of their own channel and buffer states. In the case of a finite number of communication pairs this problem is computationally extremely intensive with an exponential complexity in the number of users. Assuming that K, N -----+ 00 with constant ratio the algorithm complexity becomes substantially independent of the number of active communications and grows with the groups of users having distinct asym ptotic channel statistics. The crosslayer design is investigated for different kind of decoders at the receiver. The benefits of a cross layer approach com pared to a resource allocation ignoring the states of the queues are assessed. The performance loss due to the use of policies designed for asym ptotic conditions and applied to networks with a finite number of active communications is studied.

show abstract

“…A strategy q is said to be ESS if for every p = q there exists some y > 0 such that (1) holds for all ∈ (0, y ).…”

Section: Reminder On (Standard) Evolu-tionary Games (Eg)mentioning

confidence: 99%

“…The transition probabilities of a player's MDP are only controlled by that player. The local interactions between players can be viewed as a costcoupled stochastic game [1,2] which suggests the sufficiency of stationary strategies.…”

Section: Introductionmentioning

confidence: 99%

Markov Decision Evolutionary Games

Altman

Hayel

2010

IEEE Trans. Automat. Contr.

Self Cite

View full text Add to dashboard Cite

We present a class of evolutionary games involving large populations that have many pairwise interactions between randomly selected players. The fitness of a player depends not only on the actions chosen in the interaction but also on the individual state of the players. Players stay permanently in the system and participate infinitely often in local interactions with other randomly selected players. The actions taken by a player determine not only the immediate fitness but also the transition probabilities to its next individual state. We define and characterize the Evolutionary Stable Strategies (ESS) for these games and propose a method to compute them.

show abstract

Constrained Stochastic Games in Wireless Networks

Cited by 37 publications

References 11 publications

Dynamic Power Control for Wireless Backbone Mesh Networks: a Survey

Dynamic Power Control for Wireless Backbone Mesh Networks: a Survey

Low complexity cross-layer design for dense interference networks

Markov Decision Evolutionary Games

Contact Info

Product

Resources

About