Delay-Tolerant Networks (DTNs) have emerged as an exciting research area with a number of useful applications. Most of these applications would benefit greatly by a reduction in the message delivery delay experienced in the network. The delay performance of DTNs is adversely affected by contention, especially severe in the presence of higher traffic rates and node densities. Many-to-Many (M2M) communication can handle this contention much better than traditional one-to- one communication employing CSMA. In this paper, for the first time, we analytically model the expected delivery delay of a DTN employing epidemic routing and M2M communication. The accuracy of our model is demonstrated by matching the analytical results against those from simulations. We also show using simulations that M2M communication significantly improves the delay performance (with respect to one-to-one CSMA) for high contention scenarios. We believe our work will enable the effective application of M2M communication to reduce delivery delays in DTNs.
Initial analytical models developed for DTN routing performance study @cite_4 , @cite_9 , @cite_12 worked under the assumption that whenever two nodes are in contact with each other, all messages could always be successfully transferred from one node to the other ( @math they assumed both buffer capacity and bandwidth to be infinite). While papers such as @cite_5 have modeled DTN performance with bounded buffer capacity, they have assumed that infinite bandwidth is available and hence that there is no contention. The motivation for not considering contention has been that DTNs are sparse networks and such sparsity yields negligible contention. However, this conjecture has been disproved with the help of simulations in works such as @cite_9 , @cite_12 . The authors in @cite_10 show via simulations that, irrespective of whether the network is sparse or dense, the contention is substantial for high traffic rates; and also that the contention increases with an increase in network density. Realizing the importance of contention in the routing performance, the authors have attempted to include contention in the analysis of routing @cite_10 , @cite_1 . Their analysis assumes the one-to-one CSMA communication scheme.
@cite_4 @cite_9 @cite_1 @cite_5 @cite_10 @cite_12
1483953177 1976081465 2949226357 2033020629
The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multihop paths may not exist and communication routes may only be available through time and mobility. We use analytical tools to derive generic theoretical upper bounds for the information propagation speed in large scale mobile and intermittently connected networks. In other words, we upper-bound the optimal performance, in terms of delay, that can be achieved using any routing algorithm. We then show how our analysis can be applied to specific mobility models to obtain specific analytical estimates. In particular, in 2-D networks, when nodes move at a maximum speed v and their density is small (the network is sparse and asymptotically almost surely disconnected), we prove that the information propagation speed is upper bounded by (1 + O(v2))v in random waypoint-like models, while it is upper bounded by O(√vvv) for other mobility models (random walk, Brownian motion). We also present simulations that confirm the validity of the bounds in these scenarios. Finally, we generalize our results to 1-D and 3-D networks. The goal of this paper is to increase our under- standing of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multihop paths may not exist and communication routes may only be available through time and mobility. We use analytical tools to derive generic theoretical upper bounds for the information propagation speed in large scale mobile and intermittently con- nected networks. In other words, we upper-bound the optimal performance, in terms of delay, that can be achieved using any routing algorithm. We then show how our analysis can be applied to specific mobility models to obtain specific analytical estimates. In particular, in 2-D networks, when nodes move at a maximum speed and their density is small (the network is sparse and asymptotically almost surely disconnected), we prove that the information propagation speed is upper bounded by in random waypoint-like models, while it is upper bounded by for other mobility models (random walk, Brownian motion). We also present simulations that confirm the validity of the bounds in these scenarios. Finally, we generalize our results to 1-D and 3-D networks. The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop paths may not exist and communication routes may only be available through time and mobility. We use analytical tools to derive generic theoretical upper bounds for the information propagation speed in large scale mobile and intermittently connected networks. In other words, we upper-bound the optimal performance, in terms of delay, that can be achieved using any routing algorithm. We then show how our analysis can be applied to specific mobility and graph models to obtain specific analytical estimates. In particular, in two-dimensional networks, when nodes move at a maximum speed @math and their density @math is small (the network is sparse and surely disconnected), we prove that the information propagation speed is upper bounded by ( @math in the random way-point model, while it is upper bounded by @math for other mobility models (random walk, Brownian motion). We also present simulations that confirm the validity of the bounds in these scenarios. Finally, we generalize our results to one-dimensional and three-dimensional networks. Analytical models of IEEE 802.11-based WLANs are invariably based on approximations, such as the well-known mean-field approximations proposed by Bianchi for saturated nodes. In this paper, we provide a new approach for modeling the situation when the nodes are not saturated. We study a State Dependent Attempt Rate (SDAR) approximation to model M queues (one queue per node) served by the CSMA CA protocol as standardized in the IEEE 802.11 DCF. The approximation is that, when n of the M queues are non-empty, the attempt probability of the n non-empty nodes is given by the long-term attempt probability of n saturated nodes as provided by Bianchi's model. This yields a coupled queue system. When packets arrive to the M queues according to independent Poisson processes, we provide an exact model for the coupled queue system with SDAR service. The main contribution of this paper is to provide an analysis of the coupled queue process by studying a lower dimensional process and by introducing a certain conditional independence approximation. We show that the numerical results obtained from our finite buffer analysis are in excellent agreement with the corresponding results obtained from ns-2 simulations. We replace the CSMA CA protocol as implemented in the ns-2 simulator with the SDAR service model to show that the SDAR approximation provides an accurate model for the CSMA CA protocol. We also report the simulation speed-ups thus obtained by our model-based simulation.