Distributed load adaptive scheduling for throughput and delay guarantees in fading wireless LANs

Goyal, Munish and Kumar, Anurag and Sharma, Vinod (2006) Distributed load adaptive scheduling for throughput and delay guarantees in fading wireless LANs. In: National Conference on Communications 2006 (NCC06), January 2006, IIT Delhi, New Delhi.

PDF p3.7_3.pdf - Published Version Restricted to Registered users only Download (133kB) | Request a copy

Abstract

We consider a problem of providing mean delay and average throughput guarantees in random access fading wireless channels using CSMA/CA algorithm. This problem becomes much more challenging when the scheduling is distributed as is the case in a typical local area wireless network. We model the CSMA network using a novel queueing network based approach. The optimal throughput per device and throughput optimal policy in an M device network is obtained. We provide a simple contention control algorithm that adapts the attempt probability based on the network load and obtain bounds for the packet transmission delay. The information we make use of is the number of devices in the network and the queue length (delayed) at each device. The proposed algorithms stay within the requirements of the IEEE 802.11 standard.

Item Type:	Conference Paper
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	11 Nov 2011 06:18
Last Modified:	11 Nov 2011 06:19
URI:	http://eprints.iisc.ac.in/id/eprint/42028

Actions (login required)

View Item