The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
MV routing and capacity building in disruption tolerant networks
Open accessAbstract
Disruption-tolerant networks (DTNs) differ from other types of networks in that capacity is exclusively created by the movements of participants. This implies that understanding and influencing the participants' motions can have a significant impact on network performance. In this paper, we introduce the routing protocol MV, which learns structure in the movement patterns of network participants and uses it to enable informed message passing. We also propose the introduction of autonomous agents as additional participants in DTNs. These agents adapt their movements in response to variations in network capacity and demand. We use multi-objective control methods from robotics to generate motions capable of optimizing multiple network performance metrics simultaneously. We present experimental evidence that these strategies, individually and in conjunction, result in significant performance improvements in DTNs.
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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
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
A robust layered control system for a mobile robot
Brooks, R. (1986) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1986.1087032 · Cited by 7,799
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790
Epidemic routing for partially-connected ad hoc networks
Vahdat, A. M. (2000) · Cited by 4,133
Underwater acoustic sensor networks: research challenges
Akyildiz, I. F., Pompili, D., & Melodia, T. (2005) · Ad Hoc Networks · doi:10.1016/j.adhoc.2005.01.004 · Cited by 3,086
Khatib, O. (1987) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1987.1087068 · Cited by 2,940
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
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
Self-citationLinear Algebra and Its Applications
I., E., & Strang, G. (1976) · Mathematics of Computation · doi:10.2307/2005411 · Cited by 1,871
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
Rumor routing algorthim for sensor networks
Braginsky, D., & Estrin, D. L. (2002) · doi:10.1145/570738.570742 · Cited by 1,295
Advanced robotics: redundancy and optimization
(1991) · Choice Reviews Online · doi:10.5860/choice.29-0333 · Cited by 1,135
Local search in routing problems with time windows
Savelsbergh, M. W. P. (1985) · Annals of Operations Research · doi:10.1007/bf02022044 · Cited by 693
A survey of practical issues in underwater networks
Partan, J., Kurose, J., & Levine, B. N. (2006) · ACM International Conference on Underwater Networks & Systems (WUWNet) · doi:10.1145/1161039.1161045 · Cited by 473
Self-citationWearable computers as packet transport mechanisms in highly-partitioned ad-hoc networks
Davis, J. A., Fagg, A. H., & Levine, B. N. (2002) · International Symposium on Wearable Computers · doi:10.1109/iswc.2001.962117 · Cited by 250
Self-citationData muling over underwater wireless sensor networks using an autonomous underwater vehicle
Dunbabin, M. D., Corke, P., Vasilescu, I., et al. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2006.1642013 · Cited by 142
A Hybrid AUV Design for Shallow Water Reef Navigation
Dunbabin, M. D., Roberts, J. M., Usher, K., Winstanley, G., & Corke, P. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2005.1570424 · Cited by 126
Autonomous enhancement of disruption tolerant networks
Burns, B., Brock, O., & Levine, B. N. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2006.1642015 · Cited by 22
Self-citationExploiting redundancy to implement multiobjective behavior
Yang, Y., Brock, O., & Grupen, R. A. (2004) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2003.1242113 · Cited by 14
Self-citation
Cited by
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
Self-citationOpportunistic 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
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
Self-citationDTN routing as a resource allocation problem
Balasubramanian, A., Levine, B., & Venkataramani, A. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1282427.1282422 · Cited by 430
Self-citationA survey of practical issues in underwater networks
Partan, J., Kurose, J., & Levine, B. N. (2007) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/1347364.1347372 · Cited by 414
Self-citation
Metadata
- Authors
- Burns, B., Brock, O., & Levine, B. N.
- Venue
- Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
- Publisher
- IEEE
- Published
- 2005-08-24
- Volume
- 1
- Pages
- 398-408
- OpenAlex
- W2200366263
- Cited by
- 410
- References
- 22
- FWCI
- 16.74
- Type
- conference paper
- 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.