| | |
Summary: 1
Coverage by Directional Sensors in Randomly
Deployed Wireless Sensor Networks
Jing Ai and Alhussein A. Abouzeid
Electrical, Computer and Systems Engineering Department
Rensselaer Polytechnic Institute, Troy, NY 12180, USA
Email: aij@rpi.edu, abouzeid@ecse.rpi.edu
Abstract-- We study a novel "coverage by directional sensors"
problem with tunable orientations on a set of discrete targets. We
propose a Maximum Coverage with Minimum Sensors (MCMS)
problem in which coverage in terms of the number of targets to
be covered is maximized whereas the number of sensors to be
activated is minimized. We present its exact Integer Linear Pro-
gramming (ILP) formulation and an approximate (but compu-
tationally efficient) centralized greedy algorithm (CGA) solution.
These centralized solutions are used as baselines for comparison.
Then we provide a distributed greedy algorithm (DGA) solution.
By incorporating a measure of the sensors residual energy into
DGA, we further develop a Sensing Neighborhood Cooperative
Sleeping (SNCS) protocol which performs adaptive scheduling
|
