Distributed opportunistic scheduling in multihop wireless ad hoc networks

In this paper, we introduce a framework for distributed opportunistic scheduling in multihop wireless ad hoc networks. With the proposed framework, one can take a scheduling algorithm originally designed for infrastructure-based wireless networks and adapt it to multihop ad hoc networks. The framework includes a wireless link state estimation mechanism, a medium access control (MAC) protocols and a MAC load control mechanism. The proposed link state estimation mechanism accounts for the latest results of packet transmissions on each wireless link. To improve robustness and provide service isolation during channel errors, the MAC protocol should not make any packet retransmissions but only report the transmission result to the scheduler. We modify IEEE 802.11 to fulfill these requirements. The MAC load control mechanism improves the system robustness. With link state information and the modified IEEE 802.11 MAC, we use BGFS-EBA, an opportunistic scheduling algorithm for infrastructured wireless networks, as an example to demonstrate how such an algorithm is converted into its distributed version within the proposed framework. The simulation results show that our proposed method can provide robust outcome fairness in the presence of channel errors. ©2008 IEEE.published_or_final_versio

End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks

The shared-medium multi-hop nature of wireless ad hoc networks poses fundamental challenges to the design of an effective resource allocation algorithm to maximize spatial reuse of spectrum, while maintaining basic fairness among multiple flows. When previously proposed scheduling algorithms have been shown to perform well in providing fair shares of bandwidth among single-hop wireless flows, they do not consider multi-hop flows with an end-to-end perspective when maximizing spatial reuse of spectrum. Instead, previous work attempts to break each multi-hop end-to-end flow into multiple single-hop flows for scheduling purposes. While this may be sufficient for maintaining basic fairness properties among single-hop subflows with respect to bandwidth, we show that, due to the intra-flow correlation between upstream and downstream hops, it may not be appropriate for maximizing spatial reuse of bandwidth. In this paper, we analyze the issue of increasing such spatial reuse of bandwidth from an end-to-end perspective of multihop flows. Through analysis and simulation results, we show that our proposed algorithm is able to appropriately distribute resources among multi-hop flows, so that end-to-end throughput may be maximized in wireless ad hoc networks, while still maintaining basic fairness across the multi-hop flows

Protocol design and optimization for QoS provisioning in wireless mesh networks

Wireless Mesh Network (WMN) has been recognized as a promising step towards the goal of ubiquitous broadband wireless Internet access. By exploiting the state-of-the-art radio and multi-hop networking technologies, mesh nodes in WMN collaboratively form a stationary wireless communication backbone. Data between clients and the Internet is routed through a series of mesh nodes via one or multiple paths. Such a mesh structure enables WMN to provide clients high-speed Internet access services with a less expensive and easier-to-deployment wireless infrastructure comparing to the wired counterparts. Due to the unique characteristics of WMN, existing protocols and schemes designed for other wellstudied wireless networks, such as Wi-Fi and Mobile Ad-hoc Network (MANET), are not suitable for WMN and hence cannot be applied to WMN directly. Therefore, novel protocols specifically designed and optimized forWMNare highly desired to fully exploit the mesh architecture. The goal is to provide high-level Quality-of-Service (QoS) to WMN clients to enable a rich portfolio of wireless and mobile applications and scenarios. This dissertation investigates the following important issues related to QoS provisioning in WMN: high throughput routing between WMN clients and the Internet, fairness provisioning among WMN clients and network-level capacity optimization. We propose innovative solutions to address these issues and improve the performance, scalability and reliability of WMN. In addition, we develop CyMesh, a multi-radio multi-channel (MRMC) wireless mesh network testbed, to evaluate the capacity and performance of WMN in real world environments. Extensive simulation (using the QualNet simulator) and experimental (over the CyMesh testbed) results demonstrate the effectiveness of the designed protocols. In particular, we learn that the system capacity of WMN can be improved significantly by exploiting the MRMC network architecture and the antenna directionality of radios equipped on mesh nodes, and our proposed fulfillment based fairness is a reasonable notion for fair service provisioning among WMN clients. Moreover, we report the encountered problems, key observations and learned lessons during the design and deployment of CyMesh, which may serve as a valuable resource for future MRMC WMN implementations

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