Single-copy routing in intermittently connected mobile networks

By Akis Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra. 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004., 2004

529 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/2bf42de2fc3480ca96674299757e6ae5665fa1ab

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

Citations in the corpus

Performance analysis of mobility-assisted routing (2006, methodology): “Such networks are often collectively referred to as Delay Tolerant Networks (DTN) [1].”
DTN routing as a resource allocation problem (2007, methodology): “[33] present an analytical framework for the forwarding-only case assuming a grid-based mobility model.”
DV-CAST: A distributed vehicular broadcast protocol for vehicular ad hoc networks (2010, background): “Single-copy [4] and multi-copy Spray and Wait [5] are shown to be efficient alternatives for message delivery.”
Survey of Important Issues in UAV Communication Networks (2016, background): “Consequently, many researchers have advanced new routing algorithms such as Direct Delivery [135], which proposes single copy method for intermittently connected networks.”
Practical Routing in Delay-Tolerant Networks (2005, methodology): “A theoretical analysis of gradient routing can be found in [42], and a discussion about predicting utility function values can be found in [32].”
Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case (2008, methodology): “The champion algorithm of our study turns out to be one that combines the simplicity of a simple random policy, which is ef.cient in .nding good leads towards the destination, with the sophistication of utility-based policies that ef.ciently follow good leads.”
Encounter: based routing in DTNs (2009, background): “Forwarding-based approaches for DTNs have been proposed [8], [16], but are limited in their effectiveness due the instability or even nonexistence of routes from any particular node to the destination.”
Prioritized epidemic routing for opportunistic networks (2007, background): “Several works make use of contact history to predict future contacts to guide routing decisions, including [13] (PROPHET), [2] (MV), [4] (MaxProp), and [7].”
Routing in Sparse Vehicular Ad Hoc Wireless Networks (2007, background): “A number of routing protocols specifically designed to cope with routing in sparsely connected Mobile Ad hoc Networks that fall into the generic framework of Delay Tolerant Networks are as follows: DataMules [16] are mobile messengers which promote the network connectivity in a sensor network by pro”
Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs (2009, methodology): “[48] use a combination of random walk and utilitybased forwarding.”
Social network analysis for routing in disconnected delay-tolerant MANETs (2007, methodology): “[35] use a combination of random walk and utility-based forwarding.”
HiBOp: a History Based Routing Protocol for Opportunistic Networks (2007, background): “Indeed, we are neglecting additional delays and message losses related to network congestion, which might significantly increase delays and message drop rates under very high traffic load [ 9 ].”
Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case (2008, background): “demic routing (the theoretical one is for an oracle-based scheme [1]), in order to show how the same traffic loads affect the accuracy of existing analytical expressions for the latter [42].”
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.”
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility (2007, background): “This scheme consists of two phases: in the first phase it distributes a fixed number of copies to the first few relays encountered, and in the second phase each of these relays waits until it encounters the destination itself (i.e. " Direct Transmission " [16]).”
Modeling Time-Variant User Mobility in Wireless Mobile Networks (2007, background): “These quantities capture the time between available communication opportunities under the mobility model, and can be used as building blocks to analyze the performance of more complex packet forwarding schemes [4], [5].”
Broadcasting in VANET (2007, background): “…scenario; and (ii) propose three light-weight broadcast techniques; i.e., weighted p-persistence, slotted 1-persistence, and slotted p-persistence, which can provide 100% reachability in a well-connected network and up to approximately 70% reduction in the broadcast redundancy and packet loss…”