HEM: A hybrid evolutionary model for event detection in untrustworthy sensing

Sk. Kamruzzaman, Mahmuda Naznin, Md. Nawajish Islam
{"title":"HEM: A hybrid evolutionary model for event detection in untrustworthy sensing","authors":"Sk. Kamruzzaman, Mahmuda Naznin, Md. Nawajish Islam","doi":"10.1109/WPMC.2017.8301844","DOIUrl":null,"url":null,"abstract":"Since, event detection is open to many sensors in a participatory or in a crowd sensing network, one of the major challenges of this network to find the the authenticity of the reported events and the source nodes. If the nodes trustworthiness is unknown or the detected events truthfulness is also unknown, the event detection is a difficult task. In our paper, we study this challenge and observe that applying expectation maximization with genetic algorithm, trustworthy event detection is possible. We find the best local maximum points using Expectation Maximization and then gradually applying Genetic Algorithm we find the best value. We find our hybrid approach performs better since the best selection with the maximized expectation goes for evolving the new generation. In the long run, new generation becomes better and contributes faster. We do simulation study to support our model. We provide a comparative study among Genetic Algorithm and Expectation Maximization and the hybrid of the two above mentioned methods. We find that our proposed hybrid model provides better framework to find the trustworthy nodes, better convergence rate, more authenticated event detection.","PeriodicalId":239243,"journal":{"name":"2017 20th International Symposium on Wireless Personal Multimedia Communications (WPMC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 20th International Symposium on Wireless Personal Multimedia Communications (WPMC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WPMC.2017.8301844","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Since, event detection is open to many sensors in a participatory or in a crowd sensing network, one of the major challenges of this network to find the the authenticity of the reported events and the source nodes. If the nodes trustworthiness is unknown or the detected events truthfulness is also unknown, the event detection is a difficult task. In our paper, we study this challenge and observe that applying expectation maximization with genetic algorithm, trustworthy event detection is possible. We find the best local maximum points using Expectation Maximization and then gradually applying Genetic Algorithm we find the best value. We find our hybrid approach performs better since the best selection with the maximized expectation goes for evolving the new generation. In the long run, new generation becomes better and contributes faster. We do simulation study to support our model. We provide a comparative study among Genetic Algorithm and Expectation Maximization and the hybrid of the two above mentioned methods. We find that our proposed hybrid model provides better framework to find the trustworthy nodes, better convergence rate, more authenticated event detection.
非可信感知中事件检测的混合进化模型
由于事件检测对参与式或群体感知网络中的许多传感器开放,因此该网络的主要挑战之一是找到报告事件和源节点的真实性。如果节点的可信度未知或检测到的事件的真实性也未知,则事件检测是一项困难的任务。在本文中,我们研究了这一挑战,并观察到应用期望最大化与遗传算法,可信事件检测是可能的。先用期望最大化法求出最优的局部极大值,然后逐步应用遗传算法求出最优值。我们发现我们的混合方法表现得更好,因为具有最大期望的最佳选择用于进化新一代。从长远来看,新一代变得更好,贡献更快。我们做了仿真研究来支持我们的模型。对遗传算法和期望最大化方法以及两者的混合方法进行了比较研究。结果表明,该混合模型提供了更好的框架来寻找可信节点,收敛速度更快,验证事件检测能力更强。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信