Explore and wait
In the context of Opportunistic Networking (OppNet), designing routing and delivery protocols is currently an open and active line of research. In some OppNet scenarios, destination addresses are not always known by sending applications. Profile-cast models solve this problem by allowing message des...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2017 |
| País: | España |
| Institución: | Universitat Autònoma de Barcelona |
| Repositorio: | Dipòsit Digital de Documents de la UAB |
| Idioma: | inglés |
| OAI Identifier: | oai:ddd.uab.cat:199583 |
| Acceso en línea: | https://ddd.uab.cat/record/199583 https://dx.doi.org/urn:doi:10.1016/j.comnet.2017.05.007 |
| Access Level: | acceso abierto |
| Palabra clave: | OppNet Bundle protocol Profile-cast Optimisation DTN |
| Sumario: | In the context of Opportunistic Networking (OppNet), designing routing and delivery protocols is currently an open and active line of research. In some OppNet scenarios, destination addresses are not always known by sending applications. Profile-cast models solve this problem by allowing message destinations to be users or groups of users defined by their profiles. These profiles provide very effective ways of characterizing nodes in terms of node's attributes such as their profession, interests or typical whereabouts, for example. However, there are strong limitations in OppNet Profile-casting. There is no current way of representing special profiles defined by relative delivery functions such as best, maximum or over-the-average: nodes belong to these relative profiles taking into account not only attributes from the very same node but also relative to others from the same profile. In this article, we introduce Relcast, a Profile-cast model that allows messages to be sent to profiles defined in terms of relative delivery functions. Additionally, we present Explore and Wait, a composite routing-delivery scheme that uses optimal stopping theory-based delivery strategies to route Relcast messages. We show, using simulations, that this routing-delivery scheme performs better than traditional approaches that use state-of-the-art routing-delivery primitives. |
|---|