Absirucl-Gupta and Kumar ( Z W ) intrnduced a random network model for studying the way throughput scales in a wireless network when the nudes are fixed, and showed that the throughput per source-destinatinn pair is 0 ( l / m ) . Grossglauser and Tse (2001) showed that when nndes are mobile it is possible to have a cmstant or O( 1) thrnughput scaling per source-destination pair. The focus of this paper is on characterizing the delay and determining the throughput-delay trade-off in such fixed and mohile ad hoc netwiwks. For the Gupta-Kumar fixed network model, we sbnw that the optimal thrnughput-delay trade-off is given by where T ( , I ) and D ( n ) are the thrnughput and delay respectively. For the Grnssglauser-Tse mobile network model, we show that the delay scales as 0 ( n ' / * / o ( o ) ) , where u ( n ) is the velocity of the mobile nudes. We then dscrihe a scheme that achieves the crptiuial order of delay fnr any given throughput. The scheme varies (i) the nuniher crf hops, (ii) the transmission range and (iii) the degree of node mnhility to achieve the optimal throughput-delay trade-off. The scheme prnduces a range of models that capture the Gupta-Kuniar midel at one extreme and the Gnissglauser-Tse mndel at the other. I n the course of our wurk, we recover previnus results of Gupta and Kuniar, and Grns5glauser and Tse using simpler techniques, which might he t,f a separate interest.
In a recent work REF , it is shown that the delay experienced by packets in Grossglauser-Tse model scales as Θ( √ n/v(n)) where v(n) is the velocity of the nodes.
Throughput-delay trade-off in wireless networks
IEEE INFOCOM 2004
IEEE INFOCOM 2004
Computer Science