@techreport{lindgren-dtnrg-prophet-03,
    number =    {draft-lindgren-dtnrg-prophet-03},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-lindgren-dtnrg-prophet/03/},
    author =    {Anders Lindgren and avri doria},
    title =     {{Probabilistic Routing Protocol for Intermittently Connected Networks}},
    pagetotal = 49,
    year =      2007,
    month =     may,
    day =       29,
    abstract =  {This document defines PRoPHET, a Probabilistic Routing Protocol using History of Encounters and Transitivity. PRoPHET is a routing protocol for intermittently connected networks, where there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. These networks are examples of networks where the Delay-Tolerant Network architecture{[}1{]} is applicable. The document presents an architectural overview followed by the protocol specification.},
}