research-article

Achieving anycast in DTNs by enhancing existing unicast protocols

Authors:

Samuel C. Nelson,

Robin KravetsAuthors Info & Claims

CHANTS '10: Proceedings of the 5th ACM workshop on Challenged networks

Pages 63 - 70

https://doi.org/10.1145/1859934.1859948

Published: 24 September 2010 Publication History

Abstract

Many DTN environments, such as emergency response networks and pocket-switched networks, are based on human mobility and communication patterns, which naturally lead to groups. In these scenarios, group-based communication is central, and hence a natural and useful routing paradigm is anycast, where a node attempts to communicate with at least one member of a particular group. Unfortunately, most existing anycast solutions assume connectivity, and the few specifically for DTNs are single-copy in nature and have only been evaluated in highly limited mobility models. In this paper, we propose a protocol-independent method of enhancing a large number of existing DTN unicast protocols, giving them the ability to perform anycast communication. This method requires no change to the unicast protocols themselves and instead changes their world view by adding a thin layer beneath the routing layer. Through a thorough set of simulations, we also evaluate how different parameters and network conditions affect the performance of these newly transformed anycast protocols.

References

[1]

}}M. Abdulla and R. Simon. A simulation analysis of multicasting in delay tolerant networks. In Proceedings of Winter Simulation Conference, 2006.

Digital Library

[2]

}}A. Balasubramanian, B. Levine, and A. Venkataramani. DTN routing as a resource allocation problem. In Proc. ACM SIGCOMM, 2007.

Digital Library

[3]

}}S. Bhattachargee, M. Ammar, E. Zegura, N. Shah, and Z. Fei. Application layer anycasting. In Proceedings of IEEE INFOCOM, 1997.

Digital Library

[4]

}}J. Burgess, Br. Gallagher, D. Jensen, and B. Levine. MaxProp: Routing for vehicle-based disruption-tolerant networks. In Proc. IEEE INFOCOM, 2006.

[5]

}}A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Impact of human mobility on opportunistic forwarding algorithms. IEEE Transactions on Mobile Computing, 6(6):606--620, 2007.

Digital Library

[6]

}}Ederson Rosa da Silva and Paulo Guardieiro. Anycast routing in delay tolerant networks using genetic algorithms for route decision. In Proceedings of IDCS, 2008.

[7]

}}Y. Gong, Y. Xiong, Q. Zhang, Z. Zhang, W. Wang, and Z. Xu. Anycast routing in delay tolerant networks. In GLOBECOM, 2006.

[8]

}}P. Hui, J. Crowcroft, and E. Yoneki. Bubble rap: social-based forwarding in delay tolerant networks. In Proceedings of ACM MobiHoc, 2008.

Digital Library

[9]

}}A. Keränen, J. Ott, and T. Kärkkäinen. The ONE Simulator for DTN Protocol Evaluation. In Proceedings of SIMUTools '09, 2009.

Digital Library

[10]

}}A. Lindgren, A. Doria, and O. Scheln. Probabilistic routing in intermittently connected networks. In MobiHoc 03, 2003.

[11]

}}S. Nelson, M. Bahkt, and R. Kravets. Encounter-based routing in dtns. Proceedings of IEEE InfoCom, 2009.

[12]

}}S. Nelson, A. Harris, and R. Kravets. Event-driven, role-based mobility in disaster recovery networks. In Proceedings of ACM CHANTS, 2007.

Digital Library

[13]

}}Samuel C. Nelson and Robin Kravets. For members only: Local and robust group management in dtns. In In Proc. ACM Mobicom CHANTS workshop, 2010.

Digital Library

[14]

}}V. D. Park and J. P. Macker. Anycast routing for mobile networking. In Proceedings of IEEE Military Communications Conference, 1999.

[15]

}}J. Scott, P. Hui, J. Crowcroft, and C. Diot. Haggle: A networking architecture designed around mobile users. In WONS, 2006.

[16]

}}T. Spyropoulos, K. Psounis, and C. Raghavendra. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of ACM WDTN '05, 2005.

Digital Library

[17]

}}Thrasyvoulos Spyropoulos, Konstantinos Psounis, and Cauligi S. Raghavendra. Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. In Proceedings of IEEE PerCom, 2007.

Digital Library

[18]

}}A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-2000-06, Department of Computer Science, Duke University, April 2000.

Cited By

