Admission control schemes for 802.11-based multi-hop mobile ad hoc networks: a survey

Mobile ad hoc networks (MANETs) promise unique communication opportunities. The IEEE 802.11 standard has allowed affordable MANETs to be realised. However, providing Quality of Service (QoS) assurances to MANET applications is difficult due to the unreliable wireless channel, the lack of centralised control, contention for channel access and node mobility. One of the most crucial components of a system for providing QoS assurances is admission control (AC). It is the job of the AC mechanism to estimate the state of the network?s resources and thereby to decide which application data sessions can be admitted without promising more resources than are available and thus violating previously made guarantees. Unfortunately, due to the aforementioned difficulties, estimating the network resources and maintaining QoS guarantees are non-trivial tasks. Accordingly, a large body of work has been published on AC protocols for addressing these issues. However, as far as it is possible to tell, no wide-ranging survey of these approaches exists at the time of writing. This paper thus aims to provide a comprehensive survey of the salient unicast AC schemes designed for IEEE 802.11- based multi-hop MANETs, which were published in the peerreviewed open literature during the period 2000-2007. The relevant considerations for the design of such protocols are discussed and several methods of classifying the schemes found in the literature are proposed. A brief outline of the operation, reaction to route failures, as well as the strengths and weaknesses of each protocol is given. This enables patterns in the design and trends in the development of AC protocols to be identified. Finally, directions for possible future work are provided.     

Multicasting multimedia streams in IEEE 802.11 networks: a focus on reliability and rate adaptation

Multicasting multimedia streams in IEEE 802.11 wireless LANs has two issues: reliability and rate adaptation. We address these issues by proposing two mechanisms that augment the current multicasting standards in a backward-compatible fashion. Semi-reliable multicasting (SRM) selects a leader who sends feedback information to lessen the reliability problem of multicast frames. Probing-based auto-rate fallback (PARF) allows the multicast source to adjust the bit rate depending on the link conditions of multicast recipients. Comprehensive simulation experiments reveal that SRM + PARF achieves reliability and link efficiency close to those of an omniscient multicasting framework.     

A survey of quality of service in IEEE 802.11 networks

Developed as a simple and cost-effective wireless technology for best effort services, IEEE 802.11 has gained popularity at an unprecedented rate. However, due to the lack of built-in quality of service support, IEEE 802.11 experiences serious challenges in meeting the demands of multimedia services and applications. This article surveys 802.11 QoS schemes, including service differentiation in the MAC layer, admission control and bandwidth reservation in MAC and higher layers, and link adaptation in the physical layer, designed to meet these challenges by providing the necessary enhancements for the required QoS. Furthermore, the article addresses issues that arise when end-to-end QoS has to be guaranteed in today's pervasive heterogeneous wired-cum-wireless networks. Among these challenges, protocol interoperability, multihop scheduling, full mobility support, and seamless vertical handoff among multiple mobile/wireless interfaces are specifically addressed.     

Neural networks for classification: a survey

Classification is one of the most active research and application areas of neural networks. The literature is vast and growing. This paper summarizes some of the most important developments in neural network classification research. Specifically, the issues of posterior probability estimation, the link between neural and conventional classifiers, learning and generalization tradeoff in classification, the feature variable selection, as well as the effect of misclassification costs are examined. Our purpose is to provide a synthesis of the published research in this area and stimulate further research interests and efforts in the identified topics     

Location-based fast handoff for 802.11 networks

This paper presents a location-based approach that reduces handoff overhead in IEEE 802.11 networks. With this approach, a mobile station (MS) can derive the prospective access points (APs) most likely to be visited next, using the current location and the AP topology information acquired from some designated server. The server also provides parameters for AP (re)association so that the MS can re-associate with an AP directly without a probe beforehand. Further along the movement orientation, the MS can resolve a likely set of APs for preauthentication or proactive key distribution purposes. The performance evaluation indicates that our approach is promising.     

