Centralized Rate Allocation and Control in 802.11-based Wireless Mesh Networks

Wireless Mesh Networks (WMNs) built with commodity 802.11 radios are a cost-effective means of providing last mile broadband Internet access. Their multihop architecture allows for rapid deployment and organic growth of these networks. 802.11 radios are an important building block in WMNs. These low cost radios are readily available, and can be used globally in license-exempt frequency bands. However, the 802.11 Distributed Coordination Function (DCF) medium access mechanism does not scale well in large multihop networks. This produces suboptimal behavior in many transport protocols, including TCP, the dominant transport protocol in the Internet. In particular, cross-layer interaction between DCF and TCP results in flow level unfairness, including starvation, with backlogged traffic sources. Solutions found in the literature propose distributed source rate control algorithms to alleviate this problem. However, this requires MAC-layer or transport-layer changes on all mesh routers. This is often infeasible in practical deployments. In wireline networks, router-assisted rate control techniques have been proposed for use alongside end-to-end mechanisms. We evaluate the feasibility of establishing similar centralized control via gateway mesh routers in WMNs. We find that commonly used router-assisted flow control schemes designed for wired networks fail in WMNs. This is because they assume that: (1) links can be scheduled independently, and (2) router queue buildups are sufficient for detecting congestion. These abstractions do not hold in a wireless network, rendering wired scheduling algorithms such as Fair Queueing (and its variants) and Active Queue Management (AQM) techniques ineffective as a gateway-enforceable solution in a WMN. We show that only non-work-conserving rate-based scheduling can effectively enforce rate allocation via a single centralized traffic-aggregation point. In this context we propose, design, and evaluate a framework of centralized, measurement-based, feedback-driven mechanisms that can enforce a rate allocation policy objective for adaptive traffic streams in a WMN. In this dissertation we focus on fair rate allocation requirements. Our approach does not require any changes to individual mesh routers. Further, it uses existing data traffic as capacity probes, thus incurring a zero control traffic overhead. We propose two mechanisms based on this approach: aggregate rate control (ARC) and per-flow rate control (PFRC). ARC limits the aggregate capacity of a network to the sum of fair rates for a given set of flows. We show that the resulting rate allocation achieved by DCF is approximately max-min fair. PFRC allows us to exercise finer-grained control over the rate allocation process. We show how it can be used to achieve weighted flow rate fairness. We evaluate the performance of these mechanisms using simulations as well as implementation on a multihop wireless testbed. Our comparative analysis show that our mechanisms improve fairness indices by a factor of 2 to 3 when compared with networks without any rate limiting, and are approximately equivalent to results achieved with distributed source rate limiting mechanisms that require software modifications on all mesh routers

Multiband CSMA/CA with RTS-CTS strategy

We present in this paper a new medium access control (MAC) scheme devoted to orthogonal frequency division multiple access (OFDMA) systems which aims at reducing collision probabilities during the channel request period. The proposed MAC relies on the classical carrier sense multiple access/collision avoidance (CSMA/CA) protocol with RTS / CTS ("Request To Send" / "Clear To Send") mechanism. The proposed method focus on the collision probability of RTS messages exploiting a multi-channel configuration for these messages while using the whole band for data transmissions. The protocol may be interpreted as an asynchronous frequency multiplexing of RTS messages. This method achieves strong performance gains in terms of throughput and latency especially in crowded networks. Index Terms-Carrier sense multiple access/collision avoidance (CSMA/CA), multiband, throughput, MAC protocol

Energy-Efficient Receiver-Driven Wireless Mesh Sensor Networks

A major challenge in wireless sensor networks research is energy efficiency. In the intermittent receiver-driven data transmission (IRDT) protocol, which aims at saving energy, communication between two nodes commences when multiple receiver nodes transmit their own IDs and the sender nodes receive them. This protocol can be used to construct a mesh network which is robust against node failure and wireless channel fluctuations. In our work, we improve this protocol by implementing a collision avoidance method for control packets. First, we refer to the probability of control packet collision as a function of the intermittent interval. We then introduce procedures to determine the interval which decreases or minimizes this probability. Afterwards, we include a data aggregation mechanism into IRDT to reduce data transmission frequency and the occurrence of control packet collisions. Through computer simulation, we show that IRDT can offer greater reduction of the average energy consumption compared with RI-MAC and X-MAC, especially at small loads, and we also demonstrate that IRDT with collision avoidance for control packets can attain higher performance than the original IRDT. This method ensures a packet collection ratio of more than 99% and an average energy consumption 38% lower than that of EA-ALPL and 90% lower than that of the original IRDT

Performance Evaluation Of Multiband CSMA/CA With RTS/CTS For M2M Communication With Finite Retransmission Strategy

