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
Y1 - 2006
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
T2 - ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Y2 - 11 September 2006 through 15 September 2006
ER -