Interference Management Based on RT/nRT Traffic Classification for FFR-Aided Small Cell/Macrocell Heterogeneous Networks

Cellular networks are constantly lagging in terms of the bandwidth needed to support the growing high data rate demands. The system needs to efficiently allocate its frequency spectrum such that the spectrum utilization can be maximized while ensuring the quality of service (QoS) level. Owing to the coexistence of different types of traffic (e.g., real-time (RT) and non-real-time (nRT)) and different types of networks (e.g., small cell and macrocell), ensuring the QoS level for different types of users becomes a challenging issue in wireless networks. Fractional frequency reuse (FFR) is an effective approach for increasing spectrum utilization and reducing interference effects in orthogonal frequency division multiple access networks. In this paper, we propose a new FFR scheme in which bandwidth allocation is based on RT/nRT traffic classification. We consider the coexistence of small cells and macrocells. After applying FFR technique in macrocells, the remaining frequency bands are efficiently allocated among the small cells overlaid by a macrocell. In our proposed scheme, total frequency-band allocations for different macrocells are decided on the basis of the traffic intensity. The transmitted power levels for different frequency bands are controlled based on the level of interference from a nearby frequency band. Frequency bands with a lower level of interference are assigned to the RT traffic to ensure a higher QoS level for the RT traffic. RT traffic calls in macrocell networks are also given a higher priority compared with nRT traffic calls to ensure the low call-blocking rate. Performance analyses show significant improvement under the proposed scheme compared with conventional FFR schemes

Delay-Prioritized Scheduling (DPS) for real time traffic in 3GPP LTE system

Given that the co-existence of multimedia applications will be a norm in the future wireless systems, their quality of service (QoS) requirements need to be guaranteed. This has imposed new challenges in the design of packet scheduling algorithms in these systems. To address those challenges, a new packet scheduling algorithm for real time (RT) traffic in downlink third generation partnership project long term evolution (3GPP LTE) system is proposed in this paper. The proposed algorithm utilizes each user's packet delay information and its instantaneous downlink channel conditions when making scheduling decisions. Simulation results show that the proposed algorithm outperforms opportunistic scheduling and maximum-largest weighted delay first algorithms by maximizing system throughput and satisfying the QoS requirements of the RT traffic. ©2010 IEEE

Performance analysis of an ATM network with multimedia traffic: a simulation study

Traffic and congestion control are important in enabling ATM networks to maintain the Quality of Service (QoS) required by end users. A Call Admission Control (CAC) strategy ensures that the network has sufficient resources available at the start of each call, but this does not prevent a traffic source from violating the negotiated contract. A policing strategy (User Parameter Control (UPC)) is also required to enforce the negotiated rates for a particular connection and to protect conforming users from network overload. The aim of this work is to investigate traffic policing and bandwidth management at the User to Network Interface (UNI). A policing function is proposed which is based on the leaky bucket (LB) which offers improved performance for both real time (RT) traffic such as speech and video and non-real time (non-RT) traffic, mainly data by taking into account the QoS requirements. A video cell in violation of the negotiated bit rate causes the remainder of the slice to be discarded. This 'tail clipping' provides protection for the decoder from damaged video slices. Speech cells are coded using a frequency domain coder, which places the most significant bits of a double speech sample into a high priority cell and the least significant bits into a high priority cell. In the case of congestion, the low priority cell can be discarded with little impact on the intelligibility of the received speech. However, data cells require loss-free delivery and are buffered rather than being discarded or tagged for subsequent deletion. This triple strategy is termed the super leaky bucket (SLB). Separate queues for RT and non-RT traffic, are also proposed at the multiplexer, with non pre-emptive priority service for RT traffic if the queue exceeds a predetermined threshold. If the RT queue continues to grow beyond a second threshold, then all low priority cells (mainly speech) are discarded. This scheme protects non-RT traffic from being tagged and subsequently discarded, by queueing the cells and also by throttling back non-RT sources during periods of congestion. It also prevents the RT cells from being delayed excessively in the multiplexer queue. A simulation model has been designed and implemented to test the proposal. Realistic sources have been incorporated into the model to simulate the types of traffic which could be expected on an ATM network. The results show that the S-LB outperforms the standard LB for video cells. The number of cells discarded and the resulting number of damaged video slices are significantly reduced. Dual queues with cyclic service at the multiplexer also reduce the delays experienced by RT cells. The QoS for all categories of traffic is preserved

