Quality of service supporting downlink scheduling scheme in worldwide interoperability for microwave access wireless access systems

IEEE 802.16 is a standardisation for a broadband wireless access in metropolitan area networks (MAN). Since the IEEE 802.16 standard defines the concrete quality of service (QoS) requirement, a scheduling scheme is necessary to achieve the QoS requirement. Many scheduling schemes are proposed with the purpose of throughput optimisation and fairness enhancement, however, few scheduling schemes support the delay requirement. In this study, the authors propose a new scheduling scheme reflecting the delay requirement. Specifically, the authors add the delay requirement term in the proportional fair scheduling scheme and the scheduling parameters are optimised with respect to the QoS requirement. Therefore the QoS requirement is achieved without the excessive resource consumption.     

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

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

Mobile agent based approach for QoS routing

A mobile agent based on-demand quality of service (QoS) unicast routing scheme for supporting multimedia applications is proposed that considers bandwidth, delay and packet loss as QoS metrics for feasible path computation. A mobile agent is employed to find multiple QoS paths and select a best path among them to preserve resources so as to increase call success ratio and network bandwidth utilisation as well as adapt to network dynamics. The scheme is simulated in various network scenarios (sparse and dense networks) to verify performance and operation effectiveness, and compared with RSVP-based QoS routing by using an internet routing protocol. The results demonstrate significant improvements in call success ratio and network bandwidth utilisation compared with RSVP-based QoS routing, both in case of sparse and dense networks. Benefits of the agent-based scheme are adaptability, flexibility, and support for component-based software engineering features such as software reuse, customisation and maintainability     

Dynamic resource allocation for supporting real-time multimedia applications in IEEE 802.15.3 WPANs

The IEEE 802.15.3 medium access control (MAC) protocol is an emerging standard for high-rate wireless personal area networks (WPANs), especially for supporting high-quality real-time multimedia applications. Despite defining quality of service (QoS) signalling mechanisms for interoperability between devices, IEEE 802.15.3 does not specify resource allocation algorithms that are left to manufacturers. To guarantee the QoS of real-time variable bit rate (VBR) videos and utilise the radio resource efficiently, the authors propose a dynamic resource allocation algorithm. The proposed bandwidth allocation algorithm is based on a novel traffic predictor. Recently, the variable step-size normalised least mean square (VSSNLMS) algorithm was employed for on-line traffic prediction of VBR videos. However, the performance of the VSSNLMS algorithm significantly degrades due to the abrupt traffic variation occurring at the scene boundary. To tackle this problem, the authors design a novel traffic predictor based on a simple scene detection algorithm and the VSSNLMS algorithm. Analyses using real-life MPEG video traces indicate that the proposed traffic predictor significantly outperforms the VSSNLMS algorithm with respect to the prediction error. The performance of the proposed bandwidth allocation algorithm is also investigated by comparing several existing algorithms. Simulation results demonstrate that the proposed bandwidth allocation algorithm surpasses other mechanisms in terms of channel utilisation, buffer usage and packet loss rate.     

Integrated quality-of-service differentiation over IEEE 802.11 wireless LANs

The fundamental medium access control mechanism in IEEE 802.11 wireless LANs (WLANs)-distributed coordination function (DCF) only supports the best-effort service and does not support quality-of-service (QoS) differentiation. Enhanced distributed channel access (EDCA) in IEEE 802.11e supports delay differentiation. A new approach, EDCA+ , is proposed to enhance QoS over WLANs. It simultaneously achieves bandwidth, delay and jitter differentiation by distinguishing the minimum contention window, the maximum backoff stage or persistent factor and packet-loss rate differentiation by distinguishing the retry limit. Analytical models are proposed to analyse the performance of EDCA+ in terms of throughput, bandwidth, delay, jitter and packet-loss rate. Extensive simulations are also carried out to evaluate the accuracy of the proposed performance models and to compare the performance of DCF, EDCA and EDCA+. The simulation results show that EDCA+ performs better than DCF and EDCA in ensuring integrated QoS, and that the proposed analytical models are valid.     

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.     

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.     

Adaptive opportunistic fair scheduling in power-controlled code division multiple access systems

The authors treat the multiuser scheduling problem for practical power-controlled code division multiple access (CDMA) systems under the opportunistic fair scheduling (OFS) framework. OFS is an important technique in wireless networks to achieve fair and efficient resource allocation. Power control is an effective resource management technique in CDMA systems. Given a certain user subset, the optimal power control scheme can be derived. Then the multiuser scheduling problem refers to the optimal user subset selection at each scheduling interval to maximise certain metric subject to some specific physical-layer constraints. The authors propose discrete stochastic approximation algorithms to adaptively select the user subset to maximise the instantaneous total throughput or a general utility. Both uplink and downlink scenarios are considered. They also consider the time-varying channels where the algorithm can track the time-varying optimal user subset. Simulation results to show the performance of the proposed algorithms in terms of the throughput/ utility maximisation, the fairness, the fast convergence and the tracking capability in time-varying environments are presented.     

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.     

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.     

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.     

