Detection of mobile targets on the plane and in space using heterogeneous sensor networks

Loukas Lazos, Radha Poovendran, James A. Ritcey

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

Detection of targets moving within a field of interest is a fundamental service Wireless Sensor Network (WSN) service. The WSN's target detection performance is directly related to the placement of the sensors within the field of interest. In this paper, we address the problem of deterministic sensor deployment on the plane and in space, for the purpose of detecting mobile targets. We map the target detection problem to a line-set intersection problem and derive analytic expressions for the probability of detecting mobile targets. Compared to previous works, our mapping allows us to consider sensors with heterogeneous sensing capabilities, thus analyzing sensor networks that employ multiple sensing modalities. We show that the complexity of evaluating the target detection probability grows exponentially with the network size and, hence, derive appropriate lower and upper bounds. We also show that maximizing the lower bound on the probability for target detection on the plane and in space, is analogous to the problem of minimizing the average symbol error probability in two-dimensional and three-dimensional digital modulation schemes, respectively, over additive white Gaussian noise. These problems can be addressed using the circle packing problem for the plane, and the sphere packing problem for space. Using the analogy to digital modulation schemes, we derive sensor constellations from well known signal constellations with low average symbol error probability.

Original languageEnglish (US)
Pages (from-to)667-690
Number of pages24
JournalWireless Networks
Volume15
Issue number5
DOIs
StatePublished - Jul 2009

Fingerprint

Heterogeneous networks
Target tracking
Sensor networks
Sensors
Modulation
Wireless sensor networks
Error probability

Keywords

  • Heterogeneous
  • Plane
  • Space
  • Target detection
  • WSN

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Information Systems

Cite this

Detection of mobile targets on the plane and in space using heterogeneous sensor networks. / Lazos, Loukas; Poovendran, Radha; Ritcey, James A.

In: Wireless Networks, Vol. 15, No. 5, 07.2009, p. 667-690.

Research output: Contribution to journalArticle

Lazos, Loukas ; Poovendran, Radha ; Ritcey, James A. / Detection of mobile targets on the plane and in space using heterogeneous sensor networks. In: Wireless Networks. 2009 ; Vol. 15, No. 5. pp. 667-690.
@article{7179de0bbce9419997d5e16e80af0af2,
title = "Detection of mobile targets on the plane and in space using heterogeneous sensor networks",
abstract = "Detection of targets moving within a field of interest is a fundamental service Wireless Sensor Network (WSN) service. The WSN's target detection performance is directly related to the placement of the sensors within the field of interest. In this paper, we address the problem of deterministic sensor deployment on the plane and in space, for the purpose of detecting mobile targets. We map the target detection problem to a line-set intersection problem and derive analytic expressions for the probability of detecting mobile targets. Compared to previous works, our mapping allows us to consider sensors with heterogeneous sensing capabilities, thus analyzing sensor networks that employ multiple sensing modalities. We show that the complexity of evaluating the target detection probability grows exponentially with the network size and, hence, derive appropriate lower and upper bounds. We also show that maximizing the lower bound on the probability for target detection on the plane and in space, is analogous to the problem of minimizing the average symbol error probability in two-dimensional and three-dimensional digital modulation schemes, respectively, over additive white Gaussian noise. These problems can be addressed using the circle packing problem for the plane, and the sphere packing problem for space. Using the analogy to digital modulation schemes, we derive sensor constellations from well known signal constellations with low average symbol error probability.",
keywords = "Heterogeneous, Plane, Space, Target detection, WSN",
author = "Loukas Lazos and Radha Poovendran and Ritcey, {James A.}",
year = "2009",
month = "7",
doi = "10.1007/s11276-007-0092-z",
language = "English (US)",
volume = "15",
pages = "667--690",
journal = "Wireless Networks",
issn = "1022-0038",
publisher = "Springer Netherlands",
number = "5",

}

TY - JOUR

T1 - Detection of mobile targets on the plane and in space using heterogeneous sensor networks

AU - Lazos, Loukas

AU - Poovendran, Radha

AU - Ritcey, James A.

PY - 2009/7

Y1 - 2009/7

N2 - Detection of targets moving within a field of interest is a fundamental service Wireless Sensor Network (WSN) service. The WSN's target detection performance is directly related to the placement of the sensors within the field of interest. In this paper, we address the problem of deterministic sensor deployment on the plane and in space, for the purpose of detecting mobile targets. We map the target detection problem to a line-set intersection problem and derive analytic expressions for the probability of detecting mobile targets. Compared to previous works, our mapping allows us to consider sensors with heterogeneous sensing capabilities, thus analyzing sensor networks that employ multiple sensing modalities. We show that the complexity of evaluating the target detection probability grows exponentially with the network size and, hence, derive appropriate lower and upper bounds. We also show that maximizing the lower bound on the probability for target detection on the plane and in space, is analogous to the problem of minimizing the average symbol error probability in two-dimensional and three-dimensional digital modulation schemes, respectively, over additive white Gaussian noise. These problems can be addressed using the circle packing problem for the plane, and the sphere packing problem for space. Using the analogy to digital modulation schemes, we derive sensor constellations from well known signal constellations with low average symbol error probability.

AB - Detection of targets moving within a field of interest is a fundamental service Wireless Sensor Network (WSN) service. The WSN's target detection performance is directly related to the placement of the sensors within the field of interest. In this paper, we address the problem of deterministic sensor deployment on the plane and in space, for the purpose of detecting mobile targets. We map the target detection problem to a line-set intersection problem and derive analytic expressions for the probability of detecting mobile targets. Compared to previous works, our mapping allows us to consider sensors with heterogeneous sensing capabilities, thus analyzing sensor networks that employ multiple sensing modalities. We show that the complexity of evaluating the target detection probability grows exponentially with the network size and, hence, derive appropriate lower and upper bounds. We also show that maximizing the lower bound on the probability for target detection on the plane and in space, is analogous to the problem of minimizing the average symbol error probability in two-dimensional and three-dimensional digital modulation schemes, respectively, over additive white Gaussian noise. These problems can be addressed using the circle packing problem for the plane, and the sphere packing problem for space. Using the analogy to digital modulation schemes, we derive sensor constellations from well known signal constellations with low average symbol error probability.

KW - Heterogeneous

KW - Plane

KW - Space

KW - Target detection

KW - WSN

UR - http://www.scopus.com/inward/record.url?scp=63749132693&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=63749132693&partnerID=8YFLogxK

U2 - 10.1007/s11276-007-0092-z

DO - 10.1007/s11276-007-0092-z

M3 - Article

AN - SCOPUS:63749132693

VL - 15

SP - 667

EP - 690

JO - Wireless Networks

JF - Wireless Networks

SN - 1022-0038

IS - 5

ER -