Dynamic bandwidth management in IEEE 802.11-based multihop wireless networks

In this paper, we propose a new protocol named dynamic regulation of best-effort traffic (DRBT) which supports quality of service (QoS) throughput guarantees and provides a distributed regulation mechanism for best-effort traffic in multihop wireless networks. By adapting dynamically the rate of best-effort traffic at the link layer, DRBT increases the acceptance ratio of QoS flows and provides a good use of the remaining resources through the network. Our protocol also provides an accurate method to evaluate the available bandwidth in IEEE 802.11-based ad hoc networks which is able to differentiate QoS applications from best-effort traffic. Through extensive simulations, we compare the performance of our proposal scheme with some others protocols like QoS protocol for ad hoc real-time traffic for instance.     

Provisioning of Parameterized Quality of Service in 802.11e Based Wireless Mesh Networks

There has been a growing interest in the use of wireless mesh networks. Today’s wireless technology enables very high data rate up to hundreds of Megabits per second, which creates the high demand of supporting real-time multimedia applications over wireless mesh networks. Hence it is imperative to support quality of service (QoS) in wireless mesh networks. In this paper, we design a framework to provide parameterized QoS in 802.11e based wireless mesh networks. Our framework consists of admission control algorithms and scheduling algorithms, which aim at supporting constant bit-rate (CBR) traffic flows, as well as variable bit-rate (VBR) traffic flows. We first present deterministic end-to-end delay bounds for CBR traffic. We then prove that the delay of VBR traffic can be bounded if the traffic flow conforms to a leaky-bucket regulator. We further study different admission control algorithms for VBR traffic. Our simulation results show that, by taking advantage of statistical multiplexing, much more traffic flows can be admitted.     

Asymptotic loss of real-time traffic in wireless mobile networks with selective-repeat ARQ

We study the issue of quality of service (QoS) for real-time traffic over a wireless channel deploying automatic repeat request (ARQ) error control. An analytical model has been derived to evaluate the queueing related loss and the wireless channel related loss. In contrast to previous work, this model quantifies the interaction between the network layer and the physical layer, and then it enables the admission controllers of wireless networks to improve utilization while satisfying the traffic QoS constraints through cross-layer design techniques.     

A MAC-Layer QoS Provisioning Protocol for Cognitive Radio Networks

Due to the proliferation of diverse network devices with multimedia capabilities, there is an increasing need for Quality of Service (QoS) provisioning in wireless networks. The MAC layer protocol with enhanced distributed channel access (EDCA) in the IEEE 802.11-2007 is able to provide differentiated QoS for different traffic types in wireless networks through varying the Arbitration Inter-Frame Spaces (AIFS) and contention window sizes. However, the performance of high priority traffic can be seriously degraded in the presence of strong noise over the wireless channels. Schemes utilizing adaptive modulation and coding (AMC) technique have also been proposed for the provisioning of QoS. They can provide limited protection in the presence of noise but are ineffective in a high noise scenario. Although multiple non-overlapped channels exist in the 2.4 and 5?GHz spectrum, most IEEE 802.11-based multi-hop ad hoc networks today use only a single channel at anytime. As a result, these networks cannot fully exploit the aggregate bandwidth available in the radio spectrum provisioned by the standards. By identifying vacant channels through the use of cognitive radios technique, the noise problem can be mitigated by distributing network traffic across multiple vacant channels to reduce the node density per transmission channel. In this paper, we propose the MAC-Layer QoS Provisioning Protocol (MQPP) for 802.11-based cognitive radio networks (CRNs) which combines adaptive modulation and coding with dynamic spectrum access. Simulation results demonstrate that MQPP can achieve better performance in terms of lower delay and higher throughput.     

Dynamic-Grouping bandwidth reservation scheme for multimedia wireless networks

In wireless networks carrying multimedia traffic (voice, video, data, and image), it becomes necessary to provide a quality-of-service(QoS) guarantee for multimedia traffic connections supported by the network. In order to provide mobile hosts with high QoS in the next-generation wireless networks, efficient and better bandwidth reservation schemes must be designed. This paper presents a novel dynamic-grouping bandwidth reservation scheme as a solution to support QoS guarantees in the next-generation wireless networks. The proposed scheme is based on the probabilistic resource estimation to provide QoS guarantees for multimedia traffic in wireless cellular networks. We establish several reservation time sections, called groups, according to the mobility information of mobile hosts of each base station. The amount of reserved bandwidth for each base station is dynamically adjusted for each reservation group. We use the dynamic-grouping bandwidth reservation scheme to reduce the connection blocking rate and connection dropping rate, while increasing the bandwidth utilization. The simulation results show that the dynamic-grouping bandwidth reservation scheme provides less connection-blocking rate and less connection-dropping rate and achieves high bandwidth utilization.     

