An ad hoc mobility model founded on social network theory

  • Authors:
  • Mirco Musolesi;Stephen Hailes;Cecilia Mascolo

  • Affiliations:
  • University College London, London, United Kingdom;University College London, London, United Kingdom;University College London, London, United Kingdom

  • Venue:
  • MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Almost all work on mobile ad hoc networks relies on simulations, which, in turn, rely on realistic movement models for their credibility. Since there is a total absence of realistic data in the public domain, synthetic models for movement pattern generation must be used and the most widely used models are currently very simplistic, the focus being ease of implementation rather than soundness of foundation. Whilst it would be preferable to have models that better reflect the movement of real users, it is currently impossible to validate any movement model against real data. However, it is lazy to conclude from this that all models are equally likely to be invalid so any will do.We note that movement is strongly affected by the needs of humans to socialise in one form or another. Fortunately, humans are known to associate in particular ways that can be mathematically modelled, and that are likely to bias their movement patterns. Thus, we propose a new mobility model that is founded on social network theory, because this has empirically been shown to be useful as a means of describing human relationships. In particular, the model allows collections of hosts to be grouped together in a way that is based on social relationships among the individuals. This grouping is only then mapped to a topographical space, with topography biased by the strength of social tie.We discuss the implementation of this mobility model and we evaluate emergent properties of the generated networks. In particular, we show that grouping mechanism strongly influences the probability distribution of the average degree (i.e., the average number of neighbours of a host) in the simulated network.