Optimal stochastic model for maximizing delivered messages in opportunistic networks

Opportunistic networks (ON) allow for routing in networks where contemporaneous end-to-end path are unstable. Due to uneven and fluctuant node density, both links and nodes in our uncertain environment may be inherently unreliable and disconnections may be long-lived. A critical challenge for ONs is determining routes through the network without ever having an end-to-end connection. Owing to these conditions, the optimized route has a significant role in the number of delivered messages, when the connection and meeting nodes are undefined. The main contribution of our paper is optimization routing models (multistage stochastic model) involving uncertain parameters, for which stochastic model are available. To our best knowledge, this is the first time that the problem is addressed. Upper bound on the network performance used in comparing with previous models is also obtained.