research-article

Experiments on the spatial distribution of network code diversity in segmented DTNs

Authors:

Brenton Walker,

Christine JulienAuthors Info & Claims

CHANTS '11: Proceedings of the 6th ACM workshop on Challenged networks

Pages 15 - 20

https://doi.org/10.1145/2030652.2030659

Published: 23 September 2011 Publication History

Abstract

Biologists have observed that when a small colony breaks off from a larger population, the colony tends to have less genetic diversity. This phenomenon, called the "founder effect", has an analogy in delay-tolerant networks that employ network coded routing to disseminate large bundles of data. In this paper, we study the spread of information diversity through various experiments using a network coding DTN router. The scenarios we investigate include single communities with "mixing nodes", segmented communities with occasional travelers between sub-groups, and real encounter traces. Our experiments are carried out on the VirtualMeshTest testbed, which allows us to perform large trials with real implementations communicating using commodity wireless cards over emulated RF channels.

References

[1]

A. Caro and J. Zinky. DTN erasure coding extension block (preliminary notes). To appear as Internet Draft.

[2]

R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung. Network information flow. IEEE Transactions on Information Theory, 46(4):1204--1216, 2000.

Digital Library

[3]

R. Beraldi and H. Alnuweiri. Delay tolerant podcasting with network coding. In Proceedings of IFIP Wireless Days, 2010.

[4]

N. Cai and R. Yeung. Secure network coding. In Proceedings of the 2002 IEEE International Symposium on Information Theory, 2002.

[5]

P. Chou, Y. Wu, and K. Jain. Practical network coding. In Proceedings of Allerton Conference on Communication, Control, and Computing, 2003.

[6]

M. C. Chuah, P. Yang, and Y. Xi. How mobility models affect the design of network coding schemes for disruption tolerant networks. In ICDCS Workshops, 2009.

Digital Library

[7]

Delay Tolerant Networking Research Group. DTN bundle protocol reference implementation. http://www.dtnrg.org/wiki/Code.

[8]

K. R. Fall. A delay-tolerant network architecture for challenged internets. In Proceedings of ACM SIGCOMM, 2003.

Digital Library

[9]

C. Gkantsidis and P. R. Rodriguez. Cooperative security for network coding file distribution. 2006.

[10]

T. Ho, R. Koetter, M. Medard, D. R. Karger, and M. Effros. The benefits of coding over routing in a randomized setting. In Proceedings of 2003 IEEE International Symposium on Information Theory, 2003.

[11]

Y. Kim, K. Taylor, C. Dunbar, B. Walker, and P. Mundur. Reality vs emulation: Running real mobility traces on a mobile wireless testbed. In HotPlanet 2011, 2011.

Digital Library

[12]

Y. Lin, B. Li, and B. Liang. Stochastic analysis of network coding in epidemic routing. IEEE JSAC, 26(5):794--808, 2008.

Digital Library

[13]

M4RI(e). http://m4ri.sagemath.org/.

[14]

J. Ott and D. Kutscher. A disconnection-tolerant transport for drive-thru internet environments. In Proceedings of IEEE Infocom, 2005.

[15]

J. Ryu, S. Bhadra, and S. Shakkottai. TCP with feed-forward source coding for wireless downlink networks. In Proceedings of Allerton Conference, 2009.

Digital Library

[16]

J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau. CRAWDAD trace cambridge/haggle/imote/infocom (v. 2006-01--31), Jan. 2006.

[17]

K. Scott and S. Burleigh. Bundle Protocol Specification. RFC 5050 (Experimental), Nov. 2007.

[18]

J. K. Sundararajan, D. Shah, M. Medard, M. Mitzenmacher, and J. Barros. Network coding meets TCP. In In Proceedings of IEEE Infocom, 2009.

[19]

N. Thompson, R. Crepaldi, and R. Kravets. Locus: A location-based data overlay for disruption-tolerant networks. In Proceedings of ACM CHANTS, 2006.

Digital Library

[20]

M. Yang and Y. Yang. Peer-to-peer file sharing based on network coding. In Proceedings of IEEE ICDCS, 2008.

Digital Library

Cited By

