Path Intrusion Detection Reliability in Wireless Sensor Networks

  • Author / Creator
    Elmorsy, Mohammed TK
  • The use of Wireless Sensor Networks (WSNs) in various surveillance and monitoring tasks have attracted a wide and growing attention in recent years. The thesis considers a class of intrusion detection problems where an unauthorized person or object aims to traverse part of the geographical area guarded by a WSN. In each problem, the objective is to quantify the likelihood that an intrusion event can be jointly detected and reported to a sink node in a network whose nodes can fail randomly. The thesis considers three types of intrusion paths: paths across the network with known entry and exit points, paths across the network among a set of entry exit pairs of points outside the network, and paths from outside the network to an area of interest inside the network. For each of the above types of intrusion paths, the thesis formalizes a corresponding reliability problem that calls for computing the probability that the collaborative work of all nodes in the network succeeds in detecting and reporting an intrusion event. Our results show that all formalized problems are computationally intractable (#P-hard). Consequently, the thesis focuses on constructing optimized iterative algorithms that utilize special problem structures, known as pathsets and cutsets, for computing exact solutions as well as computing lower and upper bounds. We conclude by presenting some possible future research problems.

  • Subjects / Keywords
  • Graduation date
    2017-11:Fall 2017
  • Type of Item
  • Degree
    Doctor of Philosophy
  • DOI
  • License
    This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for non-commercial purposes. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law.
  • Language
  • Institution
    University of Alberta
  • Degree level
  • Department
    • Department of Computing Science
  • Supervisor / co-supervisor and their department(s)
    • Elmallah, Ehab (Computing Science)
  • Examining committee members and their departments
    • Hassanein, Hossam (School of Computing at Queen's University)
    • Friggstad, Zachary (Computing Science)
    • Harms, Janelle (Computing Science)
    • Nikolaidis, Ioanis (Computing Science)