Fair scheduling with rate control for IEEE 802.16 broadband wireless networks

Although the scheduling problem of the uplink transmission in the IEEE 802.16 broadband wireless access network is extensively discussed, most of the results are limited to the quality of service (QoS) upon throughput and delay requirement. But as in practice only limited wireless resources are made available, a fairness-based scheduling upon each connection?s QoS provides better outcomes. In this study, the authors propose a new fair uplink scheduling for real-time polling service and non-real-time polling service with the proportional sharing of excess bandwidth of the network. To implement the proposed fair scheduling that satisfies the delay requirement and full bandwidth utilisation, the authors introduce the rate control algorithm. With the proposed scheduling, we guarantee the fairness, delay requirement and full bandwidth utilisation which are not fully achieved in the existing results.     

An interference and latency aware uplink scheduling mechanism in IEEE 802.16j networks

IEEE 802.16j spreads out the coverage of WiMAX networks and strengthens wireless signal transmission using relay technology. To take advantage of relaying in IEEE 802.16j networks, an efficient scheduling schedule with quality of service (QoS) provision for multiple link transmissions is necessary, especially when link interference exists. In this paper, we propose an uplink scheduling mechanism in the transparent mode of IEEE 802.16j, which enables multiple devices to transmit without interference. The maximum latency of each connection has been considered in order to optimize the violation and transmission rate. An interference detection task is first carried out, and then a resource allocation algorithm and a dynamic frame adjustment method are developed. Two simulation experiments were conducted with different interference levels. The results demonstrate that under a fixed QoS type of connection, when the total number of connections goes up to 360 and 420 and the maximum latency violation rate approaches 20%, the average uplink transmission rate of the proposed mechanism can achieve 6.67 and 7.92 Mbps, which apparently outperform regular relay scheduling schemes with rate of 4 and 3.91 Mbps, respectively.     

Cross-layer design for block subchannel allocation and admission control in the IEEE 802.16 OFDMA networks

The flexibility of orthogonal frequency-division multiple access (OFDMA) technology necessitates a compromise between spectrum efficiency and quality of service (QoS) in IEEE 802.16 broadband wireless networks. This article proposes a complete solution with the nice feature of adaptive modulation and a coding scheme to provide both delay and loss rate guarantees for real-time services. The proposed method first determines the subframe boundary according to the current downlink and uplink backlogs. To comply with the IEEE 802.16 standard, the proposed method then groups contiguous subchannels and allocates them to proper connections based on the current loss rate and available modulation and coding schemes for each connection. By modeling the aggregated required subchannels as a Gaussian distribution, this study develops a simple admission control algorithm by checking if there are enough resources for a new connection. Simulation results show that the proposed solution can provide QoS guarantee with high spectrum efficiency.     

Differentiated cooperative multiple access for multimedia communications over fading wireless networks

The quality of service (QoS) support for multimedia communications faces a big challenge in a fading wireless network. On one hand, conventional automatic repeat request (ARQ) schemes are not effective for small-scale fading channels with correlated errors due to consecutive retransmission failures. On the other hand, large-scale fading due to propagation loss or shadowing severely limits transmission range. A novel differentiated cooperative medium access control (MAC) protocol, called DC-MAC, is proposed to enhance the QoS support for multimedia communications while supporting service differentiation based on the IEEE 802.11e architecture. By enabling cooperative ARQ, the retransmission is initiated from an appropriate transmission queue of an appropriate relay node instead of the original source. Since unnecessary and useless retransmissions may intensify the node contention and degrade the system performance contrarily, a novel negative acknowledgement feedback mechanism is introduced for loss distinguishing and channel estimation such that cooperative retransmission will be employed only when necessary and only by competent nodes. Extensive simulations are conducted on the OPNET platform to analyse the performances of DC-MAC under both small-scale and large-scale fading. Simulation results show that the proposed scheme significantly improves the performances of both multimedia applications and best-effort data applications in terms of throughput, delay and coverage with moderate user contention.     

A pinwheel packet scheduling scheme for broadband wireless networks

Abstract