A study of QoS support for real time multimedia communication over IEEE802.11 WLAN : a thesis presented in partial fulfillment of the requirements for the degree of Master of Engineering in Computer Systems Engineering, Massey University, Albany, New Zealand

Quality of Service (QoS) is becoming a key problem for Real Time (RT) traffic transmitted over Wireless Local Area Network (WLAN). In this project the recent proposals for enhanced QoS performance for RT multimedia is evaluated and analyzed. Two simulation models for EDCF and HCF protocols are explored using OPNET and NS-2 simulation packages respectively. From the results of the simulation, we have studied the limitations of the 802.1 le standard for RT multimedia communication and analysed the reasons of the limitations happened and proposed the solutions for improvement. Since RT multimedia communication encompasses time-sensitive traffic, the measure of quality of service generally is minimal delay (latency) and delay variation (jitter). 802.11 WLAN standard focuses on the PHY layer and the MAC layer. The transmitted data rate on PHY layer are increased on standards 802.1 lb, a, g, j, n by different code mapping technologies while 802.1 le is developed specially for the QoS performance of RT-traffics at the MAC layer. Enhancing the MAC layer protocols are the significant topic for guaranteeing the QoS performance of RT-traffics. The original MAC protocols of 802.11 are DCF (Distributed Coordination Function) and PCF (Point Coordinator Function). They cannot achieve the required QoS performance for the RT-traffic transmission. IEEE802.lle draft has developed EDCF and HCF instead. Simulation results of EDCF and HCF models that we explored by OPNET and NS-2, show that minimal latency and jitter can be achieved. However, the limitations of EDCF and HCF are identified from the simulation results. EDCF is not stable under the high network loading. The channel utilization is low by both protocols. Furthermore, the fairness index is very poor by the HCF. It means the low priority traffic should starve in the WLAN network. All these limitations are due to the priority mechanism of the protocols. We propose a future work to develop dynamic self-adaptive 802.11c protocol as practical research directions. Because of the uncertainly in the EDCF in the heavy loading, we can add some parameters to the traffic loading and channel condition efficiently. We provide indications for adding some parameters to increase the EDCF performance and channel utilization. Because all the limitations are due to the priority mechanism, the other direction is doing away with the priority rule for reasonable bandwidth allocation. We have established that the channel utilization can be increased and collision time can be reduced for RT-traffics over the EDCF protocol. These parameters can include loading rate, collision rate and total throughput saturation. Further simulation should look for optimum values for the parameters. Because of the huge polling-induced overheads, HCF has the unsatisfied tradeoff. This leads to poor fairness and poor throughput. By developing enhanced HCF it may be possible to enhance the RI polling interval and TXOP allocation mechanism to get better fairness index and channel utilization. From the simulation, we noticed that the traffics deployment could affect the total QoS performance, an indication to explore whether the classification of traffics deployments to different categories is a good idea. With different load-based traffic categories, QoS may be enhanced by appropriate bandwidth allocation Strategy

Energy-saving Resource Allocation by Exploiting the Context Information

Improving energy efficiency of wireless systems by exploiting the context information has received attention recently as the smart phone market keeps expanding. In this paper, we devise energy-saving resource allocation policy for multiple base stations serving non-real-time traffic by exploiting three levels of context information, where the background traffic is assumed to occupy partial resources. Based on the solution from a total energy minimization problem with perfect future information,a context-aware BS sleeping, scheduling and power allocation policy is proposed by estimating the required future information with three levels of context information. Simulation results show that our policy provides significant gains over those without exploiting any context information. Moreover, it is seen that different levels of context information play different roles in saving energy and reducing outage in transmission.Comment: To be presented at IEEE PIMRC 2015, Hong Kong. This work was supported by National Natural Science Foundation of China under Grant 61120106002 and National Basic Research Program of China under Grant 2012CB31600

Computing Accurate Performance Bounds for Best Effort Networks-on-Chip

Real-time (RT) communication support is a critical requirement for many complex embedded applications which are currently targeted to Network-on-chip (NoC) platforms. In this paper, we present novel methods to efficiently calculate worst- case bandwidth and latency bounds for RT traffic streams on wormhole-switched NoCs with arbitrary topology. The proposed methods apply to best-effort NoC architectures, with no extra hardware dedicated to RT traffic support. By applying our methods to several realistic NoC designs, we show substantial improvements (more than 30% in bandwidth and 50% in latency, on average) in bound tightness with respect to existing approaches