Call admission control in mobile cellular networks: a comprehensive survey

Call admission control (CAC) is a key element in the provision of guaranteed quality of service (QoS) in wireless networks. The design of CAC algorithms for mobile cellular networks is especially challenging given the limited and highly variable resources, and the mobility of users encountered in such networks. This article provides a survey of admission control schemes for cellular networks and the research in this area. Our goal is to provide a broad classification and thorough discussion of existing CAC schemes. We classify these schemes based on factors such as deterministic/stochastic guarantees, distributed/local control and adaptivity to traffic conditions. In addition to this, we present some modeling and analysis basics to help in better understanding the performance and efficiency of admission control schemes in cellular networks. We describe several admission control schemes and compare them in terms of performance and complexity. Handoff prioritization is the common characteristic of these schemes. We survey different approaches proposed for achieving handoff prioritization with a focus on reservation schemes. Moreover, optimal and near‐optimal reservation schemes are presented and discussed. Also, we overview other important schemes such as those designed for multi‐service networks and hierarchical systems as well as complete knowledge schemes and those using pricing for CAC. Finally, the paper concludes on the state of current research and points out some of the key issues that need to be addressed in the context of CAC for future cellular networks. Copyright © 2005 John Wiley & Sons, Ltd.     

Full-duplex medium access control protocols in wireless networks: a survey

Medium Access Control (MAC) protocol plays an important role in full-duplex wireless networks. Theoretically, full-duplex communications have this ability to increase the capacity of traditional half-duplex wireless systems by up to twice. However, designing and implementing an efficient MAC protocol is a central issue in this way. Increasing throughput, collision avoidance, and fairness are common challenges in designing an efficient full-duplex MAC protocol. After giving a short introduction to the general classification of traditional MAC protocols, IEEE 802.11 MAC protocol, and the identified challenges of full-duplex communications in wireless networks, this review paper provides a comprehensive survey of current major MAC protocols for full-duplex wireless communications and classifies them in to three categories i.e. distributed wireless local area networks, centralized wireless local area networks, and other types of networks. This paper also explores and gives a comparative analysis of current full-duplex MAC protocols with stating their advantages and disadvantages as well as comparing them one with another.

     

Increasing throughput in dense 802.11 networks by automatic rate adaptation improvement

Rate control algorithms for commercial 802.11 devices strongly rely on packet losses for their adaptation. As a result, they give poor performance in dense networks because they are not able to distinguish packet losses related to channel error from packet losses due to collision. In this paper, we evaluate automatic rate adaptation algorithms in IEEE 802.11 dense networks. A certain number of works in the literature address this problem, but they demand modifications of the IEEE standard, or depend on some special feature not available in off-the-shelf devices. In this context, we propose a new automatic rate control algorithm which is simple, easy to implement, standards-compliant, and well-suited for crowded 802.11 networks. Our approach consists of measuring the contention level, inferring the collision probability, and choosing transmission rates which maximize throughput. Results from simulation and real experiments show throughput improvement of up to 100% from our mechanism.     

Femtocell networks: a survey

The surest way to increase the system capacity of a wireless link is by getting the transmitter and receiver closer to each other, which creates the dual benefits of higher-quality links and more spatial reuse. In a network with nomadic users, this inevitably involves deploying more infrastructure, typically in the form of microcells, hot spots, distributed antennas, or relays. A less expensive alternative is the recent concept of femtocells - also called home base stations - which are data access points installed by home users to get better indoor voice and data coverage. In this article we overview the technical and business arguments for femtocells and describe the state of the art on each front. We also describe the technical challenges facing femtocell networks and give some preliminary ideas for how to overcome them.     

A traffic control system for IEEE 802.11 networks based on available bandwidth estimation