An Efficient and Adaptive Bandwidth Allocation Scheme for Mobile Wireless Networks Using an On-Line Local Estimation Technique

The next generation of mobile wireless networks has to provide the quality-of-service (QoS) for a variety of applications. One of the key generic QoS parameters is the call dropping probability, which has to be maintained at a predefined level independent of the traffic condition. In the presence of bursty data and the emerging multimedia traffic, an adaptive and dynamic bandwidth allocation is essential in ensuring this QoS. The paradox, however, is that all existing dynamic bandwidth allocation schemes require the prior knowledge of all traffic parameters or/and user mobility parameters. In addition, most proposals require extensive status information exchange among cells in order to dynamically readjust the control parameters, thus making them difficult to be used in actual deployment.In this paper, we introduce a novel adaptive bandwidth allocation scheme which estimates dynamically the changing traffic parameters through local on-line estimation. Such estimations are restricted to each individual cell, thus completely eliminating the signaling overhead for information exchange among cells. Furthermore, we propose the use of a probabilistic control policy, which achieves a high channel utilization, and leads to an effective and stable control. Through simulations, we show that our proposed adaptive bandwidth allocation scheme can guarantee the predetermined call dropping probability under changing traffic conditions while at the same time achieving a high channel utilization.     

Broadband satellite networks-the global IT bridge

Next-generation broadband satellite networks are being developed to carry bursty Internet and multimedia traffic in addition to the traditional circuit-switched traffic (mainly voice) on a global basis. These satellites provide direct network access for personal applications as well as interconnectivity to the terrestrial remote network segments. The main requirement in success of these networks is that they should be able to transmit high data rate traffic with prescribed quality of service (QoS). Thus, the broadband satellite network has no choice other than the rise of ATM technology and to be optimized for Internet-based traffic. ATM is the promising technology for supporting high-speed data transfer potentially suitable for all varieties of private and public telecommunications networks. IP, on the other hand is the fast-growing Internet layer protocol that is applicable over any data link layer Internet-based applications are the emerging source of traffic in the future wireless networks and broadband satellite networks should consider Internet as the primary service. In this paper, we discuss the traditional ATM and wireless ATM networks and explain the characteristics of the wireless IP networks. The paper then uses those concepts in defining the criteria for the broadband satellite networks such as the QoS and traffic management. Application of the broadband satellite networks is also proposed     

WiQoSM: An Integrated QoS-Aware Mobility and User Behavior Model for Wireless Data Networks

Modeling mobility and user behavior is of fundamental importance in testing the performance of protocols for wireless data networks. Although several models have been proposed in the literature, none of them can at the same time capture important features such as geographical mobility, user-generated traffic, and the wireless technology at hand. When collectively considered, these three aspects determine the user-perceived quality-of-service (QoS) level, which, in turn, might have an influence on the mobility of those users (we call them QoS-driven users) who do not display constrained mobility patterns, but they can decide to move to less congested areas of the network in case their perceived QoS level becomes unacceptable. In this paper, we introduce the Wireless QoS-aware Mobility (WiQoSM) model, which collectively considers all of the above mentioned aspects of wireless data networks. WiQoSM is composed of 1) a user mobility model, 2) a user traffic model, 3) a wireless technology model, and 4) a QoS model. Components 1,2, and 3 provide input to the QoS model, which, in turn, can influence the mobility behavior of QoS-driven users. WiQoSM is very simple to use and configure and can be used to generate user and traffic traces at the access points (APs) composing a wireless data network. WiQoSM is shown to be able to generate traces that resemble statistical features observed in traces extracted from real-world wireless local area network (WLAN) deployments. Furthermore, WiQoSM has the nice feature of allowing the fine tuning of a disjoint set of parameters in order to influence different statistical properties of the generated traces and of providing the network designer with a high degree of flexibility in choosing network parameters such as the number of users and APs, wireless channel technology, traffic mix, and so on. Given the above features, WiQoSM can be a valuable tool in the simulation of wireless data network protocols.     

Dynamic Bandwidth Management in Single-Hop Ad Hoc Wireless Networks

