The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Efficient Routing in Intermittently Connected Mobile Networks: The Single-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 (VANETs), etc. In this context, conventional routing schemes would 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. With this in mind, we look into a number of ldquosingle-copyrdquo routing schemes that use only one copy per message, and hence significantly reduce the resource requirements of flooding-based algorithms. We perform a detailed exploration of the single-copy routing space in order to identify efficient single-copy solutions that (i) can be employed when low resource usage is critical, and (ii) can help improve the design of general routing schemes that use multiple copies. We also propose a theoretical framework that we use to analyze the performance of all single-copy schemes presented, and to derive upper and lower bounds on the delay of any scheme.
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
GPSR: greedy perimeter stateless routing for wireless networks
Karp, B., & Kung, H. T. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345953 · Cited by 7,050
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
The broadcast storm problem in a mobile ad hoc network
Ni, S.-Y., Tseng, Y.-C., Chen, Y.-S., & Sheu, J.-P. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313525 · Cited by 3,144
Probability: Theory and Examples.
Prewitt, K., & Durrett, R. (1992) · Journal of the American Statistical Association · doi:10.2307/2290301 · Cited by 3,085
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
Perkins, C. E. (2008) · Cited by 1,889
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
Critical Power for Asymptotic Connectivity in Wireless Networks
Gupta, P., & Kumar, P. R. (1999) · Stochastic Analysis, Control, Optimization and Applications · doi:10.1007/978-1-4612-1784-8_33 · Cited by 1,137
Research challenges and applications for underwater sensor networking
Heidemann, J., Ye, W., Wills, J., Syed, A., & Li, Y. (2006) · IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006. · doi:10.1109/wcnc.2006.1683469 · Cited by 1,008
Pocket switched networks and human mobility in conference environments
Hui, P., Chaintreau, A., Scott, J., Gass, R., Crowcroft, J., & Diot, C. (2005) · Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking - WDTN '05 · doi:10.1145/1080139.1080142 · Cited by 946
Probability: Theory and Examples.
Durrett, R. (1993) · Biometrics · doi:10.2307/2532227 · Cited by 857
Throughput-delay trade-off in wireless networks
El Gamal, A., Mammen, J., Prabhakar, B., & Shah, D. (2004) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354518 · Cited by 585
MDDV: a mobility-centric data dissemination algorithm for vehicular networks
Wu, H., Fujimoto, R., Guensler, R., & Hunter, M. (2004) · Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks · doi:10.1145/1023875.1023884 · Cited by 465
Access and mobility of wireless PDA users
McNett, M., & Voelker, G. M. (2005) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/1072989.1072995 · Cited by 387
Stochastic Analysis, Control, Optimization and Applications
Fleming, W. H., Yin, G. G., Yin, G., & Zhang, Q. (1999) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-1784-8 · Cited by 377
The electrical resistance of a graph captures its commute and cover times
Chandra, A. K., Raghavan, P., Ruzzo, W. L., & Smolensky, R. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73062 · Cited by 360
DTN routing in a mobility pattern space
Leguay, J., Friedman, T., & Conan, V. (2005) · Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking - WDTN '05 · doi:10.1145/1080139.1080146 · Cited by 315
Practical routing in delay-tolerant networks
Jones, E. P. C., Li, L., & Ward, P. A. S. (2005) · Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking - WDTN '05 · doi:10.1145/1080139.1080141 · Cited by 246
Opportunistic content distribution in an urban setting
Leguay, J., Lindgren, A., Scott, J., Friedman, T., & Crowcroft, J. (2006) · Proceedings of the 2006 SIGCOMM workshop on Challenged networks · doi:10.1145/1162654.1162657 · Cited by 189
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
DTN routing as a resource allocation problem
Balasubramanian, A., Levine, B., & Venkataramani, A. (2007) · Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1282380.1282422 · Cited by 947
Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.897964 · Cited by 645
Self-citationSLAW: A New Mobility Model for Human Walks
Lee, K., Hong, S., Kim, S. J., Rhee, I., & Chong, S. (2009) · IEEE INFOCOM 2009 · doi:10.1109/infcom.2009.5061995 · Cited by 539
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
Metadata
- Authors
- Spyropoulos, T., Psounis, K., & Raghavendra, C. S.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2008-02
- Volume
- 16
- Issue
- 1
- Pages
- 63-76
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W2129849999
- Cited by
- 1,108
- References
- 26
- FWCI
- 183.81
- 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.