Communication over a wireless network with random connections
暂无分享,去创建一个
[1] I. Rhodes,et al. Some shortest path algorithms with decentralized information and communication requirements , 1982 .
[2] Alan M. Frieze,et al. An efficient algorithm for the vertex-disjoint paths problem in random graphs , 1996, SODA '96.
[3] Gerard J. Foschini,et al. Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.
[4] François Baccelli,et al. Stochastic geometry and architecture of communication networks , 1997, Telecommun. Syst..
[5] Emre Telatar,et al. Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..
[6] F. Chung,et al. The Diameter of Random Sparse Graphs , 2000 .
[7] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[8] P. Gupta,et al. Towards an information theory of large networks: an achievable rate region , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).
[9] Béla Bollobás,et al. Random Graphs: Notation , 2001 .
[10] Fan Chung Graham,et al. The Diameter of Sparse Random Graphs , 2001, Adv. Appl. Math..
[11] Thomas H. Cormen,et al. Introduction to algorithms [2nd ed.] , 2001 .
[12] J. Dall,et al. Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[13] David Tse,et al. Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.
[14] Michael Gastpar,et al. On the capacity of wireless networks: the relay case , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[15] E. Rosado,et al. ABSTRACT , 1990 .
[16] Mathew D. Penrose,et al. Random Geometric Graphs , 2003 .
[17] Panganamala Ramana Kumar,et al. Towards an information theory of large networks: an achievable rate region , 2003, IEEE Trans. Inf. Theory.
[18] Piet Van Mieghem,et al. Degree distribution and hopcount in wireless ad-hoc networks , 2003, The 11th IEEE International Conference on Networks, 2003. ICON2003..
[19] Sanjeev R. Kulkarni,et al. Upper bounds to transport capacity of wireless networks , 2004, IEEE Transactions on Information Theory.
[20] R. Hekmat. Study of Connectivity in Wireless Ad-hoc Networks with an Improved Radio Model , 2004 .
[21] B. Bollobás,et al. Continuum percolation with steps in an annulus , 2004, math/0503544.
[22] Emre Telatar,et al. Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks , 2005, IEEE Transactions on Information Theory.
[23] Patrick Thiran,et al. Connectivity vs capacity in dense ad hoc networks , 2004, IEEE INFOCOM 2004.
[24] Massimo Franceschetti,et al. On the throughput capacity of random wireless networks , 2004 .
[25] Panganamala Ramana Kumar,et al. A network information theory for wireless communication: scaling laws and optimal operation , 2004, IEEE Transactions on Information Theory.
[26] Panganamala Ramana Kumar,et al. The transport capacity of wireless networks over fading channels , 2004, IEEE Transactions on Information Theory.
[27] Babak Hassibi,et al. An achievability result for random networks , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[28] Eitan Altman,et al. Coverage and connectivity of ad hoc networks presence of channel randomness , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[29] Jeffrey G. Andrews,et al. Transmission capacity of wireless ad hoc networks with outage constraints , 2005, IEEE Transactions on Information Theory.
[30] Babak Hassibi,et al. On the capacity of MIMO broadcast channels with partial side information , 2005, IEEE Transactions on Information Theory.
[31] Jehoshua Bruck,et al. Continuum Percolation with Unreliable and Spread-Out Connections , 2005 .
[32] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.