Algorithm for data similarity measurements to reduce data redundancy in wireless sensor networks

A. Ghaddar, Tahiry Razafindralambo, I. Simplot-Ryl, Samar Tawbi, Abbas Hijazi
{"title":"Algorithm for data similarity measurements to reduce data redundancy in wireless sensor networks","authors":"A. Ghaddar, Tahiry Razafindralambo, I. Simplot-Ryl, Samar Tawbi, Abbas Hijazi","doi":"10.1109/WOWMOM.2010.5534888","DOIUrl":null,"url":null,"abstract":"Extending the lifetime of wireless sensor networks remains the most challenging and demanding requirement that impedes large-scale deployments. The basic operation in WSNs is the systematic gathering and transmission of sensed data to a base station for further processing. During data gathering, the amount of data can be large sometimes, due to redundant data combined from different sensing nodes in the neighborhood. Thus the data gathered need to be processed before being transmitted, in order to detect and remove redundancy, which can impact the communication traffic and energy consumption of the network in a negative way. In this paper, we propose an algorithm to measure similarity between the data collected toward the base station(relative to a specific event monitoring), so that an aggregator sensor sends a minimum amount of information to the base station in a way that the latter can deduce the source information of sensing neighbors nodes. Further, our experimental results demonstrate that the communication traffic and the number of bits transmitted can be minimized while preserving accuracy on the base station estimations.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOWMOM.2010.5534888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 27

Abstract

Extending the lifetime of wireless sensor networks remains the most challenging and demanding requirement that impedes large-scale deployments. The basic operation in WSNs is the systematic gathering and transmission of sensed data to a base station for further processing. During data gathering, the amount of data can be large sometimes, due to redundant data combined from different sensing nodes in the neighborhood. Thus the data gathered need to be processed before being transmitted, in order to detect and remove redundancy, which can impact the communication traffic and energy consumption of the network in a negative way. In this paper, we propose an algorithm to measure similarity between the data collected toward the base station(relative to a specific event monitoring), so that an aggregator sensor sends a minimum amount of information to the base station in a way that the latter can deduce the source information of sensing neighbors nodes. Further, our experimental results demonstrate that the communication traffic and the number of bits transmitted can be minimized while preserving accuracy on the base station estimations.
减少无线传感器网络中数据冗余的数据相似度测量算法
延长无线传感器网络的使用寿命仍然是阻碍大规模部署的最具挑战性和最苛刻的要求。无线传感器网络的基本工作是系统地采集和传输感测数据到基站进行进一步处理。在数据采集过程中,由于邻近不同感知节点的冗余数据组合,有时数据量会很大。因此,收集到的数据需要在传输之前进行处理,以检测和消除冗余,这会对网络的通信流量和能耗产生负面影响。在本文中,我们提出了一种算法来度量向基站收集的数据之间的相似性(相对于特定事件监控),从而使聚合器传感器向基站发送的信息最少,而后者可以推断感知邻居节点的源信息。此外,我们的实验结果表明,在保持基站估计精度的同时,可以最小化通信流量和传输的比特数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信