818 research outputs found
A control theoretic approach to achieve proportional fairness in 802.11e EDCA WLANs
This paper considers proportional fairness amongst ACs in an EDCA WLAN for
provision of distinct QoS requirements and priority parameters. A detailed
theoretical analysis is provided to derive the optimal station attempt
probability which leads to a proportional fair allocation of station
throughputs. The desirable fairness can be achieved using a centralised
adaptive control approach. This approach is based on multivariable statespace
control theory and uses the Linear Quadratic Integral (LQI) controller to
periodically update CWmin till the optimal fair point of operation. Performance
evaluation demonstrates that the control approach has high accuracy performance
and fast convergence speed for general network scenarios. To our knowledge this
might be the first time that a closed-loop control system is designed for EDCA
WLANs to achieve proportional fairness
Proportional Fair MU-MIMO in 802.11 WLANs
We consider the proportional fair rate allocation in an 802.11 WLAN that
supports multi-user MIMO (MU-MIMO) transmission by one or more stations. We
characterise, for the first time, the proportional fair allocation of MU-MIMO
spatial streams and station transmission opportunities. While a number of
features carry over from the case without MU-MIMO, in general neither flows nor
stations need to be allocated equal airtime when MU-MIMO is available
Controlled Matching Game for Resource Allocation and User Association in WLANs
In multi-rate IEEE 802.11 WLANs, the traditional user association based on
the strongest received signal and the well known anomaly of the MAC protocol
can lead to overloaded Access Points (APs), and poor or heterogeneous
performance. Our goal is to propose an alternative game-theoretic approach for
association. We model the joint resource allocation and user association as a
matching game with complementarities and peer effects consisting of selfish
players solely interested in their individual throughputs. Using recent
game-theoretic results we first show that various resource sharing protocols
actually fall in the scope of the set of stability-inducing resource allocation
schemes. The game makes an extensive use of the Nash bargaining and some of its
related properties that allow to control the incentives of the players. We show
that the proposed mechanism can greatly improve the efficiency of 802.11 with
heterogeneous nodes and reduce the negative impact of peer effects such as its
MAC anomaly. The mechanism can be implemented as a virtual connectivity
management layer to achieve efficient APs-user associations without
modification of the MAC layer
CapEst: A Measurement-based Approach to Estimating Link Capacity in Wireless Networks
Estimating link capacity in a wireless network is a complex task because the
available capacity at a link is a function of not only the current arrival rate
at that link, but also of the arrival rate at links which interfere with that
link as well as of the nature of interference between these links. Models which
accurately characterize this dependence are either too computationally complex
to be useful or lack accuracy. Further, they have a high implementation
overhead and make restrictive assumptions, which makes them inapplicable to
real networks.
In this paper, we propose CapEst, a general, simple yet accurate,
measurement-based approach to estimating link capacity in a wireless network.
To be computationally light, CapEst allows inaccuracy in estimation; however,
using measurements, it can correct this inaccuracy in an iterative fashion and
converge to the correct estimate. Our evaluation shows that CapEst always
converged to within 5% of the correct value in less than 18 iterations. CapEst
is model-independent, hence, is applicable to any MAC/PHY layer and works with
auto-rate adaptation. Moreover, it has a low implementation overhead, can be
used with any application which requires an estimate of residual capacity on a
wireless link and can be implemented completely at the network layer without
any support from the underlying chipset
A Dynamic Multimedia User-Weight Classification Scheme for IEEE_802.11 WLANs
In this paper we expose a dynamic traffic-classification scheme to support
multimedia applications such as voice and broadband video transmissions over
IEEE 802.11 Wireless Local Area Networks (WLANs). Obviously, over a Wi-Fi link
and to better serve these applications - which normally have strict bounded
transmission delay or minimum link rate requirement - a service differentiation
technique can be applied to the media traffic transmitted by the same mobile
node using the well-known 802.11e Enhanced Distributed Channel Access (EDCA)
protocol. However, the given EDCA mode does not offer user differentiation,
which can be viewed as a deficiency in multi-access wireless networks.
Accordingly, we propose a new inter-node priority access scheme for IEEE
802.11e networks which is compatible with the EDCA scheme. The proposed scheme
joins a dynamic user-weight to each mobile station depending on its outgoing
data, and therefore deploys inter-node priority for the channel access to
complement the existing EDCA inter-frame priority. This provides efficient
quality of service control across multiple users within the same coverage area
of an access point. We provide performance evaluations to compare the proposed
access model with the basic EDCA 802.11 MAC protocol mode to elucidate the
quality improvement achieved for multimedia communication over 802.11 WLANs.Comment: 15 pages, 8 figures, 3 tables, International Journal of Computer
Networks & Communications (IJCNC
AP-STA association control for throughput maximization in virtualized WiFi networks
To manage and enable service customization among multiple internet service providers (ISPs) sharing the common physical infrastructure and network capacity in virtualized Wi-Fi networks, this paper models and optimizes access point-station (STA) association via airtime usage control. More specifically, an optimization problem is formulated on the STAs’ transmission probabilities to maximize the overall network throughput, while providing airtime usage guarantees for the ISPs. As the proposed optimization problem is inherently non-convex, an algorithm to reach the optimal solution is developed by applying monomial approximation and geometric programming iteratively. Based on the proposed 3-D Markov-chain model of the enhanced distributed channel access protocol, the detailed implementation of the optimal transmission probability of each STA is also discussed by manipulating medium access control parameters. The performance of the developed association and airtime control scheme is evaluated through numerical results. For both homogeneous and non-homogeneous STA distributions, numerical results reveal performance gains of the proposed algorithm in improving the throughput and keeping airtime usage guarantees
- …