208 research outputs found
On The Linear Behaviour of the Throughput of IEEE 802.11 DCF in Non-Saturated Conditions
We propose a linear model of the throughput of the IEEE 802.11 Distributed
Coordination Function (DCF) protocol at the data link layer in non-saturated
traffic conditions. We show that the throughput is a linear function of the
packet arrival rate (PAR) with a slope depending on both the number
of contending stations and the average payload length. We also derive the
interval of validity of the proposed model by showing the presence of a
critical , above which the station begins operating in saturated
traffic conditions.
The analysis is based on the multi-dimensional Markovian state transition
model proposed by Liaw \textit{et al.} with the aim of describing the behaviour
of the MAC layer in unsaturated traffic conditions. Simulation results closely
match the theoretical derivations, confirming the effectiveness of the proposed
linear model.Comment: To appear on IEEE Communications Letters, November 200
On the Throughput Allocation for Proportional Fairness in Multirate IEEE 802.11 DCF
This paper presents a modified proportional fairness (PF) criterion suitable
for mitigating the \textit{rate anomaly} problem of multirate IEEE 802.11
Wireless LANs employing the mandatory Distributed Coordination Function (DCF)
option. Compared to the widely adopted assumption of saturated network, the
proposed criterion can be applied to general networks whereby the contending
stations are characterized by specific packet arrival rates, , and
transmission rates .
The throughput allocation resulting from the proposed algorithm is able to
greatly increase the aggregate throughput of the DCF while ensuring fairness
levels among the stations of the same order of the ones available with the
classical PF criterion. Put simply, each station is allocated a throughput that
depends on a suitable normalization of its packet rate, which, to some extent,
measures the frequency by which the station tries to gain access to the
channel. Simulation results are presented for some sample scenarios, confirming
the effectiveness of the proposed criterion.Comment: Submitted to IEEE CCNC 200
Modeling, Analysis and Impact of a Long Transitory Phase in Random Access Protocols
In random access protocols, the service rate depends on the number of
stations with a packet buffered for transmission. We demonstrate via numerical
analysis that this state-dependent rate along with the consideration of Poisson
traffic and infinite (or large enough to be considered infinite) buffer size
may cause a high-throughput and extremely long (in the order of hours)
transitory phase when traffic arrivals are right above the stability limit. We
also perform an experimental evaluation to provide further insight into the
characterisation of this transitory phase of the network by analysing
statistical properties of its duration. The identification of the presence as
well as the characterisation of this behaviour is crucial to avoid
misprediction, which has a significant potential impact on network performance
and optimisation. Furthermore, we discuss practical implications of this
finding and propose a distributed and low-complexity mechanism to keep the
network operating in the high-throughput phase.Comment: 13 pages, 10 figures, Submitted to IEEE/ACM Transactions on
Networkin
Increasing throughput in IEEE 802.11 by optimal selection of backoff parameters
Engineering and Physical Sciences Research Council. Grant Number: EP/G012628/
Unsaturated Throughput Analysis of IEEE 802.11 in Presence of Non Ideal Transmission Channel and Capture Effects
In this paper, we provide a throughput analysis of the IEEE 802.11 protocol
at the data link layer in non-saturated traffic conditions taking into account
the impact of both transmission channel and capture effects in Rayleigh fading
environment. The impact of both non-ideal channel and capture become important
in terms of the actual observed throughput in typical network conditions
whereby traffic is mainly unsaturated, especially in an environment of high
interference.
We extend the multi-dimensional Markovian state transition model
characterizing the behavior at the MAC layer by including transmission states
that account for packet transmission failures due to errors caused by
propagation through the channel, along with a state characterizing the system
when there are no packets to be transmitted in the buffer of a station.
Finally, we derive a linear model of the throughput along with its interval of
validity.
Simulation results closely match the theoretical derivations confirming the
effectiveness of the proposed model.Comment: To appear on IEEE Transactions on Wireless Communications, 200
A Model of the IEEE 802.11 DCF in Presence of Non Ideal Transmission Channel and Capture Effects
In this paper, we provide a throughput analysis of the IEEE 802.11 protocol
at the data link layer in non-saturated traffic conditions taking into account
the impact of both transmission channel and capture effects in Rayleigh fading
environment. Impacts of both non-ideal channel and capture become important in
terms of the actual observed throughput in typical network conditions whereby
traffic is mainly unsaturated, specially in an environment of high
interference.
We extend the multi-dimensional Markovian state transition model
characterizing the behavior at the MAC layer by including transmission states
that account for packet transmission failures due to errors caused by
propagation through the channel, along with a state characterizing the system
when there are no packets to be transmitted in the buffer of a station.Comment: Accepted for oral presentation to IEEE Globecom 2007, Washington
D.C., November 200
Weighted proportional fairness and pricing based resource allocation for uplink offloading using IP flow mobility
Mobile data offloading has been proposed as a solution for the network congestion problem that is continuously aggravating due to the increase in mobile data demand. However, the majority of the state-of-the-art is focused on the downlink offloading, while the change of mobile user habits, like mobile content creation and uploading, makes uplink offloading a rising issue. In this work we focus on the uplink offloading using IP Flow Mobility (IFOM). IFOM allows a LTE mobile User Equipment (UE) to maintain two concurrent data streams, one through LTE and the other through WiFi access technology, that presents uplink limitations due to the inherent fairness design of IEEE 802.11 DCF by employing the CSMA/CA scheme with a binary exponential backoff algorithm. In this paper, we propose a weighted proportionally fair bandwidth allocation algorithm for the data volume that is being offloaded through WiFi, in conjunction with a pricing-based rate allocation for the rest of the data volume needs of the UEs that are transmitted through the LTE uplink. We aim to improve the energy efficiency of the UEs and to increase the offloaded data volume under the concurrent use of access technologies that IFOM allows. In the weighted proportionally fair WiFi bandwidth allocation, we consider both the different upload data needs of the UEs, along with their LTE spectrum efficiency and propose an access mechanism that improves the use of WiFi access in uplink offloading. In the LTE part, we propose a two-stage pricing-based rate allocation under both linear and exponential pricing approaches, aiming to satisfy all offloading UEs regarding their LTE uplink access. We theoretically analyse the proposed algorithms and evaluate their performance through simulations. We compare their performance with the 802.11 DCF access scheme and with a state-of-the-art access algorithm under different number of offloading UEs and for both linear and exponential pricing-based rate allocation for the LTE uplink. Through the evaluation of energy efficiency, offloading capabilities and throughput performance, we provide an improved uplink access scheme for UEs that operate with IFOM for uplink offloading.Peer ReviewedPreprin
Decentralised Learning MACs for Collision-free Access in WLANs
By combining the features of CSMA and TDMA, fully decentralised WLAN MAC
schemes have recently been proposed that converge to collision-free schedules.
In this paper we describe a MAC with optimal long-run throughput that is almost
decentralised. We then design two \changed{schemes} that are practically
realisable, decentralised approximations of this optimal scheme and operate
with different amounts of sensing information. We achieve this by (1)
introducing learning algorithms that can substantially speed up convergence to
collision free operation; (2) developing a decentralised schedule length
adaptation scheme that provides long-run fair (uniform) access to the medium
while maintaining collision-free access for arbitrary numbers of stations
- …