383 research outputs found
Performance Analysis for Bandwidth Allocation in IEEE 802.16 Broadband Wireless Networks using BMAP Queueing
This paper presents a performance analysis for the bandwidth allocation in
IEEE 802.16 broadband wireless access (BWA) networks considering the
packet-level quality-of-service (QoS) constraints. Adaptive Modulation and
Coding (AMC) rate based on IEEE 802.16 standard is used to adjust the
transmission rate adaptively in each frame time according to channel quality in
order to obtain multiuser diversity gain. To model the arrival process and the
traffic source we use the Batch Markov Arrival Process (BMAP), which enables
more realistic and more accurate traffic modelling. We determine analytically
different performance parameters, such as average queue length, packet dropping
probability, queue throughput and average packet delay. Finally, the analytical
results are validated numerically.Comment: 16 page
Recommended from our members
Investigation of efficient resource allocation schemes for WiMAX networks
This thesis was submitted for the degree of Master of Philosophy and was awarded by Brunel University on 9 July 2008.WiMax (Worldwide Interoperability for Microwave Access) is a promising wireless technology with the aim of providing the last mile wireless broadband access designed for both fixed and mobile consumers as an alternative solution to the wired DSL and cable access schemes. The purpose of this research project is to investigate efficient resource allocation algorithms for WiMax. To achieve this goal, we investigate efficient PHY layer Partial Usage of SubCarriers (PUSC) allocation as well as MAC layer piggyback bandwidth request mechanisms. At the PHY layer we proposed improvements on the Uplink and Downlink PUSC subcarrier allocation scheme. For the Uplink PUSC we suggested a method by allocating different frequencies to neighbouring cells in combination with the Integer Frequency Reuse (IFR) and Fractional Frequency Reuse (FFR) in order to reduce interferences and collisions. The simulation results exhibit that collision rates can be reduced to zero for both IFR and FFR patterns with the proposed improvement by assuming that perfect power control is used in the system. In addition, there is no collision at cell edges. The results also show that FFR patterns achieve lower inter-cell interference and higher capacities as compared to the IFR patterns. For the Downlink PUSC we introduced an offset scheme with the purpose of increasing the number of users in the system. At the MAC layer we propose an improvement on the piggyback bandwidth request mechanism by increasing the size of the piggyback bandwidth request in order to reduce the number of bandwidth requests and hence improve the resource utilisation. The simulation results demonstrate that our improved scheme achieves higher throughput, less delay and packet loss rates as compared to the standardised piggyback bandwidth request mechanism
Analysis Framework for Opportunistic Spectrum OFDMA and its Application to the IEEE 802.22 Standard
We present an analytical model that enables throughput evaluation of
Opportunistic Spectrum Orthogonal Frequency Division Multiple Access (OS-OFDMA)
networks. The core feature of the model, based on a discrete time Markov chain,
is the consideration of different channel and subchannel allocation strategies
under different Primary and Secondary user types, traffic and priority levels.
The analytical model also assesses the impact of different spectrum sensing
strategies on the throughput of OS-OFDMA network. The analysis applies to the
IEEE 802.22 standard, to evaluate the impact of two-stage spectrum sensing
strategy and varying temporal activity of wireless microphones on the IEEE
802.22 throughput. Our study suggests that OS-OFDMA with subchannel notching
and channel bonding could provide almost ten times higher throughput compared
with the design without those options, when the activity and density of
wireless microphones is very high. Furthermore, we confirm that OS-OFDMA
implementation without subchannel notching, used in the IEEE 802.22, is able to
support real-time and non-real-time quality of service classes, provided that
wireless microphones temporal activity is moderate (with approximately one
wireless microphone per 3,000 inhabitants with light urban population density
and short duty cycles). Finally, two-stage spectrum sensing option improves
OS-OFDMA throughput, provided that the length of spectrum sensing at every
stage is optimized using our model
Exploring the intra-frame energy conservation capabilities of the horizontal simple packing algorithm in IEEE 802.16e networks: an analytical approach
The power saving capabilities of the mobile devices in broadband wireless networks constitute a challenging research topic that has attracted the attention of researchers recently, while it needs to be addressed at multiple layers. This work provides a novel analysis of the intra-frame energy conservation potentials of the IEEE 802.16e network. Specifically, the power saving capabilities of the worldwide interoperability for microwave access downlink sub-frame are thoroughly studied, employing the well-known simple packing algorithm as the mapping technique of the data requests. The accurate mathematical model, cross-validated via simulation, reveals the significant ability to conserve energy in this intra-frame fashion under different scenarios. To the best of our knowledge, this is the first work providing intra-frame power-saving potentials of IEEE 802.16 networks. Additionally, this is the first study following an analytic approach
Traffic Scheduling in Point-to-Multipoint OFDMA-based Systems
The new generation of wireless networks (e.g., WiMAX, LTE-Advanced, Cognitive Radio) support many high resource-consuming services (e.g., VoIP, video conference, multiplayer interactive gaming, multimedia streaming, digital video broadcasting, mobile commerce). The main problem of such networks is that the bandwidth is limited, besides to be subject to fading process, and shared among multiple users. Therefore, a combination of sophisticated transmission techniques (e.g., OFDMA) and proper packet scheduling algorithms is necessary, in order to provide applications with suitable quality of service.
This Thesis addresses the problem of traffic scheduling in Point-to-Multipoint OFDMA-based systems. We formally prove that in such systems, even a simple scheduling problem of a Service Class at a time, is NP-complete, therefore, computationally intractable. An optimal solution is unfeasible in term of time, thus, fast and simple scheduling heuristics are needed. First, we address the Best Effort traffic scheduling issue, in a system adopting variable-length Frames, with the objective of producing a legal schedule (i.e., the one meeting all system constraints) of minimum length. Besides, we present fast and simple heuristics, which generate suboptimal solutions, and evaluate their performance in the average case, as in the worst one. Then, we investigate the scheduling of Real Time traffic, with the objective of meeting as many deadlines as possible, or equivalently, minimizing the packet drop ratio. Specifically, we propose two scheduling heuristics, which apply two different resource allocation mechanisms, and evaluate their average-case performance by means of a simulation experiment
Joint Scheduling and Resource Allocation in the OFDMA Downlink: Utility Maximization under Imperfect Channel-State Information
We consider the problem of simultaneous user-scheduling, power-allocation,
and rate-selection in an OFDMA downlink, with the goal of maximizing expected
sum-utility under a sum-power constraint. In doing so, we consider a family of
generic goodput-based utilities that facilitate, e.g., throughput-based
pricing, quality-of-service enforcement, and/or the treatment of practical
modulation-and-coding schemes (MCS). Since perfect knowledge of channel state
information (CSI) may be difficult to maintain at the base-station, especially
when the number of users and/or subchannels is large, we consider scheduling
and resource allocation under imperfect CSI, where the channel state is
described by a generic probability distribution. First, we consider the
"continuous" case where multiple users and/or code rates can time-share a
single OFDMA subchannel and time slot. This yields a non-convex optimization
problem that we convert into a convex optimization problem and solve exactly
using a dual optimization approach. Second, we consider the "discrete" case
where only a single user and code rate is allowed per OFDMA subchannel per time
slot. For the mixed-integer optimization problem that arises, we discuss the
connections it has with the continuous case and show that it can solved exactly
in some situations. For the other situations, we present a bound on the
optimality gap. For both cases, we provide algorithmic implementations of the
obtained solution. Finally, we study, numerically, the performance of the
proposed algorithms under various degrees of CSI uncertainty, utilities, and
OFDMA system configurations. In addition, we demonstrate advantages relative to
existing state-of-the-art algorithms
Nearly Optimal Resource Allocation for Downlink OFDMA in 2-D Cellular Networks
In this paper, we propose a resource allocation algorithm for the downlink of
sectorized two-dimensional (2-D) OFDMA cellular networks assuming statistical
Channel State Information (CSI) and fractional frequency reuse. The proposed
algorithm can be implemented in a distributed fashion without the need to any
central controlling units. Its performance is analyzed assuming fast fading
Rayleigh channels and Gaussian distributed multicell interference. We show that
the transmit power of this simple algorithm tends, as the number of users grows
to infinity, to the same limit as the minimal power required to satisfy all
users' rate requirements i.e., the proposed resource allocation algorithm is
asymptotically optimal. As a byproduct of this asymptotic analysis, we
characterize a relevant value of the reuse factor that only depends on an
average state of the network.Comment: submitted to IEEE Transactions on Wireless Communication
- âŠ