Achievable uniform rates for ad hoc networks

Ad hoc networks are self-organizing wireless networks without any centralized control. A fundamental property of such networks is the achievable rate per node under uniform traffic conditions. It has been shown by Gupta et. al. that for ad hoc networks without mobility, the throughput per node decreases exponentially as the number of nodes (n) increases without bound. We simulate the communication scheme proposed to achieve this rate, model the rate as (K/(n log n)^m) and find K and m for finite n. The behavior of the function is studied for different path-loss exponents and for different routing strategies.