Delay-Throughput Analysis in Decentralized Single-Hop Wireless Networks

In this paper, an asymptotic analysis for the delay- throughput of a single-hop wireless network with n pairs of nodes is presented. The analysis relies on the decentralized on-off power allocation strategy, in which the on-off transmission policy for each link is based on comparing its direct channel gain with optimum threshold tau_n. We first provide a new definition of the transmission delay in a homogenous network. It is proved that the delay threshold level that results in dropping probability for each link tends to zero, while achieving the maximum average sum-rate scales as omega(n/ log n). Also, the minimum delay in order to make the dropping probability for the whole network approach zero scales as omega(n/ log n) + n. Furthermore, we drive lower and upper bounds for the link activation probability, q, such that the order of the average sum-rate is preserved. Based on the upper bound on q, an asymptotic analysis shows that the delay in each link and in the network improves without any significant impact on the the average sum-rate. Finally, we present a new definition of the throughput for the link in the cases of one and infinite buffer size. It is demonstrated that the maximum average throughput of the network with the decentralized on-off power allocation strategy is independent of the buffer size.