Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs

2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006

Volumn , Issue , 2006, Pages

  Miorandi, Daniele ^a   Tan, Hwee Pink ^b   Zorzi, Michele ^c  

^a CREATE NET   (Italy)

^b EURANDOM   (Netherlands)

^c UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS DELAY; GEOMETRIC RANDOM GRAPH; MULTIPLE ACCESS; SCHEDULING SCHEMES; TOPOLOGY TRANSPARENT SCHEDULING; UPPER BOUND;

AD HOC NETWORKS; OPTIMIZATION; SCHEDULING;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 84886503412     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIOPT.2006.1666465     Document Type: Conference Paper

References (25)

1. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. on Inf. Th., vol. 46, no. 2, pp. 388-404, Mar. 2000
2. M. Grossglauser and D. Tse, "Mobility increases the capacity of ad hoc wireless networks," IEEE/ACM Trans. on Netw., vol. 10, no. 4, pp. 477-486, Aug. 2002
3. A. El Gamal, J. Mammen, B. Prabhakar, and D. Shah, "Throughputdelay trade-off in wireless networks," in Proc. of IEEE INFOCOM, Hong Kong, 2004
4. G. Sharma and R. Mazumdar, "On achievable delay/capacity trade-offs in mobile ad hoc networks," in Proc. of WiOpt, Cambridge, UK, 2004
5. M. Neely and E. Modiano, "Capacity and delay tradeoffs for ad hoc mobile networks," IEEE Trans. on Inf. Th., vol. 51, no. 6, pp. 1917-1937, Jun. 2005
6. X. Lin and N. B. Shroff, "On the fundamental relationship between the achievable capacity and delay in mobile wireless networks," in Advances in Pervasive Computing and Networking, B. K. Szymanski and B. Yener, Eds. Springer, 2005
7. G. Sharma, R. R. Mazumdar, and N. B. Shroff, "Delay and capacity trade-offs in mobile ad hoc networks: A global perspective," in Proc. of IEEE INFOCOM, Barcellona, ES, 2006
8. P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity," in Proc. of IEEE CDC, Tampa, USA, 1998
9. M. D. Penrose, "The longest edge of the random minimal spanning tree," The Annals of Appl. Prob., vol. 7, no. 2, pp. 340-361, 1997
10. I. Chlamtac and A. Faragó, "Making transmission schedules immune to topology changes in multi-hop packet radio networks," IEEE/ACM Trans. on Net., vol. 2, no. 1, pp. 23-29, Feb. 1994
11. M. D. Penrose, Random geometric graphs. Oxford, UK: Oxford University Press, 2003
12. R. Rom and M. Sidi, Multiple Access Protocols-Performance and Analysis. Berlin: Springer-Verlag, 1989
13. J.-H. Lu and V. O. K. Li, "An optimal topology-transparent scheduling method in multihop packet radio networks," IEEE/ACM Trans. on Net., vol. 6, no. 3, pp. 298-306, Jun. 1998
14. I. Chlamtac, A. Faragó, and H. Zhang, "Time-spread multiple-access (TSMA) protocols for multihop mobile radio networks," IEEE/ACM Trans. on Net., vol. 5, no. 6, pp. 804-812, Dec. 1997
15. V. R. Syrotiuk, C. J. Colbourn, and A. C. H. Ling, "Topology- transparent scheduling for MANETs using orthogonal arrays," in Proc. of DIALMPOMC, San Diego, CA, 2003
16. K. Oikonomou and I. Stavrakakis, "Analysis of a probabilistic topologyunaware TDMA MAC policy for ad hoc networks," IEEE JSAC, vol. 22, no. 7, pp. 1286-1300, Sep. 2004
17. M. Franceschetti, O. Dousse, D. Tse, and P. Thiran, "On the throughput capacity of random wireless networks," IEEE Trans. Inf. Th., subm
18. S. Toumpis and A. J. Goldsmith, "Capacity regions for wireless ad hoc networks," IEEE Trans. Wirel. Comm., vol. 2, no. 4, pp. 736-748, Jul. 2003
19. L.-L. Xie and P. R. Kumar, "A network information theory for wireless communication: scaling laws and optimal operation," IEEE Trans. Inf. Th., vol. 50, no. 5, pp. 748-767, May 2004
20. C. Bettstetter, "On the minimum node degree and connectivity of a wireless multihop network," in Proc. of Mobihoc, Lausanne, CH, 2002
21. E. Altman and D. Miorandi, "Coverage and connectivity of ad-hoc networks in presence of channel randomness," in Proc. of IEEE INFOCOM, Miami, 2005
22. S. Basagni and D. Bruschi, "A logarithmic lower bound for time-spread multiple-access (TSMA) protocols," Wireless Networks, vol. 6, no. 2, pp. 161-163, Mar. 2000
23. A. El Gamal, J. Mammen, B. Prabhakar, and D. Shah, "Optimal throughput-delay scaling in wireless networks-part I: The fluid model," IEEE Trans. Inf. Th., 2005, submitted. [Online]. Available: www. stanford. edu/?jmammen/papers/it-TDfluid. pdf
24. -, "Optimal throughput-delay scaling in wireless networks-part II: Constant-size packets," IEEE Trans. Inf. Th., 2005, submitted. [Online]. Available: www. stanford. edu/?jmammen/papers/it-TDpkt. pdf
25. S. R. Kulkarni and P. Viswanath, "A deterministic approach to throughput scaling in wireless networks. " IEEE Trans. on Inf. Th., vol. 50, no. 6, pp. 1041-1049, Jun. 2004.