无线传感器网络中关键事件的节能检测

Yunhuai Liu, Yanmin Zhu, L. Ni
{"title":"无线传感器网络中关键事件的节能检测","authors":"Yunhuai Liu, Yanmin Zhu, L. Ni","doi":"10.1109/FTDCS.2008.42","DOIUrl":null,"url":null,"abstract":"In many mission critical applications, one of the central tasks is to obtain aggregate values, such as AVERAGE and SUM, based on which critical conditions can be detected. Immediate measures can subsequently be taken to remove associated risks timely. However, there is no successful work for detecting such critical events energy efficiently. In this paper we propose a novel approach. A fully distributed algorithm is designed, in which each sensor makes the decision purely locally. The elegance of the algorithm is that a global network behavior can be presented based on individual node actions, without a central authority to coordinate. This effectively reduces unnecessary sensor reports for network-wide coordination. Our proposed algorithm, called MEES, has the property of a zero event-missing rate, i.e., critical events are always detected. There is a trade-off between the energy cost and the false positive. Simulation experimental results show that MEES is more appropriate for large-scale WSNs with highly dynamic sensing environments. The energy cost can be saved up to 70%.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Energy Efficient Detections of Critical Events in Wireless Sensor Networks\",\"authors\":\"Yunhuai Liu, Yanmin Zhu, L. Ni\",\"doi\":\"10.1109/FTDCS.2008.42\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In many mission critical applications, one of the central tasks is to obtain aggregate values, such as AVERAGE and SUM, based on which critical conditions can be detected. Immediate measures can subsequently be taken to remove associated risks timely. However, there is no successful work for detecting such critical events energy efficiently. In this paper we propose a novel approach. A fully distributed algorithm is designed, in which each sensor makes the decision purely locally. The elegance of the algorithm is that a global network behavior can be presented based on individual node actions, without a central authority to coordinate. This effectively reduces unnecessary sensor reports for network-wide coordination. Our proposed algorithm, called MEES, has the property of a zero event-missing rate, i.e., critical events are always detected. There is a trade-off between the energy cost and the false positive. Simulation experimental results show that MEES is more appropriate for large-scale WSNs with highly dynamic sensing environments. The energy cost can be saved up to 70%.\",\"PeriodicalId\":414800,\"journal\":{\"name\":\"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTDCS.2008.42\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTDCS.2008.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在许多关键任务应用程序中,中心任务之一是获取聚合值,例如AVERAGE和SUM,基于这些值可以检测到关键条件。随后可以立即采取措施,及时消除相关风险。然而,目前还没有成功的工作来有效地检测这些关键事件的能量。在本文中,我们提出了一种新的方法。设计了一种全分布式算法,其中每个传感器仅在局部做出决策。该算法的优雅之处在于,全局网络行为可以基于单个节点的行为来呈现,而无需中央机构进行协调。这有效地减少了网络范围内协调的不必要的传感器报告。我们提出的算法称为MEES,具有零事件缺失率的特性,即始终检测到关键事件。在能源成本和误报之间存在一种权衡。仿真实验结果表明,MEES更适用于具有高动态感知环境的大型WSNs。可节省能源成本高达70%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Energy Efficient Detections of Critical Events in Wireless Sensor Networks
In many mission critical applications, one of the central tasks is to obtain aggregate values, such as AVERAGE and SUM, based on which critical conditions can be detected. Immediate measures can subsequently be taken to remove associated risks timely. However, there is no successful work for detecting such critical events energy efficiently. In this paper we propose a novel approach. A fully distributed algorithm is designed, in which each sensor makes the decision purely locally. The elegance of the algorithm is that a global network behavior can be presented based on individual node actions, without a central authority to coordinate. This effectively reduces unnecessary sensor reports for network-wide coordination. Our proposed algorithm, called MEES, has the property of a zero event-missing rate, i.e., critical events are always detected. There is a trade-off between the energy cost and the false positive. Simulation experimental results show that MEES is more appropriate for large-scale WSNs with highly dynamic sensing environments. The energy cost can be saved up to 70%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信