Tossaphol Settawatcharawanit, S. Yamada, M. Haque, K. Rojviboonchai
{"title":"Message dropping policy in congested social Delay Tolerant Networks","authors":"Tossaphol Settawatcharawanit, S. Yamada, M. Haque, K. Rojviboonchai","doi":"10.1109/JCSSE.2013.6567330","DOIUrl":null,"url":null,"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.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2013.6567330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
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.