35 research outputs found
An analytical model for performance evaluation of multimedia applications over EDCA in an IEEE 802.11e WLAN
We extend the modeling heuristic of (Harsha et al. 2006. In IEEE IWQoS '06, pp 178-187) to evaluate the performance of an IEEE 802.11e infrastructure network carrying packet telephone calls, streaming video sessions and TCP controlled file downloads, using Enhanced Distributed Channel Access (EDCA). We identify the time boundaries of activities on the channel (called channel slot boundaries) and derive a Markov Renewal Process of the contending nodes on these epochs. This is achieved by the use of attempt probabilities of the contending nodes as those obtained from the saturation fixed point analysis of (Ramaiyan et al. 2005. In Proceedings ACM Sigmetrics, '05. Journal version accepted for publication in IEEE TON). Regenerative analysis on this MRP yields the desired steady state performance measures. We then use the MRP model to develop an effective bandwidth approach for obtaining a bound on the size of the buffer required at the video queue of the AP, such that the streaming video packet loss probability is kept to less than 1%. The results obtained match well with simulations using the network simulator, ns-2. We find that, with the default IEEE 802.11e EDCA parameters for access categories AC 1, AC 2 and AC 3, the voice call capacity decreases if even one streaming video session and one TCP file download are initiated by some wireless station. Subsequently, reducing the voice calls increases the video downlink stream throughput by 0.38 Mbps and file download capacity by 0.14 Mbps, for every voice call (for the 11 Mbps PHY). We find that a buffer size of 75KB is sufficient to ensure that the video packet loss probability at the QAP is within 1%
Contributions to QoS and energy efficiency in wi-fi networks
The Wi-Fi technology has been in the recent years fostering the proliferation of attractive mobile computing devices with broadband capabilities. Current
Wi-Fi radios though severely impact the battery duration of these devices thus limiting their potential applications.
In this thesis we present a set of contributions that address the challenge of increasing energy efficiency in Wi-Fi networks. In particular, we consider
the problem of how to optimize the trade-off between performance and energy effciency in a wide variety of use cases and applications. In this context, we introduce novel energy effcient algorithms for real-time and data applications, for distributed and centralized Wi-Fi QoS and power saving protocols and for Wi-Fi stations and Access Points.
In addition, the di¿erent algorithms presented in this thesis adhere to the following design guidelines: i) they are implemented entirely at layer two, and
can hence be easily re-used in any device with a Wi-Fi interface, ii) they do not require modi¿cations to current 802.11 standards, and can hence be readily deployed in existing Wi-Fi devices, and iii) whenever possible they favor client side solutions, and hence mobile computing devices implementing them can benefit from an increased energy efficiency regardless of the Access Point they connect to. Each of our proposed algorithms is thoroughly evaluated by means of both theoretical analysis and packet level simulations. Thus, the contributions presented in this thesis provide a realistic set of tools to improve energy efficiency in current Wi-Fi networks
A differentiated Services Architecture for Quality of Service Provisioning in Wireless Local Area Networks
Currently the issue of Quality of Service (QoS) is a major problem in IP networks due to the growth in multimedia traffic (e.g. voice and video applications) and therefore many mechanisms like IntServ, DiffServ, etc. have been proposed. Since the IEEE 802.11b (or Wi-Fi) standard was approved in 1999, it has gained in popularity to become the leading Wireless Local Area Network (WLAN) technology with millions of such networks deployed worldwide. Wireless networks have a limited capacity (11 Mbits/s in the case of Wi-Fi networks) owing to the limited amount of frequency spectrum available. At any given time there may be a large number of users contending for access which results in the bandwidth available to each user being severely limited. Moreover, the system does not differentiate between traffic types which means that all traffic, regardless of its importance or priority, experiences the same QoS. An important network application requiring QoS guarantees is the provision of time-bounded services, such as voice over IP and video streaming, where the combination of packet delay, jitter and packet loss will impact on the perceived QoS. Consequently this has led to a large amount of research work focussing mainly on QoS enhancement schemes for the 802.11 MAC mechanism. The Task Group E of the IEEE 802.11 working group has been developing an extension to the Wi-Fi standard that proposes to make changes to the MAC mechanism to support applications with QoS requirements. The 802.11e QoS standard is currently undergoing final revisions before approval expected sometime in 2004. As 802.11e WLAN equipment is not yet available, performance reports can only be based on simulation. The objective of this thesis was to develop a computer simulator that implements the upcoming IEEE 802.11e standard and to use this simulator to evaluate the QoS performance enhancement potential of 802.11e. This thesis discusses the QoS facilities, analyses the MAC protocol enhancements and compares them with the original 802.11 standard. The issue of QoS provisioning is primarily concerned with providing predictable performance guarantees with regard to throughput, packet delay, jitter and packet loss. The simulated results indicate that the proposed QoS enhancements to the MAC will considerably improve QoS performance in 802.11b WLANs. However, in order for the proposed 802.11e QoS mechanism to be effective the 802.11e parameters will need to be continually adjusted in order to ensure QoS guarantees are fulfilled for all traffic loads
Recommended from our members
Design and optimization of QoS-based medium access control protocols for next-generation wireless LANs
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In recent years, there have been tremendous advances in wireless & mobile communications, including wireless radio techniques, networking protocols, and mobile devices. It is expected that different
broadband wireless access technologies, e.g., WiFi (IEEE 802.11) and WiMAX (IEEE 802.16) will coexist in the future. In the meantime, multimedia applications have experienced an explosive growth with increasing user demands. Nowadays, people expect to receive high-speed video, audio, voice and web services even when being mobile. The key question that needs to be answered, then, is how do we ensure that users always have the "best" network performance with the "lowest" costs in such complicated situations? The latest IEEE 802.11n standards attains rates of more than 100 Mbps by introducing innovative enhancements at the PHY and MAC layer, e.g. MIMO and Frame Aggregation, respectively. However, in this thesis we demonstrate that frame aggregation's performance adheres due to the EDCA scheduler's priority mechanism and consequently resulting in the network's poor overall performance. Short waiting times for high priority flows into the aggregation queue resolves to poor channel utilization. A Delayed Channel Access algorithm was designed to intentionally postpone the channel access procedure so that the number of packets in a formed frame can be increased and so will the network's overall performance. However, in some cases, the DCA algorithm has a negative impact on the applications that utilize the TCP protocol, especially the when small TCP window sizes are engaged. So, the TCP process starts to refrain from sending data due to delayed acknowledgements and the overall throughput drops. In this thesis, we address the above issues by firstly demonstrating the potential performance benefits of frame aggregation over the next generation wireless networks. The efficiency and behaviour of frame aggregation within a single queue, are mathematically analysed with the aid of a M=G[a;b]=1=K model. Results show that a trade-off choice has to be taken into account over minimizing the waiting time or maximizing utilization. We also point out that there isn't an optimum batch collection rule which can be assumed as generally valid but individual cases have to be considered separately. Secondly, we demonstrate through extensive simulations that by introducing a method, the DCA algorithm, which dynamically determines and adapts batch collections based upon the traffic's characteristics, QoS requirements
and server's maximum capacity, also improves e ciency. Thirdly, it is important to understand the behaviour of the TCP
ows over the WLAN and the influence that DCA has over the degrading performance of the TCP protocol. We investigate the cause of the problem and provide the foundations of designing and implementing possible solutions. Fourthly, we introduce two innovative proposals, one amendment and one extension to the original DCA algorithm, called Adaptive DCA and Selective DCA, respectively. Both solutions have been implemented in OPNET and extensive simulation runs over a wide set of scenarios show their effectiveness over the network's overall performance, each in its own way.This study was supported by the Engineering and Physical Sciences Research Council (EPSRC)
Recommended from our members
Towards the Quality of Service for VoIP traffic in IEEE 802.11 Wireless Networks
The usage of voice over IP (VoIP) traffic in IEEE 802.11 wireless networks is expected to increase in the near future due to widely deployed 802.11 wireless networks and VoIP services on fixed lines. However, the quality of service (QoS) of VoIP traffic in wireless networks is still unsatisfactory. In this thesis, I identify several sources for the QoS problems of VoIP traffic in IEEE 802.11 wireless networks and propose solutions for these problems. The QoS problems discussed can be divided into three categories, namely, user mobility, VoIP capacity, and call admission control. User mobility causes network disruptions during handoffs. In order to reduce the handoff time between Access Points (APs), I propose a new handoff algorithm, Selective Scanning and Caching, which finds available APs by scanning a minimum number of channels and furthermore allows clients to perform handoffs without scanning, by caching AP information. I also describe a new architecture for the client and server side for seamless IP layer handoffs, which are caused when mobile clients change the subnet due to layer 2 handoffs. I also present two methods to improve VoIP capacity for 802.11 networks, Adaptive Priority Control (APC) and Dynamic Point Coordination Function (DPCF). APC is a new packet scheduling algorithm at the AP and improves the capacity by balancing the uplink and downlink delay of VoIP traffic, and DPCF uses a polling based protocol and minimizes the bandwidth wasted from unnecessary polling, using a dynamic polling list. Additionally, I estimated the capacity for VoIP traffic in IEEE 802.11 wireless networks via theoretical analysis, simulations, and experiments in a wireless test-bed and show how to avoid mistakes in the measurements and comparisons. Finally, to protect the QoS for existing VoIP calls while maximizing the channel utilization, I propose a novel admission control algorithm called QP-CAT (Queue size Prediction using Computation of Additional Transmission), which accurately predicts the impact of new voice calls by virtually transmitting virtual new VoIP traffic
Supporting Internet Access and Quality of Service in Distributed Wireless Ad Hoc Networks
In this era of wireless hysteria, with continuous technological advances in wireless communication and new wireless technologies becoming standardized at a fast rate, we can expect an increased interest for wireless networks, such as ad hoc and mesh networks. These networks operate in a distributed manner, independent of any centralized device. In order to realize the practical benefits of ad hoc networks, two challenges (among others) need to be considered: distributed QoS guarantees and multi-hop Internet access. In this thesis we present conceivable solutions to both of these problems. An autonomous, stand-alone ad hoc network is useful in many cases, such as search and rescue operations and meetings where participants wish to quickly share information. However, an ad hoc network connected to the Internet is even more desirable. This is because Internet plays an important role in the daily life of many people by offering a broad range of services. In this thesis we present AODV+, which is our solution to achieve this network interconnection between a wireless ad hoc network and the wired Internet. Providing QoS in distributed wireless networks is another challenging, but yet important, task mainly because there is no central device controlling the medium access. In this thesis we propose EDCA with Resource Reservation (EDCA/RR), which is a fully distributed MAC scheme that provides QoS guarantees by allowing applications with strict QoS requirements to reserve transmission time for contention-free medium access. Our scheme is compatible with existing standards and provides both parameterized and prioritized QoS. In addition, we present the Distributed Deterministic Channel Access (DDCA) scheme, which is a multi-hop extension of EDCA/RR and can be used in wireless mesh networks. Finally, we have complemented our simulation studies with real-world ad hoc and mesh network experiments. With the experience from these experiments, we obtained a clear insight into the limitations of wireless channels. We could conclude that a wise design of the network architecture that limits the number of consecutive wireless hops may result in a wireless mesh network that is able to satisfy users’ needs. Moreover, by using QoS mechanisms like EDCA/RR or DDCA we are able to provide different priorities to traffic flows and reserve resources for the most time-critical applications
Traffic Control and Quality of Service in Wireless LANs
The thesis deals with two aspects of the IEEE 802.11 standard. The first is the so-called “performance anomaly”: the variable bandwidth of the links and the use of multiple transmission rates push the throughput of all stations to align to the slowest one. To tackle this problem we designed and developed a simple channel-aware scheduling algorithm, called DTT, which actualises the proportional fairness concept, thus leading to noteworthy improvements, and in particular to flow isolation. This is achieved by measuring link quality as the time needed to deliver a frame. The resource to share is no longer capacity, but the time the channel is in use. DTT has then been integrated into a prototype Access Point, which is the first working implementation of a scheduler based on proportional fairness.
Secondly, we focused on 802.11e networks, which, though enhancing QoS support, still offer scarce reliability of QoS guarantees and suffer from network congestion. We devised two admission control algorithms to assess the maximum number of users allowable to the services while satisfying QoS requirements. Following the studies on DTT, both algorithms centre the admission test on the time occupancy of the medium. The first algorithm builds on an analytical model of the EDCA mode in non-saturation conditions. This closely matches the real behaviour of a network carrying time-sensitive applications, thus overcoming the limits of all previous works, based on saturation models. The second algorithm uses and extends to 802.11e the NUC, a parameter defined and proved effective for 802.11b systems. This scheme needs measures of the actual state of the network. Simulations run within the E-model framework show good accuracy performance for both models