DocumentCode
692283
Title
Reducing latency of message diffusion on congested DTNs
Author
Teranishi, Yuuichi ; Sawamura, Yusuke ; Harumoto, Kaname ; Nishio, Shojiro
Author_Institution
Nat. Inst. of Inf. & Commun. Technol., Koganei, Japan
fYear
2013
fDate
9-13 Dec. 2013
Firstpage
4452
Lastpage
4458
Abstract
We propose a broadcast method for Delay Tolerant Networks (DTNs) to achieve small latency for message diffusion in a congested situation. In the existing DTN broadcast methods, nodes tend to transfer a limited variant of messages to the contacted nodes, and thus cause an inefficient bandwidth use. That leads to a large latency of message diffusion. This paper proposes a new transfer message selection method called ESF (Estimated Slowest First) which estimates the diffusion rate of messages and precedes the message that has the smallest diffusion rate for its elapsed time from creation, i.e. the slowest message, at the time of node contact. By preceding the slowest message, a variant of the transferred messages is diversified in congested situations and the latency is reduced. The simulation results show that our method can reduce the latency of diffusion completion by 46% more than existing methods in a DTN in a congested situation.
Keywords
delay tolerant networks; DTN broadcast methods; ESF; congested DTNs; contacted nodes; delay tolerant networks; estimated slowest first; latency reduction; message diffusion rate; node contact; transfer message selection method; Bandwidth; Equations; Estimation; Mathematical model; Protocols; Vectors; Wireless communication;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Communications Conference (GLOBECOM), 2013 IEEE
Conference_Location
Atlanta, GA
Type
conf
DOI
10.1109/GLOCOMW.2013.6855652
Filename
6855652
Link To Document