Probabilistic Routing Protocol for Intermittently Connected Mobile Ad hoc Network (PROPICMAN)

Routing in intermittently connected mobile ad hoc networks (ICMAN) is a very challenging problem because disconnections are prevalent and the lack of knowledge about network dynamics hinders good decision making. In ICMAN one of the most important decisions is how to choose the most suitable intermediate(s) to forward the message to the destination. We propose in this document a new algorithm (PROPICMAN) that, based on context information, allows the sender to select the neighbor(s) such that the message has the highest probability to reach the destination.