Seminar by Chandramani K Singh
Efficient and Fair Medium Access Control in Wireless Ad hoc Networks
Chandramani K Singh
University of Illinois, Urbana-Champaign
Date: Thursday, January 30th, 2014
Time: 15:30 PM
Venue: CS101.Abstract:
One approach for designing throughput-optimal algorithms for wireless networks is based on solving Maximum Weighted Independent Set (MWIS) problem. In this work, we first propose an algorithm for solving the LP relaxation of MWIS, which exhibits faster convergence to an optimal solution. Further, we show that one does not have to wait for infinite time for convergence to occur, but a simple rounding technique can be used to identify the ON/OFF states of the wireless links in finite time. As in prior work, such an approach only identifies the optimal MWIS states of some of the links in the network. Therefore, we present a scheme to combine this solution with Q-CSMA. The proposed scheme is seen to yield significantly better performance as compared to the plain Q-CSMA.
I will also briefly discuss another, stochastic geometry based, approach of medium access control, that models SINR based reception (unlike the protocol model). Here, we study proportionally fair and locally adaptive spatial Aloha for Poisson networks.
About the speaker:
Chandramani Kishore Singh did his BE (ECE) from Kumaon Univ. Nainital, ME(Telecomm) from IISc, PhD also from IISc. Currently he is a Postdoctoral Res. Associate at the Coordinated Science Lab at the Univ. of Illinois at Urbana-Champaign. His research interests are: distributed systems and networks, stochastic modeling and analysis, optimization and control and game theory.