TCP-friendly congestion control for streaming real-time applications over wireless networks

Congestion control for streaming real-time applications, which need smoothness of the transmission rate, should be transmission control protocol (TCP)-friendly. Moreover, in wireless networks, TCP-friendly congestion control should be based on differentiation of packet losses due to congestion and wireless link error to improve network utilisation. The authors propose a TCP-friendly congestion control algorithm based on explicit congestion notification over the wireless networks. The simulation results show that the proposed algorithm utilises the link bandwidth efficiently, providing smoothness of the transmission rate.     

Experimental evaluation of a bandwidth allocation scheme for foundation fieldbus

Operation of the data link layer of the foundation fieldbus is based on scheduling and token-passing disciplines. This paper presents a network design for the foundation fieldbus protocol using a bandwidth allocation scheme. Fieldbus traffic consists of periodic data and sporadically generated time-critical and time-available data. The bandwidth allocation scheme schedules the transmission of periodic data. Time-critical and time-available data are transmitted via a token-passing service. The validity of this bandwidth allocation scheme was determined using an experimental model of a network system. The results obtained from the model show that the proposed scheme restricted the delay of both periodic and time-critical data to a pre-specified bound. The proposed bandwidth allocation scheme also fully utilized the bandwidth resources of the network system.     

一种轮询周期受限的EPON双级动态带宽分配算法

提出一种新的EPON上行带宽分配算法——轮询周期受限的双级动态带宽分配算法。这种算法结合用户等级协定和DiffServ的特点,采用周期受限的轮询方法和双级的带宽分配方式,在OLT端根据ONUi提供的业务队列情况对业务量进行估算,并授权带宽给ONUi,ONUi根据实际的业务量进行再分配。仿真结果表明,这种算法实现了高的带宽利用率,与DBAM相比有效地提高了EPON的QoS。     

An Application-Oriented Buffer Management Strategy in Opportunistic Networks

In Opportunistic networks (ONs), buffer management is critical to improve the message exchanging efficiency due to the limited storage space and transmission bandwidth at the wireless edge. Current solutions make message scheduling and drop policy based on assumptions that messages can always been forwarded in a single contact, and all node pairs have the same contact rates. However, such ideal assumptions are invalid for realistic mobility traces of hand-held. Recent studies show that the single contact duration is limited and the mobility of nodes is heterogeneous in reality. In this paper, a buffer management strategy based on contact duration and heterogeneous mobility is proposed to improve the efficiency of buffer policy in the practical applications. We mainly focus on the minimization of the total expected delivery delay for all messages in ONs with resource constraints. Using the global network information including existing copies of message in the network, the distribution of pair-wise inter-contact time and contact duration between nodes, we develop a function to compute per-message utility which reflects the contribution of single message to the total expected delivery delay. Messages are scheduled or dropped according to their utilities. Simulation results show that our proposed strategy not only achieves lower delivery delay than mainstream strategies, but also keeps a high delivery ratio and a low network overhead.     

一种支持多跳无线网QoS业务的MAC层接入协议

提供一定的服务质量保证(QoS)是多跳无线网络研究中的热点和难点,本文基于TDMA/FDMA机制提出了一种支持多信道多跳无线网络话音级QoS业务的MAC层接入协议RA/SRN。该协议以RBRP协议思想为基础,针对无线信道中隐藏、暴露终端造成的信道利用率降低和分组冲突问题进行改进设计,减小了信道冲突概率,提高了信道利用率,降低了信道接入时延,为网络层QoS路由协议提供了良好的支持。     

Wireless mesh networks channel reservation: modelling and delay analysis

In order to overcome the negotiation procedure bottleneck of the standard DCF in wireless mesh networks, the authors propose a new channel reservation function (CRF) that reduces the negotiation overhead of the DCF, which as a result reduces the overall transmission delay effectively without of any extra bandwidth consumption. Furthermore, the authors provide an analytical model for the proposed scheme for which the simulation results measure the amount that the new method can reduce the average total delay for both regular and fragmented mesh topologies demonstrating superiority of the new method over the classic 802.11 solution. Additionally, the authors extend the scheme to multichannel CRF upon which the proposed method can be used for multichannel applications.     

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.     

Provision of proportional delay differentiation in wireless LAN using a cross-layer fine-tuning scheduling scheme

The proportional delay differentiation (PDD) is one of the most well-known quality of service (QoS) models and has drawn much attention because of its 'controllable' and 'predictable' characteristics. How to provide PDD in a wireless LAN (WLAN) is addressed and a cross-layer fine-tuning scheduling (CFS) scheme with the goal to maintain PDD among all wireless stations is proposed, while improving performance in a WLAN. CFS additionally considers the time-varying channel capacity to schedule packets, finely tunes the contention window and properly arbitrates the backoff time. Also, it operates in a fully distributed manner among all stations and in a cross-layer approach in each station. The simulation results demonstrate that the CFS scheme can provide more satisfactory PDD and higher performance in a WLAN, compared with 802.1 le.     

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.