670 research outputs found
Providing Dynamic TXOP for QoS Support of Video Transmission in IEEE 802.11e WLANs
The IEEE 802.11e standard introduced by IEEE 802.11 Task Group E (TGe)
enhances the Quality of Service (QoS) by means of HCF Controlled Channel Access
(HCCA). The scheduler of HCCA allocates Transmission Opportunities (TXOPs) to
QoS-enabled Station (QSTA) based on their TS Specifications (TSPECs) negotiated
at the traffic setup time so that it is only efficient for Constant Bit Rate
(CBR) applications. However, Variable Bit Rate (VBR) traffics are not
efficiently supported as they exhibit nondeterministic profile during the time.
In this paper, we present a dynamic TXOP assignment Scheduling Algorithm for
supporting the video traffics transmission over IEEE 802.11e wireless networks.
This algorithm uses a piggybacked information about the size of the subsequent
video frames of the uplink traffic to assist the Hybrid Coordinator accurately
assign the TXOP according to the fast changes in the VBR profile. The proposed
scheduling algorithm has been evaluated using simulation with different
variability level video streams. The simulation results show that the proposed
algorithm reduces the delay experienced by VBR traffic streams comparable to
HCCA scheduler due to the accurate assignment of the TXOP which preserve the
channel time for transmission.Comment: arXiv admin note: substantial text overlap with arXiv:1602.0369
Distributed QoS Guarantees for Realtime Traffic in Ad Hoc Networks
In this paper, we propose a new cross-layer framework, named QPART ( QoS br>rotocol for Adhoc Realtime Traffic), which provides QoS guarantees to real-time multimedia applications for wireless ad hoc networks. By adapting the contention window sizes at the MAC layer, QPART schedules packets of flows according to their unique QoS requirements. QPART implements priority-based admission control and conflict resolution to ensure that the requirements of admitted realtime flows is smaller than the network capacity. The novelty of QPART is that it is robust to mobility and variances in channel capacity and imposes no control message overhead on the network
QoS based aggregation in high speed IEEE802.11 wireless networks
We propose a novel frame aggregation algorithm with statistical delay guarantee for high speed IEEE802.11 networks considering link quality fluctuations. We use the concept of effective capacity to formulate frame aggregation with QoS guarantee as an optimization problem. The QoS guarantee is in the form of a target delay bound and violation probability. We apply proper approximations to derive a simple formulation, which is solved using a Proportional-Integral-Derivative (PID) controller. The proposed PID aggregation algorithm independently adapts the amount of time allowance for each link, while it needs to be implemented only at the Access Point (AP), without requiring any change to the 802.11 Medium Access Control (MAC). More importantly, the aggregator does not consider any physical layer or channel information, as it only makes use of queue level metrics, such as average queue length and link utilization, for tuning the amount of time allowance. NS-3 simulations show that our proposed scheme outperforms Earliest Deadline First (EDF) scheduling with maximum aggregation size and pure deadlinebased aggregation, both in terms of maximum number of stations and channel efficiency
Enhancement of QoS support of HCCA schedulers using EDCA function in IEEE 802.11e networks
The IEEE 802.11e standard introduces Quality of Service support for wireless local area networks through two MAC functions: Enhanced Distributed Channel Access (EDCA) and HCF Controlled Channel Access (HCCA). While the former provides prioritized contention-based access to the medium, the latter uses a parameterized contention-free polling scheme. Several studies have proposed enhancements to EDCA or improved scheduling algorithms for HCCA to properly support VBR traffic. However, the cooperation between these functions has only marginally been considered and the solutions vary depending on specific traffic requirements.
In this paper we propose a novel approach to address the problem of scheduling VBR traffic streams. Our scheduler, named Overboost, uses HCCA to negotiate a minimum bandwidth and deals with traffic streams that require more bandwidth than the negotiated one by redirecting the excess bandwidth to the EDCA function. An analytical evaluation has been conducted and the results has been corroborated by an extensive set of simulations. They show that the overall scheduler improves the performance with respect to other HCCA schedulers in terms of null rate, throughput, access delay, and queue length
W-CBS: A Scheduling Algorithm for Supporting QoS in IEEE 802.11e
This paper presents a new scheduling algorithm, the Wireless Constant Bandwidth Server (W-CBS) for the Access Points of an IEEE 802.11e wireless networks to support traffic streams with Quality of Service guarantees, in particular in the case of multimedia applications which present variable bit rate traffic. The performance of W-CBS is compared to that of the reference scheduler defined in 802.11e standard using the ns2 simulator. The results show that the W-CBS outperforms the reference scheduler with VBR traffic, in terms of resource utilization and maximum admitted flows
Multipath routing and QoS provisioning in mobile ad hoc networks
PhDA Mobile Ad Hoc Networks (MANET) is a collection of mobile nodes that can
communicate with each other using multihop wireless links without utilizing any
fixed based-station infrastructure and centralized management. Each mobile node
in the network acts as both a host generating flows or being destination of flows
and a router forwarding flows directed to other nodes.
Future applications of MANETs are expected to be based on all-IP
architecture and be capable of carrying multitude real-time multimedia
applications such as voice and video as well as data. It is very necessary for
MANETs to have an efficient routing and quality of service (QoS) mechanism to
support diverse applications.
This thesis proposes an on-demand Node-Disjoint Multipath Routing protocol
(NDMR) with low broadcast redundancy. Multipath routing allows the
establishment of multiple paths between a single source and single destination
node. It is also beneficial to avoid traffic congestion and frequent link breaks in
communication because of the mobility of nodes. The important components of
the protocol, such as path accumulation, decreasing routing overhead and
selecting node-disjoint paths, are explained. Because the new protocol
significantly reduces the total number of Route Request packets, this results in an
increased delivery ratio, smaller end-to-end delays for data packets, lower control
overhead and fewer collisions of packets.
Although NDMR provides node-disjoint multipath routing with low route
overhead in MANETs, it is only a best-effort routing approach, which is not
enough to support QoS. DiffServ is a standard approach for a more scalable way
to achieve QoS in any IP network and could potentially be used to provide QoS
in MANETs because it minimises the need for signalling. However, one of the
biggest drawbacks of DiffServ is that the QoS provisioning is separate from the
routing process. This thesis presents a Multipath QoS Routing protocol for
iv
supporting DiffServ (MQRD), which combines the advantages of NDMR and
DiffServ. The protocol can classify network traffic into different priority levels
and apply priority scheduling and queuing management mechanisms to obtain
QoS guarantees
Spectrum Sharing Methods in Coexisting Wireless Networks
Radio spectrum, the fundamental basis for wireless communication, is a finite resource. The development of the expanding range of radio based devices and services in recent years makes the spectrum scarce and hence more costly under the paradigm of extensive regulation for licensing. However, with mature technologies and with their continuous improvements it becomes apparent that tight licensing might no longer be required for all wireless services. This is from where the concept of utilizing the unlicensed bands for wireless communication originates. As a promising step to reduce the substantial cost for radio spectrum, different wireless technology based networks are being deployed to operate in the same spectrum bands, particularly in the unlicensed bands, resulting in coexistence. However, uncoordinated coexistence often leads to cases where collocated wireless systems experience heavy mutual interference. Hence, the development of spectrum sharing rules to mitigate the interference among wireless systems is a significant challenge considering the uncoordinated, heterogeneous systems. The requirement of spectrum sharing rules is tremendously increasing on the one hand to fulfill the current and future demand for wireless communication by the users, and on the other hand, to utilize the spectrum efficiently. In this thesis, contributions are provided towards dynamic and cognitive spectrum sharing with focus on the medium access control (MAC) layer, for uncoordinated scenarios of homogeneous and heterogeneous wireless networks, in a micro scale level, highlighting the QoS support for the applications. This thesis proposes a generic and novel spectrum sharing method based on a hypothesis: The regular channel occupation by one system can support other systems to predict the spectrum opportunities reliably. These opportunities then can be utilized efficiently, resulting in a fair spectrum sharing as well as an improving aggregated performance compared to the case without having special treatment. The developed method, denoted as Regular Channel Access (RCA), is modeled for systems specified by the wireless local resp. metropolitan area network standards IEEE 802.11 resp. 802.16. In the modeling, both systems are explored according to their respective centrally controlled channel access mechanisms and the adapted models are evaluated through simulation and results analysis. The conceptual model of spectrum sharing based on the distributed channel access mechanism of the IEEE 802.11 system is provided as well. To make the RCA method adaptive, the following enabling techniques are developed and integrated in the design: a RSS-based (Received Signal Strength based) detection method for measuring the channel occupation, a pattern recognition based algorithm for system identification, statistical knowledge based estimation for traffic demand estimation and an inference engine for reconfiguration of resource allocation as a response to traffic dynamics. The advantage of the RCA method is demonstrated, in which each competing collocated system is configured to have a resource allocation based on the estimated traffic demand of the systems. The simulation and the analysis of the results show a significant improvement in aggregated throughput, mean delay and packet loss ratio, compared to the case where legacy wireless systems coexists. The results from adaptive RCA show its resilience characteristics in case of dynamic traffic. The maximum achievable throughput between collocated IEEE 802.11 systems applying RCA is provided by means of mathematical calculation. The results of this thesis provide the basis for the development of resource allocation methods for future wireless networks particularly emphasized to operate in current unlicensed bands and in future models of the Open Spectrum Alliance
- …