An ad hoc mobility model founded on social network theory
The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471 · cited 2×
“Another development in which we are currently engaged stems from the creation of a possible variant of the Albert-Barabasi model [1] to generate weighted scale-free social networks.”
BackgroundMethodThe Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719 · cited 1×
“views of the recent progress in complex and social networks analysis may be found in [1] and [11].”
BackgroundBollobás, B. (1985) · Cited by 6,196
A survey of mobility models for ad hoc network research
Camp, T., Boleng, J., & Davies, V. (2002) · Wireless Communications and Mobile Computing · doi:10.1002/wcm.72 · Cited by 4,621 · cited 2×
“A comprehensive review of the most popular mobility models used by the mobile ad hoc research community can be found in [3].”
MethodBollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
Small worlds: the dynamics of networks between order and randomness
(2000) · Choice Reviews Online · doi:10.5860/choice.37-5722 · Cited by 2,360
Investigations on the Theory of the Brownian Movement
Topping, J. (1956) · Physics Bulletin · doi:10.1088/0031-9112/7/10/012 · Cited by 2,033
THE OMNET++ DISCRETE EVENT SIMULATION SYSTEM
Varga, A. (2003) · Cited by 2,003
Investigations on the theory of the Brownian movement
Einstein, A. (1926) · BURJC Digital (King Juan Carlos University) · Cited by 1,861
Towards realistic mobility models for mobile ad hoc networks
Jardosh, A., Belding-Royer, E. M., Almeroth, K. C., & Suri, S. (2003) · Proceedings of the 9th annual international conference on Mobile computing and networking · doi:10.1145/938985.939008 · Cited by 594 · cited 1×
“For example, in [8], a technique for the creation of more realistic mobility models that include the presence of obstacles is presented.”
Background
Cited by
A Survey on Mobile Anchor Node Assisted Localization in Wireless Sensor Networks
Han, G., Jiang, J., Zhang, C., Duong, T. Q., Guizani, M., & Karagiannidis, G. K. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2544751 · Cited by 455
Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks
Musolesi, M., Hailes, S., & Mascolo, C. (2005) · Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks · doi:10.1109/wowmom.2005.17 · Cited by 386
Self-citationA community based mobility model for ad hoc network research
Musolesi, M., & Mascolo, C. (2006) · Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality · doi:10.1145/1132983.1132990 · Cited by 338
Self-citationApplications, Architectures, and Protocol Design Issues for Mobile Social Networks: A Survey
Kayastha, N., Niyato, D., Wang, P., & Hossain, E. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2011.2169033 · Cited by 253
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
Hossmann, T., Spyropoulos, T., & Legendre, F. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5462135 · Cited by 159
“In our scenarios, this graph governs the probability of two nodes coming into contact at any time, regardless of the actual mobility model underlying the proc ess (see [24] for an example of a mobility model with a social overlay).”
Background
Metadata
- Authors
- Musolesi, M., Hailes, S., & Mascolo, C.
- Venue
- Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
- Publisher
- ACM
- Published
- 2004-10-04
- Pages
- 20-24
- OpenAlex
- W1978231807
- Cited by
- 173
- References
- 12
- FWCI
- 6.82
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.