The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Delegation forwarding
Abstract
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low costs and delays in such networks is thus challenging. Most forwarding algorithms avoid the cost associated with flooding the network by forwarding only to nodes that are likely to be good relays, using a quality metric associated with nodes. However it is non-trivial to decide whether an encountered node is a good relay at the moment of encounter. Thus the problem is in part one of online inference of the quality distribution of nodes from sequential samples, and has connections to optimal stopping theory. Based on these observations we develop a new strategy for forwarding, which we refer to as delegation forwarding.
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
Epidemic routing for partially-connected ad hoc networks
Vahdat, A. M. (2000) · Cited by 4,133
Reality mining: sensing complex social systems
Eagle, N., & (Sandy) Pentland, A. (2006) · Personal and Ubiquitous Computing · doi:10.1007/s00779-005-0046-3 · Cited by 2,772
Probabilistic 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
MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks
Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.228 · Cited by 2,042
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
Social network analysis for routing in disconnected delay-tolerant MANETs
Daly, E. M., & Haahr, M. (2007) · Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing · doi:10.1145/1288107.1288113 · Cited by 1,151
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
Ширяев, А. Н. (1977) · Medical Entomology and Zoology · Cited by 1,025
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
Self-citationDTN 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
Cited by
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
- Erramilli, V., Crovella, M., Chaintreau, A., & Diot, C.
- Venue
- Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
- Publisher
- ACM
- Published
- 2008-05-26
- Pages
- 251-260
- OpenAlex
- W2293146328
- Cited by
- 359
- References
- 15
- FWCI
- 26.29
- 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: Delegation forwarding. https://app.cochat.ai/papers/10.1145/1374618.1374653
- The paper
- Erramilli, V., Crovella, M., Chaintreau, A., & Diot, C. (2008). Delegation forwarding. Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing. https://doi.org/10.1145/1374618.1374653
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.
