Exploration and assessment of memory architectures for densely-deployed embedded sensor networks

Azim Abdool, C. Radix, Sean Rocke
{"title":"Exploration and assessment of memory architectures for densely-deployed embedded sensor networks","authors":"Azim Abdool, C. Radix, Sean Rocke","doi":"10.1109/RSP.2014.6966894","DOIUrl":null,"url":null,"abstract":"Densely-deployed embedded sensor networks are susceptible to constraints associated with contention across a shared transport medium. To improve channel reliability, as well as average power consumption across the system, densely-deployed embedded sensor networks often leverage node-based neighbourhood data aggregation strategies. The tradeoff is that individual sensor nodes will have increased memory capacity and access requirements; where access requirements are determined by the memory transport bandwidth, the nature and frequency of the memory accesses, and the latencies associated with the memory storage mechanism. Individual sensor nodes consume power both directly based on the number/nature of memory operations, and indirectly through leakage current through latent circuitry. This paper considers the impact of different memory archetypes on performance of aggregation-related algorithms by individual nodes - specifically the scalability of number of required bus transactions and memory-related latencies with data-set size. The archetypes under consideration were: linear-addressing (RAM), content-based addressing (ternary CAM), and multi-dimensional addressing (Parks'). VHDL-specified MicroBlaze-based nodes, a 32 bit data-bus, and archetypical memories were implemented on a Virtex-5 development board. Operations central to aggregation algorithms (min, sum, count) were run using each type of memory on data-sets of 8 different sizes between 8 and 1024 data-points. Results suggest that appropriate selection of local-node memory architecture, can offer performance benefits in densely deployed sensor networks.","PeriodicalId":394637,"journal":{"name":"2014 25nd IEEE International Symposium on Rapid System Prototyping","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 25nd IEEE International Symposium on Rapid System Prototyping","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RSP.2014.6966894","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Densely-deployed embedded sensor networks are susceptible to constraints associated with contention across a shared transport medium. To improve channel reliability, as well as average power consumption across the system, densely-deployed embedded sensor networks often leverage node-based neighbourhood data aggregation strategies. The tradeoff is that individual sensor nodes will have increased memory capacity and access requirements; where access requirements are determined by the memory transport bandwidth, the nature and frequency of the memory accesses, and the latencies associated with the memory storage mechanism. Individual sensor nodes consume power both directly based on the number/nature of memory operations, and indirectly through leakage current through latent circuitry. This paper considers the impact of different memory archetypes on performance of aggregation-related algorithms by individual nodes - specifically the scalability of number of required bus transactions and memory-related latencies with data-set size. The archetypes under consideration were: linear-addressing (RAM), content-based addressing (ternary CAM), and multi-dimensional addressing (Parks'). VHDL-specified MicroBlaze-based nodes, a 32 bit data-bus, and archetypical memories were implemented on a Virtex-5 development board. Operations central to aggregation algorithms (min, sum, count) were run using each type of memory on data-sets of 8 different sizes between 8 and 1024 data-points. Results suggest that appropriate selection of local-node memory architecture, can offer performance benefits in densely deployed sensor networks.
面向密集部署的嵌入式传感器网络的存储器架构的探索与评估
密集部署的嵌入式传感器网络容易受到与跨共享传输介质争用相关的约束。为了提高信道可靠性,以及整个系统的平均功耗,密集部署的嵌入式传感器网络通常利用基于节点的邻域数据聚合策略。权衡的是,单个传感器节点将增加内存容量和访问要求;其中访问需求由存储器传输带宽、存储器访问的性质和频率以及与存储器存储机制相关的延迟决定。单个传感器节点消耗的功率直接基于内存操作的数量/性质,间接地通过潜在电路的泄漏电流。本文考虑了不同内存原型对单个节点的聚合相关算法性能的影响——特别是所需总线事务数量的可伸缩性以及与数据集大小相关的内存相关延迟。考虑中的原型是:线性寻址(RAM)、基于内容的寻址(三元制CAM)和多维寻址(Parks’)。vhdl指定的基于microblaze的节点、32位数据总线和典型内存在Virtex-5开发板上实现。聚合算法的核心操作(min、sum、count)使用每种类型的内存在8到1024个数据点之间的8个不同大小的数据集上运行。结果表明,在密集部署的传感器网络中,适当选择本地节点内存架构可以提供性能优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信