BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Distributed Opportunistic Scheduling: A Control Theoretic Approach
  - Albert Banchs\, University Carlos III
DTSTART:20121003T140000Z
DTEND:20121003T144000Z
UID:TALK40314@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:Distributed Opportunistic Scheduling (DOS) techniques have bee
 n recently proposed to improve the throughput performance of wireless netw
 orks. With DOS\, each station contends for the channel with a certain acce
 ss probability. If a contention is successful\, the station measures the c
 hannel conditions and transmits in case the channel quality is above a cer
 tain threshold. Otherwise\, the station does not use the transmission oppo
 rtunity\, allowing all stations to recontend. A key challenge with DOS is 
 to design a distributed algorithm that optimally adjusts the access probab
 ility and the threshold of each station. To address this challenge\, in th
 is paper we first compute the configuration of these two parameters that j
 ointly optimizes throughput performance in terms of proportional fairness.
  Then\, we propose an adaptive algorithm based on control theory that conv
 erges to the desired point of operation. Finally\, we conduct a control th
 eoretic analysis of the algorithm to find a setting for its parameters tha
 t provides a good tradeoff between stability and speed of convergence. Sim
 ulation results validate the design of the proposed algorithm and confirm 
 its advantages over previous proposals.
LOCATION:Large lecture theatre\, Microsoft Research Ltd\, 7 J J Thomson Av
 enue (Off Madingley Road)\, Cambridge
END:VEVENT
END:VCALENDAR