Papers in CISS and Infocom in this week and the next

Our papers are appearing in two conferences this month.

In CISS'12 this week in Princeton, Pradipta will talk of our paper with Eyjo Asgeirsson,
"A Fully Distributed Algorithm for Throughput Performance in Wireless Networks", see http://arxiv.org/abs/1203.3962. It exports some of our technology for analyzing algorithms (TCS-style) in the SINR model to the field of stochastic networks, where packets arrive at links with some distribution and the goal is to ensure that no link queue grows out of bounds. When the disparity in link lengths is a constant, we get a highly efficient and completely distributed algorithm with constant performance (referred to in the stochastic field as "efficiency").

At Infocom'12 next week in Orlando, he will then talk about our paper "Wireless Capacity and Admission Control in Cognitive Radio", see http://arxiv.org/abs/1111.5200. We introduce there the first LP formulation for SINR capacity problems that can yield good performance bounds. This allows for introducing various other constraints into the formulation. We use it in particular to obtain a constant-factor approximation for an admission problem related to 'cognitive radio': Suppose there is a set P of hard links that cannot be interfered with, add as many additional links from a given input set as possible.