Heuristic solutions to the target identifiability problem in directional sensor networks

Wilson M. Tan*, Stephen A. Jarvis

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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 is a non-issue. Such an assumption however, does not hold true in all situations. In this paper, heuristic algorithms for choosing active sensors and orienting them with the goal of balancing coverage and identifiability are presented. The performance of the algorithms are verified via extensive simulations, and shown to confer increased target identifiability compared to algorithms originally designed to simply maximize the number of targets covered.

Original languageEnglish
Pages (from-to)84-102
Number of pages19
JournalJournal of Network and Computer Applications
Publication statusPublished - Apr 2016

Bibliographical note

Funding Information:
This work is funded in part by the UK Technology Strategy Board (TSB) Emerging Technologies Programme , Project 131187/26835-183208 , OPV-based Energy Harvesting for Urban Noise Pollution . Author W.M. Tan is supported by the Republic of the Philippines׳ Engineering Research and Development for Technology (ERDT) Program .

Publisher Copyright:
© 2016 Elsevier Ltd. All rights reserved.


  • Coverage quality
  • Directional sensing antenna
  • Distributed algorithms
  • Heuristic algorithm
  • Sensor networks

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Science Applications
  • Computer Networks and Communications


Dive into the research topics of 'Heuristic solutions to the target identifiability problem in directional sensor networks'. Together they form a unique fingerprint.

Cite this