• español
    • English
  • Login
  • español 
    • español
    • English
  • Tipos de Publicaciones
    • bookbook partconference objectdoctoral thesisjournal articlemagazinemaster thesispatenttechnical documentationtechnical report
Ver ítem 
  •   IMDEA Networks Principal
  • Ver ítem
  •   IMDEA Networks Principal
  • Ver ítem
JavaScript is disabled for your browser. Some features of this site may not work without it.

Underwater Delay-Tolerant Routing via Probabilistic Spraying

Compartir
Ficheros
udtn_access.pdf (5.116Mb)
Identificadores
URI: http://hdl.handle.net/20.500.12761/647
ISSN: 2169-3536
DOI: DOI: 0.1109/ACCESS.2018.2884090
Metadatos
Mostrar el registro completo del ítem
Autor(es)
Casari, Paolo; Azad, Saiful; Zanforlin, Marco; Zorzi, Michele
Fecha
2018-12
Resumen
We propose underwater delay-tolerant routing via probabilistic spraying (UDTN-Prob), a routing protocol for underwater delay-tolerant networks based on the store-and-forward paradigm. Our protocol exploits limited statistical knowledge of the time between two subsequent contacts between pairs of network nodes in order to filter the packets injected into the network, so that only those with a sufficiently high chance of being delivered to their intended destination within a given deadline are actually transmitted. In addition, the foreseen duration of a contact is estimated via a preliminary packet exchange, so that the nodes get a fair share of the contact time to exchange their own data. The transmission is protected against channel-induced packet losses via an ARQ scheme modified to adapt itself to typical underwater transmission times and to the variation of round-trip times induced by node mobility. We simulate the protocol using the DESERT Underwater libraries, that make it possible to accurately reproduce the nodes' behavior and mobility patterns. Our results show that the proposed protocol achieves significantly better performance than Spray-and-Wait, which is currently the most typical choice among store-and-forward protocols. Moreover, we show that a 2-hop statistical knowledge of the node contact process yields marginally higher utility with respect to a simpler 1-hop knowledge, which is also much easier to collect or estimate.
Compartir
Ficheros
udtn_access.pdf (5.116Mb)
Identificadores
URI: http://hdl.handle.net/20.500.12761/647
ISSN: 2169-3536
DOI: DOI: 0.1109/ACCESS.2018.2884090
Metadatos
Mostrar el registro completo del ítem

Listar

Todo IMDEA NetworksPor fecha de publicaciónAutoresTítulosPalabras claveTipos de contenido

Mi cuenta

Acceder

Estadísticas

Ver Estadísticas de uso

Difusión

emailContacto person Directorio wifi Eduroam rss_feed Noticias
Iniciativa IMDEA Sobre IMDEA Networks Organización Memorias anuales Transparencia
Síguenos en:
Comunidad de Madrid

UNIÓN EUROPEA

Fondo Social Europeo

UNIÓN EUROPEA

Fondo Europeo de Desarrollo Regional

UNIÓN EUROPEA

Fondos Estructurales y de Inversión Europeos

© 2021 IMDEA Networks. | Declaración de accesibilidad | Política de Privacidad | Aviso legal | Política de Cookies - Valoramos su privacidad: ¡este sitio no utiliza cookies!