Erasure coding-based message forwarding to multiple destinations in intermittently connected networks
by Yu-Feng Hsu; Chih-Lin Hu
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 19, No. 1/2, 2015

Abstract: Erasure coding-based paradigm is a typical sort of message forwarding paradigms to improve robustness of message forwarding against dynamics and unreliability in intermittently connected networks. Since previous erasure coding-based schemes were mainly dedicated to delivering messages to any single destination, this paper considers the other situation of delivering messages to multiple destinations in intermittently connected networks. This paper obtains a straightforward expression for the delay distribution of multiple destinations if the delay distribution of a single destination is given. Afterwards, this paper analyses the delay distribution for message forwarding to not only a single destination but also multiple destinations. Upon delivery ratio and delay time, the examination of performance sensitivity results in many new inherent observations, properties and insights into the virtue of the erasure coding-based forwarding scheme, providing significant information for the design of erasure coding-based forwarding mechanisms in support of multiple destinations in intermittently connected networks.

Online publication date: Tue, 19-May-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com