Date Added: Mar 2010
Most of the existing routing schemes for opportunistic forwarding either rely on a priori known topology information, or provide explicit protocol information in the data packet header. In this paper, the authors present a routing protocol for opportunistic forwarding that dynamically create candidate priority forwarding lists without the need for any explicit control information in data packet headers, and determines and distributes link probability information. The routing protocol is both modular and powerful enough to be used as the routing information creating entity for most existing opportunistic schemes, as well as future new schemes. These properties makes their protocol an ideal candidate for a common opportunistic forwarding reference framework.