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

Abstract

We find that most of the recent works on this issue did not care so much about the information of mobile Routing in intermittently connected mobile ad hoc devices' carriers. This reduces the possibilities of networks (ICMAN) is a very challenging problem considering the users' social behavior, which is seen as because disconnections are prevalent and the lack of one of the most interesting parameters for mobile users knowledge about network dynamics hinders good [1,6]. In our approach, the carrier's information, called decision making. In ICMAN one of the most important node profile, plays an important role in predicting the decisions is how to choose the most suitable mobility of the nodes. We consider that people are not intermediate(s) to forward the message to the likely to move around randomly. Rather, they move in destination. We propose in this document a new a predictable fashion based on repeating behavioral algorithm (PROPICMAN) that, based on context patterns at different timescales (day, week, month). If a information, allows the sender to select the neighbor(s) node has visited a place several times before, it is such that the message has the highest probability to likely that it will visit this location again in the future. reach the destination.For example, because this person likes pasta, and the place is an Italian restaurant. Thus, relevant

Congestion Control Strategies on Integrated Routing Protocol for the Opportunistic Network: A Comparative Study and Performance Analysis

“…Hence, many routing protocols [7], [13], [14], [15], [16] adopt flooding based schemes to deal with the problem of network partitioning and unpredictability in connections in order to increase the message delivery. Node receives packets, stores them in their buffer, carry them when moving and pass them to other nodes when they meet each other.…”

A Peer-to-Peer Overlay System for Message Delivery in Wide Intermittently-Connected Hybrid Networks

“…Where PRoPHET relies on the history of encounters, the Context-Aware Routing protocol (CAR) [11] exploits some contextual properties using utility functions and Kalman filters to compute the message delivery estimation. HiBOp [2] and Propicman [12] investigate a social and history-based approach in order to predict the future movements of the nodes and to route the messages according to this prediction. HiBOp and Propicman can be considered as more general than CAR, because unlike the latter, they do not suppose the existence of an underlying routing protocol, and they can process context information provided by the message emitters in order to take their routing decisions.…”

A Critical Review of the Routing Protocols in Opportunistic Networks

“…Propicman is another Social-context aware routing protocol that uses the carrier's information to disseminate the data efficiently and to make provision for efficient routing [12] with zero knowledge. The protocol assumes that the users are not likely to move around in a random manner.…”