A Graph-Based Model for Disconnected Ad Hoc Networks

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 Erdos-Renyi random graphs. Furthermore, we show that, under a uniformity assumption, the time taken for the connectivity graph to become connected scales as Theta((n log n)/lambda) with the number of nodes in the network. Hence we found that, using epidemic routing techniques, message delay is O((n log2 n)/(lambda log log n)). The model is validated by numerical simulations and by a comparison with the connectivity patterns emerging from real experiments.

[1]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[2]  Thomas L. Saaty,et al.  Elements of queueing theory , 2003 .

[3]  G. Doetsch.  Guide to the applications of the Laplace and Z-transforms , 1971 .

[4]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[5]  Béla Bollobás,et al.  Random Graphs , 1985 .

[6]  Andrea Fumagalli,et al.  A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks , 1998, TNET.

[7]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[8]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[9]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[10]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[12]  Christian Becker,et al.  An epidemic model for information diffusion in MANETs , 2002, MSWiM '02.

[13]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[14]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[15]  Vinton G. Cerf,et al.  Delay-tolerant networking: an approach to interplanetary Internet , 2003, IEEE Commun. Mag..

[16]  Devavrat Shah,et al.  Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.

[17]  Afonso Ferreira,et al.  Building a reference combinatorial model for MANETs , 2004, IEEE Network.

[18]  Mostafa Ammar,et al.  Routing in Space and Time in Networks with Predictable Mobility , 2004 .

[19]  Eric Brewer,et al.  Implementing Delay Tolerant Networking , 2004 .

[20]  Eytan Modiano,et al.  Capacity and delay tradeoffs for ad hoc mobile networks , 2004, IEEE Transactions on Information Theory.

[21]  Jean-Yves Le Boudec,et al.  Perfect simulation and stationarity of a class of mobility models , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[22]  Kevin C. Almeroth,et al.  Delay Tolerant Mobile Networks (DTMNs): Controlled Flooding in Sparse Mobile Networks , 2005, NETWORKING.

[23]  Ellen W. Zegura,et al.  Controlling the mobility of multiple data transport ferries in a delay-tolerant network , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[24]  Ger Koole,et al.  Message delay in MANET , 2005, SIGMETRICS '05.

[25]  Anders Lindgren,et al.  Opportunistic content distribution in an urban setting , 2006, CHANTS '06.

[26]  Pan Hui,et al.  Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[27]  Paolo Bellavista,et al.  Mobeyes: smart mobs for urban monitoring with a vehicular sensor network , 2006, IEEE Wireless Communications.

[28]  Ellen W. Zegura,et al.  Message ferry route design for sparse ad hoc networks with mobile nodes , 2006, MobiHoc '06.

[29]  P. Oscar Boykin,et al.  Scalable percolation search on complex networks , 2006, Theor. Comput. Sci..

[30]  Imrich Chlamtac,et al.  A Framework for Opportunistic Forwarding in Disconnected Networks , 2006, 2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services.

[31]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[32]  Massimo Franceschetti,et al.  On the throughput scaling of wireless relay networks , 2006, IEEE Transactions on Information Theory.

[33]  Vijaya Ramachandran,et al.  The diameter of sparse random graphs , 2007, Random Struct. Algorithms.