Sensor Network Placement for Maximizing Detection of Vehicle Tracks and Minimizing Disjoint Coverage Areas

PDF

Authors
  1. Ball, M.
  2. Wesolkowski, S.
Corporate Authors
Defence Research and Development Canada, Centre for Operational Research and Analysis, Ottawa ON (CAN)
Abstract
We apply a genetic algorithm to the sensor network node assignment problem, with the goal of optimizing for barrier, rather than blanket, coverage. The sensor network placement optimization problem is a type of assignment problem where possible sensor locations can be assigned sensors of different types (or no sensor). To do this, we use the Non-dominate Sorting Genetic Algorithm II with the objectives to maximize the number of detected vehicle tracks, to minimize the number of discontinuities in coverage, and to minimize sensor network cost. We present a preliminary example of generated non-dominated front including various sensor network configurations. Finally, we outline future work.
Keywords
surveillance;sensor placement;sensor network;genetic algorithm
Report Number
DRDC-RDDC-2015-P115 — External Literature
Date of publication
30 Nov 2015
Number of Pages
5
DSTKIM No
CA041552
CANDIS No
802747
Format(s):
Electronic Document(PDF)

Permanent link

Document 1 of 1

Date modified: