Connectivity of Heterogeneous Wireless Networks
暂无分享,去创建一个
[1] Asser N. Tantawi,et al. Connectivity properties of a packet radio network model , 1989, IEEE Trans. Inf. Theory.
[2] François Baccelli,et al. Impact of interferences on connectivity in ad hoc networks , 2005, IEEE/ACM Transactions on Networking.
[3] Daniel Mossé,et al. Providing a bidirectional abstraction for unidirectional ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[4] Panganamala Ramana Kumar,et al. A network information theory for wireless communication: scaling laws and optimal operation , 2004, IEEE Transactions on Information Theory.
[5] Joseph Mitola,et al. Cognitive radio: making software radios more personal , 1999, IEEE Wirel. Commun..
[6] Qing Zhao,et al. Spectrum Opportunity and Interference Constraint in Opportunistic Spectrum Access , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.
[7] Armand M. Makowski,et al. A very strong zero-one law for connectivity in one-dimensional geometric random graphs , 2007, IEEE Communications Letters.
[8] M. R. Leadbetter. Poisson Processes , 2011, International Encyclopedia of Statistical Science.
[9] Piyush Gupta,et al. Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .
[10] Edmund M. Yeh,et al. Characterization of the Critical Density for Percolation in Random Geometric Graphs , 2007, 2007 IEEE International Symposium on Information Theory.
[11] C. Caramanis. What is ergodic theory , 1963 .
[12] Ananthram Swami,et al. Power control in cognitive radio networks: how to cross a multi-lane highway , 2008, IEEE Journal on Selected Areas in Communications.
[13] S. T. Buckland,et al. An Introduction to the Bootstrap. , 1994 .
[14] S.A.G. Chandler,et al. Connectivity properties of a random radio network , 1994 .
[15] H. Poincaré,et al. Percolation ? , 1982 .
[16] Massimo Franceschetti,et al. Random networks for communication : from statistical physics to information systems , 2008 .
[17] J. Quintanilla,et al. Efficient measurement of the percolation threshold for fully penetrable discs , 2000 .
[18] Emre Telatar,et al. Information theoretic upper bounds on the capacity of large extended ad-hoc wireless networks , 2004, ISIT.
[19] Mathew D. Penrose,et al. Random Geometric Graphs , 2003 .
[20] Rahul Roy,et al. Uniqueness of unbounded occupied and vacant components in Boolean models , 1994 .
[21] Christian Bettstetter,et al. On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.
[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] M. Fewell. Area of Common Overlap of Three Circles , 2006 .
[24] Isaac Balberg. Continuum Percolation , 2009, Encyclopedia of Complexity and Systems Science.
[25] Ananthram Swami,et al. On the Connectivity and Multihop Delay of Ad Hoc Cognitive Radio Networks , 2009, 2010 IEEE International Conference on Communications.
[26] Brian M. Sadler,et al. A Survey of Dynamic Spectrum Access , 2007, IEEE Signal Processing Magazine.
[27] Massimo Franceschetti,et al. Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.
[28] P. Thiran,et al. Percolation in the signal to interference ratio graph , 2006, Journal of Applied Probability.
[29] Edmund M. Yeh,et al. Connectivity, Percolation, and Information Dissemination in Large-Scale Wireless Networks with Dynamic Links , 2009, ArXiv.
[30] Edmund M. Yeh,et al. Connectivity and Latency in Large-Scale Wireless Networks with Unreliable Links , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.