An efficient and fair reliable multicast protocol for 802.11-based wireless LANs

Many applications are inherently multicast in nature. Such applications can benefit tremendously from reliable multicast support at the MAC layer since addressing reliability at the MAC level is much less expensive than handling errors at the upper layers. However, the IEEE 802.11 MAC layer does not support reliable multicast. This void in the MAC layer is a limiting factor in the efficacy of multicast applications. In this work, we propose a Slot Reservation based Reliable Multicast protocol that adds a novel reliability component to the existing multicast protocol in the 802.11 MAC. Our protocol builds on the existing DCF support in the IEEE 802.11 MAC to seamlessly incorporate an efficient reliable multicast mechanism. Intelligent assignment of transmission slots, minimal control packet overhead and an efficient retransmission strategy form the basis of our protocol. We evaluate the performance of our protocol through extensive simulations. Our simulation results show that our protocol outperforms another reliable multicast protocol, Batch Mode Multicast MAC, in terms of delivered throughput in various scenarios. We enhance our protocol to add a fairness component in the presence of parallel unicast and multicast flows and provide unicast friendly multicast operation. We then evaluate the performance of our Slot Reservation Based Reliable Multicast Protocol with Fairness through extensive simulations and see that the scheme ensures fairness among parallel unicast and multicas

Wireless model-based predictive networked control system over cooperative wireless network

Owing to their distributed architecture, networked control systems (NCSs) are proven to be feasible in scenarios where a spatially distributed feedback control system is required. Traditionally, such NCSs operate over real-time wired networks. Recently, in order to achieve the utmost flexibility, scalability, ease of deployment, and maintainability, wireless networks such as IEEE 802.11 wireless local area networks (LANs) are being preferred over dedicated wired networks. However, conventional NCSs with event-triggered controllers and actuators cannot operate over such general purpose wireless networks since the stability of the system is compromised due to unbounded delays and unpredictable packet losses that are typical in the wireless medium. Approaching the wireless networked control problem from two perspectives, this work introduces a practical wireless NCS and an implementation of a cooperative medium access control protocol that work jointly to achieve decent control under severe impairments, such as unbounded delay, bursts of packet loss and ambient wireless traffic. The proposed system is evaluated on a dedicated test platform under numerous scenarios and significant performance gains are observed, making cooperative communications a strong candidate for improving the reliability of industrial wireless networks

Voice Call Capacity Over Wireless Mesh Networks

The goal of this thesis is to understand the voice call carrying capacity of an IEEE 802.11b/e based ad hoc network. We begin with the modelling of conversational speech and define a six state semi-Markov voice model based on ITU-T P59 recommendation. We perform a theoretical analysis of the voice model and compare it with results obtained via simulations. Using a Java based IEEE 802.11 medium access layer simulator, we determine the upper-bound for the number of voice calls carried by an ad hoc network. We use a linear topology with the ideal carrier sensing range and evaluate the number of calls carried using packet loss and packet delay as metrics. We observe that, for one, two, three and four hop, 5.5 Mbps IEEE 802.11 wireless links have an upper-bound of eight, six, five, and three voice calls respectively. We then consider a carrier sensing range and a path loss model and compare them with the ideal case. We observe, after considering a carrier sensing range with path loss model, there is a reduction in the number of calls carried by the linear networks. One, two, three and four hop 5.5 Mbps IEEE 802.11 wireless links support eight, five, four, and two voice calls respectively, when a carrier sensing range and a path loss model is considered. We also find that by adopting packet dropping policies at the nodes, we improve the call carrying capacity and quality of service on the network. In our simulations of a two hop network in path loss conditions, we find that, by adopting a time delay based packet dropping policy at the nodes, the number of calls supported simultaneously increased from five to six. In a four hop linear network we find that by total packet loss is reduced by 20%, adopting a random packet dropping policy and by 50% adopting a time delay based packet dropping policy. Although there is no change in number of calls supported, load on the network is reduced

Scheduling of real-time traffic in IEEE 802.11 networks

Real-time applications require the provision of time-bounded services from the network, however, the scheduling algorithms used in wired networks are not suitable for wireless networks because they assume that the channel is error free. Besides, the scheduler has only a limited knowledge of the arrival processes of the uplink traffic. In this paper, we propose scheduling algorithms for the transport of real-time traffic in IEEE 802.11 wireless LANs which deal with channel errors. We also present the simulation results obtained with these algorithms

Performance modelling of fairness in IEEE 802.11 wireless LAN protocols

