A hybrid routing approach for opportunistic networks

Ling Jyh Chen, Chen Hung Yu, Tony Sun, Yung Chih Chen, Hao Hua Chu

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

76 Citations (Scopus)

Abstract

With wireless networking technologies extending into the fabrics of our working and operating environments, proper handling of intermittent wireless connectivity and network disruptions is of significance. As the sheer number of potential opportunistic application continues to surge (i.e. wireless sensor networks, underwater sensor networks, pocket switched networks, transportation networks, and etc.), the design for an effective routing scheme that considers and accommodates the various intricate behaviors observed in an opportunistic network is of interest and remained desirable. While previous solutions use either replication or coding techniques to address the challenges in opportunistic networks, the tradeoff of these two techniques only make them ideal under certain network scenarios. In this paper, we propose a hybrid scheme, named H-EC, to deal with a wide variety of opportunistic network cases. H-EC is designed to fully combine the robustness of erasure coding based routing techniques, while preserving the performance advantages of replication techniques. We evaluate H-EC against other similar strategies in terms of delivery ratio and latency, and find that H-EC offers robustness in worst-case delay performance cases while achieving good performance in small delay performance cases. We also discuss the traffic overhead issues associated with H-EC as compared to other schemes, and present several strategies that can potentially alleviate the traffic overhead of H-EC schemes.

Original languageEnglish
Title of host publicationProceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Pages213-220
Number of pages8
DOIs
Publication statusPublished - 2006 Dec 1
EventACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication - Pisa, Italy
Duration: 2006 Sep 112006 Sep 15

Publication series

NameProceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Volume2006

Other

OtherACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
CountryItaly
CityPisa
Period06/9/1106/9/15

Fingerprint

Switching networks
Sensor networks
Wireless sensor networks

Keywords

  • Erasure coding
  • Hybrid approach
  • Opportunistic networks
  • Routing

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture

Cite this

Chen, L. J., Yu, C. H., Sun, T., Chen, Y. C., & Chu, H. H. (2006). A hybrid routing approach for opportunistic networks. In Proceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (pp. 213-220). (Proceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication; Vol. 2006). https://doi.org/10.1145/1162654.1162658

A hybrid routing approach for opportunistic networks. / Chen, Ling Jyh; Yu, Chen Hung; Sun, Tony; Chen, Yung Chih; Chu, Hao Hua.

Proceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. 2006. p. 213-220 (Proceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication; Vol. 2006).

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

Chen, LJ, Yu, CH, Sun, T, Chen, YC & Chu, HH 2006, A hybrid routing approach for opportunistic networks. in Proceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. Proceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, vol. 2006, pp. 213-220, ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, Pisa, Italy, 06/9/11. https://doi.org/10.1145/1162654.1162658
Chen LJ, Yu CH, Sun T, Chen YC, Chu HH. A hybrid routing approach for opportunistic networks. In Proceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. 2006. p. 213-220. (Proceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication). https://doi.org/10.1145/1162654.1162658
Chen, Ling Jyh ; Yu, Chen Hung ; Sun, Tony ; Chen, Yung Chih ; Chu, Hao Hua. / A hybrid routing approach for opportunistic networks. Proceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. 2006. pp. 213-220 (Proceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication).
@inproceedings{9d3725256ae3480b9add5186f167fc73,
title = "A hybrid routing approach for opportunistic networks",
abstract = "With wireless networking technologies extending into the fabrics of our working and operating environments, proper handling of intermittent wireless connectivity and network disruptions is of significance. As the sheer number of potential opportunistic application continues to surge (i.e. wireless sensor networks, underwater sensor networks, pocket switched networks, transportation networks, and etc.), the design for an effective routing scheme that considers and accommodates the various intricate behaviors observed in an opportunistic network is of interest and remained desirable. While previous solutions use either replication or coding techniques to address the challenges in opportunistic networks, the tradeoff of these two techniques only make them ideal under certain network scenarios. In this paper, we propose a hybrid scheme, named H-EC, to deal with a wide variety of opportunistic network cases. H-EC is designed to fully combine the robustness of erasure coding based routing techniques, while preserving the performance advantages of replication techniques. We evaluate H-EC against other similar strategies in terms of delivery ratio and latency, and find that H-EC offers robustness in worst-case delay performance cases while achieving good performance in small delay performance cases. We also discuss the traffic overhead issues associated with H-EC as compared to other schemes, and present several strategies that can potentially alleviate the traffic overhead of H-EC schemes.",
keywords = "Erasure coding, Hybrid approach, Opportunistic networks, Routing",
author = "Chen, {Ling Jyh} and Yu, {Chen Hung} and Tony Sun and Chen, {Yung Chih} and Chu, {Hao Hua}",
year = "2006",
month = "12",
day = "1",
doi = "10.1145/1162654.1162658",
language = "English",
isbn = "1595933085",
series = "Proceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication",
pages = "213--220",
booktitle = "Proceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication",

}

