Mobility

On the Longest Vulnerable Path Inside a Sensor Network From Boundary Regions

Download Now Free registration required

Executive Summary

One of the most fundamental problems in wireless sensor network is coverage problem. Higher coverage contributes to improving the quality of services provided by a sensor network. In this paper, the authors have investigated the coverage problem in heterogeneous sensor network from an intruder's point of view. They argue that a well covered area may still be vulnerable if there exist some paths that can be traversed without being discovered by any sensors. After defining vulnerable paths and weak points and demonstrating their properties they present an efficient algorithm with O(n log n) time complexity to find the longest vulnerable path from a given boundary point in non overlapping sensing regions.

  • Format: PDF
  • Size: 94 KB