Sensor deployment and target localization in distributed sensor networks
Author(s) -
Yi Zou,
Krishnendu Chakrabarty
Publication year - 2004
Publication title -
acm transactions on embedded computing systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.435
H-Index - 56
eISSN - 1558-3465
pISSN - 1539-9087
DOI - 10.1145/972627.972631
Subject(s) - software deployment , computer science , wireless sensor network , probabilistic logic , cluster (spacecraft) , real time computing , field (mathematics) , distributed computing , artificial intelligence , computer network , mathematics , pure mathematics , operating system
The effectiveness of cluster-based distributed sensor networks depends to a large extent on the coverage provided by the sensor deployment. We propose a virtual force algorithm (VFA) as a sensor deployment strategy to enhance the coverage after an initial random placement of sensors. For a given number of sensors, the VFA algorithm attempts to maximize the sensor field coverage. A judicious combination of attractive and repulsive forces is used to determine the new sensor locations that improve the coverage. Once the effective sensor positions are identified, a one-time movement with energy consideration incorporated is carried out, that is, the sensors are redeployed, to these positions. We also propose a novel probabilistic target localization algorithm that is executed by the cluster head. The localization results are used by the cluster head to query only a few sensors (out of those that report the presence of a target) for more detailed information. Simulation results are presented to demonstrate the effectiveness of the proposed approach.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom