The Community for Technology Leaders
Green Image
Issue No. 01 - Jan. (2014 vol. 13)
ISSN: 1536-1233
pp: 116-129
Sokol Kosta , Dept. of Comput. Sci., Sapienza Univ. of Rome, Rome, Italy
Alessandro Mei , Dept. of Comput. Sci., Sapienza Univ. of Rome, Rome, Italy
Julinda Stefa , Dept. of Comput. Sci., Sapienza Univ. of Rome, Rome, Italy
ABSTRACT
This paper presents small world in motion (SWIM), a new mobility model for ad hoc networking. SWIM is relatively simple, is easily tuned by setting just a few parameters, and generates traces that look real-synthetic traces have the same statistical properties of real traces in terms of intercontact times, contact duration, and frequency among node couples. Furthermore, it generates social behavior among nodes and models networks with complex social communities as the ones observed in the real traces. SWIM shows experimentally and theoretically the presence of the power-law and exponential decay dichotomy of intercontact times, and, most importantly, our experiments show that predicts very accurately the performance of forwarding protocols for PSNs like Epidemic, Delegation, Spray&Wait, and more complex, social-based ones like BUBBLE. Moreover, we propose a methodology to assess protocols on model with a large number of nodes. To the best of our knowledge, this is the first such study. Scaling of mobility models is a fundamental issue, yet never considered in the literature. Thanks to SWIM, here we present the first analysis of the scaling capabilities of Epidemic Forwarding, Delegation Forwarding, Spray&Wait, and BUBBLE.
INDEX TERMS
Protocols, Humans, Computational modeling, Communities, Mathematical model, Mobile computing, Mobile communication,simulations, Protocols, Humans, Computational modeling, Communities, Mathematical model, Mobile computing, Mobile communication, forwarding protocols in mobile networks, Mobility model, small world
CITATION
Sokol Kosta, Alessandro Mei, Julinda Stefa, "Large-Scale Synthetic Social Mobile Networks with SWIM", IEEE Transactions on Mobile Computing, vol. 13, no. , pp. 116-129, Jan. 2014, doi:10.1109/TMC.2012.229
324 ms
(Ver 3.1 (10032016))