Capacity of interference-limited three dimensional CSMA networks

In this paper, we study the throughput of interference-limited three dimensional (3D) CSMA networks. Specifically, we consider a network with a total of n nodes uniformly i.i.d. in a cube of edge length n^1/3. Further, CSMA random access scheme is employed and the SINR model is used to simulate a successful transmission. We first give a sufficient condition on the transmit power required for the CSMA network to be asymptotically almost surely (a.a.s.) connected as n → ∞ under the SINR model. Then, we demonstrate constructively that a throughput of Θ(1/(n log² n)^1/3) is obtainable by each node for an arbitrarily chosen destination.