|
ABSTRACT
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
|
| |
3
|
|
| |
4
|
T. Camp, J. Boleng, and V. Davies. A Survey of Mobility Models for Ad Hoc Network Research. WCMC: Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications, 2(5):483--502, 2002.
|
| |
5
|
Augustin Chaintreau , Pan Hui , Jon Crowcroft , Christophe Diot , Richard Gass , James Scott, Impact of Human Mobility on Opportunistic Forwarding Algorithms, IEEE Transactions on Mobile Computing, v.6 n.6, p.606-620, June 2007
[doi> 10.1109/TMC.2007.1060]
|
| |
6
|
Community Resource for Archiving Wireless Data At Dartmouth. http://crawdad.cs.dartmouth.edu.
|
| |
7
|
J. M. Dietrich Stoyan, Wilfrid S. Kendall. Stochastic geometry and its applications. Chichester {etc.} : Wiley, 1995.
|
| |
8
|
B. Fan and A. Helmy. Wireless Ad Hoc and Sensor Networks, chapter A Survey of Mobility Models in Wireless Adhoc Networks, pages 1--29. Kluwer Academic Publishers, 2004.
|
| |
9
|
|
| |
10
|
A. Ferreira. Building a reference combinatorial model for MANETs. IEEE Network, 18(5):24--29, 2004.
|
| |
11
|
C. W. Gardiner. Handbook of stochastic methods : for physics, chemistry and the natural sciences. Berlin : Springer, 2004.
|
| |
12
|
G. R. Grimmett and D. R. Stirzaker. Probability and random processes. Oxford : Oxford University Press, 2003.
|
 |
13
|
|
| |
14
|
W.-J. Hsu, T. Spyropoulos, K. Psounis, and A. Helmy. Modeling Time-Variant User Mobility in Wireless Mobile Networks. In IEEE INFOCOM, 2007.
|
 |
15
|
Sushant Jain , Kevin Fall , Rabin Patra, Routing in a delay tolerant network, Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, August 30-September 03, 2004, Portland, Oregon, USA
|
 |
16
|
|
| |
17
|
M. Kim, D. Kotz, and S. Kim. Extracting a mobility model from real user traces. In IEEE INFOCOM, 2006.
|
| |
18
|
J. Leguay, T. Friedman, and V. Conan. Evaluating Mobility Pattern Space Routing. In IEEE INFOCOM, 2006.
|
| |
19
|
S. Lim, C. Yu, and C. R. Das. Clustered Mobility Model for Scale-Free Wireless Networks. IEEE Local Computer Networks, pages 231--238, 2006.
|
 |
20
|
|
| |
21
|
|
 |
22
|
|
 |
23
|
|
| |
24
|
M. Penrose and A. Pisztora. Large Deviations for Discrete and Continuous Percolation. Adv. Appl. Prob., 28:29--52, 1996.
|
| |
25
|
H. Risken. The Fokker-Planck equation : methods of solution and applications. Berlin : Springer, 1989.
|
| |
26
|
R. R. Ronald Meester. Continuum percolation. Cambridge : Cambridge University Press, 1996.
|
| |
27
|
N. Sarafijanovic-Djukic, M. Piórkowski, and M. Grossglauser. Island Hopping: Efficient Mobility-Assisted Forwarding in Partitioned Networks. In SECON, 2006.
|
| |
28
|
N. Sarafijanovic-Djukic, M. Piórkowski, and M. Grossglauser. Island Hopping: Efficient Mobility-Assisted Forwarding in Partitioned Networks. Technical report, LCA, 2007.
|
| |
29
|
P. Sommer. Design and Analysis of Realistic Mobility Model for Wireless Mesh Networks. Master's thesis, ETH Zurich, September 2007.
|
 |
30
|
Thrasyvoulos Spyropoulos , Konstantinos Psounis , Cauligi S. Raghavendra, Spray and wait: an efficient routing scheme for intermittently connected mobile networks, Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, p.252-259, August 26-26, 2005, Philadelphia, Pennsylvania, USA
[doi> 10.1145/1080139.1080143]
|
 |
31
|
|
| |
32
|
|
 |
33
|
|
| |
34
|
|
| |
35
|
A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks technical report cs-200006. Technical report, Duke University, 2000.
|
 |
36
|
|
 |
37
|
Eiko Yoneki , Pan Hui , ShuYan Chan , Jon Crowcroft, 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, October 22-26, 2007, Chania, Crete Island, Greece
[doi> 10.1145/1298126.1298166]
|
 |
38
|
|
|