Information-Driven Distributed Sensing for Efficient Bayesian Inference in Internet of Things Systems

Chongyu Zhou, Qiang Li, C. Tham
{"title":"Information-Driven Distributed Sensing for Efficient Bayesian Inference in Internet of Things Systems","authors":"Chongyu Zhou, Qiang Li, C. Tham","doi":"10.1109/SAHCN.2018.8397111","DOIUrl":null,"url":null,"abstract":"Distributed Bayesian inference or estimation in Internet of Things (IoT) has recently received much attention due to its broad application in the areas of object classification, target tracking and medical diagnosis etc. In many distributed IoT systems with limited resources, e.g. sensor networks and crowdsourcing systems, it is likely that only a few agents will have valuable information at any given time. Therefore, the paradigm of information-driven distributed sensing (IDDS) is essential to achieve efficient inference, where the resources are spent only on sensing and communicating valuable information. In this paper, we consider the problem of IDDS for efficient Bayesian inference with exponential family distributions. We first propose a centralized algorithm (C-IDDS) where a centralized controller exists to make sensing decisions for the sensing agents. As the centralized algorithm does not scale well in large systems, we continue to design a distributed algorithm (D-IDDS) where each individual sensing agents can make their own sensing decisions independently. Both C-IDDS and D-IDDS are online algorithms which can adapt to stochastic system conditions without any future information. Through rigorous theoretical analysis, we prove that the proposed algorithms can achieve an asymptotically optimal system-wide utility. A real testbed has been built to evaluate the performance of the proposed algorithms in real-world environments. Using the data from the real-world testbed and comparing with some baseline methods, we demonstrate the effectiveness of the proposed C-IDDS and D-IDDS algorithms.","PeriodicalId":139623,"journal":{"name":"2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAHCN.2018.8397111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Distributed Bayesian inference or estimation in Internet of Things (IoT) has recently received much attention due to its broad application in the areas of object classification, target tracking and medical diagnosis etc. In many distributed IoT systems with limited resources, e.g. sensor networks and crowdsourcing systems, it is likely that only a few agents will have valuable information at any given time. Therefore, the paradigm of information-driven distributed sensing (IDDS) is essential to achieve efficient inference, where the resources are spent only on sensing and communicating valuable information. In this paper, we consider the problem of IDDS for efficient Bayesian inference with exponential family distributions. We first propose a centralized algorithm (C-IDDS) where a centralized controller exists to make sensing decisions for the sensing agents. As the centralized algorithm does not scale well in large systems, we continue to design a distributed algorithm (D-IDDS) where each individual sensing agents can make their own sensing decisions independently. Both C-IDDS and D-IDDS are online algorithms which can adapt to stochastic system conditions without any future information. Through rigorous theoretical analysis, we prove that the proposed algorithms can achieve an asymptotically optimal system-wide utility. A real testbed has been built to evaluate the performance of the proposed algorithms in real-world environments. Using the data from the real-world testbed and comparing with some baseline methods, we demonstrate the effectiveness of the proposed C-IDDS and D-IDDS algorithms.
物联网系统中高效贝叶斯推理的信息驱动分布式感知
物联网中的分布式贝叶斯推理或估计由于其在目标分类、目标跟踪和医疗诊断等领域的广泛应用而受到广泛关注。在许多资源有限的分布式物联网系统中,例如传感器网络和众包系统,在任何给定时间,可能只有少数代理拥有有价值的信息。因此,信息驱动的分布式感知(IDDS)范式对于实现高效推理至关重要,其中资源仅用于感知和传递有价值的信息。本文研究了具有指数族分布的有效贝叶斯推理的IDDS问题。我们首先提出了一种集中式算法(C-IDDS),其中存在一个集中控制器来为感知代理做出感知决策。由于集中式算法在大型系统中不能很好地扩展,我们继续设计一种分布式算法(D-IDDS),其中每个单独的感知代理可以独立地做出自己的感知决策。C-IDDS和D-IDDS都是在线算法,可以在没有任何未来信息的情况下适应随机系统条件。通过严格的理论分析,我们证明了所提出的算法可以达到渐近最优的系统范围效用。建立了一个真实的测试平台来评估所提出的算法在现实环境中的性能。利用实际测试平台的数据并与一些基准方法进行比较,我们证明了所提出的C-IDDS和D-IDDS算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信