Optimal throughput-delay scaling in wireless networks: part I: the fluid model

• Authors: Abbas El Gamal;James Mammen;Balaji Prabhakar;Devavrat Shah
• Venue: IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
• Year: 2006

Gupta and Kumar (2000) introduced a random model to study throughput scaling in a wireless network with static nodes, and showed that the throughput per source-destination pair is Θ (1/√n log n). Grossglauser and Tse (2001) showed that when nodes are mobile it is possible to have a constant throughput scaling per source-destination pair. In most applications, delay is also a key metric of network performance. It is expected that high throughput is achieved at the cost of high delay and that one can be improved at the cost of the other. The focus of this paper is on studying this tradeoff for wireless networks in a general framework. Optimal throughput-delay scaling laws for static and mobile wireless networks are established. For static networks, it is shown that the optimal throughput-delay tradeoff is given by D(n) = Θ (nT(n)), where T(n) and D(n) are the throughput and delay scaling, respectively. For mobile networks, a simple proof of the throughput scaling of Θ(1) for the Grossglauser-Tse scheme is given and the associated delay scaling is shown to be Θ(n log n). The optimal throughput-delay tradeoff for mobile networks is also established. To capture physical movement in the real world, a random-walk (RW) model for node mobility is assumed. It is shown that for throughput of O (1/√n log n), which can also be achieved in static networks, the throughput-delay tradeoff is the same as in static networks, i.e., D(n) = Θ (nT(n)). Surprisingly, for almost any throughput of a higher order, the delay is shown to be Θ (n log n), which is the delay for throughput of Θ(1). Our result, thus, suggests that the use of mobility to increase throughput, even slightly, in real-world networks would necessitate an abrupt and very large increase in delay.