Protocol Design and Stability Analysis of Cooperative Cognitive Radio Users

A single cognitive radio transmitter--receiver pair shares the spectrum with two primary users communicating with their respective receivers. Each primary user has a local traffic queue, whereas the cognitive user has three queues; one storing its own traffic while the other two are relaying queues used to store primary relayed packets admitted from the two primary users. A new cooperative cognitive medium access control protocol for the described network is proposed, where the cognitive user exploits the idle periods of the primary spectrum bands. Traffic arrival to each relaying queue is controlled using a tuneable admittance factor, while relaying queues service scheduling is controlled via channel access probabilities assigned to each queue based on the band of operation. The stability region of the proposed protocol is characterized shedding light on its maximum expected throughput. Numerical results demonstrate the performance gains of the proposed cooperative cognitive protocol.Comment: Accepted in WCNC 201

Queue-Based Random-Access Algorithms: Fluid Limits and Stability Issues

We use fluid limits to explore the (in)stability properties of wireless networks with queue-based random-access algorithms. Queue-based random-access schemes are simple and inherently distributed in nature, yet provide the capability to match the optimal throughput performance of centralized scheduling mechanisms in a wide range of scenarios. Unfortunately, the type of activation rules for which throughput optimality has been established, may result in excessive queue lengths and delays. The use of more aggressive/persistent access schemes can improve the delay performance, but does not offer any universal maximum-stability guarantees. In order to gain qualitative insight and investigate the (in)stability properties of more aggressive/persistent activation rules, we examine fluid limits where the dynamics are scaled in space and time. In some situations, the fluid limits have smooth deterministic features and maximum stability is maintained, while in other scenarios they exhibit random oscillatory characteristics, giving rise to major technical challenges. In the latter regime, more aggressive access schemes continue to provide maximum stability in some networks, but may cause instability in others. Simulation experiments are conducted to illustrate and validate the analytical results

Fluid flow queue models for fixed-mobile network evaluation

A methodology for fast and accurate end-to-end KPI, like throughput and delay, estimation is proposed based on the service-centric traffic flow analysis and the fluid flow queuing model named CURSA-SQ. Mobile network features, like shared medium and mobility, are considered defining the models to be taken into account such as the propagation models and the fluid flow scheduling model. The developed methodology provides accurate computation of these KPIs, while performing orders of magnitude faster than discrete event simulators like ns-3. Finally, this methodology combined to its capacity for performance estimation in MPLS networks enables its application for near real-time converged fixed-mobile networks operation as it is proven in three use case scenarios

Dynamic Bandwidth Allocation in Heterogeneous OFDMA-PONs Featuring Intelligent LTE-A Traffic Queuing

This work was supported by the ACCORDANCE project, through the 7th ICT Framework Programme. This is an Accepted Manuscript of an article accepted for publication in Journal of Lightwave Technology following peer review. © 2014 IEEE Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.A heterogeneous, optical/wireless dynamic bandwidth allocation framework is presented, exhibiting intelligent traffic queuing for practically controlling the quality-of-service (QoS) of mobile traffic, backhauled via orthogonal frequency division multiple access–PON (OFDMA-PON) networks. A converged data link layer is presented between long term evolution-advanced (LTE-A) and next-generation passive optical network (NGPON) topologies, extending beyond NGPON2. This is achieved by incorporating in a new protocol design, consistent mapping of LTE-A QCIs and OFDMA-PON queues. Novel inter-ONU algorithms have been developed, based on the distribution of weights to allocate subcarriers to both enhanced node B/optical network units (eNB/ONUs) and residential ONUs, sharing the same infrastructure. A weighted, intra-ONU scheduling mechanism is also introduced to control further the QoS across the network load. The inter and intra-ONU algorithms are both dynamic and adaptive, providing customized solutions to bandwidth allocation for different priority queues at different network traffic loads exhibiting practical fairness in bandwidth distribution. Therefore, middle and low priority packets are not unjustifiably deprived in favor of high priority packets at low network traffic loads. Still the protocol adaptability allows the high priority queues to automatically over perform when the traffic load has increased and the available bandwidth needs to be rationally redistributed. Computer simulations have confirmed that following the application of adaptive weights the fairness index of the new scheme (representing the achieved throughput for each queue), has improved across the traffic load to above 0.9. Packet delay reduction of more than 40ms has been recorded as a result for the low priority queues, while high priories still achieve sufficiently low packet delays in the range of 20 to 30msPeer reviewe

