Optimal throughput-delay scaling in wireless networks: part I: the fluid model
作者： A. El Gamal , J. Mammen , B. Prabhakar , D. Shah
关键词:
摘要: Gupta and Kumar (2000) introduced a random model to study throughput scaling in wireless network with static nodes, showed that the per source-destination pair is Theta(1/radic(nlogn)). Grossglauser Tse (2001) when nodes are mobile it possible have constant pair. In most applications, delay also key metric of performance. It expected high achieved at cost one can be improved other. The focus this paper on studying tradeoff for networks general framework. Optimal throughput-delay laws established. For networks, shown optimal given by D(n)=Theta(nT(n)), where T(n) D(n) scaling, respectively. simple proof Theta(1) Grossglauser-Tse scheme associated Theta(nlogn). To capture physical movement real world, random-walk (RW) node mobility assumed. Oscr(1/radic(nlogn)), which same as i.e., D(n)=Theta(nT(n)). Surprisingly, almost any higher order, Theta(nlogn), Theta(1). Our result, thus, suggests use increase throughput, even slightly, real-world would necessitate an abrupt very large delay.
acm.org 
sci-hub.se 参考文章(20)
A. El Gamal, J. Mammen, B. Prabhakar, D. Shah, Optimal Throughput–Delay Scaling in Wireless Networks—Part II: Constant-Size Packets IEEE Transactions on Information Theory. ,vol. 52, pp. 5111- 5116 ,(2006) , 10.1109/TIT.2006.883548
Xiaojun Lin, G. Sharma, R.R. Mazumdar, N.B. Shroff, Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility IEEE Transactions on Information Theory. ,vol. 14, pp. 2777- 2784 ,(2006) , 10.1109/TIT.2006.874544
A. Jovicic, P. Viswanath, S.R. Kulkarni, Upper bounds to transport capacity of wireless networks IEEE Transactions on Information Theory. ,vol. 50, pp. 2555- 2565 ,(2004) , 10.1109/TIT.2004.836936
A.F. Dana, B. Hassibi, On the power efficiency of sensory and ad-hoc wireless networks international symposium on information theory. ,vol. 52, pp. 2890- 2914 ,(2003) , 10.1109/TIT.2006.876245
S.R. Kulkarni, P. Viswanath, A deterministic approach to throughput scaling in wireless networks international symposium on information theory. ,vol. 50, pp. 1041- 1049 ,(2002) , 10.1109/TIT.2004.828055
O. Leveque, I.E. Telatar, Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks IEEE Transactions on Information Theory. ,vol. 51, pp. 858- 865 ,(2005) , 10.1109/TIT.2004.842576
R. M. Loynes, The stability of a queue with non-independent inter-arrival and service times Mathematical Proceedings of the Cambridge Philosophical Society. ,vol. 58, pp. 497- 520 ,(1962) , 10.1017/S0305004100036781
Amir Dembo, Yuval Peres, Jay Rosen, Ofer Zeitouni, Cover times for Brownian motion and random walks in two dimensions Annals of Mathematics. ,vol. 160, pp. 433- 464 ,(2004) , 10.4007/ANNALS.2004.160.433
Finkel, Brief review: Stochastic Modeling and the Theory of Queues by Ronald W. Wolfe (Prentice-Hall, 1989) ACM SIGMETRICS Performance Evaluation Review. ,vol. 19, pp. 12- ,(1992) , 10.1145/130951.1045490
P. Gupta, P.R. Kumar, The capacity of wireless networks IEEE Transactions on Information Theory. ,vol. 46, pp. 388- 404 ,(2000) , 10.1109/18.825799