Abstract
Delay Tolerant Networks (DTN) are characterized by intermittent connectivity between nodes causing parts of an end-to-end path to be formed at different times, though a complete end-to-end path may not exist at any time. In such networks, messages are buffered at nodes, and forwarded as and when a contact with the next hop is made. Typically, broadcasting in DTNs uses some variation of flooding. Such schemes generate a large number of extra messages that may need to be buffered and may not work well in resource-constrained scenarios such as low buffer size at nodes or nodes with energy constraints.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical Report 200006, Duke University (2000)
Khelil, A., Marrón, P.J., Becker, C., Rothermel, K.: Hypergossiping: A generalized broadcast strategy for mobile ad hoc networks. Ad Hoc Networks 5(5), 531–546 (2007)
Gupta, A., Jathar, R.: Probabilistic routing protocol using contact sequencing in delay tolerant networks. In: Second International Conference on Communication Systems and Networks, COMSNETS 2010, pp. 1–10 (2010)
Keränen, A., Ott, J., Kärkkäinen, T.: The ONE Simulator for DTN Protocol Evaluation. In: Second International Conference on Simulation Tools and Techniques, SIMUTools 2009, New York, NY, USA. ICST (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dhole, P., Gupta, A., Sharma, A. (2013). POSTER: Broadcasting in Delay Tolerant Networks Using Periodic Contacts. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds) Distributed Computing and Networking. ICDCN 2013. Lecture Notes in Computer Science, vol 7730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35668-1_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-35668-1_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35667-4
Online ISBN: 978-3-642-35668-1
eBook Packages: Computer ScienceComputer Science (R0)