To support Quality of service (QoS)‐sensitive applications like real‐time video streaming in IEEE 802.11 networks, a MAC layer extension for QoS, IEEE 802.11e, has been recently ratified as a standard. This MAC layer solution, however, addresses only the issue of prioritized access to the wireless medium and leaves such issues as QoS guarantee and admission control to the traffic control systems at the higher layers. This paper presents an IP‐layer traffic control system for IEEE 802.11 networks based on available bandwidth estimation. We build an analytical model for estimating the available bandwidth by extending an existing throughput computation model, and implement a traffic control system that provides QoS guarantees and admission control by utilizing the estimated available bandwidth information. We have conducted extensive performance evaluation of the proposed scheme via both simulations and measurements in the real test‐bed. The experiment results show that our estimation model and traffic control system work accurately and effectively in various network load conditions without IEEE 802.11e. The presence of IEEE 802.11e will allow even more efficient QoS provision, as the proposed scheme and the MAC layer QoS support will complement each other. Copyright © 2006 John Wiley & Sons, Ltd.     

Decentralized rate control for tracking and surveillance networks

We present a duality-based method for decentralized communication resource management in the context of networked tracking and surveillance systems. This method shares communication resources according to the joint utility provided by information of particular types. By formulating the problem as an optimization of the joint utility of information flow rates, the dual of the problem can be understood to provide prices for particular routes. Decentralized rate control is accomplished using primal–dual iterations in combination with communication of these route prices and marginal utility values. We build on previous work on the subject in a few important ways. First, we consider utility functions that are jointly dependent on flow rates, to properly account for geometric synergy that can occur in sensor fusion problems. Second, we do not require that the rate-update algorithms have explicit knowledge of utility functions. Instead, our update algorithms only require transmission of marginal utility values. We provide a proof of the convergence of the algorithm, and present simulation results to demonstrate its effectiveness.     

Saturation throughput analysis of multi‐rate IEEE 802.11 wireless networks

IEEE 802.11 protocol supports adaptive rate mechanism, which selects the transmission rate according to the condition of the wireless channel, to enhance the system performance. Thus, research of multi‐rate IEEE 802.11 medium access control (MAC) performance has become one of the hot research topics. In this paper, we study the performance of multi‐rate IEEE 802.11 MAC over a Gaussian channel. An accurate analytical model is presented to compute the system saturation throughput. We validate our model in both single‐rate and multi‐rate networks through various simulations. The results show that our model is accurate and channel error has a significant impact on system performance. In addition, our numerical results show that the performance of single‐rate IEEE 802.11 DCF with basic access method is better than that with RTS/CTS mechanism in a high‐rate and high‐load network and vice versa. In a multi‐rate network, the performance of IEEE 802.11 DCF with RTS/CTS mechanism is better than that with basic access method in a congested and error‐prone wireless environment. Copyright © 2008 John Wiley & Sons, Ltd.     

Robust rate control for integrated services packet networks

Research on congestion-control algorithms has traditionally focused more on performance than on robustness of the closed-loop system to changes in network conditions. As the performance of the control loop is strictly connected with the quality of service, these systems are natural candidates to be approached by the optimal control theory. Unfortunately, this approach may fail in the presence of transmission delay variations, which are unavoidable in telecommunication systems. In this paper, we first show the fragility of optimal controllers and demonstrate their instability when the control delay is not known exactly. Then we propose a robust control algorithm based on a classical proportional integral derivative scheme which does not suffer from this fragility phenomenon. Its stability versus the control delay variations, as well as versus sources that transmit less than their computed share, is studied with Nyquist analysis. The control algorithm is implemented within a simulator in the framework of the asynchronous transfer mode (ATM) ABR transfer capability. The final part of the paper shows some selected results assessing the performance of the control algorithm in a realistic network environment. ABR was chosen as an example, but the control studied here can be applied in any data network to obtain a robust and reliable congestion-control scheme.     

Modeling 802.11 mesh networks

