Robust Streaming in Delay Tolerant Networks

Tournoux, P; Lochin, Emmanuel; Leguay, Jérémie; Lacan, Jérôme

doi:10.1109/icc.2010.5502070

Cited by 18 publications

(7 citation statements)

References 14 publications

(22 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All above proposals are to deliver a single segment of data. Tournoux et al [7] first consider streaming-like applications in DTNs, with unreliable longdelay links, where RLNC can not be applied to the whole data. They propose an implicit acknowledgment strategy called Tetrys, in which retransmission is based on an elastic encoding window that is updated dynamically according to the feedback from the receiver.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic segmented network coding for reliable data dissemination in delay tolerant networks

Zeng

Guo

Jin

et al. 2012

2012 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Delay/Disruption Tolerant Network (DTN) differs from the conventional networks in that it has no continuous or contemporaneous connections among wireless nodes. Its inherent characteristic of intermittent connections makes existing routing solutions hardly to be applied directly. Epidemic routing using random linear network coding has been studied and proved as an efficient way for delivering small amount of data. To our best knowledge, we are the first to study high performance reliable transmission for bulk or stream-like data in DTNs. In this paper, we propose a dynamic segmented network coding scheme to efficiently exploit the transmission opportunity that is scarce in DTNs. In particular, we adopt a dynamic segment size control mechanism, which makes the segmentation adapt to the dynamics of the network. The high performance of our proposal is validated by extensive simulations. Several other interesting findings are also observed from the simulation results.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Furthermore, decoding packets requires Gaussian Elimination with high complexity of ( 3 ). Even worse, it is infeasible to encode the whole data together for stream-like data [7]. All these reasons motivate us to investigate the segmented network coding (SNC), where only packets within the same segment are encoded together.…”

Section: Introductionmentioning

confidence: 99%

Dynamic segmented network coding for reliable data dissemination in delay tolerant networks

Zeng

Guo

Jin

et al. 2012

2012 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

show abstract

“…On one hand, here they are not used in the traditional context as telephony, in that an individual tag can intuitively be viewed more like a single code symbol rather than a set of symbols. On the other hand, the coding operation is also different from that of reliable transmission mechanisms based on erasure codes in deep space networks [21], [22], [23], [24], [25], [26], since we use coding on small authentication tags rather than packets themselves. We use erasure codes not to recover damaged packets but rather the lost authentication tags of fragments of a bundle.…”

Section: Related Workmentioning

confidence: 99%

Loss-Tolerant Bundle Fragment Authentication for Space-Based DTNs

2015

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

Bundle authentication, which ensures the authenticity and integrity of bundles, is critical in space Delay/ disruption-Tolerant Networks (DTNs). When bundle fragment services are needed, the previous solutions directly using digital signatures suffer from heavy computational costs and bandwidth overheads. This paper addresses the issue of fragment authentication for Bundle Protocol by exploiting erasure codes and the batch transmission characteristic of DTNs. Erasure codes are adopted to allow all the fragments of a bundle to equally share only one signature, to tolerate high delays as well as unexpected loss of connectivity. Following this generic idea, we present two approaches, both of which are effective in filtering inauthentic fragments as early as possible. The first one takes a surprisingly low bandwidth overhead, while it makes all received fragments of a bundle to be removed when there is an inauthentic one, because of its failure in locating the inauthentic fragments. Considering this defect, we present an improved scheme which is able to detect inauthentic fragments thanks to a special hash chain and then only remove these inauthentic ones. The performance simulation demonstrates that both our schemes significantly reduce bandwidth overheads and computational costs as compared to the prior works. Abstract-Delay Tolerant Networks (DTNs), as the principal technology for space internet, implement and support internetworking via the Bundle Protocol (BP). Bundle authentication is a critical security service in DTNs which ensures the authenticity and integrity of bundles during parallel multi-hop transmissions, especially when the bundle fragment service is needed. The authentication based on digital signatures, suggested in the CCSDS bundle security protocol specification, inevitably adds computational cost, transmission overhead and energy consumption. In this paper, we address the issue of fragment authentication for BP by exploiting the well known erasure codes and the batch transmission characteristic of DTNs. In our schemes, erasure codes are adopted to allow the receipts to recover the signature and the hashes of all the fragments of a bundle no matter how many fragments they receive. In other words, only a part of authentication information are sufficient to authenticate the received fragments from a bundle. Such an approach tolerates the high delay and unexpected loss of connectivity of DTNs, and also the BP nature of routing fragments of the same bundle possibly via different paths. With this main idea based on erasure codes, we present three approaches, all of which work well in resisting injection attacks and eradicating traffic storms. The first one takes a surprisingly low communication cost due to fragment authentication, while it makes all received fragments of a bundle to be removed when there is an injected one, because of its failure in locating the false fragments. Considering this defect, we present an improved scheme which is able to detect injected fragments thanks to the spe...

show abstract

“…In , T. Liu and S. Nelakuditi use erasure coding techniques in order to construct a disruption‐tolerant video sequence so that in the event of disruption, the network may still provide helpful video content to clients by injecting additional ‘summary frames’ to the original stream. Another proposal that is also based on a coding scheme is presented in by P. U. Tournoux et al They introduce Tetrys, a transport level mechanism based on an on‐the‐fly coding scheme, which provides full reliability provided that the encoding ratio used by Tetrys is higher than the average loss rate. Other well‐known approaches employ data replication techniques in order to improve the availability and the consistency of data despite potentially frequent network disruptions.…”

Section: Related Workmentioning

confidence: 99%

Bundle streaming service: design, implementation and performance evaluation

Lenas

Burleigh

Tsaoussidis

2013

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

We present bundle streaming service (BSS), a communication framework that allows for reliable data streaming over delay/disruptive tolerant networks. BSS improves the reception and storage of data streams through the application of sophisticated forwarding tactics and the exploitation of inherent delay/disruptive tolerant networking (DTN) architecture features. The proposed framework, which targets easy configuration and deployment, comprises two elements: a bundle forwarder and a software library. Both elements were implemented as part of the interplanetary overlay network DTN platform. Using European Space Agency's DTN testbed, we experimentally evaluate BSS performance across a wide range of network scenarios. Based on these emulation results, we discuss the associated performance trade‐offs along with potential improvement opportunities and demonstrate BSS's suitability for both terrestrial and space environments. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Robust Streaming in Delay Tolerant Networks

Cited by 18 publications

References 14 publications

Dynamic segmented network coding for reliable data dissemination in delay tolerant networks

Dynamic segmented network coding for reliable data dissemination in delay tolerant networks

Loss-Tolerant Bundle Fragment Authentication for Space-Based DTNs

Bundle streaming service: design, implementation and performance evaluation

Contact Info

Product

Resources

About