{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:49:17Z","timestamp":1777902557481,"version":"3.51.4"},"reference-count":55,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T00:00:00Z","timestamp":1668384000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[2023,4]]},"abstract":"<jats:p>According to state-of-the-art research, mobile network simulation is preferred over real testbeds, especially to evaluate communication protocols used in Opportunistic Networks (OppNet) or Mobile Ad hoc NETworks (MANET). The main reason behind it is the difficulty of performing experiments in real scenarios. However, in a simulation, a mobility model is required to define users\u2019 mobility patterns. Trace-based models can be used for this purpose, but they are difficult to obtain, and they are not flexible or scalable. Another option is TRAce-based ProbabILiStic (TRAILS). TRAILS mimics the spatial dependency, geographic restrictions, and temporal dependency from real scenarios. In addition, with TRAILS, it is possible to scale the number of mobile users and simulation time. In this paper, we dive into the algorithms used by TRAILS to generate mobility graphs from real scenarios and simulate human mobility. In addition, we compare mobility metrics of TRAILS simulations, real traces, and another synthetic mobility model such as Small Worlds in Motion (SWIM). Finally, we analyze the performance of an implementation of the TRAILS model in computation time and memory consumption. We observed that TRAILS simulations represent the interaction among users of real scenarios with higher accuracy than SWIM simulations. Furthermore, we found that a simulation with TRAILS requires less computation time than a simulation with real traces and that a TRAILS graph consumes less memory than traces.<\/jats:p>","DOI":"10.1177\/00375497221133847","type":"journal-article","created":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T08:39:34Z","timestamp":1668415174000},"page":"385-402","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":4,"title":["TRAILS mobility model"],"prefix":"10.1177","volume":"99","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4072-4690","authenticated-orcid":false,"given":"Leonardo","family":"Sarmiento","sequence":"first","affiliation":[{"name":"Kommunikationsnetze\u2014FB 1, Universit\u00e4t Bremen, Germany"},{"name":"Carrera de Ingenier\u00eda Electr\u00f3nica, Universidad Polit\u00e9cnica Salesiana, Ecuador"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"F\u00f6rster","sequence":"additional","affiliation":[{"name":"Kommunikationsnetze\u2014FB 1, Universit\u00e4t Bremen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2022,11,14]]},"reference":[{"key":"bibr1-00375497221133847","first-page":"1357","volume":"2","author":"Bhoi A.","year":"2014","journal-title":"Int J Recent Innov Trend Comput Commun"},{"key":"bibr2-00375497221133847","first-page":"855","volume-title":"Proceedings of the IEEE INFOCOM 2009","author":"Lee K"},{"key":"bibr3-00375497221133847","doi-asserted-by":"crossref","unstructured":"Kuppusamy V, Sarmiento L, Udugama A, et al. Community-based mobility model and probabilistic ORBIT mobility model implementations in OMNeT++. In: Proceedings of the 5th international OMNeT++ community summit, 2018, pp. 23\u201334, https:\/\/easychair.org\/publications\/open\/H5pq","DOI":"10.29007\/4tv9"},{"key":"bibr4-00375497221133847","first-page":"337","volume-title":"Proceedings of the 2020 IEEE 3rd international conference on automation, electronics and electrical engineering (AUTEEE)","author":"Tian J"},{"key":"bibr5-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1177\/00375497221105530."},{"key":"bibr6-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2012.013012.00051"},{"key":"bibr7-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1145\/570738.570751"},{"key":"bibr8-00375497221133847","first-page":"1","volume-title":"Proceedings of the MILCOM 2009\u20142009 IEEE military communications conference","author":"Lee SH"},{"key":"bibr9-00375497221133847","first-page":"679","volume":"4","author":"Taleb AA","year":"2013","journal-title":"J Emerg Trend Comput Inform Sci"},{"key":"bibr10-00375497221133847","volume-title":"Demystifying the levy-walk nature of human walks","author":"Rhee I","year":"2008"},{"key":"bibr11-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2907195"},{"key":"bibr12-00375497221133847","doi-asserted-by":"crossref","first-page":"372572","DOI":"10.1155\/2012\/372572","volume":"2012","author":"Munjal A","year":"2012","journal-title":"J Electr Comput Eng"},{"key":"bibr13-00375497221133847","volume-title":"Analytical models and performance evaluation in massive mobile ad hoc networks","author":"Rodolakis G.","year":"2006"},{"key":"bibr14-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1023\/B:WINE.0000036458.88990.e5"},{"key":"bibr15-00375497221133847","first-page":"2106","volume-title":"Proceedings of the IEEE INFOCOM 2009","author":"Mei A"},{"key":"bibr16-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1145\/3242102.3242134"},{"key":"bibr17-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2021.102726"},{"key":"bibr18-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2782182"},{"key":"bibr19-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-021-08433-z"},{"key":"bibr20-00375497221133847","first-page":"1672","volume-title":"Proceedings of the 22nd international conference on advanced information networking and applications\u2014workshops (AINA workshops 2008)","author":"Huang CM"},{"key":"bibr21-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2019.04.021"},{"key":"bibr22-00375497221133847","unstructured":"Timcenko V, Stojanovic M, Rakas SB. MANET routing protocols vs. mobility models: performance analysis and comparison. In: Proceedings of the 9th WSEAS international conference on applied informatics and communications, 2009, pp. 271\u2013276, https:\/\/www.researchgate.net\/publication\/229035399_MANET_routing_protocols_vs_mobility_models_performance_analysis_and_comparison"},{"key":"bibr23-00375497221133847","unstructured":"Balasubramanian A, Levine B, Venkataramani A. DTN routing as a resource allocation problem. In: Proceedings of the 2007 conference on applications, technologies, architectures, and protocols for computer communications, 2007, pp. 373\u2013384, https:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.129.9966&rep=rep1&type=pdf#:~:text=The%20inherent%20uncertainty%20about%20network,path%20with%20extremely%20limited%20information."},{"key":"bibr24-00375497221133847","author":"Vahdat A","year":"2000","journal-title":"Epidemic routing for partially connected ad hoc networks"},{"key":"bibr25-00375497221133847","doi-asserted-by":"publisher","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"bibr26-00375497221133847","unstructured":"Papanikos N, Akestoridis DG, Papapetrou E. Adyton: a network simulator for opportunistic networks, 2015, https:\/\/github.com\/npapanik\/Adyton"},{"key":"bibr27-00375497221133847","unstructured":"Udugama A, F\u00f6rster A, Dede J, et al. Opportunistic networking protocol simulator for OMNeT++, 2017, https:\/\/arxiv.org\/abs\/1709.02210"},{"key":"bibr28-00375497221133847","unstructured":"Varga A. OMNeT++ discrete event simulation system, version 5.4, 2019, https:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.122.1688&rep=rep1&type=pdf"},{"key":"bibr29-00375497221133847","first-page":"401","volume-title":"Proceedings of the PCCC 2005: 24th IEEE international performance, computing, and communications conference, 2005","author":"Ali M"},{"key":"bibr30-00375497221133847","first-page":"664","volume-title":"Proceedings of the IEEE 24th annual joint conference of the IEEE computer and communications societies","volume":"1","author":"Tuduce C"},{"key":"bibr31-00375497221133847","first-page":"298","volume-title":"Proceedings of the international conference on pervasive computing","author":"Marin-Perianu R"},{"key":"bibr32-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013933626682"},{"key":"bibr33-00375497221133847","unstructured":"Burgard W, Fox D, Hennig D, et al. Estimating the absolute position of a mobile robot using position probability grids. In: Proceedings of the national conference on artificial intelligence, 1996, pp. 896\u2013901, https:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.114.9606&rep=rep1&type=pdf"},{"key":"bibr34-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2005.75"},{"key":"bibr35-00375497221133847","unstructured":"L\u00f3pez J. Wikiloc: database and sharing platform for GNSS traces, 2021, https:\/\/www.wikiloc.com\/"},{"key":"bibr36-00375497221133847","unstructured":"Helmy A, Bai F, Hsu W. Mobilib: community-wide library of mobility and wireless networks measurements, 2008, https:\/\/www.cise.ufl.edu\/~helmy\/MobiLibOld.htm"},{"key":"bibr37-00375497221133847","first-page":"147","volume":"206","author":"Bai F","year":"2004","journal-title":"Wirel Adhoc Netw"},{"key":"bibr38-00375497221133847","unstructured":"Udugama A, Khalilov B, Muslim AB, et al. Implementation of the SWIM mobility model in OMNeT++, 2016, https:\/\/arxiv.org\/abs\/1609.05199"},{"key":"bibr39-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2020.107300"},{"key":"bibr40-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0038202"},{"key":"bibr41-00375497221133847","unstructured":"Project Nayuki. Smallest enclosing circle, 2018, https:\/\/www.nayuki.io\/page\/smallest-enclosing-circle"},{"key":"bibr42-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2007.58"},{"key":"bibr43-00375497221133847","unstructured":"Varga A. INET framework for the OMNeT++ discrete event simulator, version 4.1, 2019, https:\/\/inet.omnetpp.org\/"},{"key":"bibr44-00375497221133847","unstructured":"Sarmiento L, F\u00f6rster A. TRAILS\u2014OMNeT-implementation: trace based probabilistic, 2021, https:\/\/github.com\/ComNets-Bremen\/TRAILS\u2014OMNeT-Implementation"},{"key":"bibr45-00375497221133847","unstructured":"Udugama A, F\u00f6rster A. MobilityModelCheck, 2019, https:\/\/github.com\/ComNets-Bremen\/MobilityModelCheck"},{"key":"bibr46-00375497221133847","unstructured":"Rhee I, Shin M, Hong S, et al. The ncsu\/mobilitymodels dataset (v. 2009-07-23), 2009, https:\/\/crawdad.org\/ncsu\/mobilitymodels\/"},{"key":"bibr47-00375497221133847","unstructured":"Piorkowski M, Sarafijanovic-Djukic N, Grossglauser M. The epfl\/mobility dataset (v. 2009-02-24), 2009, https:\/\/crawdad.org\/epfl\/mobility\/20090224\/"},{"key":"bibr48-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1145\/2107502.2107526"},{"key":"bibr49-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1145\/1317425.1317433"},{"key":"bibr50-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1145\/778415.778446"},{"key":"bibr51-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.246"},{"key":"bibr52-00375497221133847","doi-asserted-by":"publisher","DOI":"10.1080\/10691898.2005.11910556"},{"key":"bibr53-00375497221133847","volume-title":"Understanding statistics","author":"Upton G","year":"1996"},{"key":"bibr54-00375497221133847","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1080\/00031305.1988.10475580","volume":"42","author":"Benjamini Y.","year":"1988","journal-title":"Am Stat"},{"key":"bibr55-00375497221133847","volume-title":"Applied statistics and probability for engineers","author":"Montgomery DC","year":"2010"}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/00375497221133847","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/00375497221133847","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/00375497221133847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:33:06Z","timestamp":1777635186000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/00375497221133847"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,14]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["10.1177\/00375497221133847"],"URL":"https:\/\/doi.org\/10.1177\/00375497221133847","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,14]]}}}