Abstract-We address the problem of how throughput in a wireless network scales as the number of users grows. Following the model of Gupta and Kumar, we consider identical nodes placed in a fixed area. Pairs of transmitters and receivers wish to communicate but are subject to interference from other nodes. Throughput is measured in bit-meters per second. We provide a very elementary deterministic approach that gives achievability results in terms of three key properties of the node locations. As a special case, we obtain throughput for a general class of network configurations in a fixed area. Results for random node locations in a fixed area can also be derived as special cases of the general result by verifying the growth rate of three parameters. For example, as a simple corollary of our result we obtain a stronger (almost sure) version of the log throughput for random node locations in a fixed area obtained by Gupta and Kumar. Results for some other interesting non-independent and identically distributed (i.i.d.) node distributions are also provided.
Kulkarni et al. provided a very elementary deterministic approach on the capacity of wireless networks, which gave throughput results in terms of the node locations REF .
A deterministic approach to throughput scaling in wireless networks
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Computer Science