{"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.
入侵检测是智能家居中最重要的服务之一,它需要监控入侵事件并对其做出反应。无线传感器和参与者网络(WSAN)具有一组用于监视事件的传感器节点和一组用于对事件作出反应的高性能节点(称为参与者节点)。它可以为智能家居中入侵检测系统的构建提供基础设施。我们需要共同考虑容错和及时性问题,因为传感器节点很可能受到故障(例如,电池耗尽)的影响,并且需要通过易受墙壁、地板或家具干扰的无线链路实时传输数据包。本文提出了基于Edmonds-Karp最大流算法和Goldberg and Tarjan最小成本流算法的最优多路径规划(OMP),用于WSANs建立路径,将入侵事件通知从事件源传递到智能家居中的参与者。该规划是最优的,因为它以最小的期望传输计数(ETX)建立了最大数量的节点不相交的链路路径。我们还通过仿真评估了OMP的性能,并将其与使用Dijkstra算法的最小成本规划进行了比较,以显示其优势。