Walker BLindgren APaschos GVassilaras STassiulas L(2016)Long-term country-scale opportunistic network coded data disseminationProceedings of the 1st Workshop on Content Caching and Delivery in Wireless Networks10.1145/2836183.2836184(1-7)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1145/2836183.2836184
Walker B(2016)Computing network coded data coverage in an opportunistic data dissemination networkIEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications10.1109/INFOCOM.2016.7524493(1-9)Online publication date: Apr-2016
https://doi.org/10.1109/INFOCOM.2016.7524493
Wei Bai La RLee GStein G(2015)Performance evaluation of NSC in DTNs2015 49th Annual Conference on Information Sciences and Systems (CISS)10.1109/CISS.2015.7086848(1-5)Online publication date: Mar-2015
https://doi.org/10.1109/CISS.2015.7086848
Show More Cited By

Index Terms

Experiments on the spatial distribution of network code diversity in segmented DTNs
1. Networks
  1. Network types

Recommendations

Network coded routing in delay tolerant networks: an experience report
ExtremeCom '11: Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition

In delay-tolerant networks, end-to-end routes are rarely available, and routing protocols must take advantage of the opportunistic interactions among nodes to deliver packets. Probabilistic routing performs well in such networks and has been the ...
Nullspace-based stopping conditions for network-coded transmissions in DTNs
CHANTS '12: Proceedings of the seventh ACM international workshop on Challenged networks

In a challenged network environment, where end-to-end connectivity may be a rare occurrence, delay-tolerant routing protocols must strike a balance between the increased robustness and reliability that comes with message replication and the resulting ...
Evaluating the capacity of resource-constrained DTNs
IWCMC '06: Proceedings of the 2006 international conference on Wireless communications and mobile computing

Due to their low network connectivity, sparsely-connected networks can support delay-tolerant applications only. Thus, such communication environments are examples of Delay-Tolerant Networks (DTNs). While in some DTN connectivity is predictable (e.g., ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CHANTS '11: Proceedings of the 6th ACM workshop on Challenged networks

September 2011

86 pages

ISBN:9781450308700

DOI:10.1145/2030652

Program Chairs:
Franck Legendre
ETH Z�rich
,
Ahmed Helmy
University of Florida

Copyright � 2011 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: 23 September 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

Mobicom'11

Sponsor:

SIGMOBILE

Mobicom'11: The 17th Annual International Conference on Mobile Computing and Networking

September 23, 2011

Nevada, Las Vegas, 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
140
Total Downloads

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

Reflects downloads up to 18 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Walker BLindgren APaschos GVassilaras STassiulas L(2016)Long-term country-scale opportunistic network coded data disseminationProceedings of the 1st Workshop on Content Caching and Delivery in Wireless Networks10.1145/2836183.2836184(1-7)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1145/2836183.2836184
Walker B(2016)Computing network coded data coverage in an opportunistic data dissemination networkIEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications10.1109/INFOCOM.2016.7524493(1-9)Online publication date: Apr-2016
https://doi.org/10.1109/INFOCOM.2016.7524493
Wei Bai La RLee GStein G(2015)Performance evaluation of NSC in DTNs2015 49th Annual Conference on Information Sciences and Systems (CISS)10.1109/CISS.2015.7086848(1-5)Online publication date: Mar-2015
https://doi.org/10.1109/CISS.2015.7086848
Hennessy AGladd AWalker B(2013)Nullspace-based stopping conditions for network-coded transmissions in DTNsACM SIGMOBILE Mobile Computing and Communications Review10.1145/2502935.250293817:1(14-21)Online publication date: 12-Jul-2013
https://dl.acm.org/doi/10.1145/2502935.2502938
Hennessy AGladd AWalker BYoneki EKravets R(2012)Nullspace-based stopping conditions for network-coded transmissions in DTNsProceedings of the seventh ACM international workshop on Challenged networks10.1145/2348616.2348627(51-56)Online publication date: 22-Aug-2012
https://dl.acm.org/doi/10.1145/2348616.2348627
Julien CPetz AGrim E(2012)Rethinking Context for Pervasive ComputingProceedings of the 2012 12th International Symposium on Pervasive Systems, Algorithms and Networks10.1109/I-SPAN.2012.7(1-8)Online publication date: 13-Dec-2012
https://dl.acm.org/doi/10.1109/I-SPAN.2012.7

View Options

Get Access

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.

Media

Figures

Other

Tables

View Table of Contents