Spatial CSMA: A Distributed Scheduling Algorithm for the SIR Model with Time-varying Channels

Recent work has shown that adaptive CSMA algorithms can achieve throughput optimality. However, these adaptive CSMA algorithms assume a rather simplistic model for the wireless medium. Specifically, the interference is typically modelled by a conflict graph, and the channels are assumed to be static. In this work, we propose a distributed and adaptive CSMA algorithm under a more realistic signal-to-interference ratio (SIR) based interference model, with time-varying channels. We prove that our algorithm is throughput optimal under this generalized model. Further, we augment our proposed algorithm by using a parallel update technique. Numerical results show that our algorithm outperforms the conflict graph based algorithms, in terms of supportable throughput and the rate of convergence to steady-state.Comment: This work has been presented at National Conference on Communication, 2015, held at IIT Bombay, Mumbai, Indi

Equivariant cobordism of schemes

We study the equivariant cobordism theory of schemes for action of linear algebraic groups. We compare the equivariant cobordism theory for the action of a linear algebraic groups with similar groups for the action of tori and deduce some consequences for the cycle class map of the classifying space of an algebraic groups.Comment: This revised version supercedes arxiv:1006:317

Gersten Conjecture For Equivariant K-theory And Applications

For a reductive group scheme over a regular semi-local ring, we prove an equivarinat version of the Gersten conjecture. We draw some interesting consequences for the representation rings of such reductive group schemes. We also prove the rigidity for the equivariant K-theory of reductive group schemes over a henselian local ring. This is then used to compute the equivariant K-theory of algebraically closed fields

Web 2.0 and the ever elusive balance between information explosion and data mining

In a fascinating tussle of perspectives in Volume 6 and issue no 3 of april 2008 Frontiers in Ecology and Evolution, Martin A Nuñez and Gregory M Crustinger enlist ways to brace up with the recent literature. They advocate that PhD students should choose a well studied system to have better chances of success. On the other side of this fascinating tussle Daniel Simberloff and Nathan J Sanders agree with there enthusiastic case and approaches for bracing up with the recent literature. However, they disagree with the play safe strategy of start-ups in ecology and evolution.

For me this tussle of perspectives is really fascinating. It underlines the story of our times. In the times of information explosion, should we concentrate on mining this information for knowledge or should we keep adding to this information explosion. This dilemma fits well in the context of the tussle by a quote from Nassim Nicholas Taleb “ It is almost impossible these days to finish PhD without excessive intellectual curiosity and it is impossible to get a faculty position without narrowly specializing in a chosen field ”.
Here in this letter, I want to harmonize the two perspectives by arguing that coexistence of information explosion and data mining is possible. We should strive for that ever elusive balance and I discuss below how Web 2.0 will enable it. Web 2.0, still in its infancy already shows promising results and I discuss below these usages