On the maximum stable throughput problem in random networks with directional antennas

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2003, Pages 76-87

  Peraki, Christina ^a   Servetto, Sergio D ^a  

^a Cornell University   (United States)

Author keywords

Directional antennas; Maximum stable throughput; Multi commodity flow; Network flow; Random graphs; Random networks; Wireless networks

Indexed keywords

DENSE WAVELENGTH DIVISION MULTIPLEXING; DIRECTIONAL PATTERNS (ANTENNA); MULTIPATH PROPAGATION; WIRELESS TELECOMMUNICATION SYSTEMS;

DENSE WIRELESS NETWORKS; MAXIMUM STABLE THROUGHPUT; MULTICOMMODITY FLOW;

MOBILE ANTENNAS;

EID: 0242527333     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/778425.778426     Document Type: Conference Paper

References (26)

1. S. Adireddy and L. Tong. Exploiting Decentralized Channel State Information for Random Access. Submitted for publication. Available from http://acsp.ece.cornell.edu/.
2. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network Information Flow. IEEE Trans. Inform. Theory, 46(4):1204-1216, 2000.
3. R. R. Choudhury, X. Yang, R. Ramanathan, and N. Vaidya. Medium Access Control in Ad Hoc Networks Using Directional Antennas. In Proc. ACM MobiCom, Atlanta, GA, 2002.
4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms (2nd ed). MIT Press, 2001.
5. T. M. Cover and J. Thomas. Elements of Information Theory. John Wiley and Sons, Inc., 1991.
6. L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962.
7. S. Ghez, S. Verdú, and S. Schwartz. Optimal Decentralized Control in the Random Access Multipacket Channel. IEEE Trans. Autom. Control, 34(11):1153-1163, 1989.
8. R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics-A Foundation for Computer Science. Addison Wesley, 1994.
9. M. Grossglauser and D. Tse. Mobility Increases the Capacity of AdHoc Wireless Networks. IEEE Trans. Networking, 10(4):477-486, 2002.
10. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer Verlag, 1988.
11. P. Gupta and P. R. Kumar. Critical Power for Asymptotic Connectivity in Wireless Networks. In W. M. McEneany, G. Yin, and Q. Zhang, editors, Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming. Birkhauser, 1998.
12. P. Gupta and P. R. Kumar. The Capacity of Wireless Networks. IEEE Trans. Inform. Theory, 46(2):388-404, 2000.
13. M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz. Simple Heuristics for Unit Disk Graphs. Networks, 25:59-68, 1995.
14. G. Mergen and L. Tong. On the Capacity of Regular Wireless Networks with Transceiver Multipacket Communication. In Proc. IEEE Int. Symp. Inform. Theory (ISIT), Lausanne, Switzerland, 2002.
15. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
16. D. Pollard. Convergence of Stochastic Processes. Springer-Verlag, 1984.
17. A. Scaglione and S. D. Servetto. On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks. In Proc. ACM MobiCom, Atlanta, GA, 2002.
18. S. D. Servetto. Quantization with Side Information: Lattice Codes, Asymptotics, and Applications in Wireless Networks. Submitted to the IEEE Trans. Inform. Theory. Available from http://people.ece.cornell.edu/servetto/.
19. L. Tong, Q. Zhao, and G. Mergen. Multipacket Reception in Random Access Wireless Networks: From Signal Processing to Optimal Medium Access Control. IEEE Communications Magazine, 39(11):108-112, 2001.
20. S. Toumpis and A. J. Goldsmith. Capacity Regions for Wireless Adhoc Networks. IEEE Trans. Wireless Comm., to appear. Available from http://wsl.stanford.edu/.
21. B. S. Tsybakov and V. A. Mikhailov. Ergodicity of a Slotted ALOHA System. Problemy Peredachi Informatsii, 15(4):301-312, 1979.
22. V. N. Vapnik and A. Ya. Chervonenkis. On the Uniform Convergence of Relative Frequencies of Events to their Probabilities. Theory of Probability and its Applications, XVI(2):264-280, 1971.
23. D. West. Introduction to Graph Theory. Prentice Hall, 1996.
24. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides. Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. ACM/Kluwer Mobile Networks and Applications, 7(6), 2002.
25. L.-L. Xie and P. R. Kumar. A Network Information Theory for Wireless Communication: Scaling Laws and Optimal Operation. Submitted to the IEEE Trans. Inform. Theory, April 2002. Available from http://decision.csl.uiuc.edu/~prkumar/.
26. F. Xue and P. R. Kumar. The Number of Neighbors Needed for Connectivity of Wireless Networks. Submitted to Wireless Networks, April 2002. Available from http://decision.csl.uiuc.edu/~prkumar/.