Low complexity cross-layer design for dense interference networks

Abstract

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.

Admission control in wireless ad hoc networks: a survey

“…In [28], the authors investigated distributed algorithms for joint admission control, rate, and power allocation aiming at maximizing the flow's throughput. The admission decision is based on statistical knowledge of the channel and buffer states of communication pairs and on the exact knowledge of their own channel and buffer states.…”

“…As our detailed survey showed, some AC models (e.g., [12], CMC, IFCAC, StAC, DACME, [28]) are decoupled from routing schemes; they suppose that a route for a requesting flow has already been discovered, and their main task is to evaluate the route's fitness for supporting the flow's requirements. Thus, they are totally free from the routing scheme deployed in the network.…”

“…Note that almost all earlier routing-coupled and routing-decoupled AC models are based on DCF, for example, IFCAC, PAC, HRAC, StAC, CACP, ACSCQS, MACMAN, AAC, etc. On the other hand, the AC models which are decoupled from the MAC layer (e.g., RFAR, SWAN, FuzzyQoS, [12,28]) can utilize only information of the network layer; this leads to a simpler interaction with different MAC technologies without need to a complex cross-layer design, but at the expense of false admission issue ( Table 2).…”