Opportunistic networks: Minimizing expected latency

Abstract

Even in the absence of a physical network infrastructure, it is important that mobile devices can take advantage of the opportunities presented to them to maintain communication. Opportunistic networks are a class of mobile networks that must rely on unscheduled sporadic meetings between nodes to achieve communication. The main challenge in these networks is to route messages towards a destination with high delivery probability, low average latency and efficient usage of network resources. Despite the numerous proposals for opportunistic routing protocols, there are relatively few analytical characterizations of their behaviour. In this paper, we propose both centralized and decentralized message forwarding algorithms that, under relatively strong assumptions about the network's behaviour, minimize the expected latency to a destination. After presenting proofs of the optimality of our proposed algorithms, we confirm their improvement in system performance through numerical simulation.

Optimal Forwarding in Opportunistic Delay Tolerant Networks With Meeting Rate Estimations

“…Although this error analysis is useful, Boldrini et al do not specify how parameters should be estimated in order to obtain a performance that approaches what can be achieved when perfect a-priori knowledge of the network parameters is available. Some of the results in this paper were presented in an earlier conference paper [33], but here we include more extensive experimental analysis and additional theoretical results.…”

“…Some researchers have explored how imprecision in the measurement or estimation of network parameters can impact the performance of opportunistic network routing algorithms. In [26], [27], Boldrini Some of the results in this paper were presented in an earlier conference paper [33], but here we include more extensive experimental analysis and additional theoretical results.…”