Speaker: Augustin Chaintreau
Thompson Research, Paris
Friday, June 15, 2007
11:00 am - 12:00 pm
EBU3b 1202

ABSTRACT
The popularity of IEEE 802.11 has led to the deployment of large WLANS in urban areas. However, the high density of Access Points might be counter productive unless the interfering network elements learn how to optimally use and share the spectrum. This project addresses generally the following questions: "What are the options for distributed algorithms, readily deployable with minor modifications, to handle network configuration?"

In this work, we present algorithms that allow (i) multiple interfering 802.11 Access Points to select their operating frequency in order to minimize interference, and (ii) users to choose the Access Point they attach to, in order to get their fair share of the whole network bandwidth. The proposed algorithms rely on Gibbs sampler, and do not require explicit coordination among the wireless devices. They only require the participating wireless nodes to measure local quantities such as interference and transmission delay. We prove that these algorithms, however simple, do share bandwidth optimally according to the minimum potential delay criterion. We will then present why gibbsian algorithms are well adapted to handle incremental deployment and other network configuration choices.

This is joint work with B. Kauffmann, F. Baccelli, D. Papagiannaki, V. Mathre, and C. Diot.

BIO
A. Chaintreau joined the Thomson Paris Resarch lab soon after graduating in 2006 from Ecole Normale Superieure de Paris, working at INRIA under the supervision of Francois Bacelli. During his PhD he worked in collaboration with Alcatel Bell, as well as the IBM Watson T. J. Research Center in New York. He has spent one year visiting Intel Research Cambridge to work on opportunistic mobile networking and wireless networks.