Stochastic analysis of multiserver systems
ACM SIGMETRICS Performance Evaluation Review
Scalability of wireless networks
IEEE/ACM Transactions on Networking (TON)
Optimal delay scheduling in networks with arbitrary constraints
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the improvement of scaling laws for large-scale MANETs with network coding
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Delay-throughput tradeoff for overlaid wireless networks of different priorities
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Secrecy throughput of MANETs with malicious nodes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
On delay constrained multicast capacity of large-scale mobile ad-hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Throughput, delay, and mobility in wireless ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Throughput-delay tradeoff for hierarchical cooperation in ad hoc wireless networks
IEEE Transactions on Information Theory
Scaling laws for overlaid wireless networks: a cognitive radio network versus a primary network
IEEE/ACM Transactions on Networking (TON)
On the price of security in large-scale wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Throughput and delay scaling laws for mobile overlaid wireless networks
Journal of Network and Computer Applications
Optimal queue-size scaling in switched networks
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Capacity scaling of general cognitive networks
IEEE/ACM Transactions on Networking (TON)
Delay and capacity in MANETs under random walk mobility model
Wireless Networks
Hi-index | 754.90 |
In Part I of this paper, the optimal throughput-delay tradeoff for static wireless networks was shown to be 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 tradeoff 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 tradeoff remains the same when the packet size is kept constant, which necessitates packet scheduling in the network. In this correspondence, this question is answered in the affirmative by showing that the optimal throughput-delay tradeoff 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 queuing network and analyzing the corresponding delay. Our method consists of deriving packet schedules in the discrete-time network by devising a corresponding continuous-time network and then analyzing the delay induced in the actual discrete network using results from queuing theory for continuous-time networks.