{"title":"Timely information dissemination with distributed storage in delay tolerant mobile sensor networks","authors":"Aashish Dhungana, E. Bulut","doi":"10.1109/INFCOMW.2017.8116360","DOIUrl":null,"url":null,"abstract":"In delay tolerant mobile sensor networks, the application may sometimes require informing all the sensor nodes in the network about the presence of a message while delivering it to a specific destination node. But, due to constraints on buffer space, it is not efficient to keep these message copies in the buffer of all nodes. In this paper, we propose a probabilistic approach for information dissemination to every node in the network but caching the message copies in only some of the nodes' buffer that can be utilized for future references to decrease the data access latency. This method saves the buffer space of nodes which do not hold the copies while still allowing the whole network nodes to access information on the message whenever required by providing the copies from the nodes that still hold it.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2017.8116360","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In delay tolerant mobile sensor networks, the application may sometimes require informing all the sensor nodes in the network about the presence of a message while delivering it to a specific destination node. But, due to constraints on buffer space, it is not efficient to keep these message copies in the buffer of all nodes. In this paper, we propose a probabilistic approach for information dissemination to every node in the network but caching the message copies in only some of the nodes' buffer that can be utilized for future references to decrease the data access latency. This method saves the buffer space of nodes which do not hold the copies while still allowing the whole network nodes to access information on the message whenever required by providing the copies from the nodes that still hold it.