On using probabilistic forwarding to improve HEC-based data forwarding in opportunistic networks

Ling Jyh Chen, Cheng Long Tseng, Cheng Fu Chou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we propose the HEC-PF scheme, an enhancement of our previous H-EC scheme for effective data forwarding in opportunistic networks. The enhanced scheme modifies the aggressive forwarding phase of the H-EC scheme by implementing a new Probabilistic Forwarding feature, which decides whether to forward a message to a newly encountered node based on the delivery probability. Using simulations as well as realistic network traces, we evaluate the performance of the proposed scheme in terms of delivery latency and completion ratio. The results show that the HEC-PF scheme outperforms the EC and H-EC schemes in all test cases, and the performance gain is even more substantial when network connectivity is extremely poor. By varying the parameters of the HEC-PF scheme, we show that its completion ratio improves as the maximum forwarding distance or the hop distance considered when calculating the delivery probability increases. The effectiveness of the HEC-PF scheme makes it an ideal solution that goes a long way toward ensuring effective data delivery in opportunistic networks.

Original languageEnglish
Title of host publicationEmbedded and Ubiquitous Computing - International Conference, EUC 2007, Proceedings
Pages101-112
Number of pages12
Publication statusPublished - 2007 Dec 1
EventIFIB International Conference on Embedded and Ubiquitous Computing, EUC 2007 - Taipei, Taiwan
Duration: 2007 Dec 172007 Dec 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4808 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherIFIB International Conference on Embedded and Ubiquitous Computing, EUC 2007
CountryTaiwan
CityTaipei
Period07/12/1707/12/20

Fingerprint

Completion
Network Connectivity
Latency
Enhancement
Trace
Evaluate
Vertex of a graph
Simulation

Keywords

  • Erasure coding
  • Opportunistic networks
  • Probabilistic forwarding

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chen, L. J., Tseng, C. L., & Chou, C. F. (2007). On using probabilistic forwarding to improve HEC-based data forwarding in opportunistic networks. In Embedded and Ubiquitous Computing - International Conference, EUC 2007, Proceedings (pp. 101-112). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4808 LNCS).

On using probabilistic forwarding to improve HEC-based data forwarding in opportunistic networks. / Chen, Ling Jyh; Tseng, Cheng Long; Chou, Cheng Fu.

Embedded and Ubiquitous Computing - International Conference, EUC 2007, Proceedings. 2007. p. 101-112 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4808 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chen, LJ, Tseng, CL & Chou, CF 2007, On using probabilistic forwarding to improve HEC-based data forwarding in opportunistic networks. in Embedded and Ubiquitous Computing - International Conference, EUC 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4808 LNCS, pp. 101-112, IFIB International Conference on Embedded and Ubiquitous Computing, EUC 2007, Taipei, Taiwan, 07/12/17.
Chen LJ, Tseng CL, Chou CF. On using probabilistic forwarding to improve HEC-based data forwarding in opportunistic networks. In Embedded and Ubiquitous Computing - International Conference, EUC 2007, Proceedings. 2007. p. 101-112. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Chen, Ling Jyh ; Tseng, Cheng Long ; Chou, Cheng Fu. / On using probabilistic forwarding to improve HEC-based data forwarding in opportunistic networks. Embedded and Ubiquitous Computing - International Conference, EUC 2007, Proceedings. 2007. pp. 101-112 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{5b1f31b710cc4a84b107f4c1b89497de,
title = "On using probabilistic forwarding to improve HEC-based data forwarding in opportunistic networks",
abstract = "In this paper, we propose the HEC-PF scheme, an enhancement of our previous H-EC scheme for effective data forwarding in opportunistic networks. The enhanced scheme modifies the aggressive forwarding phase of the H-EC scheme by implementing a new Probabilistic Forwarding feature, which decides whether to forward a message to a newly encountered node based on the delivery probability. Using simulations as well as realistic network traces, we evaluate the performance of the proposed scheme in terms of delivery latency and completion ratio. The results show that the HEC-PF scheme outperforms the EC and H-EC schemes in all test cases, and the performance gain is even more substantial when network connectivity is extremely poor. By varying the parameters of the HEC-PF scheme, we show that its completion ratio improves as the maximum forwarding distance or the hop distance considered when calculating the delivery probability increases. The effectiveness of the HEC-PF scheme makes it an ideal solution that goes a long way toward ensuring effective data delivery in opportunistic networks.",
keywords = "Erasure coding, Opportunistic networks, Probabilistic forwarding",
author = "Chen, {Ling Jyh} and Tseng, {Cheng Long} and Chou, {Cheng Fu}",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "9783540770916",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "101--112",
booktitle = "Embedded and Ubiquitous Computing - International Conference, EUC 2007, Proceedings",

}

TY - GEN

T1 - On using probabilistic forwarding to improve HEC-based data forwarding in opportunistic networks

AU - Chen, Ling Jyh

AU - Tseng, Cheng Long

AU - Chou, Cheng Fu

PY - 2007/12/1

Y1 - 2007/12/1

N2 - In this paper, we propose the HEC-PF scheme, an enhancement of our previous H-EC scheme for effective data forwarding in opportunistic networks. The enhanced scheme modifies the aggressive forwarding phase of the H-EC scheme by implementing a new Probabilistic Forwarding feature, which decides whether to forward a message to a newly encountered node based on the delivery probability. Using simulations as well as realistic network traces, we evaluate the performance of the proposed scheme in terms of delivery latency and completion ratio. The results show that the HEC-PF scheme outperforms the EC and H-EC schemes in all test cases, and the performance gain is even more substantial when network connectivity is extremely poor. By varying the parameters of the HEC-PF scheme, we show that its completion ratio improves as the maximum forwarding distance or the hop distance considered when calculating the delivery probability increases. The effectiveness of the HEC-PF scheme makes it an ideal solution that goes a long way toward ensuring effective data delivery in opportunistic networks.

AB - In this paper, we propose the HEC-PF scheme, an enhancement of our previous H-EC scheme for effective data forwarding in opportunistic networks. The enhanced scheme modifies the aggressive forwarding phase of the H-EC scheme by implementing a new Probabilistic Forwarding feature, which decides whether to forward a message to a newly encountered node based on the delivery probability. Using simulations as well as realistic network traces, we evaluate the performance of the proposed scheme in terms of delivery latency and completion ratio. The results show that the HEC-PF scheme outperforms the EC and H-EC schemes in all test cases, and the performance gain is even more substantial when network connectivity is extremely poor. By varying the parameters of the HEC-PF scheme, we show that its completion ratio improves as the maximum forwarding distance or the hop distance considered when calculating the delivery probability increases. The effectiveness of the HEC-PF scheme makes it an ideal solution that goes a long way toward ensuring effective data delivery in opportunistic networks.

KW - Erasure coding

KW - Opportunistic networks

KW - Probabilistic forwarding

UR - http://www.scopus.com/inward/record.url?scp=38149026318&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149026318&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:38149026318

SN - 9783540770916

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 101

EP - 112

BT - Embedded and Ubiquitous Computing - International Conference, EUC 2007, Proceedings

ER -