The study and simulation of connectivity based routing protocols in ad hoc networks
暂无分享,去创建一个
[1] Piyush Gupta,et al. Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .
[2] Bart Selman,et al. Referral Web: combining social networks and collaborative filtering , 1997, CACM.
[3] J. Hammersley,et al. Percolation processes , 1957, Mathematical Proceedings of the Cambridge Philosophical Society.
[4] Paolo Santi. The critical transmitting range for connectivity in mobile ad hoc networks , 2005, IEEE Transactions on Mobile Computing.
[5] S. Milgram,et al. Acquaintance Networks Between Racial Groups: Application of the Small World Method. , 1970 .
[6] M. Penrose. A Strong Law for the Longest Edge of the Minimal Spanning Tree , 1999 .
[7] Jehoshua Bruck,et al. Covering Algorithms, Continuum Percolation, and the Geometry of Wireless Networks. , 2003 .
[8] John Guare,et al. Six Degrees of Separation: A Play , 1990 .
[9] Stanley Milgram,et al. An Experimental Study of the Small World Problem , 1969 .
[10] François Baccelli,et al. Impact of interferences on connectivity in ad hoc networks , 2005, IEEE/ACM Transactions on Networking.
[11] Sharon L. Milgram,et al. The Small World Problem , 1967 .
[12] Bernard Sapoval,et al. The fractal nature of a diffusion front and the relation to percolation , 1985 .
[13] Paolo Santi,et al. The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..