EasiPCC: Popularity-aware Collaborative Caching for Web Requests in Low-Duty-Cycle Sensor Networks

Chenying Hou, Dong Li, Li Cui
{"title":"EasiPCC: Popularity-aware Collaborative Caching for Web Requests in Low-Duty-Cycle Sensor Networks","authors":"Chenying Hou, Dong Li, Li Cui","doi":"10.1145/2811587.2811626","DOIUrl":null,"url":null,"abstract":"The lightweight RESTful protocols, such as CoAP, have been proposed to provide web service on resource constrained devices. However, these devices normally operate in battery and work in sleeping mode most time to prolong lifetime. Consequently it is difficult to maintain persistent end-to-end connection and leads to the high access delay for web requests. In this paper, we propose a collaborative caching scheme to solve this problem. Initially we define sleep probability based on the feature of low-duty-cycle networks to decide what data to cache. Then we introduce the definition of node popularity, which focuses nodes that are on the request forwarding public paths and forward most web requests. A centralized algorithm is presented based on the theory of gravity center to find which nodes to cache. Finally, we propose a cache discovery method. Experiments show that our caching scheme significantly improves the performance of web data access in low-duty-cycle sensor networks.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"76 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2811587.2811626","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The lightweight RESTful protocols, such as CoAP, have been proposed to provide web service on resource constrained devices. However, these devices normally operate in battery and work in sleeping mode most time to prolong lifetime. Consequently it is difficult to maintain persistent end-to-end connection and leads to the high access delay for web requests. In this paper, we propose a collaborative caching scheme to solve this problem. Initially we define sleep probability based on the feature of low-duty-cycle networks to decide what data to cache. Then we introduce the definition of node popularity, which focuses nodes that are on the request forwarding public paths and forward most web requests. A centralized algorithm is presented based on the theory of gravity center to find which nodes to cache. Finally, we propose a cache discovery method. Experiments show that our caching scheme significantly improves the performance of web data access in low-duty-cycle sensor networks.
低占空比传感器网络中Web请求的流行度感知协同缓存
轻量级RESTful协议(如CoAP)已被提出用于在资源受限的设备上提供web服务。然而,这些设备通常在电池供电和睡眠模式下工作,以延长寿命。因此,很难维持持久的端到端连接,并导致web请求的高访问延迟。在本文中,我们提出了一种协作缓存方案来解决这个问题。我们首先根据低占空比网络的特点定义睡眠概率来决定缓存哪些数据。然后,我们引入了节点流行度的定义,它关注的是那些在请求转发公共路径上并且转发大多数web请求的节点。提出了一种基于重心理论的集中式节点缓存算法。最后,我们提出了一种缓存发现方法。实验表明,该缓存方案显著提高了低占空比传感器网络中web数据访问的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信