No abstract

Recently, research on disconnected networks has been fostered by several studies on delay-tolerant networks, which are designed in order to sustain disconnected operations. We focus on the emerging notion of connectivity which exists in such networks, where the message exchange between nodes is enforced by leveraging storage capabilities at intermediate relays, with the aim of achieving connectivity over time. The problem, under the constraint of intermittent connectivity, is hence to devise efficient mechanisms for message delivery, and evaluate the performance thereof.In this paper, we introduce a graph-based model able to capture the evolution of the connectivity properties of such systems over time. We show that, for most networks of interest, such connectivity graphs can be modeled as Erdös-Renyi random graphs. Furthermore, we show that, under a uniformity assumption, the time taken for the connectivity graph to become connected scales as Θ( n log n λ ) with the number of nodes in the network. Hence we found that, using epidemic routing techniques, message delay is O( n log 2 n λ log log n ). The model is validated by numerical simulations and by a comparison with the connectivity patterns emerging from real experiments.

No abstract

No abstract

For the last twenty years, mobile communications have experienced an explosive growth. In particular, one area of mobile communication, the Mobile Ad hoc Networks (MANETs), has attracted significant attention due to its multiple applications and its challenging research problems. On the other hand, the nodes mobility in these networks has introduced new challenges for the routing protocols, especially when the mobility induces multiple disconnections in the network. In this survey, we present an overview of this issue and a detailed discussion of the major factors involved. In particular, we show how messages can be efficiently disseminated in different types of MANETs.