International audienceM2M communication is information exchange between machines and machines without any human interaction. M2M commu-nication based on cellular network suffers from the extremely large number of devices in service coverage. In cellular network case, the large number of devices lead to communication problem caused by collisions between the senders. In this work we study the collision probability, saturation throughput and packet error rate for the carrier sense multiple access collision avoidance (CSMA/CA) protocol with request to send and clear to send (RTS/CTS) mechanism in the case of frequency band division. We propose in this paper a modified version of CSMA/CA-RTS/CTS to be compatible with the band repartition technique and we prove that an important gain is introduced in terms of system performance especially for loaded networks. Different backoff stage numbers with different finite retransmission limit values are investigated. Simulations highlight that dividing the RTS band into independent channels reduces drastically the RTS collision probability and in particular the packet error rate. A gain in terms of saturation throughput is also demonstrated especially in charged networks mode

DESIGN OF RELIABLE AND SUSTAINABLE WIRELESS SENSOR NETWORKS: CHALLENGES, PROTOCOLS AND CASE STUDIES

Integrated with the function of sensing, processing, and wireless communication, wireless sensors are attracting strong interest for a variety of monitoring and control applications. Wireless sensor networks (WSNs) have been deployed for industrial and remote monitoring purposes. As energy shortage is a worldwide problem, more attention has been placed on incorporating energy harvesting devices in WSNs. The main objective of this research is to systematically study the design principles and technical approaches to address three key challenges in designing reliable and sustainable WSNs; namely, communication reliability, operation with extremely low and dynamic power sources, and multi-tier network architecture. Mathematical throughput models, sustainable WSN communication strategies, and multi-tier network architecture are studied in this research to address these challenges, leading to protocols for reliable communication, energy-efficient operation, and network planning for specific application requirements. To account for realistic operating conditions, the study has implemented three distinct WSN testbeds: a WSN attached to the high-speed rotating spindle of a turning lathe, a WSN powered by a microbial fuel cell based energy harvesting system, and a WSN with a multi-tier network architecture. With each testbed, models and protocols are extracted, verified and analyzed. Extensive research has studied low power WSNs and energy harvesting capabilities. Despite these efforts, some important questions have not been well understood. This dissertation addresses the following three dimensions of the challenge. First, for reliable communication protocol design, mathematical throughput or energy efficiency estimation models are essential, yet have not been investigated accounting for specific application environment characteristics and requirements. Second, for WSNs with energy harvesting power sources, most current networking protocols do not work efficiently with the systems considered in this dissertation, such as those powered by extremely low and dynamic energy sources. Third, for multi-tier wireless network system design, routing protocols that are adaptive to real-world network conditions have not been studied. This dissertation focuses on these questions and explores experimentally derived mathematical models for designing protocols to meet specific application requirements. The main contributions of this research are 1) for industrial wireless sensor systems with fast-changing but repetitive mobile conditions, understand the performance and optimal choice of reliable wireless sensor data transmission methods, 2) for ultra-low energy harvesting wireless sensor devices, design an energy neutral communication protocol, and 3) for distributed rural wireless sensor systems, understand the efficiency of realistic routing in a multi-tier wireless network. Altogether, knowledge derived from study of the systems, models, and protocols in this work fuels the establishment of a useful framework for designing future WSNs

Time-Driven Access and Forwarding for Industrial Wireless Multihop Networks

The deployment of wireless technologies in industrial networks is very promising mainly due to their inherent flexibility. However, current wireless solutions lack the capability to provide the deterministic, low delay service required by many industrial applications. Moreover, the high level of interference generated by industrial equipment limits the coverage that ensures acceptable performance. Multi-hop solutions, when combining frame forwarding with higher node density, have the potential to provide the needed coverage while keeping radio communication range short. However, in multi-hop solutions the medium access time at each of the nodes traversed additively contributes to the end-to-end delay and the forwarding delay (i.e., the time required for packets to be processed, switched, and queued) at each node is to be added as well. This paper describes Time-driven Access and Forwarding (TAF), a solution for guaranteeing deterministic delay, at both the access and forwarding level, in wireless multi-hop networks, analyzes its properties, and assesses its performance in industrial scenario

Scalability of broadcast performance in wireless network-on-chip

Networks-on-Chip (NoCs) are currently the paradigm of choice to interconnect the cores of a chip multiprocessor. However, conventional NoCs may not suffice to fulfill the on-chip communication requirements of processors with hundreds or thousands of cores. The main reason is that the performance of such networks drops as the number of cores grows, especially in the presence of multicast and broadcast traffic. This not only limits the scalability of current multiprocessor architectures, but also sets a performance wall that prevents the development of architectures that generate moderate-to-high levels of multicast. In this paper, a Wireless Network-on-Chip (WNoC) where all cores share a single broadband channel is presented. Such design is conceived to provide low latency and ordered delivery for multicast/broadcast traffic, in an attempt to complement a wireline NoC that will transport the rest of communication flows. To assess the feasibility of this approach, the network performance of WNoC is analyzed as a function of the system size and the channel capacity, and then compared to that of wireline NoCs with embedded multicast support. Based on this evaluation, preliminary results on the potential performance of the proposed hybrid scheme are provided, together with guidelines for the design of MAC protocols for WNoC.Peer ReviewedPostprint (published version