A frame‐based packet scheduling scheme, the pinwheel scheduling (PWS) scheme, is proposed and investigated at the medium access control (MAC) layer in broadband wireless networks. The objective of the proposed scheduling scheme is to provide low delay and low jitter for real‐time traffic. We have demonstrated in this paper that the proposed PWS scheme not only satisfies the packet‐level QoS requirements but also has low implementation cost. The PWS scheme gives the highest priority to CBR connections in a service cycle to minimize their delay and jitter. For ABR traffic, a number of slots are allocated to fit their MCR. The remaining time slots are then allocated to VBR traffic according to their PCR. Thus, the VBR traffic may suffer large delay and jitter when the number of CBR connections increases. The PWS with modular strategy (PWS/MS) is proposed to improve the performance of the VBR traffic. We also introduce three different slot‐reuse strategies named real‐time traffic first (RTF), non‐real‐time traffic first (NRTF) and longest queue first (LQF), respectively, to improve resource utilization. In order to demonstrate the performance of the PWS and PWS/MS schemes, comparisons are made with existing schemes such as the round‐robin (RR) and weighted‐round‐robin (WRR) by using OPNET software. Simulation results show that the proposed schemes are capable of maintaining the lowest delay and jitter for VBR and CBR traffic while not sacrificing the available bit rate (ABR) traffic.     

Multi-rate power-controlled link scheduling for mesh broadband wireless access networks

The problem of multi-rate power-controlled collision-free scheduling in spatial time division multiple access (STDMA) wireless mesh networks is formulated as a mathematical program utilising cross layer information. As these mixed integer linear programs are intractable (NP-hard problems), optimal collision-free schedules can be found only for topologies consisting of a few nodes. To this end, approximation algorithms that are based on linear programming relaxation and randomised rounding are studied. The proposed framework, which aims to maximise the spatial timeslot reuse under predefined signal-to-interference noise ratio thresholds, is suitable for providing centralised scheduling in the mesh mode of the IEEE 802.16 standard. Performance aspects of the approximation algorithms under different scenarios are investigated.     

Effective transmission opportunity allocation scheme for real-time variable bit rate traffic flows with different delay bounds

The medium access control of IEEE 802.11e defines a novel coordination function, namely, hybrid coordination function (HCF), which allocates transmission opportunity (TXOP) to stations taking their quality of service (QoS) requirements into account. However, the reference TXOP allocation scheme of HCF controlled channel access, a contention-free channel access function of HCF, is only suitable for constant bit rate traffic. For variable bit rate traffic, packet loss may occur seriously. The authors propose a TXOP allocation scheme to efficiently allocate bandwidth and meet the QoS requirements in terms of both delay bound and packet loss probability. To achieve high bandwidth efficiency, the authors take advantage of not only intra-flow multiplexing gain of traffic flows with large delay bounds, but also inter-flow multiplexing gain of multiple traffic flows with different delay bounds. According to numerical results obtained by computer simulations, the proposed TXOP allocation scheme results in much higher bandwidth efficiency than previous algorithms under the same constraints of delay bounds and packet loss probability.     

Enhancing enhanced distributed channel access function based on cross-layer information for multirate wireless networks

IEEE 802.lie provides guaranteed quality of service (QoS) by proving different transmission priorities. IEEE 802. lie improves the media access control layer of IEEE 802.11 to satisfy the different QoS requirements by introducing two new channel access functions: the enhanced distributed channel access (EDCA) and the hybrid coordination function-controlled channel access. The available bandwidth and transmission rate may be easily affected by the signal quality, because the communication channel in a wireless environment operates in a random time-variation manner. Generally, a station using a low transmission rate will occupy the communication channel for a long time and degrade system performance, which causes bandwidth waste and unfairness; thus the guaranteed QoS for stations with higher transmission rates cannot be provided. An enhancing EDCAF (E DCAF) is proposed that consolidates the cross-layer concept and the IEEE 802.1 le EDCAF protocol. After simulation experiments, E DCAF obviously improves performance, especially in throughput and fairness. E DCAF scheduling also allows the different QoS requirements to be processed efficiently and flexibly.     

基于统计性QoS保证的数据包延时界调度算法

讨论了调度算法的性能指标，对目前基于业务流的调度算法的技术特点与性能优劣进行了分析和比较．重点研究了基于时延和丢包率的算法，并提出了一种基于数据包延时界（PDB）排列的调度策略，与WFQ及传统EDF算法进行了比较，证明业务端到端超时概率随网络带宽利用率的变化性能优于传统EDF算法．     

Adaptive bandwidth sharing mechanism for quality of service administration in infrastructure wireless networks

In infrastructure wireless networks, the wireless hop can be considered as another hop of the transmission path. With the rapid growth of wireless traffics, the future wireless network is expected to provide services for heterogeneous data traffics with different quality of service (QoS) requirements. Most proposed schemes do not have adaptive mechanisms to deal with the environment changes. In real situation, bandwidths, error rates and loss rates of wireless links vary frequently. We will base on the differentiated service model and propose a wireless differentiation (WD) scheme for user datagram protocol (UDP) flows and a wireless differentiation with prioritised ACK scheme for connections with transmission control protocol (TCP) flows. Both schemes provide QoS support for IEEE 802.11b and do not change the basic access mechanism of IEEE 802.11b.     

