Optimal Multipath Planning for Intrusion Detection in Smart Homes Using Wireless Sensor and Actor Networks

Yung-Liang Lai, Jehn-Ruey Jiang
{"title":"Optimal Multipath Planning for Intrusion Detection in Smart Homes Using Wireless Sensor and Actor Networks","authors":"Yung-Liang Lai, Jehn-Ruey Jiang","doi":"10.1109/ICPPW.2010.83","DOIUrl":null,"url":null,"abstract":"Intrusion detection is one of the most important services in a smart home, which requires to monitor intrusion events and to react against them. A Wireless Sensor and Actor Network (WSAN) has a set of sensor nodes for monitoring events and a set of high capability nodes, called actor nodes, for reacting to the events. It can provide an infrastructure for building the intrusion detection system in a smart home. We need to jointly consider fault-tolerance and timeliness issues because sensor nodes are likely to be influenced by failures (e.g., dead battery) and need to deliver packets in real time over wireless links vulnerable to interference caused by walls, floors or furniture. In this paper, we propose Optimal Multipath Planning (or OMP), which is based on Edmonds-Karp maximum flow algorithm and Goldberg and Tarjan minimum cost flow algorithm, for WSANs to set up paths to deliver intrusion event notification from event sources to actors in a smart home. The planning is optimal in the sense that it sets up the maximum number of node-disjoint paths of links with the minimized expected transmission count (ETX). We also evaluate OMP’s performance by simulations and compare it with the minimum cost planning using Dijkstra algorithm to show its advantages.","PeriodicalId":415472,"journal":{"name":"2010 39th International Conference on Parallel Processing Workshops","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 39th International Conference on Parallel Processing Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPPW.2010.83","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Intrusion detection is one of the most important services in a smart home, which requires to monitor intrusion events and to react against them. A Wireless Sensor and Actor Network (WSAN) has a set of sensor nodes for monitoring events and a set of high capability nodes, called actor nodes, for reacting to the events. It can provide an infrastructure for building the intrusion detection system in a smart home. We need to jointly consider fault-tolerance and timeliness issues because sensor nodes are likely to be influenced by failures (e.g., dead battery) and need to deliver packets in real time over wireless links vulnerable to interference caused by walls, floors or furniture. In this paper, we propose Optimal Multipath Planning (or OMP), which is based on Edmonds-Karp maximum flow algorithm and Goldberg and Tarjan minimum cost flow algorithm, for WSANs to set up paths to deliver intrusion event notification from event sources to actors in a smart home. The planning is optimal in the sense that it sets up the maximum number of node-disjoint paths of links with the minimized expected transmission count (ETX). We also evaluate OMP’s performance by simulations and compare it with the minimum cost planning using Dijkstra algorithm to show its advantages.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于无线传感器和行动者网络的智能家居入侵检测最优多路径规划
入侵检测是智能家居中最重要的服务之一,它需要监控入侵事件并对其做出反应。无线传感器和参与者网络(WSAN)具有一组用于监视事件的传感器节点和一组用于对事件作出反应的高性能节点(称为参与者节点)。它可以为智能家居中入侵检测系统的构建提供基础设施。我们需要共同考虑容错和及时性问题,因为传感器节点很可能受到故障(例如,电池耗尽)的影响,并且需要通过易受墙壁、地板或家具干扰的无线链路实时传输数据包。本文提出了基于Edmonds-Karp最大流算法和Goldberg and Tarjan最小成本流算法的最优多路径规划(OMP),用于WSANs建立路径,将入侵事件通知从事件源传递到智能家居中的参与者。该规划是最优的,因为它以最小的期望传输计数(ETX)建立了最大数量的节点不相交的链路路径。我们还通过仿真评估了OMP的性能,并将其与使用Dijkstra算法的最小成本规划进行了比较,以显示其优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
GEM: Graphical Explorer of MPI Programs Predictive Space- and Time-Resource Allocation for Parallel Job Scheduling in Clusters, Grids, Clouds WS4D: Toolkits for Networked Embedded Systems Based on the Devices Profile for Web Services A Multi-hop Walkie-Talkie-Like Emergency Communication System for Catastrophic Natural Disasters Message Driven Programming with S-Net: Methodology and Performance
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1