Distributed weighted fair scheduling schemes for Quality of Service (QoS) support in wireless local area networks have not yet become standard. Therefore, we propose an Admission Control and Dynamic Bandwidth Management scheme that provides fairness and a soft rate guarantee in the absence of distributed MAC-layer weighted fair scheduling. This scheme is especially suitable for smart-rooms where peer-to-peer multimedia transmissions need to adapt their transmission rates co-operatively. We present a mapping scheme to translate the bandwidth requirements of an application into its channel time requirements. The center piece of our scheme is a Bandwidth Manager, which allots each flow a share of the channel, depending on the flow's requirements relative to the requirements of other flows in the network. Admitted flows control their transmission rates so they only occupy the channel for the fraction of time allotted to them. Thus co-operation between flows is achieved and the channel time is fair shared. As the available channel capacity changes and the traffic characteristics of various flows change, the Bandwidth Manager dynamically re-allocates the channel access time to the individual flows. Our simulation experiments show that, at a very low cost and with high probability, every admitted flow in the network will receive at least its minimum requested share of the network bandwidth. We also present extensive testbed experiments with our scheme using a real-time audio streaming application running between Linux laptops equipped with standard IEEE 802.11 network cards.     

Delay minimization and priority scheduling in wireless mesh networks

Wireless mesh networks (WMNs) have emerged as a significant technology for applications because of its advantage of multi-radio and multi-channel which makes it perform better than wireless LANs. Furthermore, quality-of-service (QoS) support can be achieved by some distinguished ways in WMN. In this paper, QoS requirements are recorded by traffic profile, QoS constraints are formulated as delay time of transmitting all the requested data flows in the network. Multi-commodity flow technologies are applied for handling this issue. After minimizing the delay of the network by the assistance of multi-commodity-flow techniques and resource contention graph, we use effective channel assignment algorithm to schedule the data flows under the QoS constraints. Our evaluation indicates that our technologies successfully route flows under their special QoS requirements with different priority.     

Adaptive Rate Control and QoS Provisioning in Direct Broadcast Satellite Networks

Adaptive rate control, if properly employed, is an effective mechanism to sustain acceptable levels of Quality of Service (QoS) in wireless networks where channel and traffic conditions vary over time. In this paper we present an adaptive rate (source and channel) control mechanism, developed as part of an Adaptive Resource Allocation and Management (ARAM) algorithm, for use in Direct Broadcast Satellite (DBS) networks. The algorithm performs admission control and dynamically adjusts traffic source rate and Forward Error Correction (FEC) rate in a co-ordinated fashion to satisfy QoS requirements. To analyze its performance, we have simulated the adaptive algorithm with varying traffic flows and channel conditions. The traffic flow is based on a variable bit rate (VBR) source model that represents Motion Picture Expert Group (MPEG) traffic fluctuations while the DBS channel model is based on a two-state Additive White Gaussian Noise (AWGN) channel. For measures of performance, the simulator quantifies throughput, frame loss due to congestion during transmission as well as QoS variations due to channel (FEC) and source (MPEG compression and data transmission) rate changes. To show the advantage of the adaptive FEC mechanism, we also present the performance results when fixed FEC rates are employed. The results indicate significant throughput and/or quality gains are possible when the FEC/source pairs are adjusted properly in co-ordination with source rate changes.     

基于多门限预留机制的自适应带宽分配算法

针对异构无线网络融合环境提出了一种基于多门限预留机制的自适应带宽分配算法,从而为多业务提供QoS保证。该算法采用多宿主传输机制,通过预设各个网络中不同业务的带宽分配门限,并基于各个网络中不同业务和用户的带宽分配矩阵,根据业务k支持的传输速率等级需求和网络状态的变化,将自适应带宽分配问题转化为一个动态优化问题并采用迭代方法来求解,在得到各个网络中不同业务和用户优化的带宽分配矩阵的同时,在带宽预留门限和网络容量的约束条件下实现网络实时吞吐量的最大化,以提高整个异构网络带宽的利用效率。数值仿真结果显示,所提算法能够支持满足QoS需求的传输速率等级,减小了新用户接入异构网络的阻塞概率,提高了平均用户接入率并将网络吞吐量最大提高40%。     

Quality-of-service in ad hoc carrier sense multiple access wirelessnetworks