Adaptive fair channel allocation for QoS enhancement in IEEE 802.11 wireless LANs

The emerging widespread use of real-time multimedia applications over wireless networks makes the support of quality of service (QoS) a key problem. In this paper, we focus on QoS support mechanisms for IEEE 802.11 wireless ad-hoc networks. First, we review limitations of the upcoming IEEE 802.11e enhanced DCF (EDCF) and other enhanced MAC schemes that have been proposed to support QoS for 802.11 ad-hoc networks. Then, we describe a new scheme called adaptive fair EDCF that extends EDCF, by increasing the contention window during deferring periods when the channel is busy, and by using an adaptive fast backoff mechanism when the channel is idle. Our scheme computes an adaptive backoff threshold for each priority level by taking into account the channel load. The new scheme significantly improves the quality of multimedia applications. Moreover, it increases the overall throughput obtained both in medium and high load cases. Simulution results show that our new scheme outperforms EDCF and other enhanced schemes. Finally, we show that the adaptive fair EDCF scheme achieves a high degree of fairness among applications of the same priority level

Network-Level Performance Evaluation of a Two-Relay Cooperative Random Access Wireless System

In wireless networks relay nodes can be used to assist the users' transmissions to reach their destination. Work on relay cooperation, from a physical layer perspective, has up to now yielded well-known results. This paper takes a different stance focusing on network-level cooperation. Extending previous results for a single relay, we investigate here the benefits from the deployment of a second one. We assume that the two relays do not generate packets of their own and the system employs random access to the medium; we further consider slotted time and that the users have saturated queues. We obtain analytical expressions for the arrival and service rates of the queues of the two relays and the stability conditions. We investigate a model of the system, in which the users are divided into clusters, each being served by one relay, and show its advantages in terms of aggregate and throughput per user. We quantify the above, analytically for the case of the collision channel and through simulations for the case of Multi-Packet Reception (MPR), and we provide insight on when the deployment of a second relay in the system can yield significant advantages.Comment: Submitted for journal publicatio

On Efficiency and Validity of Previous Homeplug MAC Performance Analysis

The Medium Access Control protocol of Power Line Communication networks (defined in Homeplug and IEEE 1901 standards) has received relatively modest attention from the research community. As a consequence, there is only one analytic model that complies with the standardised MAC procedures and considers unsaturated conditions. We identify two important limitations of the existing analytic model: high computational expense and predicted results just prior to the predicted saturation point do not correspond to long-term network performance. In this work, we present a simplification of the previously defined analytic model of Homeplug MAC able to substantially reduce its complexity and demonstrate that the previous performance results just before predicted saturation correspond to a transitory phase. We determine that the causes of previous misprediction are common analytical assumptions and the potential occurrence of a transitory phase, that we show to be of extremely long duration under certain circumstances. We also provide techniques, both analytical and experimental, to correctly predict long-term behaviour and analyse the effect of specific Homeplug/IEEE 1901 features on the magnitude of misprediction errors

Collision Helps - Algebraic Collision Recovery for Wireless Erasure Networks

Current medium access control mechanisms are based on collision avoidance and collided packets are discarded. The recent work on ZigZag decoding departs from this approach by recovering the original packets from multiple collisions. In this paper, we present an algebraic representation of collisions which allows us to view each collision as a linear combination of the original packets. The transmitted, colliding packets may themselves be a coded version of the original packets. We propose a new acknowledgment (ACK) mechanism for collisions based on the idea that if a set of packets collide, the receiver can afford to ACK exactly one of them and still decode all the packets eventually. We analytically compare delay and throughput performance of such collision recovery schemes with other collision avoidance approaches in the context of a single hop wireless erasure network. In the multiple receiver case, the broadcast constraint calls for combining collision recovery methods with network coding across packets at the sender. From the delay perspective, our scheme, without any coordination, outperforms not only a ALOHA-type random access mechanisms, but also centralized scheduling. For the case of streaming arrivals, we propose a priority-based ACK mechanism and show that its stability region coincides with the cut-set bound of the packet erasure network

Analysis of a polling system modeling QoS differentiation in WLANs

This paper investigates a polling system with a random polling scheme, a 1-limited service discipline and deterministic service requirement modeling WLANs with QoS differentation capability. The system contains high and low priority queues that are distinguished via the probability of being served next. We propose a new iteration algorithm to approximate the waiting time of customers in the high and low priority queues. As shown by simulation results, our approximation is accurate for light to moderately loaded networks