A cross-layer adaptive algorithm for multimedia QoS fairness in WLAN environments using neural networks

The authors address the problem of providing fair multimedia quality-of-service (QoS) in IEEE 802.11 distributed co-ordination function-based wireless local area networks in the infrastructure mode where mobile hosts experience heterogeneous channel conditions due to mobility and fading effects. It was observed that unequal link qualities can pose significant unfairness of channel sharing, which may thereby lead to the degradation of multimedia QoS performed in adverse conditions. A cross-layer adaptation scheme that provides fair QoS by online adjusting the multidimensional medium access control layer backoff parameters in accordance with the application-layer QoS requirements as well as the physical-layer channel conditions was proposed. The solution is based on an optimisation approach, which utilises neural networks to learn the cross-layer function. Simulation results demonstrate that the proposed adaptation scheme can tackle heterogeneous channel conditions and random joining (or leaving) of hosts to achieve fair QoS in terms of throughput and packet delay.     

基于语音流统计特性的VoIP容量分析与提升算法

在研究IEEE 802.16标准关于VoIP传输机制的基础上,指出语音流的静默特性严重制约了VoIP的容量.通过分析VoIP业务流的统计特性得出了在统计复用情况下VoIP的容量极限.提出了一种基于统计复用的带宽调度方法及其实现算法,以克服由于语音静默带来的语音速率波动.仿真结果表明,该调度方法与UGS(unsolicited grant service)调度相比能够显著提升VoIP的容量,同时使BS和SS之间的VoIP丢包率和传输时延保持在0.02%和5.1ms以下.     

Quality of service constrained throughput optimisation for joint adaptive transmission with automatic repeat request over block-fading channels

An optimisation framework for wireless link adaptation which maximises the system throughput subject to a packet-level quality of service (QoS) constraint is presented. The authors consider joint adaptive variation of the transmitted power level, transmission data rate and packet-error-rate (PER) at the physical layer to improve the throughput performance of the selective-repeat automatic repeat request (SR-ARQ) protocol over block-fading channels. Specifically, for discrete-rate coded M-QAM schemes, the authors present a power and rate adaptation algorithm that guarantees a target PER constraint. The proposed framework also facilitates optimising the throughput performance for delay constrained wireless applications, which imposes a limit on the number of retransmissions for the ARQ. In particular, a link adaptation scheme is presented, which guarantees a target packet-loss rate (PLR) when a truncated SR ARQ protocol at the data-link layer is employed. Numerical results indicate that the proposed adaptation schemes compared with other adaptive schemes noticeably enhance the system throughput. Also, in the case of truncated ARQ, the results illustrate a fundamental trade-off between the delay and PLR QoS metrics achieved at the maximum throughput performance.     

Medium access control access delay analysis of IEEE 802.11e wireless LAN

The IEEE 802.11e standard is specified to support quality-of-service in wireless local area networks, and different contention parameters are designated to each type of service. This developed model is presented to analyse the scheduling and the contention between packets with different priorities, where the new features of the enhanced distributed channel access such as virtual collision, backoff, minimum contention window and different arbitration inter-frame spaces are taken into account. Based on the model, the delay performance of differentiated service traffic is analysed and a recursive method is proposed, which is capable of calculating the mean access delay. Simulations show that the model and the analysis provide an insight into the protocol and the effects of different parameters on the performance.     

Design of Intra‐BS handoff in multi‐hop IEEE 802.16 broadband wireless networks

Abstract

In IEEE 802.16‐based multi‐hop networks, transmissions using a multi‐hop high‐rate relay path can potentially achieve better throughput and delay than using a single‐hop low‐rate direct path. The establishment of relay or direct connection and the handoffs between different connections for mobile subscribers are thus key design issues. This paper studies connection setup and Intra‐BS handoff operations in IEEE 802.16‐based multi‐hop networks, where each connection employs adaptive modulation and coding scheme at the physical layer against wireless fading channel. Both centralized and decentralized designs are considered. In the centralized design, the base station coordinates connection establishments and handoffs for multi‐hop IEEE 802.16‐based subscribers. In the decentralized design, the MMR‐enhanced relay stations and mobile subscribers are required to participate in the connection and handoff management. Simulation results show that the two designs can significantly improve the good put, the packet transmission delay and network throughput. The results also highlight that the centralized design outperforms decentralized design in terms of throughput and delay.     

Coverage probability analysis of IEEE 802.16 system with smart antenna system over stanford university interim fading channels

