Localized Sensor Self-deployment with Coverage Guarantee in Complex Environment

  • Authors:
  • Xu Li;Nathalie Mitton;Isabelle Ryl;David Simplot

  • Affiliations:
  • CNRS/INRIA/Univ. of Lille 1, France;CNRS/INRIA/Univ. of Lille 1, France;CNRS/INRIA/Univ. of Lille 1, France;CNRS/INRIA/Univ. of Lille 1, France

  • Venue:
  • ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has higher priority to be covered than a distant one. A localized sensor self-deployment algorithm, named Greedy-Rotation-Greedy (GRG) [9], has recently been proposed for constructing optimal focused coverage. The previous work assumed obstacle-free environment and focused on theoretical aspects. In this paper, we remove this strong assumption and extend GRG to practical settings. We equip with a novel obstacle "penetration" technique and give it the important obstacle avoidance capability. The new version of GRG is referred to as GRG/OP. Through simulation, we evaluate its performance in comparison with plain GRG.