On-mote compressive sampling to reduce power consumption for wireless sensors

Marc J. Rubin, T. Camp
{"title":"On-mote compressive sampling to reduce power consumption for wireless sensors","authors":"Marc J. Rubin, T. Camp","doi":"10.1109/SAHCN.2013.6644998","DOIUrl":null,"url":null,"abstract":"In this article, we introduce a novel on-mote compressive sampling method called the Randomized Timing Vector algorithm (RTV). In addition to describing this new lightweight algorithm, we provide experimental results that compare RTV to the two existing on-mote compressive sampling algorithms that we are aware: Additive Random Sampling (ARS) and Sparse Binary Sampling (SBS). Experimentation involved three different steps. First, we tested and validated the three on-mote compressive sampling algorithms using a simplistic sinusoid produced by a signal generator. Second, we analyzed the power consumption of the three algorithms and compared them to full sampling. Lastly, we simulated the three algorithms on a real-world passive seismic dataset containing avalanche events collected in the mountains of Switzerland. Results from our experiments indicate that our novel and lightweight RTV algorithm outperforms ARS and SBS in at least two ways. First, unlike ARS and SBS, RTV does not falter at moderate to high sampling rates (e.g., 500 Hz or above). Second, RTV showed the greatest power savings since it eliminates costly floating point calculations and reduces ADC conversions.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAHCN.2013.6644998","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

In this article, we introduce a novel on-mote compressive sampling method called the Randomized Timing Vector algorithm (RTV). In addition to describing this new lightweight algorithm, we provide experimental results that compare RTV to the two existing on-mote compressive sampling algorithms that we are aware: Additive Random Sampling (ARS) and Sparse Binary Sampling (SBS). Experimentation involved three different steps. First, we tested and validated the three on-mote compressive sampling algorithms using a simplistic sinusoid produced by a signal generator. Second, we analyzed the power consumption of the three algorithms and compared them to full sampling. Lastly, we simulated the three algorithms on a real-world passive seismic dataset containing avalanche events collected in the mountains of Switzerland. Results from our experiments indicate that our novel and lightweight RTV algorithm outperforms ARS and SBS in at least two ways. First, unlike ARS and SBS, RTV does not falter at moderate to high sampling rates (e.g., 500 Hz or above). Second, RTV showed the greatest power savings since it eliminates costly floating point calculations and reduces ADC conversions.
实时压缩采样,减少无线传感器的功耗
在本文中,我们介绍了一种新的实时压缩采样方法,称为随机时序矢量算法(RTV)。除了描述这种新的轻量级算法之外,我们还提供了将RTV与我们所知道的两种现有的远程压缩采样算法:加性随机采样(ARS)和稀疏二进制采样(SBS)进行比较的实验结果。实验包括三个不同的步骤。首先,我们使用由信号发生器产生的简单正弦波测试并验证了三种实时压缩采样算法。其次,我们分析了三种算法的功耗,并将它们与全采样进行了比较。最后,我们在瑞士山区收集的包含雪崩事件的真实被动地震数据集上模拟了这三种算法。实验结果表明,我们的新型轻量级RTV算法至少在两个方面优于ARS和SBS。首先,与ARS和SBS不同,RTV在中高采样率(例如500 Hz或更高)下不会抖动。其次,RTV显示出最大的功耗节省,因为它消除了昂贵的浮点计算并减少了ADC转换。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信