DocumentCode
624114
Title
Message dropping policy in congested social Delay Tolerant Networks
Author
Settawatcharawanit, Tossaphol ; Yamada, Shigeru ; Haque, Md Enamul ; Rojviboonchai, Kultida
Author_Institution
Dept. of Comput. Eng., Chulalongkorn Univ., Bangkok, Thailand
fYear
2013
fDate
29-31 May 2013
Firstpage
116
Lastpage
120
Abstract
Congestion in DTNs happens when the forwarding path to destination does not exist and a node runs out of buffer space. Several works have shown that the situation is hard to mitigate. Consequently, to choose the right message to drop is a crucial task. Moreover, there has not been much attention to the buffer management policy in the Social-DTNs contexts. Therefore, an efficient buffer management policy for Social-DTNs is needed to achieve a better performance for communication in challenging disruptive scenarios. In this paper, we propose a novel message dropping policy for Social-DTNs. Our proposed policy utilizes social relation of nodes to avoid dropping meaningful messages in congested social-DTNs. We have implemented and evaluated our policy on the ONE simulator, and used real contact traces obtained during a conference. Our evaluation results show that our proposed policy can significantly reduce the number of overhead and can outperform the traditional policy under investigated scenarios.
Keywords
delay tolerant networks; telecommunication network management; ONE simulator; buffer management policy; congested social delay tolerant network; message dropping policy; opportunistic network environment; path forwarding; social-DTN context; Communities; Context; Delays; Detection algorithms; Mobile computing; Simulation;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Software Engineering (JCSSE), 2013 10th International Joint Conference on
Conference_Location
Maha Sarakham
Print_ISBN
978-1-4799-0805-9
Type
conf
DOI
10.1109/JCSSE.2013.6567330
Filename
6567330
Link To Document