The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Probabilistic routing in intermittently connected networks
Open accessAbstract
We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at any time, rendering traditional routing protocols unable to deliver messages between hosts. We propose a probabilistic routing protocol for such networks.
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
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
Epidemic routing for partially-connected ad hoc networks
Vahdat, A. M. (2000) · Cited by 4,624
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
A review of current routing protocols for ad hoc mobile wireless networks
Royer, E. M., & Toh, C.-K. (1999) · IEEE Personal Communications · doi:10.1109/98.760423 · Cited by 3,763
Mobility increases the capacity of ad hoc wireless networks
Grossglauser, M., & Tse, D. N. C. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801403 · Cited by 2,839
Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L. S., & Rubenstein, D. (2002) · Proceedings of the 10th international conference on Architectural support for programming languages and operating systems · doi:10.1145/605397.605408 · Cited by 1,804
Epidemic algorithms for replicated database maintenance
Demers, A., Greene, D., Hauser, C., Irish, W., & Larson, J. (1987) · Proceedings of the sixth annual ACM Symposium on Principles of distributed computing - PODC '87 · doi:10.1145/41840.41841 · Cited by 1,673
Providing connectivity to the Saami nomadic community
Doria, A., Udén, M., & Pandey, D. P. (2002) · Cited by 155
Self-citationVogels, W., van Renesse, R., & Birman, K. (2003) · ACM SIGCOMM Computer Communication Review · doi:10.1145/774763.774784 · Cited by 116
Cited by
Survey of Important Issues in UAV Communication Networks
Gupta, L., Jain, R., & Vaszkun, G. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2495297 · Cited by 2,343
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
Hui, P., Crowcroft, J., & Yoneki, E. (2011) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2010.246 · Cited by 1,515
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks
Pelusi, L., Passarella, A., & Conti, M. (2006) · IEEE Communications Magazine · doi:10.1109/mcom.2006.248176 · Cited by 1,163
Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.897962 · Cited by 1,108
Impact of Human Mobility on Opportunistic Forwarding Algorithms
Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., & Scott, J. (2007) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2007.1060 · Cited by 1,023
Metadata
- Authors
- Lindgren, A., Doria, A., & Schelén, O.
- Venue
- ACM SIGMOBILE Mobile Computing and Communications Review
- Published
- 2003-07
- Volume
- 7
- Issue
- 3
- Pages
- 19-20
- ISSN
- 1559-1662 (ISSN-L)
- 1931-1222
- OpenAlex
- W2010634640
- Cited by
- 2,288
- References
- 9
- FWCI
- 23.57
- Type
- journal article
- Language
- en
- Open access
- green
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.