Date Added: Jan 2011
In Part I the authors characterized the optimal throughput-delay trade-off in static wireless networks as D(n) = ?(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 captures the essential network dynamics, packets need to scale down with the network size. In this "Fluid model", no buffers are required. Due to this packet scaling, D(n) does not correspond to the average delay per bit. This leads to the question whether the trade-off remains the same when the packet size is kept constant, which necessitates packet scheduling in the network.