Paper Info
Title
Competition Avoidance Policy For Network Coding-Based Epidemic Routing
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.
Year
DOI
Venue
2015
10.1587/transfun.E98.A.1985
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Keywords
Field
DocType
epidemic routing, network coding, competition avoidance, delay tolerant networks
Linear network coding,Theoretical computer science,Mathematics
Journal
Volume
Issue
ISSN
E98A
9
0916-8508
Citations 
PageRank 
References 
0
0.34
7
Authors
3
Name
Order
Citations
PageRank
Cheng Zhao1478.34
Yao, S.2243.67
Y. Yang346641.93