Achieving Optimal Throughput Utility And Low Delay With CSMA Like Algorithm A Virtual in Java

Carrier-sense multiple access (CSMA) algorithms have recently received significant interests in the literature for designing wireless control algorithms. CSMA algorithms incur low complexity and can achieve the optimal capacity under certain assumptions. However, CSMA algorithms suffer the starvation problem and incur large delay that may grow exponentially with the network size. In this paper, our goal is to develop a new algorithm that can provably achieve high throughput utility and low delay with low complexity. Toward this end, we propose a new CSMA-like algorithm, called Virtual-Multi-Channel CSMA (VMC-CSMA), that can dramatically reduce delay. The key idea of VMC-CSMA to avoid the starvation problem is to use multiple virtual channels (which emulate a multichannel system) and compute a good set of feasible schedules simultaneously (without constantly switching/recomputing schedules). Under the protocol interference model and a single-hop utility-maximization setting, VMC-CSMA can approach arbitrarily close-to-optimal system utility with both the number of virtual channels and the computation complexity increasing logarithmically with the network size. Furthermore, once VMC-CSMA converges to the steady state, we can show that under certain assumptions on the utility functions and the topology, both the expected packet delay and the tail distribution of the head-of-line (HOL) waiting time at each link can be bounded independently of the network size. Our simulation results confirm that VMC-CSMA algorithms indeed achieve both high throughput utility and low delay with low-complexity operations.