701 research outputs found
Adaptive delayed channel access for IEEE 802.11n WLANs
Abstractâ In this paper we investigate potential benefits that an adaptive delayed channel access algorithm can attain for the next-generation wireless LANs, the IEEE 802.11n. We show that the performance of frame aggregation introduced by the 802.11n adheres due to the priority mechanism of the legacy 802.11e EDCA scheduler, resulting in a poor overall performance. Because high priority flows have low channel utilization, the low priority flows throughputs can be amerced further. By introducing an additional delay at the MAC layer, before the channel access scheduling, it will retain aggregate sizes at higher numbers and consequently a better channel utilization. Also, in order to support both UDP and TCP transport layer protocols, the algorithmâs operational conditions are kept adaptive. The simulation results demonstrate that our proposed adaptive delayed channel access outperforms significantly the current 802.11n specification and non-adaptive delayed channel access
FastM: Design and Evaluation of a Fast Mobility Mechanism for Wireless Mesh Networks
Although there is a large volume of work in the literature in terms of mobility approaches for Wireless Mesh Networks, usually these approaches introduce high latency in the handover process and do not support realtime services and applications. Moreover, mobility is decoupled from routing, which leads to inefficiency to both mobility and routing approaches with respect to mobility. In this paper we present a new extension to proactive routing protocols using a fast mobility extension, FastM, with the purpose of increasing handover performance in Wireless Mesh Networks. With this new extension, a new concept is created to integrate information between neighbor wireless mesh routers, managing locations of clients associated to wireless mesh routers in a certain neighborhood, and avoiding packet loss during handover. The proposed mobility approach is able to optimize the handover process without imposing any modifications to the current IEE 802.11 MAC protocol and use unmodified clients. Results show the improved efficiency of the proposed scheme: metrics such as disconnection time, throughput, packet loss and control overhead are largely improved when compared to previous approaches. Moreover, these conclusions apply to mobility scenarios, although mobility decreases the performance of the handover approach, as expected
Service differentiation in multihop wireless packet networks
This work explores the potential of link layer scheduling combined with MAC layer prioritization for providing service differentiation in multihop wireless packet networks. As a result of limited power, multihop characteristic and mobility, packet loss ratio in wireless ad hoc networks tends to be high compared to wireline and one-hop mobile data networks. Therefore, for wireless ad hoc networks, DiffServ-like distributed service differentiation schemes are more viable than hard QoS solutions, which are mainly designed for wireline networks. The choice and implementation of proper queuing and scheduling methods, which determine how packets will use the channel when bandwidth becomes available, contributes significantly to this differentiation. Due to the broadcast nature of wireless communication, media access is one of the main resources that needs to be shared among different flows. Thus, one can design and implement algorithms also at MAC level for service differentiation. In this study, in addition to the scheduling discipline, IEEE 802.11 Distributed Coordination Function is used to increase the media access probability of a specific class of traffic. It is shown that the service requirements of a class can be better met using this two level approach compared to the cases where either of these schemes used alone
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)
- âŠ