Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6876277 | Theoretical Computer Science | 2013 | 9 Pages |
Abstract
In this paper, we propose a simple model of opportunistic mobility network based on oblivious carriers, and investigate the routing problem in such networks. We present an optimal online routing algorithm and compare it with a simple shortest-path inspired routing and optimal offline routing. In doing so, we identify the key parameters (the minimum non-zero probability of meeting among the carrier pairs, and the number of carriers a given carrier comes into contact) driving the separation among these algorithms.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
BroÅa Brejová, Stefan Dobrev, Rastislav KráloviÄ, TomáÅ¡ VinaÅ,