We introduce a tractable analytic model of throughput performance for general 802.11 multi-hop multi-radio networks subject to finite loads. The model's accuracy and utility is illustrated by comparison with simulation.     

High-performance architectures for IP-based multihop 802.11 networks

The concept of a forwarding node, which receives packets from upstream nodes and then transmits these packets to downstream nodes, is a key element of any multihop network, wired or wireless. While high-speed IP router architectures have been extensively studied for wired networks, the concept of a "wireless IP router" has not been addressed so far. We examine the limitations of the IEEE 802.11 MAC protocol in supporting a low-latency and high-throughput IP datapath comprising multiple wireless LAN hops. We first propose a wireless IP forwarding architecture that uses MPLS with modifications to 802.11 MAC to significantly improve packet forwarding efficiency. We then study further enhancements to 802.11 MAC that improve system throughput by allowing a larger number of concurrent packet transmissions in multihop 802.11-based IP networks. With 802.11 poised to be the dominant technology for wireless LANs, we believe a combined approach to MAC, packet forwarding, and transport layer protocols is needed to make high-performance multihop 802.11 networks practically viable.     

A survey and comparison of multichannel protocols for performance anomaly mitigation in IEEE 802.11wireless networks

Providing multichannel functionality can improve the performance of wireless networks. Although off‐the‐shelf IEEE 802.11 physical layer and medium access control specifications support multiple channels and multiple data rates, one of the major challenges is how to efficiently utilize available channels and data rates to improve network performance. In multirate networks, low‐rate links severely degrade the capacity of high‐rate links, which is known as performance anomaly. To overcome the performance anomaly problem, different data rate links can get equal air‐time by exploiting time diversity and frequency diversity, or they can be separated over nonoverlapping channels. In this paper, we study existing multichannel protocols proposed to mitigate the performance anomaly problem by classifying them into single‐radio protocols, multiradio single‐hop protocols, and multiradio multihop protocols. To investigate the effectiveness of multichannel solutions for performance anomaly, we compare these protocols with well‐known multichannel protocols that do not consider performance anomaly. In addition, this paper gives insightful research issues to design multichannel protocols that mitigate performance anomaly in IEEE 802.11 wireless networks. Copyright © 2012 John Wiley & Sons, Ltd.     

Admission control on multipath routing in 802.11-based wireless mesh networks

Admission control (AC) is a mechanism for meeting bandwidth requirements of data transmissions. Early research on admission control for wireless mesh networks (WMNs) was centered around single-path routing. Compared to single-path routing, parallel multipath routing may offer more reliable network services and better load balancing. Applying admission control to multipath routing could further improve service quality, but it also faces a number of challenges. For example, transmission on one path may affect transmission on a neighboring path. Addressing these challenges, this paper presents an AC algorithm on parallel multipath routing for WMNs. In particular, we formulate an optimization problem for achieving the best service based on available bandwidth and bandwidth consumption of to-be-admitted data sessions. While solving this problem is a complex task, we devise an optimal algorithm for selecting two node-disjoint paths with rate allocation, and propose a distributed multipath routing and admission control protocol to achieve a near-optimal solution. Simulations show that MRAC is efficient and effective in meeting bandwidth requirements.     

Clock synchronization for wireless sensor networks: a survey

Recent advances in micro-electromechanical (MEMS) technology have led to the development of small, low-cost, and low-power sensors. Wireless sensor networks (WSNs) are large-scale networks of such sensors, dedicated to observing and monitoring various aspects of the physical world. In such networks, data from each sensor is agglomerated using data fusion to form a single meaningful result, which makes time synchronization between sensors highly desirable. This paper surveys and evaluates existing clock synchronization protocols based on a palette of factors like precision, accuracy, cost, and complexity. The design considerations presented here can help developers either in choosing an existing synchronization protocol or in defining a new protocol that is best suited to the specific needs of a sensor-network application. Finally, the survey provides a valuable framework by which designers can compare new and existing synchronization protocols.