A distributed heuristic solution to the target identifiability problem in directional sensor networks

Existing algorithms for orienting sensors in directional sensor networks have primarily concerned themselves with the problem of maximizing the number of covered targets, assuming that target identification as a non-issue. Such an assumption however, does not hold true in all situations. In this paper, a distributed heuristic algorithm for choosing active sensors and orienting them with the goal of balancing coverage and identifiability is presented. The performance of the algorithm is verified via simulations, and shown through simulations to confer increased target identifiability compared to algorithms originally designed to simply maximize the number of targets covered.