Spatio-Temporal Hierarchical Data Aggregation Using Compressive Sensing (ST-HDACS)

Xi Xu, R. Ansari, A. Khokhar
{"title":"Spatio-Temporal Hierarchical Data Aggregation Using Compressive Sensing (ST-HDACS)","authors":"Xi Xu, R. Ansari, A. Khokhar","doi":"10.1109/DCOSS.2015.15","DOIUrl":null,"url":null,"abstract":"The problem of power-efficient data aggregation in wireless sensor networks (WSNs) using Compressive Sensing (CS) to reduce the amount of data communicated is addressed here. Existing CS-based data aggregation methods can be categorized as either those that apply CS spatially to minimize the amount of data to be communicated in the routing path, or those that seek to minimize the amount of data by applying CS temporally at each sensor. A recently reported scheme that is described as a Spatial-Temporal CS scheme randomly selects a subset of data but does not apply compression in the routing path. Here we formulate a spatial-temporal data collection model in WSNs and refer to it as Spatial-Temporal Hierarchical Data Aggregation using Compressive Sensing (ST-HDACS). The idea underlying ST-HDACS consists of two key components: Firstly, for each time snapshot of data collected in the network, a subset of nodes is randomly selected and designated for data sensing and transmission. A power-efficient Adaptive Hierarchical Data Aggregation (A-HDACS) scheme is incorporated in our work to compress the spatial data to be communicated in the routing path. Secondly, after performing data collection over a designated time period, a Matrix Completion (MC) problem is executed in the fusion center to recover the data for the entire network over the full data collection period. The performance of the proposed method is evaluated and it is demonstrated that ST-HDACS scheme reduces the amount of data for transmission and improves the associated energy consumption more effectively than existing CS-based data aggregation schemes.","PeriodicalId":332746,"journal":{"name":"2015 International Conference on Distributed Computing in Sensor Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Distributed Computing in Sensor Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCOSS.2015.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

The problem of power-efficient data aggregation in wireless sensor networks (WSNs) using Compressive Sensing (CS) to reduce the amount of data communicated is addressed here. Existing CS-based data aggregation methods can be categorized as either those that apply CS spatially to minimize the amount of data to be communicated in the routing path, or those that seek to minimize the amount of data by applying CS temporally at each sensor. A recently reported scheme that is described as a Spatial-Temporal CS scheme randomly selects a subset of data but does not apply compression in the routing path. Here we formulate a spatial-temporal data collection model in WSNs and refer to it as Spatial-Temporal Hierarchical Data Aggregation using Compressive Sensing (ST-HDACS). The idea underlying ST-HDACS consists of two key components: Firstly, for each time snapshot of data collected in the network, a subset of nodes is randomly selected and designated for data sensing and transmission. A power-efficient Adaptive Hierarchical Data Aggregation (A-HDACS) scheme is incorporated in our work to compress the spatial data to be communicated in the routing path. Secondly, after performing data collection over a designated time period, a Matrix Completion (MC) problem is executed in the fusion center to recover the data for the entire network over the full data collection period. The performance of the proposed method is evaluated and it is demonstrated that ST-HDACS scheme reduces the amount of data for transmission and improves the associated energy consumption more effectively than existing CS-based data aggregation schemes.
基于压缩感知(ST-HDACS)的时空分层数据聚合
本文讨论了无线传感器网络(WSNs)中使用压缩感知(CS)来减少通信数据量的高能效数据聚合问题。现有的基于CS的数据聚合方法可以分为在空间上应用CS以最小化路由路径中要通信的数据量的方法,或者在每个传感器上通过在时间上应用CS来最小化数据量的方法。最近报道了一种被描述为时空CS方案的方案,该方案随机选择数据子集,但在路由路径中不应用压缩。本文提出了一种基于压缩感知的时空分层数据聚合(ST-HDACS)的传感器网络时空数据收集模型。ST-HDACS的基本思想由两个关键部分组成:首先,对于网络中收集的数据的每个时间快照,随机选择一个节点子集并指定用于数据感知和传输。我们的工作中采用了一种节能的自适应分层数据聚合(A- hdacs)方案来压缩要在路由路径中通信的空间数据。其次,在完成指定时间段的数据收集后,在融合中心执行矩阵完成(Matrix Completion, MC)问题,恢复整个网络在整个数据收集周期内的数据。结果表明,ST-HDACS方案比现有的基于cs的数据聚合方案更有效地减少了传输数据量,提高了相关能耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信