IEICE TRANSACTIONS on Fundamentals
Competition Avoidance Policy for Network Coding-Based Epidemic Routing
Summary :
Network Coding-based Epidemic Routing (NCER) facilitates the reduction of data delivery delay in Delay Tolerant Networks (DTNs). The intrinsic reason lies in that the network coding paradigm avoids competitions for transmission opportunities between segmented packets of a large data file. In this paper, we focus on the impact of transmission competitions on the delay performance of NCER when multiple data files exist. We prove analytically that when competition occurs, transmitting the least propagated data file is optimal in the sense of minimizing the average data delivery delay. Based on such understanding, we propose a family of competition avoidance policies, namely the Least Propagated First (LPF) policies, which includes a centralized, a distributed, and a modified variants. Numerical results show that LPF policies can achieve at least 20% delay performance gain at different data traffic rates, compared with the policy currently available.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E98-A No.9 pp.1985-1989
- Publication Date
- 2015/09/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E98.A.1985
- Type of Manuscript
- LETTER
- Category
- Communication Theory and Signals
Authors
Cheng ZHAO
Shanghai Institute of Microsystem and Information Technology (SIMIT)
Sha YAO
Shanghai Research Center for Wireless Communications
Yang YANG
Shanghai Research Center for Wireless Communications,Shanghai Tech University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Cheng ZHAO, Sha YAO, Yang YANG, "Competition Avoidance Policy for Network Coding-Based Epidemic Routing" in IEICE TRANSACTIONS on Fundamentals,
vol. E98-A, no. 9, pp. 1985-1989, September 2015, doi: 10.1587/transfun.E98.A.1985.
Abstract: Network Coding-based Epidemic Routing (NCER) facilitates the reduction of data delivery delay in Delay Tolerant Networks (DTNs). The intrinsic reason lies in that the network coding paradigm avoids competitions for transmission opportunities between segmented packets of a large data file. In this paper, we focus on the impact of transmission competitions on the delay performance of NCER when multiple data files exist. We prove analytically that when competition occurs, transmitting the least propagated data file is optimal in the sense of minimizing the average data delivery delay. Based on such understanding, we propose a family of competition avoidance policies, namely the Least Propagated First (LPF) policies, which includes a centralized, a distributed, and a modified variants. Numerical results show that LPF policies can achieve at least 20% delay performance gain at different data traffic rates, compared with the policy currently available.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.1985/_p
Copy
@ARTICLE{e98-a_9_1985,
author={Cheng ZHAO, Sha YAO, Yang YANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Competition Avoidance Policy for Network Coding-Based Epidemic Routing},
year={2015},
volume={E98-A},
number={9},
pages={1985-1989},
abstract={Network Coding-based Epidemic Routing (NCER) facilitates the reduction of data delivery delay in Delay Tolerant Networks (DTNs). The intrinsic reason lies in that the network coding paradigm avoids competitions for transmission opportunities between segmented packets of a large data file. In this paper, we focus on the impact of transmission competitions on the delay performance of NCER when multiple data files exist. We prove analytically that when competition occurs, transmitting the least propagated data file is optimal in the sense of minimizing the average data delivery delay. Based on such understanding, we propose a family of competition avoidance policies, namely the Least Propagated First (LPF) policies, which includes a centralized, a distributed, and a modified variants. Numerical results show that LPF policies can achieve at least 20% delay performance gain at different data traffic rates, compared with the policy currently available.},
keywords={},
doi={10.1587/transfun.E98.A.1985},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - Competition Avoidance Policy for Network Coding-Based Epidemic Routing
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1985
EP - 1989
AU - Cheng ZHAO
AU - Sha YAO
AU - Yang YANG
PY - 2015
DO - 10.1587/transfun.E98.A.1985
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2015
AB - Network Coding-based Epidemic Routing (NCER) facilitates the reduction of data delivery delay in Delay Tolerant Networks (DTNs). The intrinsic reason lies in that the network coding paradigm avoids competitions for transmission opportunities between segmented packets of a large data file. In this paper, we focus on the impact of transmission competitions on the delay performance of NCER when multiple data files exist. We prove analytically that when competition occurs, transmitting the least propagated data file is optimal in the sense of minimizing the average data delivery delay. Based on such understanding, we propose a family of competition avoidance policies, namely the Least Propagated First (LPF) policies, which includes a centralized, a distributed, and a modified variants. Numerical results show that LPF policies can achieve at least 20% delay performance gain at different data traffic rates, compared with the policy currently available.
ER -
English
