Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case
By Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra. IEEE/ACM Transactions on Networking, 2008
880 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/4391fb2201bf307315fe309230fcee908c874f5b
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
- Zhili Sun
- Thrasyvoulos Spyropoulos
- Konstantinos Psounis
- Cauligi S. Raghavendra
- Rongxing Lu
- Xiaodong Lin
- Xuemin Shen
- Haojin Zhu
Citations in the corpus
- Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges (2013, methodology): “Seek-and-Focus [29] consists of the Seek Phase with random forwarding approach, and the Focus Phase using a utility forwarding approach based on recent encounter time.”
- SLAW: A New Mobility Model for Human Walks (2009, methodology): “Examples of these protocols are abundant (e.g., [3], [30], [ 37 ]).”
- Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility (2007, methodology): “We only depict results for multi-copy schemes in this study (a comparison of single-copy schemes could be found in [20]): Epidemic routing (“epidemic”) [21]: a node copies a message to every new node it encounters that hasn’t got a copy already.”
- A parsimonious model of mobile partitioned networks with clustering (2009, background): “For this reason, many existing DTN routing algorithms exploit only one-hop communication [1], [12], [15], [17], [28], [27], [29], [32], with the exception of [19], [21], [24], [6].”
- SMART: A Secure Multilayer Credit-Based Incentive Scheme for Delay-Tolerant Networks (2009, methodology): “For a single-copy-based forwarding scheme [10], [11], we can choose {Li = 1|i = 1, 2, .”
- Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case (2008, methodology): “This scenario could be modelled with a 2-dimensional Markov Chain, whose state is the distance from the destination (as in [17]) and the number of copies at that distance.”