Minimal exposure path algorithms for directional sensor networks
Academic Article
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
abstract
As a fundamental problem of wireless sensor networks, the minimal exposure path problem corresponding to the sensor network's worst-case coverage plays an important role in the applications for detecting intrusions. However, most existing works about minimal exposure path are based on omnidirectional sensors. In contrast, this paper studies the minimal exposure path problem for two different types of directional sensing models: the binary sector model and directional sensitivity model. For the binary sector model, we construct a special Voronoi diagram, called sector centroids-based Voronoi diagram, to transform the minimal exposure path problem from a continuous geometric problem into a discrete geometric problem. By using the sector centroids-based Voronoi diagram, we develop an approximate algorithm to find the minimal exposure path in the sensors deployment field. For the directional sensitive model, we formulate the minimal exposure path problem by using two sensing intensity functions: all-sensor intensity function and maximum-sensor intensity function and then generate two weighted grids to convert the minimal exposure path problem into two discrete geometric problems. On the basis of the aforementioned weighted grids, we also develop two approximation algorithms to find the minimal exposure path for the directional sensitive model. We conduct extensive experiment simulations to validate and evaluate our proposed models and algorithms. Copyright 2012 John Wiley & Sons, Ltd. As a fundamental problem of wireless sensor networks, the minimal exposure path problem corresponding to the sensor network's worst-case coverage plays an important role in the applications for detecting intrusions. This paper studies the minimal exposure path problem for two different types of directional sensing models: the binary sector model and directional sensitivity model.We construct a special Voronoi diagram and two weighted grids to transform the minimal exposure path problem from a continuous geometric problem into three discrete geometric problems and develop three approximate algorithms to find the minimal exposure path in the sensors deployment field. Copyright 2012 John Wiley & Sons, Ltd.