The IEEE 802.16 system, a promising wireless communication system, has a maximum transmission range of 50 km according to the IEEE 802.16 standard. In reality, the transmission range and coverage probability of an IEEE 802.16 system vary for different wireless scenarios. Evaluating the transmission range and coverage probability of an IEEE 802.16 system prior to implementation is important. Hence, the Stanford University Interim (SUI) channel model in IEEE 802.16 specifications is suitable for evaluating the performance of IEEE 802.16 systems. To generate an effective method for predicting coverage, this study uses the SUI channel model to analyse the coverage probability of an IEEE 802.16 system. Furthermore, this study utilises a smart antenna system (SAS) to enhance IEEE 802.16 system performance. In terms of different antenna heights of the Base Transceiver Station and Customer Premises Equipment, the performance evaluation results show that the cell radius with the SAS is at least 30% more than that without the SAS.     

Power-saving mechanisms for mobile devices in wireless communications

In wireless communications, a sleep mode is commonly used to save power for mobile stations (MS). When there is no traffic to transmit, an MS periodically switches to sleep mode. Obviously, the performance of a power-saving mechanism depends on its sleep mode scheduling algorithm and the traffic characteristics of the user. In real systems, the power-saving mechanism of IEEE802.11 WLAN uses a constant sleep interval, and the IEEE802.16e WMAN adopts one with truncated exponentially extending sleep intervals denoted by PS-16, which contains constant sleep intervals as special cases. The two mechanisms are compared, resulting in the, finding that in the case of Poisson traffic, they have the same performance; whereas in the case of non-Poisson traffic PS-16 has better performance. For non-Poisson traffic, the performance of PS-16 lacks a closed form expression, which makes its design challenging. The authors propose to approximate the idle durations of an MS by hyper-exponentials, based on which an online sleep mode scheduling algorithm is developed. Numerical examples are provided to illustrate the efficiency of the proposed algorithm.     

基于服务曲线的TDMA无线网络上行信道时隙调度算法

研究了采用TDMA接入方式的无线分组网络上行信道时隙分配策略,基于移动台的QoS要求,提出了一种自适应时隙分配算法。利用服务曲线对移动台的QoS要求进行了建模。算法的目标是在尽量满足所有移动台Qos要求的基础上提高系统的上行吞吐量。在无法满足所有移动台QoS要求的情况下,使得移动台实际发送的数据与满足服务曲线要求之间的偏差最小。仿真结果表明：该算法能够在系统吞吐量和系统偏差之间进行折衷,从而有效地平衡上述两个目标。     

Traffic scheduling for multimedia transmission over IEEE 802.11e wireless LAN

As the demand for broadband multimedia wireless is increasing, improving the quality of service (QoS) of the widely deployed IEEE 802.11 wireless LAN has become crucial. In order to attain the QoS required by a wide range of applications, the IEEE 802.11 working group has denned a new standard - the IEEE 802.lie. However, very limited work has been performed to address the QoS transmission problem of real-time video over IEEE 802.11e. A novel measurement-based dynamic transmission opportunity (MBDTXOP) scheme is proposed, which adaptively allocates resources to a variable bit rate (VBR) video on the basis of the estimation of future traffic demand to support efficient QoS transmission of VBR video. The novelty of the proposed scheme, when compared with existing methods, lies in estimating the required network resources by exploiting the characteristics of digital video; this capability enables the MBDTXOP scheme to substantially increase network utilisation while preserving the required QoS for the transmission of VBR video. Simulations comparing the proposed scheme with other mechanisms clearly demonstrate the outstanding performance of the former.     

Virtual multiple input multiple output in multiple high-altitude platform constellations

Multiple-input multiple-output (MIMO) technology, which makes use of the spatial dimension by utilising multiple antennas at the transmitter and receiver, has proved an efficient solution for providing higher data throughput and/or link reliability in wireless systems. In this study, the authors investigate a virtual MIMO (V-MIMO) technique, based on a constellation of multiple high-altitude platforms (HAPs), providing broadband wireless access to high-speed trains under predominantly line-of-sight (LOS) propagation conditions. They analyse the performance of transmit diversity based on space?time block coding (STBC), in particular Alamouti and extended Alamouti schemes, using fixed wide-lobe receive antennas, and compare it to the reference receive diversity scheme based on best HAP selection that requires highly directional and steerable antennas. Simulation results for different diversity schemes are based on the calculation of carrier to interference-plus-noise ratio (CINR) along representative railway lines in a realistic terrain configuration. The CINR levels obtained are mapped onto transmission modes specified by standards developed for two wireless systems operating at distinct frequency bands, the DVB-S2 assumed for operation in mm-wave bands and the IEEE 802.16e (mobile WiMAX) for operation at 3.5 GHz. Simulation results show that the use of transmit diversity schemes in a multiple HAP constellation decreases the link outage and also increases the average spectral efficiency, but requires a marked increase in transmit power, especially for the system operating in mm-wave bands.