Connectivity Properties of Random Waypoint Mobility Model for Ad Hoc Networks
暂无分享,去创建一个
[1] Mingyan Liu,et al. Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[2] Mathew D. Penrose,et al. On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.
[3] Henri Koskinen,et al. A Simulation-Based Method for Predicting Connectivity in Wireless Multihop Networks , 2004, Telecommun. Syst..
[4] Jorma T. Virtamo,et al. Random waypoint mobility model in cellular networks , 2007, Wirel. Networks.
[5] Peng-Jun Wan,et al. Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks , 2004, MobiHoc '04.
[6] Paolo Santi,et al. The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..
[7] M. Penrose. The longest edge of the random minimal spanning tree , 1997 .
[8] Pietro Manzoni,et al. Determination of Critical Transmission Range in Ad-Hoc Networks , 1999 .
[9] Mathew D. Penrose,et al. Extremes for the minimal spanning tree on normally distributed points , 1998, Advances in Applied Probability.
[10] Tracy Camp,et al. Stationary distributions for the random waypoint mobility model , 2004, IEEE Transactions on Mobile Computing.
[11] Christian Bettstetter,et al. On the Connectivity of Ad Hoc Networks , 2004, Comput. J..
[12] Paolo Santi,et al. The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..
[13] Jorma T. Virtamo,et al. Spatial node distribution of the random waypoint mobility model with applications , 2006, IEEE Transactions on Mobile Computing.
[14] M. Penrose. On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.
[15] Esa Hyytiä,et al. Spatial Node Distribution in the Random Waypoint Mobility Model , 2004 .