Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case
By Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra. IEEE/ACM Transactions on Networking, 2008
938 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/b0825f2f77fc56f0160f8c54429d5f0e1916e101
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Rongxing Lu
- Xiaodong Lin
- Xuemin Shen
- Zhili Sun
- Chadi M. Assi
- Wissam Fawaz
- Maurice J. Khabbaz
- Haojin Zhu
Citations in the corpus
- SMART: A Secure Multilayer Credit-Based Incentive Scheme for Delay-Tolerant Networks (2009, methodology): “reliability of DTN communication [9], which makes most exist-”
- DTN routing as a resource allocation problem (2007, background): “They subsequently extend the model [34] and propose a replication-based protocol, Spray and Wait [31].”
- Disruption-Tolerant Networking: A Comprehensive Survey on Recent Developments and Persisting Challenges (2012, methodology): “In E-NCP, a source transmits K pseudo coded messages to L randomly chosen nodes as done in the case of Binary Spraying (BS) [101].”
- Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges (2013, methodology): “Different from the work [23] in “Naive Replication“ family achieving the high delivery ratio via redundancy, the work in [101] concentrates on achieving the low overhead ratio using the concept of source Spray-and-Wait rather than binary Spray-and-Wait [22].”
- The ONE simulator for DTN protocol evaluation (2009, background): “[13], Direct Transmission/Delivery [27]), others a fixed number limited by the sender [28] [26] while epidemic [30] and probabilistic [19] routing potentially create an “infinite” number of messages.”