Distributed Communication Control Mechanisms for Ad Hoc Networks

Akbarzadeh, Sara; Cottatellucci, Laura; Altman, Eitan; Bonnet, Christian

doi:10.1109/icc.2009.5198923

Cited by 5 publications

(11 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Following the same approach as in [3] we define two sets of discrete variables representing states and actions of each transmitter.…”

Section: System Modelmentioning

confidence: 99%

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

Section: Introductionmentioning

confidence: 98%

“…Then, a transmitter can avoid outage events by convenient control algorithms. Secondly, the complexity of the cross layer design algorithms, which increases exponentially with the number of users in [3], scales only with the number of groups of users characterized by the same channel statistics in large systems.…”

Section: Introductionmentioning

confidence: 99%

“…Additionally, they assume slow varying channels. Constrained stochastic games have been applied to decentralized cross layer design for multiple access [2] and interference channels [3]. By assuming statistical knowledge of the channels and the service request processes, constrained stochastic games can be applied to system with fast varying dynamics.…”

Section: Introductionmentioning

confidence: 99%

“…[14], [15], [16]). We extend the results to interference channels and apply them to the design and analysis of distributed cross layer algorithms in large interference networks 1. The assumption of large system analysis introduces two fundamental features into the system setting in [3] characterized by a discrete set of decision variables and a discrete set of channel statistics. Firstly, in an interference system with finite number of users and decentralized control mechanisms, a transmission is intrinsically subject to outage since each transmitter is not aware of the interferers' decisions and effects.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

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

Self Cite

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

“…Following the same approach as in [3] we define two sets of discrete variables representing states and actions of each transmitter.…”

Section: System Modelmentioning

confidence: 99%

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

Section: Introductionmentioning

confidence: 98%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%