The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Towards realistic mobility models for mobile ad hoc networks
Abstract
One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number of significant benefits, including repeatable scenarios, isolation of parameters, and exploration of a variety of metrics. The topology and movement of the nodes in the simulation are key factors in the performance of the network protocol under study. Once the nodes have been initially distributed, the mobility model dictates the movement of the nodes within the network. Because the mobility of the nodes directly impacts the performance of the protocols, simulation results obtained with unrealistic movement models may not correctly reflect the true performance of the protocols. The majority of existing mobility models for ad hoc networks do not provide realistic movement scenarios; they are limited to random walk models without any obstacles. In this paper, we propose to create more realistic movement models through the incorporation of obstacles. These obstacles are utilized to both restrict node movement as well as wireless transmissions. In addition to the inclusion of obstacles, we construct movement paths using the Voronoi diagram of obstacle vertices. Nodes can then be randomly distributed across the paths, and can use shortest path route computations to destinations at randomly chosen obstacles. Simulation results show that the use of obstacles and pathways has a significant impact on the performance of ad hoc network protocols.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
A performance comparison of multi-hop wireless ad hoc network routing protocols
Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y.-C., & Jetcheva, J. (1998) · Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/288235.288256 · Cited by 4,673
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
Computational Geometry: Algorithms and Applications
de Berg, M., Cheong, O., van Kreveld, M. J., & Overmars, M. H. (1997) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,450
A new routing protocol for the reconfigurable wireless networks
Haas, Z. J. (2002) · IEEE International Conference on Universal Personal Communications (ICUPC) · doi:10.1109/icupc.1997.627227 · Cited by 695
Bettstetter, C. (2001) · doi:10.1145/381591.381600 · Cited by 439
Channel occupancy time distribution in a cellular radio system
Guerin, R. A. (1987) · IEEE Transactions on Vehicular Technology · doi:10.1109/t-vt.1987.24106 · Cited by 436
Cited by
On the validity of geosocial mobility traces
Zhang, Z., Zhou, L., Zhao, X., Wang, G., Su, Y., Metzger, M., Zheng, H., & Zhao, B. Y. (2013) · Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks · doi:10.1145/2535771.2535786 · Cited by 52
Metadata
- Authors
- Jardosh, A., Belding-Royer, E. M., Almeroth, K. C., & Suri, S.
- Venue
- Proceedings of the 9th annual international conference on Mobile computing and networking
- Publisher
- ACM
- Published
- 2003-09-14
- Pages
- 217-229
- ISSN
- 1543-5679 (ISSN-L)
- OpenAlex
- W2167627514
- Cited by
- 594
- References
- 7
- FWCI
- 28.60
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Towards realistic mobility models for mobile ad hoc networks. https://app.cochat.ai/papers/10.1145/938985.939008
- The paper
- Jardosh, A., Belding-Royer, E. M., Almeroth, K. C., & Suri, S. (2003). Towards realistic mobility models for mobile ad hoc networks. Proceedings of the 9th annual international conference on Mobile computing and networking. https://doi.org/10.1145/938985.939008
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.