Enabling limited traffic scheduling in asynchronous ad hoc networks

We present work-in-progress developing a communication framework that addresses the communication challenges of the decentralized multihop wireless environment. The main contribution is the combination of a fully distributed, asynchronous power save mechanism with adaptation of the timing patterns defined by the power save mechanism to improve the energy and bandwidth efficiency of communication in multihop wireless networks. The possibility of leveraging this strategy to provide more complex forms of traffic management is explored

PACE: Simple Multi-hop Scheduling for Single-radio 802.11-based Stub Wireless Mesh Networks

IEEE 802.11-based Stub Wireless Mesh Networks (WMNs) are a cost-effective and flexible solution to extend wired network infrastructures. Yet, they suffer from two major problems: inefficiency and unfairness. A number of approaches have been proposed to tackle these problems, but they are too restrictive, highly complex, or require time synchronization and modifications to the IEEE 802.11 MAC. PACE is a simple multi-hop scheduling mechanism for Stub WMNs overlaid on the IEEE 802.11 MAC that jointly addresses the inefficiency and unfairness problems. It limits transmissions to a single mesh node at each time and ensures that each node has the opportunity to transmit a packet in each network-wide transmission round. Simulation results demonstrate that PACE can achieve optimal network capacity utilization and greatly outperforms state of the art CSMA/CA-based solutions as far as goodput, delay, and fairness are concerned

High-SIR Transmission Capacity of Wireless Networks with General Fading and Node Distribution

In many wireless systems, interference is the main performance-limiting factor, and is primarily dictated by the locations of concurrent transmitters. In many earlier works, the locations of the transmitters is often modeled as a Poisson point process for analytical tractability. While analytically convenient, the PPP only accurately models networks whose nodes are placed independently and use ALOHA as the channel access protocol, which preserves the independence. Correlations between transmitter locations in non-Poisson networks, which model intelligent access protocols, makes the outage analysis extremely difficult. In this paper, we take an alternative approach and focus on an asymptotic regime where the density of interferers $\eta$ goes to 0. We prove for general node distributions and fading statistics that the success probability \p \sim 1-\gamma \eta^{\kappa} for $\eta \rightarrow 0$, and provide values of $\gamma$ and $\kappa$ for a number of important special cases. We show that $\kappa$ is lower bounded by 1 and upper bounded by a value that depends on the path loss exponent and the fading. This new analytical framework is then used to characterize the transmission capacity of a very general class of networks, defined as the maximum spatial density of active links given an outage constraint.Comment: Submitted to IEEE Trans. Info Theory special issu