PhD ThesisWireless communication has become a key technology in the modern world, allowing network services to be delivered in almost any environment, without the need for potentially expensive and invasive fixed cable solutions. However, the level of performance experienced by wireless devices varies tremendously on location and time. Understanding the factors which can cause variability of service is therefore of clear practical and theoretical interest. In this thesis we explore the performance of the IEEE 802.11 family of wireless protocols, which have become the de facto standard for Wireless Local Area Networks (WLANs). The specific performance issue which is investigated is the unfairness which can arise due to the spatial position of nodes in the network. In this work we characterise unfairness in terms of the difference in performance (e.g. throughput) experienced by different pairs of communicating nodes within a network. Models are presented using the Markovian process algebra PEPA which depict different scenarios with three of the main protocols, IEEE 802.11b, IEEE 802.11g and IEEE 802.11n. The analysis shows that performance is affected by the presence of other nodes (including in the well-known hidden node case), by the speed of data and the size of the frames being transmitted. The collection of models and analysis in this thesis collectively provides not only an insight into fairness in IEEE 802.11 networks, but it also represents a significant use case in modelling network protocols using PEPA. PEPA and other stochastic process algebra are extremely powerful tools for efficiently specifying models which might be very complex to study using conventional simulation approaches. Furthermore the tool support for PEPA facilitates the rapid solution of models to derive key metrics which enable the modeller to gain an understanding of the network behaviour across a wide range of operating conditions. From the results we can see that short frames promote a greater fairness due to the more frequent spaces between frames allowing other senders to transmit. An interesting consequence of these findings is the observation that varying frame length can play a role in addressing topological unfairness, which leads to the analysis of a novel model of IEEE 802.11g with variable frame lengths. While varying frame lengths might not always be practically possible, as frames need to be long enough for collisions to be detected, IEEE 802.11n supports a number of mechanisms for frame aggregation, where successive frames may be sent in series with little or no delay between them. We therefore present a novel model of IEEE 802.11n with frame aggregation to explore how this approach affects fairness and, potentially, can be used to address unfairness by allowing affected nodes to transmit longer frame bursts.Kurdistan Region Government of Iraq (KRG) sponso

IEEE Wireless LAN capacity in multicell environments with rate adaptation

Since the advent of the first IEEE 802.11 standard, many research efforts have been spent on evaluating different aspects of the specification. In this paper, we present a new method to predict the capacity of a multicell IEEE 802.11 network. The mechanism takes the effect of co-channel and adjacent channel interference into account. In addition, the study of a common rate adaptation algorithm is included. When the effect of rate adaptation is considered within the throughput computation, the results provided by our algorithm are closer to the measurements obtained in a real scenario. To the best of our knowledge, this paper presents the first analytical study of throughput performance including both types of interferences and the effect of bit rate adaptatio

Performance enhancement of WLAN IEEE 802.11 for asymmetric traffic

Most studies about the performance of IEEE 802.11 consider scenarios of ad-hoc topology and networks where all stations have the same traffic load (symmetric traffic conditions). This paper presents a study of performance parameters of more realistic networks. We focus the attention on WLAN with infrastructure networks, where the traffic distribution is asymmetric. In this case, the traffic load at the access point is much heavier than that at user stations. These studies are more realistic because most nowadays installed WLAN are infrastructure topology type, due to the fact that they are used as access networks. In this case, the access point has to retransmit all incoming traffic to the basic service set and therefore its traffic load is higher. Finally, the paper presents the tuning of the contention window, taken from IEEE 802.11e, used to increase the system performance under asymmetric traffic conditions, and the proposal of an adaptive algorithm to adapt the MAC layer settings to the system traffic load.Peer Reviewe

Improving the Performance of Wireless LANs

This book quantifies the key factors of WLAN performance and describes methods for improvement. It provides theoretical background and empirical results for the optimum planning and deployment of indoor WLAN systems, explaining the fundamentals while supplying guidelines for design, modeling, and performance evaluation. It discusses environmental effects on WLAN systems, protocol redesign for routing and MAC, and traffic distribution; examines emerging and future network technologies; and includes radio propagation and site measurements, simulations for various network design scenarios, numerous illustrations, practical examples, and learning aids

STUDY OF MOBILITY AND QoS OF 802.11 AND 802.11e WIRELESS LAN STANDARDS

Quality of service (QoS) is a key problem in wireless environments where bandwidth is scarce and channel conditions are time varying and sometimes implies highly packet losses. IEEE 802.11b/g/a wireless LAN (WLAN) are the most widely used WLAN standards today, and the IEEE 802.11e QoS enhancement standard exists and introduces QoS support for multimedia applications. This paper presents a class based admission control algorithm for 802.11e based wireless local area networks . The strengths of our admission control is dynamicity and flexibility of the algorithm, which adapts to the situation of the BSS, like global load, number of best effort AC, and position of QSTA by report of QAP. Thus it achieves higher throughput than other admission control for 802.11 e. A summary of many good solutions on admission control for 802.11e is be done, and the model of our admission control is presented. The 802.11e standard starves the low priority traffic in case of high load, and leads to higher collision rates, and did not make a good estimate of weight of queues, so there is an unbalance enters the flows with high priorities. A discussion is presented in detail using simulation-based evaluations, with an aim of comparing results of our admission control algorithm, with the 802.11e standard and the FHCF algorithm. Results reveal an improvement of the network load and a decrease of the number of collisions