Research on wireless multi-hop networks: Current state and challenges
暂无分享,去创建一个
[1] H. L. R. Ong,et al. Glacial Environment Monitoring using Sensor Networks , 2005 .
[2] John Orriss,et al. Probability distributions for the number of radio transceivers which can communicate with one another , 2003, IEEE Trans. Commun..
[3] Brian D. O. Anderson,et al. On the Giant Component of Wireless Multihop Networks in the Presence of Shadowing , 2009, IEEE Transactions on Vehicular Technology.
[4] Christian Bettstetter,et al. Connectivity of Wireless Multihop Networks in a Shadow Fading Environment , 2003, MSWIM '03.
[5] M. Penrose. The longest edge of the random minimal spanning tree , 1997 .
[6] David Tse,et al. Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.
[7] Jeffrey G. Andrews,et al. Stochastic geometry and random graphs for the analysis and design of wireless networks , 2009, IEEE Journal on Selected Areas in Communications.
[8] Sanjay Jha,et al. The design and evaluation of a hybrid sensor network for cane-toad monitoring , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..
[9] 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.
[10] Xinbing Wang,et al. Mobility increases the connectivity of K-hop clustered wireless networks , 2009, MobiCom '09.
[11] Christian Bettstetter. Failure-Resilient Ad Hoc and Sensor Networks in a Shadow Fading Environment , 2004 .
[12] Vlady Ravelomanana,et al. Extremal properties of three-dimensional sensor networks with applications , 2004, IEEE Transactions on Mobile Computing.
[13] Andrea J. Goldsmith,et al. Large wireless networks under fading, mobility, and delay constraints , 2004, IEEE INFOCOM 2004.
[14] Yu Zhang,et al. Analysis of Access and Connectivity Probabilities in Vehicular Relay Networks , 2011, IEEE Journal on Selected Areas in Communications.
[15] M. Penrose. On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.
[16] Patrick Thiran,et al. Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[17] Donald F. Towsley,et al. Asymptotic connectivity properties of cooperative wireless ad hoc networks , 2009, IEEE Journal on Selected Areas in Communications.
[18] Donald F. Towsley,et al. On the capacity of hybrid wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[19] Yuguang Fang,et al. The Capacity of Heterogeneous Wireless Networks , 2010, 2010 Proceedings IEEE INFOCOM.
[20] Brian D. O. Anderson,et al. Graph Theoretic Models and Tools for the Analysis of Dynamic Wireless Multihop Networks , 2009, 2009 IEEE Wireless Communications and Networking Conference.
[21] Guoqiang Mao,et al. Connectivity of Large Scale Networks: Emergence of Unique Unbounded Component , 2011, ArXiv.
[22] Brian D. O. Anderson,et al. On the Properties of Giant Component in Wireless Multi-Hop Networks , 2009, IEEE INFOCOM 2009.
[23] B. Bollobás,et al. Connectivity of random k-nearest-neighbour graphs , 2005, Advances in Applied Probability.
[24] Theodore S. Rappaport,et al. Wireless communications - principles and practice , 1996 .
[25] Christian Bettstetter,et al. On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.
[26] Piyush Gupta,et al. Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .
[27] Yong Wang,et al. Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.
[28] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[29] Piet Van Mieghem,et al. Connectivity in Wireless Ad-hoc Networks with a Log-normal Radio Model , 2006, Mob. Networks Appl..
[30] Christian Bettstetter,et al. On the Connectivity of Ad Hoc Networks , 2004, Comput. J..
[31] Massimo Franceschetti,et al. Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.
[32] Yuguang Fang,et al. Asymptotic Connectivity in Wireless Ad Hoc Networks Using Directional Antennas , 2009, IEEE/ACM Transactions on Networking.
[33] B. Bollobás,et al. A critical constant for the k nearest-neighbour model , 2007, Advances in Applied Probability.
[34] Kannan Srinivasan,et al. Wireless Sensors: Oyster Habitat Monitoring in the Bras d'Or Lakes , 2005, DCOSS.
[35] Brian D. O. Anderson,et al. Evaluation of the Probability of K-Hop Connection in Homogeneous Wireless Sensor Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.
[36] Ness B. Shroff,et al. Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[37] Asser N. Tantawi,et al. Connectivity properties of a packet radio network model , 1989, IEEE Trans. Inf. Theory.
[38] François Baccelli,et al. Impact of interferences on connectivity in ad hoc networks , 2005, IEEE/ACM Transactions on Networking.
[39] 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..
[40] Mathew D. Penrose,et al. On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.
[41] Surendar Chandra,et al. Delay Tolerant Collaborations among Campus-Wide Wireless Users , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[42] Panganamala Ramana Kumar,et al. The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.
[43] Massimo Franceschetti,et al. Random Networks for Communication , 2008 .
[44] Mathew D. Penrose,et al. Random Geometric Graphs , 2003 .
[45] Brian D. O. Anderson,et al. Towards a Better Understanding of Large-Scale Network Models , 2010, IEEE/ACM Transactions on Networking.
[46] Brian D. O. Anderson,et al. Probability of k-Hop Connection under Random Connection Model , 2010, IEEE Communications Letters.
[47] Isaac Balberg. Continuum Percolation , 2009, Encyclopedia of Complexity and Systems Science.
[48] Ao Tang,et al. An empirical study on the connectivity of ad hoc networks , 2003, 2003 IEEE Aerospace Conference Proceedings (Cat. No.03TH8652).
[49] M. Penrose. A Strong Law for the Longest Edge of the Minimal Spanning Tree , 1999 .
[50] Wei Zhang,et al. Connectivity of Wireless CSMA Multi-Hop Networks , 2011, 2011 IEEE International Conference on Communications (ICC).
[51] Yang Yang,et al. Relay technologies for WiMax and LTE-advanced mobile systems , 2009, IEEE Communications Magazine.
[52] Eytan Modiano,et al. Capacity and delay tradeoffs for ad hoc mobile networks , 2004, IEEE Transactions on Information Theory.
[53] Guoqiang Mao,et al. Connectivity of Large Scale Networks: Distribution of Isolated Nodes , 2011, ArXiv.
[54] Daniele Miorandi. The Impact of Channel Randomness on Coverage and Connectivity of Ad Hoc and Sensor Networks , 2008, IEEE Transactions on Wireless Communications.
[55] Guoqiang Mao,et al. Design of an Extended Kalman Filter for UAV Localization , 2007, 2007 Information, Decision and Control.
[56] Devavrat Shah,et al. Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.
[57] Mauro Leoncini,et al. The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks , 2006, IEEE Transactions on Mobile Computing.