Carrier sense multiple access (CSMA) is one of the most pervasive medium access control (MAC) schemes in ad hoc, wireless networks. However, CSMA and its current variants do not provide quality-of-service (QoS) guarantees for real-time traffic support. This paper presents and studies black-burst (BB) contention, which is a distributed MAC scheme that provides QoS real-time access to ad hoc CSMA wireless networks. With this scheme, real-time nodes contend for access to the channel with pulses of energy-so called BBs-the durations of which are a function of the delay incurred by the nodes until the channel became idle. It is shown that real-time packets are not subject to collisions and that they have access priority over data packets. When operated in an ad hoc wireless LAN, BB contention further guarantees bounded and typically very small real-time delays. The performance of the network can approach that attained under ideal time division multiplexing (TDM) via a distributed algorithm that groups real-time packet transmissions into chains. A general analysis of BB contention is given, contemplating several modes of operation. The analysis provides conditions for the scheme to be stable. Its results are complemented with simulations that evaluate the performance of an ad hoc wireless LAN with a mixed population of data and real-time nodes     

Per-Stream QoS and Admission Control in Ethernet Passive Optical Networks (EPONs)

Ethernet passive optical networks (EPONs) are designed to deliver services for numerous applications such as voice over Internet protocol, standard and high-definition video, video conferencing (interactive video), and data traffic. Various dynamic bandwidth allocation and intra-optical network unit (ONU) scheduling algorithms have been proposed to enable EPONs to deliver differentiated services for traffic with different quality of service (QoS) requirements. However, none of these protocols and schedulers can guarantee bandwidth for each class of service nor can they protect the QoS level required by admitted real-time traffic streams. In this paper, we propose the first framework for per-stream QoS protection in EPONs using a two-stage admission control (AC) system. The first stage enables the ONU to perform flow admission locally according to the bandwidth availability, and the second stage allows for global AC at the optical line terminal. Appropriate bandwidth allocation algorithms are presented as well. An event-driven simulation model is implemented to study the effectiveness of the proposed schemes in providing and protecting QoS.     

End-to-End Adaptive QoS Provisioning over GPRS Wireless Mobile Network

The General Packet Radio Service (GPRS) offers performance guaranteed packet data services to mobile users over wireless frequency-division duplex links with time division multiple access, and core packet data networks. This paper presents a dynamic adaptive guaranteed Quality-of-Service (QoS) provisioning scheme over GPRS wireless mobile links by proposing a guaranteed QoS media access control (GQ-MAC) protocol and an accompanying adaptive prioritized-handoff call admission control (AP-CAC) protocol to maintain GPRS QoS guarantees under the effect of mobile handoffs. The GQ-MAC protocol supports bounded channel access delay for delay-sensitive traffic, bounded packet loss probability for loss-sensitive traffic, and dynamic adaptive resource allocation for bursty traffic with peak bandwidth allocation adapted to the current queue length. The AP-CAC protocol provides dynamic adaptive prioritized admission by differentiating handoff requests with higher admission priorities over new calls via a dynamic multiple guard channels scheme, which dynamically adapts the capacity reserved for dealing with handoff requests based on the current traffic conditions in the neighboring radio cells. Integrated services (IntServ) QoS provisioning over the IP/ATM-based GPRS core network is realized over a multi-protocol label switching (MPLS) architecture, and mobility is supported over the core network via a novel mobile label-switching tree (MLST) architecture. End-to-end QoS provisioning over the GPRS wireless mobile network is realized by mapping between the IntServ and GPRS QoS requirements, and by extending the AP-CAC protocol from the wireless medium to the core network to provide a unified end-to-end admission control with dynamic adaptive admission priorities.     

Supporting service differentiation for real-time and best-effort traffic in stateless wireless ad hoc networks (SWAN)

We propose SWAN, a stateless network model which uses distributed control algorithms to deliver service differentiation in mobile wireless ad hoc networks in a simple, scalable and robust manner. The proposed architecture is designed to handle both real-time UDP traffic, and best effort UDP and TCP traffic without the need for the introduction and management of per-flow state information in the network. SWAN supports per-hop and end-to-end control algorithms that primarily rely on the efficient operation of TC/IP protocols. In particular, SWAN uses local rate control for best-effort traffic, and sender-based admission control for real-time UDP traffic. Explicit congestion notification (ECN) is used to dynamically regulate admitted real-time sessions in the face of network dynamics brought on by mobility or traffic overload conditions. SWAN does not require the support of a QoS-capable MAC to deliver service differentiation. Rather, real-time services are built using existing best effort wireless MAC technology. Simulation, analysis, and results from an experimental wireless testbed show that real-time applications experience low and stable delays under various multihop, traffic, and mobility conditions.     

Channel assignment with QoS guarantees for a multiclass multicode CDMA system

