DocumentCode :
2271419
Title :
Throughput-delay scaling in wireless networks with constant-size packets
Author :
El Gamal, Abbas ; Mammen, James ; Prabhakar, Balaji ; Shah, Devavrat
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Stanford Univ., CA
fYear :
2005
fDate :
4-9 Sept. 2005
Firstpage :
1329
Lastpage :
1333
Abstract :
In previous work (2004), we characterized the optimal throughput-delay trade-off in static wireless networks as D(n) = Theta(nT(n)), where D(n) and T(n) are the average packet delay and throughput in a network of n nodes, respectively. While this trade-off captured the essential network dynamics, packets needed to scale down with the network size. In this "fluid model", no buffers were required. Due to this packet scaling, D(n) did not correspond to the average delay per bit. That led to the question whether the trade-off remains the same when the packet size is kept constant, which necessitates buffers and packet scheduling in the network. In this paper, we answer this question in the affirmative by showing that the optimal throughput-delay trade-off is still D(n) = Theta(nT(n)), where now D(n) is the average delay per bit. Packets of constant size necessitate the use of buffers in the network, which in turn requires scheduling packet transmissions in a discrete-time queueing network and analyzing the corresponding delay. Our method consists of deriving packet schedules in the discrete-time network by looking at a corresponding continuous-time network and then analyzing the delay induced in the actual discrete network using results from queueing theory for continuous-time networks
Keywords :
continuous time systems; discrete time systems; packet radio networks; queueing theory; scheduling; average packet delay; constant-size packets; continuous-time network; discrete-time queueing network; fluid model; network dynamics; optimal throughput-delay trade-off; packet scaling; packet scheduling; packet transmissions; queueing theory; static wireless networks; throughput-delay scaling; Delay; Intelligent networks; Queueing analysis; Routing; Scheduling algorithm; Throughput; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
Type :
conf
DOI :
10.1109/ISIT.2005.1523558
Filename :
1523558
Link To Document :
بازگشت