On channel access delay of CSMA policies in wireless networks with primary interference constraints

CSMA policies are examples of simple distributed scheduling algorithms in wireless networks. In this paper, we study the delay properties of CSMA in the limit of large networks. We first define an ideal network under which CSMA becomes memoryless in that the delay to access the channel becomes an exponential r.v. independent of the past. We then show that, in the limit of large bipartite graphs with primary interference constraints, simple CSMA policies become memoryless.