In a wireless system that supports multimedia services, each traffic requires different quality of service (QoS) at both communication on radio links and connection admission. We initially derive the uplink capacity satisfying the QoS constraint on radio links in a multiclass multicode code-division multiple-access (CDMA) system. Based on the derived capacity, the number of channel elements, which is one of the system resources, is determined. Then, we define the QoS parameters associated with connection processes. To guarantee the defined QoS at the connection level, under given channel elements, we propose a channel-assignment scheme with dynamic priority adjustment (DPA). The proposed scheme gives multipriority to different traffic classes. Real-time classes can preempt non-real-time classes with restricted preemptive priority. Such restriction is regulated by preemption-free code channels and a buffer threshold for non-real-time classes. Among real-time classes, different priorities are assigned to each traffic class by code reservation parameters. These multipriority parameters are dynamically adjusted in order to guarantee different QoS requirements. We analyze the DPA scheme by the matrix-geometric method, and evaluate the performance of each traffic class. The results show that the proposed scheme flexibly guarantees QoS depending on traffic loading condition and achieves high channel utilization.     

Dynamic priority re-allocation scheme for quality of service in IEEE 802.11e wireless networks

In IEEE 802.11e Enhanced Distributed Coordinator Function (EDCF) (In the recently approved IEEE 802.11e standard, EDCF is renamed to enhanced distributed channel access (EDCA). Throughout this paper, we use EDCF for consistency with early work in the literature.), per-flow service differentiation is achieved by maintaining separate queues for different traffic categories (TCs). However, due to its static Quality of Service (QoS) parameter setting, EDCF does not perform adequately under high traffic load (Romdhani et al., Proceedings of IEEE wireless communications and networking conference, 2003). We present an extended performance model of EDCF and analyze conditions for network getting overloaded. With this extended model, we show that the overall throughput of a network can be improved by changing the distribution of the number of active stations (an active station is one that has a pending packet to be sent) over a set of TCs. Hence, we propose to dynamically re-allocate flow priorities evenly in order to maintain high system performance while providing QoS guarantee for individual real-time flows. Our scheme has several interesting features: (1) performance of EDCF is improved; (2) low priority flows are not starved under high traffic load; (3) misuse of priority (misuse of priority means that a flow requests much higher priority than necessary) can be easily handled. Simulations are conducted for both infrastructure-based and Ad hoc models. Results show that dynamic priority re-allocation does not decrease throughput of real-time flows under low to medium loads, while considerable improvement over EDCF is obtained even under high loads, making it easy to support multimedia applications.     

A Unified Approach to QoS-Guaranteed Scheduling for Channel-Adaptive Wireless Networks

Scheduling amounts to allocating optimally channel, rate and power resources to multiple connections with diverse quality-of-service (QoS) requirements. It constitutes a throughput-critical task at the medium access control layer of today's wireless networks that has been tackled by seemingly unrelated information-theoretic and protocol design approaches. Capitalizing on convex optimization and stochastic approximation tools, the present paper develops a unified framework for channel-aware QoS-guaranteed scheduling protocols for use in adaptive wireless networks whereby multiple terminals are linked through orthogonal fading channels to an access point, and transmissions are (opportunistically) adjusted to the intended channel. The unification encompasses downlink and uplink with time-division or frequency-division duplex operation; full and quantized channel state information comprising a few bits communicated over a limited-rate feedback channel; different types of traffic (best effort, non-real-time, real-time); uniform and optimal power loading; off-line optimal scheduling schemes benchmarking fundamentally achievable rate limits; as well as on-line scheduling algorithms capable of dynamically learning the intended channel statistics and converging to the optimal benchmarks from any initial value. The take-home message offers an important cross-layer design guideline: judiciously developed, yet surprisingly simple, channel-adaptive, on-line schedulers can approach information-theoretic rate limits with QoS guarantees.     

Quality of service models for heterogeneous networks: overview and challenges

The proliferation and convergence of different types of wired, wireless and mobile networks (such as WiMAX, Wireless Mesh Networks, WPANs, WLANs, etc) and cellular-based networks are crucial for the success of next-generation networks. Traditional wired/wireless networks can hardly meet the requirements of future integrated-service networks which are expected to carry multimedia traffic with various quality of service (QoS) requirements. Therefore, it is necessary to develop efficient global control mechanisms that can maintain QoS requirements to maximize network resources utilization, and minimize operational costs on all the types of wireless mobile networks. In this paper, we present an overview of QoS paradigms for heterogeneous networks and focus on those based on deterministic and probabilistic QoS.