TY - GEN

T1 - A hybrid routing approach for opportunistic networks

AU - Chen, Ling Jyh

AU - Yu, Chen Hung

AU - Sun, Tony

AU - Chen, Yung Chih

AU - Chu, Hao Hua

PY - 2006/12/1

Y1 - 2006/12/1

N2 - With wireless networking technologies extending into the fabrics of our working and operating environments, proper handling of intermittent wireless connectivity and network disruptions is of significance. As the sheer number of potential opportunistic application continues to surge (i.e. wireless sensor networks, underwater sensor networks, pocket switched networks, transportation networks, and etc.), the design for an effective routing scheme that considers and accommodates the various intricate behaviors observed in an opportunistic network is of interest and remained desirable. While previous solutions use either replication or coding techniques to address the challenges in opportunistic networks, the tradeoff of these two techniques only make them ideal under certain network scenarios. In this paper, we propose a hybrid scheme, named H-EC, to deal with a wide variety of opportunistic network cases. H-EC is designed to fully combine the robustness of erasure coding based routing techniques, while preserving the performance advantages of replication techniques. We evaluate H-EC against other similar strategies in terms of delivery ratio and latency, and find that H-EC offers robustness in worst-case delay performance cases while achieving good performance in small delay performance cases. We also discuss the traffic overhead issues associated with H-EC as compared to other schemes, and present several strategies that can potentially alleviate the traffic overhead of H-EC schemes.

AB - With wireless networking technologies extending into the fabrics of our working and operating environments, proper handling of intermittent wireless connectivity and network disruptions is of significance. As the sheer number of potential opportunistic application continues to surge (i.e. wireless sensor networks, underwater sensor networks, pocket switched networks, transportation networks, and etc.), the design for an effective routing scheme that considers and accommodates the various intricate behaviors observed in an opportunistic network is of interest and remained desirable. While previous solutions use either replication or coding techniques to address the challenges in opportunistic networks, the tradeoff of these two techniques only make them ideal under certain network scenarios. In this paper, we propose a hybrid scheme, named H-EC, to deal with a wide variety of opportunistic network cases. H-EC is designed to fully combine the robustness of erasure coding based routing techniques, while preserving the performance advantages of replication techniques. We evaluate H-EC against other similar strategies in terms of delivery ratio and latency, and find that H-EC offers robustness in worst-case delay performance cases while achieving good performance in small delay performance cases. We also discuss the traffic overhead issues associated with H-EC as compared to other schemes, and present several strategies that can potentially alleviate the traffic overhead of H-EC schemes.

KW - Erasure coding

KW - Hybrid approach

KW - Opportunistic networks

KW - Routing

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

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

U2 - 10.1145/1162654.1162658

DO - 10.1145/1162654.1162658

M3 - Conference contribution

AN - SCOPUS:34247373501

SN - 1595933085

SN - 9781595933089

T3 - Proceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication

SP - 213

EP - 220

BT - Proceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication

ER -