Scipediacontent: Scipediacontent moved page Draft Content 564879837 to Palazzo et al 2011a

2021-02-16T10:04:05Z

Scipediacontent moved page Draft Content 564879837 to Palazzo et al 2011a

Scipediacontent: Created page with " == Abstract == International audience; Similarity-based techniques relying on contact patterns among nodes have shown to provide high delivery success rate when performing r..."

2021-02-16T10:04:02Z

Created page with " == Abstract == International audience; Similarity-based techniques relying on contact patterns among nodes have shown to provide high delivery success rate when performing r..."

New page

== Abstract ==

International audience; Similarity-based techniques relying on contact patterns among nodes have shown to provide high delivery success rate when performing routing in delay-tolerant networks (DTN). Nevertheless, such approaches work well only when nodes exhibit high similarity values. In this paper, we propose Price (Periodicity-based Routing in Intermittently-Connected Environments), an agenda-based greedy forwarding scheme for DTNs that combines geographic-oriented forwarding with contact-based forwarding by relying packets according to predictable patterns of locations and contacts. We define the operation of Price and evaluate the performance of geographic forwarding under the framework of graph navigation to unveil a small-world phenomenon. We then gauge the performance of Price using a real-life mobility data set according to various well-known routing solutions such as Flooding, Prophet, Bubble Rap, and Wait. Simulation results show that Price largely outperforms other solutions, especially in terms of combined cost/delivery ratio.

== Original document ==

The different versions of the original document can be found in:

* [http://dx.doi.org/10.1016/j.comnet.2011.03.014 http://dx.doi.org/10.1016/j.comnet.2011.03.014]

* [https://hal.archives-ouvertes.fr/hal-01151833 https://hal.archives-ouvertes.fr/hal-01151833]

* [https://api.elsevier.com/content/article/PII:S1389128611001174?httpAccept=text/xml https://api.elsevier.com/content/article/PII:S1389128611001174?httpAccept=text/xml],
: [https://api.elsevier.com/content/article/PII:S1389128611001174?httpAccept=text/plain https://api.elsevier.com/content/article/PII:S1389128611001174?httpAccept=text/plain],
: [http://dx.doi.org/10.1016/j.comnet.2011.03.014 http://dx.doi.org/10.1016/j.comnet.2011.03.014] under the license https://www.elsevier.com/tdm/userlicense/1.0/

* [https://www.sciencedirect.com/science/article/pii/S1389128611001174 https://www.sciencedirect.com/science/article/pii/S1389128611001174],
: [https://hal.archives-ouvertes.fr/hal-01151833 https://hal.archives-ouvertes.fr/hal-01151833],
: [https://dblp.uni-trier.de/db/journals/cn/cn55.html#BocFAGP11 https://dblp.uni-trier.de/db/journals/cn/cn55.html#BocFAGP11],
: [http://dx.doi.org/10.1016/j.comnet.2011.03.014 http://dx.doi.org/10.1016/j.comnet.2011.03.014],
: [https://academic.microsoft.com/#/detail/2059057449 https://academic.microsoft.com/#/detail/2059057449]

← Older revision	Revision as of 10:04, 16 February 2021
(No difference)

Palazzo et al 2011a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 564879837 to Palazzo et al 2011a

Scipediacontent: Created page with " == Abstract == International audience; Similarity-based techniques relying on contact patterns among nodes have shown to provide high delivery success rate when performing r..."