Analysis of a metropolitan-area wireless network
Wireless Networks - Selected Papers from Mobicom'99
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Journal of Computational Physics
The Area Graph-Based Mobility Model and Its Impact on Data Dissemination
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Weighted waypoint mobility model and its impact on ad hoc networks
ACM SIGMOBILE Mobile Computing and Communications Review
Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Performance analysis of mobility-assisted routing
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Analysis and implications of student contact patterns derived from campus schedules
Proceedings of the 12th annual international conference on Mobile computing and networking
Integrating DTN and MANET routing
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Understanding the simulation of mobility models with Palm calculus
Performance Evaluation
Hybrid routing in clustered DTNs with message ferrying
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Power law and exponential decay of inter contact times between mobile devices
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
A socio-aware overlay for publish/subscribe communication in delay tolerant networks
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Designing mobility models based on social network theory
ACM SIGMOBILE Mobile Computing and Communications Review
Building a reference combinatorial model for MANETs
IEEE Network: The Magazine of Global Internetworking
Retiring replicants: congestion control for intermittently-connected networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Locus: a location-based data overlay for disruption-tolerant networks
Proceedings of the 5th ACM workshop on Challenged networks
QuickSilver: application-driven inter- and intra-cluster communication in Vanets
Proceedings of the third ACM international workshop on Mobile Opportunistic Networks
| Hi-index | 0.00 |
According to different kinds of connectivity, we can distinguish three types of mobile ad-hoc networks: dense, sparse and clustered networks. This paper is about modeling mobility in clustered networks, where nodes are concentrated into clusters of dense connectivity, and in between there exists sparse connectivity. The dense and sparse networks are extensively studied and modeled, but not much attention is paid to the clustered networks. In the sparse and clustered networks, an inherently important aspect is the mobility model, both for the design and evaluation of routing protocols. We propose a new mobility model for clustered networks, called Heterogeneous Random Walk. This model is simple, mathematically tractable and most importantly it captures the phenomenon of emerging clusters, observed in real partitioned networks, in an elegant way. We provide a closed-form expression for the stationary distribution of node position and we give a recipe for the "perfect simulation". Moreover, based on the real mobility trace we provide strong evidence for the main macroscopic characteristics of clustered networks captured by the proposed mobility model. For the very first time in the literature we show evidence for the correlation between the spatial speed distribution and the cluster formation. We also present the results of the analysis of real cluster dynamics caused by nodes' mobility.