Exploiting a prioritized MAC protocol to efficiently compute interpolations

Björn Andersson, Nuno Pereira, E. Tovar
{"title":"Exploiting a prioritized MAC protocol to efficiently compute interpolations","authors":"Björn Andersson, Nuno Pereira, E. Tovar","doi":"10.1109/EFTA.2007.4416905","DOIUrl":null,"url":null,"abstract":"Consider a network where all nodes share a single broadcast domain such as a wired broadcast network. Nodes take sensor readings but individual sensor readings are not the most important pieces of data in the system. Instead, we are interested in aggregated quantities of the sensor readings such as minimum and maximum values, the number of nodes and the median among a set of sensor readings on different nodes. In this paper we show that a prioritized medium access control (MAC) protocol may advantageously be exploited to efficiently compute aggregated quantities of sensor readings. In this context, we propose a distributed algorithm that has a very low time and message-complexity for computing certain aggregated quantities. Importantly, we show that if every sensor node knows its geographical location, then sensor data can be interpolated with our novel distributed algorithm, and the message-complexity of the algorithm is independent of the number of nodes. Such an interpolation of sensor data can be used to compute any desired function; for example the temperature gradient in a room (e.g., industrial plant) densely populated with sensor nodes, or the gas concentration gradient within a pipeline or traffic tunnel.","PeriodicalId":415467,"journal":{"name":"2007 IEEE Conference on Emerging Technologies and Factory Automation (EFTA 2007)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Conference on Emerging Technologies and Factory Automation (EFTA 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EFTA.2007.4416905","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Consider a network where all nodes share a single broadcast domain such as a wired broadcast network. Nodes take sensor readings but individual sensor readings are not the most important pieces of data in the system. Instead, we are interested in aggregated quantities of the sensor readings such as minimum and maximum values, the number of nodes and the median among a set of sensor readings on different nodes. In this paper we show that a prioritized medium access control (MAC) protocol may advantageously be exploited to efficiently compute aggregated quantities of sensor readings. In this context, we propose a distributed algorithm that has a very low time and message-complexity for computing certain aggregated quantities. Importantly, we show that if every sensor node knows its geographical location, then sensor data can be interpolated with our novel distributed algorithm, and the message-complexity of the algorithm is independent of the number of nodes. Such an interpolation of sensor data can be used to compute any desired function; for example the temperature gradient in a room (e.g., industrial plant) densely populated with sensor nodes, or the gas concentration gradient within a pipeline or traffic tunnel.
利用优先级MAC协议,有效地计算插值
考虑一个网络,其中所有节点共享一个单一的广播域,例如有线广播网络。节点获取传感器读数,但单个传感器读数并不是系统中最重要的数据。相反,我们感兴趣的是传感器读数的聚合量,如最小值和最大值、节点数和不同节点上一组传感器读数的中位数。在本文中,我们证明了优先介质访问控制(MAC)协议可以被有利地利用来有效地计算传感器读数的聚合量。在这种情况下,我们提出了一种分布式算法,它具有非常低的时间和消息复杂度来计算特定的聚合数量。重要的是,我们证明了如果每个传感器节点都知道它的地理位置,那么传感器数据可以用我们的分布式算法插值,并且算法的消息复杂度与节点的数量无关。这种传感器数据的插值可以用来计算任何所需的函数;例如,在一个房间(如工业厂房)的温度梯度密集的传感器节点,或气体浓度梯度内的管道或交通隧道。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书