The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case
Abstract
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc networks, etc. In this context, conventional routing schemes fail, because they try to establish complete end-to-end paths, before any data is sent. To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention which can significantly degrade their performance. Furthermore, proposed efforts to reduce the overhead of flooding-based schemes have often been plagued by large delays. With this in mind, we introduce a new family of routing schemes that "spray" a few message copies into the network, and then route each copy independently towards the destination. We show that, if carefully designed, spray routing not only performs significantly fewer transmissions per message, but also has lower average delivery delays than existing schemes; furthermore, it is highly scalable and retains good performance under a large range of scenarios. Finally, we use our theoretical framework proposed in our 2004 paper to analyze the performance of spray routing. We also use this theory to show how to choose the number of copies to be sprayed and how to optimally distribute these copies to relays.
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
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
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
Epidemic routing for partially-connected ad hoc networks
Vahdat, A. M. (2000) · Cited by 4,133
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
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005) · doi:10.1145/1080139.1080143 · Cited by 2,649
Self-citationProbabilistic routing in intermittently connected networks
Lindgren, A., Doria, A., & Schelén, O. (2003) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/961268.961272 · Cited by 2,288
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
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
The Broadcast Storm Problem in a Mobile Ad Hoc Network
Tseng, Y.-C., Ni, S.-Y., Chen, Y.-S., & Sheu, J.-P. (2002) · Wireless Networks · doi:10.1023/a:1013763825347 · Cited by 1,421
Delay-tolerant networking: an approach to interplanetary Internet
Burleigh, S., Hooke, A., Torgerson, L., Fall, K., Cerf, V., Durst, B., Scott, K., & Weiss, H. (2003) · IEEE Communications Magazine · doi:10.1109/mcom.2003.1204759 · Cited by 1,416
Cited by
The ONE simulator for DTN protocol evaluation
Keränen, A., Ott, J., & Kärkkäinen, T. (2009) · Proceedings of the Second International ICST Conference on Simulation Tools and Techniques · doi:10.4108/icst.simutools2009.5674 · Cited by 2,315
Bao, F., Chen, I.-R., Chang, M., & Cho, J.-H. (2012) · IEEE Transactions on Network and Service Management · doi:10.1109/tcomm.2012.031912.110179 · Cited by 450
Erramilli, V., Crovella, M., Chaintreau, A., & Diot, C. (2008) · Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing · doi:10.1145/1374618.1374653 · Cited by 359
Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges
Cao, Y., & Sun, Z. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.042512.00053 · Cited by 350
SMART: A Secure Multilayer Credit-Based Incentive Scheme for Delay-Tolerant Networks
Zhu, H., Lin, X., Lu, R., Fan, Y., & Shen, X. (2009) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2009.2020105 · Cited by 284
A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Passarella, A. (2012) · Computer Communications · doi:10.1016/j.comcom.2011.10.005 · Cited by 226
ARBR: Adaptive reinforcement-based routing for DTN
Elwhishi, A., Ho, P.-H., Naik, K., & Shihada, B. (2010) · 2010 IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications · doi:10.1109/wimob.2010.5645040 · Cited by 49
Metadata
- Authors
- Spyropoulos, T., Psounis, K., & Raghavendra, C. S.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2008-02
- Volume
- 16
- Issue
- 1
- Pages
- 77-90
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W4242656826
- Cited by
- 645
- References
- 21
- FWCI
- 98.22
- Type
- journal article
- 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.