On sensor selection in linked information networks

Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

Sensor networks are often redundant by design in order to achieve reliability in information processing. In many cases, the relationships between the different sensors are known a-priori, and can be represented as virtual linkages among the different sensors. These virtual linkages correspond to an information network of sensors, which provides useful external input to the problem of sensor selection. In this paper, we propose the unique approach of using external linkage information in order to improve the efficiency of very large scale sensor selection. We design efficient theoretical models, including a greedy approximation algorithm and an integer programming formulation for sensor selection. Our greedy selection algorithm provides an approximation bound of 1−1/e, where e is the base of the natural logarithm. We show that our approach is much more effective than baseline sampling strategies. We present experimental results that illustrate the effectiveness and efficiency of our approach.

Original languageEnglish
Pages (from-to)100-113
Number of pages14
JournalComputer Networks
Volume126
DOIs
StatePublished - 24 Oct 2017

Bibliographical note

Publisher Copyright:
© 2017

Keywords

  • Greedy algorithm
  • Information networks
  • Sensor selection
  • Stream prediction

Fingerprint

Dive into the research topics of 'On sensor selection in linked information networks'. Together they form a unique fingerprint.

Cite this