Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/585823
Title: Delay Performance of Network-Coding-Based Epidemic Routing
Authors: Yang Yang;Cheng Zhao;Sha Yao;Wuxiong Zhang;Xiaohu Ge;Guoqiang Mao
subject: delay performance modeling|delay tolerant networks|Epidemic routing|recovery protocol
Year: 2016
Publisher: IEEE
Abstract: In this paper, we first challenge the accuracy of the so-called innovative assumption that is widely adopted in delay performance analysis of network-coding-based epidemic routing (NCER) in delay-tolerant networks (DTNs). We demonstrate that this optimistic assumption severely underestimates data delivery delay and solves this problem successfully by introducing an extra encounter factor δ. Based on this, we propose a coloring process (CP)-based analytical model to evaluate the delay performance of NCER. Numerical results show that our CP-based method outperforms traditional ordinary differential equation (ODE)-based methods on estimating the delay performance under different network sizes. Furthermore, to mitigate potential competition among multiple data streams from different nodes, we propose a feedback-based recovery protocol (FRP) that takes advantage of finite buffer space and significantly reduces the number of ineffective transmissions between nodes. As a result, FRP can achieve much better delay performance compared with existing protocols in prior work.
URI: http://localhost/handle/Hannan/166679
http://localhost/handle/Hannan/585823
ISSN: 0018-9545
1939-9359
volume: 65
issue: 5
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7108073.pdf2.08 MBAdobe PDFThumbnail
Preview File
Title: Delay Performance of Network-Coding-Based Epidemic Routing
Authors: Yang Yang;Cheng Zhao;Sha Yao;Wuxiong Zhang;Xiaohu Ge;Guoqiang Mao
subject: delay performance modeling|delay tolerant networks|Epidemic routing|recovery protocol
Year: 2016
Publisher: IEEE
Abstract: In this paper, we first challenge the accuracy of the so-called innovative assumption that is widely adopted in delay performance analysis of network-coding-based epidemic routing (NCER) in delay-tolerant networks (DTNs). We demonstrate that this optimistic assumption severely underestimates data delivery delay and solves this problem successfully by introducing an extra encounter factor δ. Based on this, we propose a coloring process (CP)-based analytical model to evaluate the delay performance of NCER. Numerical results show that our CP-based method outperforms traditional ordinary differential equation (ODE)-based methods on estimating the delay performance under different network sizes. Furthermore, to mitigate potential competition among multiple data streams from different nodes, we propose a feedback-based recovery protocol (FRP) that takes advantage of finite buffer space and significantly reduces the number of ineffective transmissions between nodes. As a result, FRP can achieve much better delay performance compared with existing protocols in prior work.
URI: http://localhost/handle/Hannan/166679
http://localhost/handle/Hannan/585823
ISSN: 0018-9545
1939-9359
volume: 65
issue: 5
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7108073.pdf2.08 MBAdobe PDFThumbnail
Preview File
Title: Delay Performance of Network-Coding-Based Epidemic Routing
Authors: Yang Yang;Cheng Zhao;Sha Yao;Wuxiong Zhang;Xiaohu Ge;Guoqiang Mao
subject: delay performance modeling|delay tolerant networks|Epidemic routing|recovery protocol
Year: 2016
Publisher: IEEE
Abstract: In this paper, we first challenge the accuracy of the so-called innovative assumption that is widely adopted in delay performance analysis of network-coding-based epidemic routing (NCER) in delay-tolerant networks (DTNs). We demonstrate that this optimistic assumption severely underestimates data delivery delay and solves this problem successfully by introducing an extra encounter factor δ. Based on this, we propose a coloring process (CP)-based analytical model to evaluate the delay performance of NCER. Numerical results show that our CP-based method outperforms traditional ordinary differential equation (ODE)-based methods on estimating the delay performance under different network sizes. Furthermore, to mitigate potential competition among multiple data streams from different nodes, we propose a feedback-based recovery protocol (FRP) that takes advantage of finite buffer space and significantly reduces the number of ineffective transmissions between nodes. As a result, FRP can achieve much better delay performance compared with existing protocols in prior work.
URI: http://localhost/handle/Hannan/166679
http://localhost/handle/Hannan/585823
ISSN: 0018-9545
1939-9359
volume: 65
issue: 5
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7108073.pdf2.08 MBAdobe PDFThumbnail
Preview File