A deterministic approach to throughput scaling in wireless networks

Some significant steps towards a systematic study of how throughput of wireless networks scales with space and number of users have been initiated recently. In this paper, we revisit the throughput scaling problem. Our key contribution is the identification of deterministic properties in the location of the nodes that, combined with a simple deterministic algorithm, provides a throughput that is very easily computed. Furthermore, our deterministic approach can be used to make almost sure statements for various random node locations and traffic patterns, easily strengthening some previous results and obtaining throughput for non-i.i.d. distributions.