The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Message ferry route design for sparse ad hoc networks with mobile nodes
Abstract
Message ferrying is a networking paradigm where a special node, called a message ferry, facilitates the connectivity in a mobile ad hoc network where the nodes are sparsely deployed. One of the key challenges under this paradigm is the design of ferry routes to achieve certain properties of end-to-end connectivity, such as, delay and message loss among the nodes in the ad hoc network. This is a difficult problem when the nodes in the network move arbitrarily. As we cannot be certain of the location of the nodes, we cannot design a route where the ferry can contact the nodes with certainty. Due to this difficulty, prior work has either considered ferry route design for ad hoc networks where the nodes are stationary, or where the nodes and the ferry move pro-actively in order to meet at certain locations. Such systems either require long-range radio or disrupt nodes' mobility patterns which can be dictated by non-communication tasks. We present a message ferry route design algorithm that we call the Optimized Way-points, or OPWP, that generates a ferry route which assures good performance without requiring any online collaboration between the nodes and the ferry. The OPWP ferry route comprises a set of way-points and waiting times at these way-points, that are chosen carefully based on the node mobility model. Each time that the ferry traverses this route, it contacts each mobile node with a certain minimum probability. The node-ferry contact probability in turn determines the frequency of node-ferry contacts and the properties of end-to-end delay. We show that OPWP consistently outperforms other naive ferry routing approaches.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Ad-hoc on-demand distance vector routing
Perkins, C. E., & Royer, E. M. (1999) · Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.1999.749281 · Cited by 10,313
Dynamic Source Routing in Ad Hoc Wireless Networks
Johnson, D. B., & Maltz, D. A. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_5 · Cited by 8,518
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190336 · Cited by 6,678
Epidemic routing for partially-connected ad hoc networks
Vahdat, A. M. (2000) · Cited by 4,133
(2011) · SpringerReference · doi:10.1007/springerreference_57547 · Cited by 3,190
A delay-tolerant network architecture for challenged internets
Fall, K. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.863960 · Cited by 3,082
Routing in a delay tolerant network
Jain, S., Fall, K., & Patra, R. K. (2004) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · doi:10.1145/1015467.1015484 · Cited by 1,779
Data MULEs: modeling a three-tier architecture for sparse sensor networks
Shah, R. C., Roy, S., Jain, S., & Brunette, W. (2003) · Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003. · doi:10.1109/snpa.2003.1203354 · Cited by 1,322
Random waypoint considered harmful
Yoon, J., Liu, M., & Noble, B. (2003) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1208967 · Cited by 1,178
Cited by
Controlled sink mobility for prolonging wireless sensor networks lifetime
Basagni, S., Carosi, A., Melachrinoudis, E., Petrioli, C., & Wang, Z. M. (2008) · Wireless Networks · doi:10.1007/s11276-007-0017-x · Cited by 393
From wireless sensor networks towards cyber physical systems
Wu, F.-J., Kao, Y.-F., & Tseng, Y.-C. (2011) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2011.03.003 · Cited by 329
Cognition in UAV-Aided 5G and Beyond Communications: A Survey
Ullah, Z., Al-Turjman, F., & Mostarda, L. (2020) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2020.2968311 · Cited by 226
Metadata
- Authors
- Bin Tariq, M. M., Ammar, M., & Zegura, E.
- Venue
- Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
- Publisher
- ACM
- Published
- 2006-05-22
- Pages
- 37-48
- OpenAlex
- W1974063789
- Cited by
- 298
- References
- 15
- FWCI
- 17.72
- 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: Message ferry route design for sparse ad hoc networks with mobile nodes. https://app.cochat.ai/papers/10.1145/1132905.1132910
- The paper
- Bin Tariq, M. M., Ammar, M., & Zegura, E. (2006). Message ferry route design for sparse ad hoc networks with mobile nodes. Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing. https://doi.org/10.1145/1132905.1132910
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.