Probabilistic routing in intermittently connected networks

Lindgren, Anders; Doria, Avri; Schelén, Olov

doi:10.1145/961268.961272

Cited by 2,084 publications

(1,116 citation statements)

References 4 publications

Supporting

Mentioning

1,072

Contrasting

Unclassified

Order By: Relevance

“…These techniques include the Probabilistic Routing Protocol using History of Encounters and Transitivity (PRoPHET) (Lindgren et al, 2003) and MaxProp (Burgess et al, 2006). Lindgren et al (2003) have developed PRoPHET which it works as similar as the ER protocol.…”

Section: Prediction Techniquesmentioning

confidence: 99%

“…Lindgren et al (2003) have developed PRoPHET which it works as similar as the ER protocol. This routing protocol attempts to decrease the use of resources and tries to keep the best routing capabilities of ER by forwarding messages to selected nodes only, rather than forwarding messages to all nodes in the network.…”

Section: Prediction Techniquesmentioning

confidence: 99%

“…P_init should be set to 0.5 (Lindgren et al, 2004). The DP is calculated in three steps (Lindgren et al, 2003;Sammou, 2012b):…”

Section: Prediction Techniquesmentioning

confidence: 99%

“…Knowledge of meetings and visit places is stored in every intermediate node and is used to estimate message delivery probability. A similar approach is followed in the PRoPHET routing protocol (Lindgren et al, 2003). Three assumptions are available in the MV protocol that includes (Karimzadeh, 2011):…”

Section: Meet and Visit (Mv)mentioning

confidence: 99%

See 3 more Smart Citations

Survey and Comparison of Operating Concept for Routing Protocols in DTN

Ahmed¹,

Omar²,

Hassan³

2016

Journal of Computer Science

View full text Add to dashboard Cite

Delay Tolerant Network (DTN) are promising techniques to enable data transmission in challenging scenarios where sophisticated infrastructure is not available and the end-to-end path does not exist at the moment of data transmission. These networks are characterized by a long delay, intermittent connectivity and high error rates. Furthermore, the dynamic topology of the network may change randomly. Therefore, routing is one of the most crucial issues that affect the performance of DTN in terms of data delivery, latency and using resources if node mobility is considered. The routing design in DTN raises many challenges to the networks. Therefore, the problem of how to route a packet from one node to another in DTN is of the essence. This paper puts forward a rigorous survey of various routing protocols as well as performs a comparison of diverse routing strategies regarding significant issues in DTN.

show abstract

Section: Prediction Techniquesmentioning

confidence: 99%

Section: Prediction Techniquesmentioning

confidence: 99%

“…P_init should be set to 0.5 (Lindgren et al, 2004). The DP is calculated in three steps (Lindgren et al, 2003;Sammou, 2012b):…”

Section: Prediction Techniquesmentioning

confidence: 99%

Section: Meet and Visit (Mv)mentioning

confidence: 99%

See 2 more Smart Citations

Survey and Comparison of Operating Concept for Routing Protocols in DTN

Ahmed¹,

Omar²,

Hassan³

2016

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…In the light of direct dissemination techniques, Delay Tolerant Networks (DTN) [4] are a variant of classic MANETs based on the carry-store-and forward paradigm. In [8], several dissemination schemes for DTNs (PRoHET [27], MaxProp [28], and TTR [29]) were evaluated in disaster scenarios. According to the results, MaxProp is the best technique in terms of packet delivery ratio (PDR), and TTR in terms of energy consumption.…”

Section: Related Workmentioning

confidence: 99%

Multi-objective performance optimization of a probabilistic similarity/dissimilarity-based broadcasting scheme for mobile ad hoc networks in disaster response scenarios

et al. 2013

View full text Add to dashboard Cite

decentralized communications quickly and using common devices like mobile phones. Broadcasting is the main mechanism used to disseminate information in all-to-all fashion in ad hoc networks. The objective of this paper is to optimize a broadcasting scheme based on similarity/dissimilarity coefficient designed for disaster response scenarios through a multi-objective optimization problem in which several performance metrics such as reachability, number of retransmissions and delay are optimized simultaneously.

show abstract

Epidemic Models, Algorithms, and Protocols in Wireless Sensor and Ad Hoc Networks

Das

2008

Algorithms and Protocols for Wireless Sensor Networks

View full text Add to dashboard Cite

Probabilistic routing in intermittently connected networks

Cited by 2,084 publications

References 4 publications

Survey and Comparison of Operating Concept for Routing Protocols in DTN

Survey and Comparison of Operating Concept for Routing Protocols in DTN

Multi-objective performance optimization of a probabilistic similarity/dissimilarity-based broadcasting scheme for mobile ad hoc networks in disaster response scenarios

Epidemic Models, Algorithms, and Protocols in Wireless Sensor and Ad Hoc Networks

Contact Info

Product

Resources

About