Information-centric Routing for Opportunistic Wireless Networks

The information below is for an old version of the document
Document Type Expired Internet-Draft (individual)
Last updated 2019-09-01 (latest revision 2019-02-28)
Stream (None)
Intended RFC status (None)
Expired & archived
pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at


This draft describes the Data reAchaBility BasEd Routing (DABBER) protocol, which has been developed to extend the reached of Named Data Networking based routing approaches to opportunistic wireless networks. By "opportunistic wireless networks" it is meant multi-hop wireless networks where finding an end-to-end path between any pair of nodes at any moment in time may be a challenge. The goal is to assist in better defining opportunities for the transmission of Interest packets towards the most suitable data source, based on metrics that provide information about: i) the availability of different data sources; ii) the availability and centrality of neighbor nodes; iii) the time lapse between forwarding Interest packets and receiving the corresponding data packets. The document presents an architectural overview of DABBER followed by specification options related to the dissemination of name-prefix information to support the computation of next hops, and the ranking of forwarding options based on the best set of neighbors to ensure a short time-to-completion.


Paulo Mendes (
Rute Sofia (
Vassilis Tsaoussidis (
Sotiris Diamantopoulos (
Christos-Alexandros Sarros (
Carlos Borrego (
Joan Borrell (

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)