Le TGerla M(2017)An anycast routing strategy with time constraint in delay tolerant networks2017 16th Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net)10.1109/MedHocNet.2017.8001637(1-6)Online publication date: Jun-2017
https://doi.org/10.1109/MedHocNet.2017.8001637
Le TGerla M(2017)Social contact graph-based group communication schemes for delay tolerant networksInternational Journal of Parallel, Emergent and Distributed Systems10.1080/17445760.2017.1300802(1-15)Online publication date: 15-Mar-2017
https://doi.org/10.1080/17445760.2017.1300802
Zeng DTeng CYao HLiang QHu CYan X(2014)Stochastic Analysis of Epidemic Routing Based Anycast in Throwbox-Equipped DTNsProceedings of the 2014 IEEE 8th International Symposium on Embedded Multicore/Manycore SoCs10.1109/MCSoC.2014.20(77-81)Online publication date: 23-Sep-2014
https://dl.acm.org/doi/10.1109/MCSoC.2014.20
Show More Cited By

Index Terms

Achieving anycast in DTNs by enhancing existing unicast protocols
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols

Recommendations

Replication routing in DTNs: a resource allocation approach

Routing protocols for disruption-tolerant networks (DTNs) use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and network coding. The primary focus of these mechanisms is to increase the ...
DTN-FLOW: Inter-Landmark Data Flow for High-Throughput Routing in DTNs
IPDPS '13: Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing

In this paper, we focus on the efficient routing of data among different areas in Delay Tolerant Networks (DTNs). In current algorithms, packets are forwarded gradually through nodes with higher probability of visiting the destination node or area. ...
Performance modeling of DTN routing with heterogeneous and selfish nodes

The performance modeling study of Delay-Tolerant Network routing, in general, assumes the nodes to be homogeneous (in terms of features such as the coverage range) and uncompromised (in terms of forwarding messages). However, in realistic settings this ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CHANTS '10: Proceedings of the 5th ACM workshop on Challenged networks

September 2010

98 pages

ISBN:9781450301398

DOI:10.1145/1859934

Program Chairs:
Brenton Walker
Laboratory for Telecommunications Sciences, US DoD
,
Pan Hui
Deutsche Telekom Laboratories

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 September 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

MobiCom/MobiHoc '10

Sponsor:

SIGMOBILE

MobiCom/MobiHoc '10: The 16th Annual International Conference on Mobile Computing and Networking and The 11th ACM International Symposium on Mobile Ad Hoc Networking and Computing

September 24, 2010

Illinois, Chicago, USA

Acceptance Rates

Overall Acceptance Rate 61 of 159 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
189
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Le TGerla M(2017)An anycast routing strategy with time constraint in delay tolerant networks2017 16th Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net)10.1109/MedHocNet.2017.8001637(1-6)Online publication date: Jun-2017
https://doi.org/10.1109/MedHocNet.2017.8001637
Le TGerla M(2017)Social contact graph-based group communication schemes for delay tolerant networksInternational Journal of Parallel, Emergent and Distributed Systems10.1080/17445760.2017.1300802(1-15)Online publication date: 15-Mar-2017
https://doi.org/10.1080/17445760.2017.1300802
Zeng DTeng CYao HLiang QHu CYan X(2014)Stochastic Analysis of Epidemic Routing Based Anycast in Throwbox-Equipped DTNsProceedings of the 2014 IEEE 8th International Symposium on Embedded Multicore/Manycore SoCs10.1109/MCSoC.2014.20(77-81)Online publication date: 23-Sep-2014
https://dl.acm.org/doi/10.1109/MCSoC.2014.20
de Oliveira JLima Lde Andrade GMichelon G(2014)Anycasting in DTNs using virtual magnetic fields2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)10.1109/CCNC.2014.6994396(505-506)Online publication date: Jan-2014
https://doi.org/10.1109/CCNC.2014.6994396
Cao YSun Z(2013)Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and ChallengesIEEE Communications Surveys & Tutorials10.1109/SURV.2012.042512.0005315:2(654-677)Online publication date: Oct-2014
https://doi.org/10.1109/SURV.2012.042512.00053
Nelson SKravets RWalker BHui P(2010)For members onlyProceedings of the 5th ACM workshop on Challenged networks10.1145/1859934.1859937(5-12)Online publication date: 24-Sep-2010
https://dl.acm.org/doi/10.1145/1859934.1859937

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten