A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Mobility modeling in wireless networks: categorization, smooth movement, and border effects
ACM SIGMOBILE Mobile Computing and Communications Review
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
On the Performance of Flooding-Based Resource Discovery
IEEE Transactions on Parallel and Distributed Systems
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Predict and relay: an efficient routing in disruption-tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Multicasting in delay tolerant networks: a social network perspective
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
The age of gossip: spatial mean field regime
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
A study of information dissemination under multiple random walkers and replication mechanisms
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
IEEE Journal on Selected Areas in Communications
Probabilistic routing using contact sequencing in delay tolerant networks
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Distributed stochastic optimization in opportunistic networks: the case of optimal relay selection
Proceedings of the 5th ACM workshop on Challenged networks
Text clustering using one-mode projection of document-word bipartite graphs
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
In this paper, we present a model of a delay tolerant network(DTN) and identify that this model can be suitably reformulated as a bipartite network and that the major predictions from the former are equivalent to that of the latter. In particular, we show that the coverage of the information dissemination process in the DTN matches accurately with the size of the largest component in the suitably thresholded one-mode projection of the corresponding bipartite network. In the process of this analysis, some of the important insights gained are that (a) arbitrarily increasing the number of agents participating in the dissemination process cannot increase the coverage once the system has reached the stationary state for a given buffer time (i.e., the time for which a message resides in the buffer of the places visited by the agents), (b) the coverage varies inversely with the square of the number of places in the system and directly with the square of the average social participation of the agents and (c) it is possible to design an optimal buffer time for a desired cost of coverage. To the best of our knowledge, this is the first such work that employs the rich theoretical backbone of bipartite networks as a "proxy" for the analysis of the otherwise intractable DTN dynamics thus allowing for various novel analytical estimates.