sesa 15(6): e3

Research Article

Redundancy Elimination in DTN via ACK Mechanism

Download455 downloads
Cite
BibTeX Plain Text
  • @ARTICLE{10.4108/icst.mobimedia.2015.259046,
    author={Xiqing Zhang and Yuan Feng and Feng Hong and Zhongwen Guo},
    title={Redundancy Elimination in DTN via ACK Mechanism},
    journal={EAI Endorsed Transactions on Security and Safety},
    volume={2},
    number={6},
    publisher={EAI},
    journal_a={SESA},
    year={2015},
    month={8},
    keywords={dtn, redundancy elimination, ack},
    doi={10.4108/icst.mobimedia.2015.259046}
}
  • Xiqing Zhang
    Yuan Feng
    Feng Hong
    Zhongwen Guo
    Year: 2015
    Redundancy Elimination in DTN via ACK Mechanism
    SESA
    EAI
    DOI: 10.4108/icst.mobimedia.2015.259046
Xiqing Zhang1, Yuan Feng1,*, Feng Hong1, Zhongwen Guo1
  • 1: Ocean University of China
*Contact email: fengyuan@ouc.edu.cn

Abstract

The traditional routing protocols for delay tolerant networks (DTN) usually take the strategy of spreading multiple copies of one message to the networks. When one copy reaches destination, the transmission of other copies not only waste the bandwidth but also deprive other messages of the opportunities for transmission. This paper brings up a mechanism to eliminate the redundant copies. By adding an acknowledge field to the packet header to delete redundant copies, it can degrade the network overhead while improve the delivery ratio. Simulation results confirm that the proposed method can improve the performance of epidemic and Spray and Wait routing protocol.

Keywords
dtn, redundancy elimination, ack
Published
2015-08-03
Publisher
EAI
http://dx.doi.org/10.4108/icst.mobimedia.2015.259046

Copyright © 2015 Y. Feng et al., licensed to EAI. This is an open access article distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/3.0/), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited.