An Evaluation of a P2P Sensor Data Streaming System Considering the Number of Hops on the PIAX Testbed

Yoshimasa Ishi, Tomoya Kawakami, T. Yoshihisa, Y. Teranishi
{"title":"An Evaluation of a P2P Sensor Data Streaming System Considering the Number of Hops on the PIAX Testbed","authors":"Yoshimasa Ishi, Tomoya Kawakami, T. Yoshihisa, Y. Teranishi","doi":"10.1109/3PGCIC.2014.115","DOIUrl":null,"url":null,"abstract":"Our research team proposed some peer-to-peer technique based on sensor data streaming methods named LCF, LLF and LLF-H for distributing communication loads when delivering sensor data streams with different data collection cycles. The LCF method and the LLF method mainly focus on the fairness of communication load. However, when many distribution nodes have a same collection cycle, the number of hops to distribute becomes large, and the transmission delay increases by those techniques. To suppress the delay time, we proposed the LLF-H method which add a upper limit to the number of hops on delivering, and evaluated the LLF-H method by the simulation. In this paper, we evaluate the behavior of the transmission delay and the fairness on the LLF-H method with many destination nodes which require same collection cycle, by using the PIAX test bed. From the evaluation result, we confirmed that the transmission delay could be suppressed, without spoiling the fairness of load greatly as compared with the existing LLF method, even if the maximum number of hops was limited to several hops.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"55 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/3PGCIC.2014.115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Our research team proposed some peer-to-peer technique based on sensor data streaming methods named LCF, LLF and LLF-H for distributing communication loads when delivering sensor data streams with different data collection cycles. The LCF method and the LLF method mainly focus on the fairness of communication load. However, when many distribution nodes have a same collection cycle, the number of hops to distribute becomes large, and the transmission delay increases by those techniques. To suppress the delay time, we proposed the LLF-H method which add a upper limit to the number of hops on delivering, and evaluated the LLF-H method by the simulation. In this paper, we evaluate the behavior of the transmission delay and the fairness on the LLF-H method with many destination nodes which require same collection cycle, by using the PIAX test bed. From the evaluation result, we confirmed that the transmission delay could be suppressed, without spoiling the fairness of load greatly as compared with the existing LLF method, even if the maximum number of hops was limited to several hops.
考虑PIAX测试平台跳数的P2P传感器数据流系统评价
本课题组提出了基于传感器数据流方法LCF、LLF和LLF- h的点对点技术,用于在传输不同采集周期的传感器数据流时分配通信负载。LCF方法和LLF方法主要关注通信负载的公平性。但是,当许多分布节点具有相同的收集周期时,要分配的跳数会变大,并且这些技术会增加传输延迟。为了抑制延迟时间,我们提出了在发送时增加跳数上限的LLF-H方法,并通过仿真对该方法进行了评价。在PIAX测试平台上,我们评估了具有相同采集周期的多个目标节点的LLF-H方法的传输延迟和公平性行为。从评估结果来看,与现有的LLF方法相比,即使将最大跳数限制在几跳以内,也可以抑制传输延迟,而不会大大破坏负载的公平性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信