Abstract

A distributed location detection problem in wireless sensor networks (WSNs) with M anchors and one node is considered in this paper. In the presence of the transmitting node at a known location, each anchor receives a noisy signal in the presence of node. In the absence of the node, the anchors receive only noise. Each anchor makes a decision as to whether the node is present or not by using a Neyman-Pearson detector. The bit denoting the decision is transmitted to a fusion center (FC). If an anchor detects the node, a bit '1' will be sent; otherwise, a bit '0' will be sent. The FC will count the number of '1's and '0's, and declares the node present if it receives at least K '1's from the anchors, where K ≤ M is a design parameter. We also consider the case of detecting a node in a known region, and detecting one node of interest with multiple interfering nodes. In comparison to the centralized location detection scheme, the distributed scheme benefits from both time and energy efficiency. Simulation results show that the choice of K depends on the requirement of the overall probability of false alarm.

Original languageEnglish (US)
Title of host publicationConference Record - Asilomar Conference on Signals, Systems and Computers
PublisherIEEE Computer Society
Pages428-432
Number of pages5
ISBN (Print)9781479923908
DOIs
StatePublished - 2013
Event2013 47th Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States
Duration: Nov 3 2013Nov 6 2013

Other

Other2013 47th Asilomar Conference on Signals, Systems and Computers
CountryUnited States
CityPacific Grove, CA
Period11/3/1311/6/13

Fingerprint

Anchors
Wireless sensor networks
Fusion reactions
Energy efficiency
Detectors

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing

Cite this

Zhang, X., Tepedelenlioglu, C., Banavar, M. K., & Spanias, A. (2013). Distributed location detection in wireless sensor networks. In Conference Record - Asilomar Conference on Signals, Systems and Computers (pp. 428-432). [6810312] IEEE Computer Society. https://doi.org/10.1109/ACSSC.2013.6810312

Distributed location detection in wireless sensor networks. / Zhang, Xue; Tepedelenlioglu, Cihan; Banavar, Mahesh K.; Spanias, Andreas.

Conference Record - Asilomar Conference on Signals, Systems and Computers. IEEE Computer Society, 2013. p. 428-432 6810312.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, X, Tepedelenlioglu, C, Banavar, MK & Spanias, A 2013, Distributed location detection in wireless sensor networks. in Conference Record - Asilomar Conference on Signals, Systems and Computers., 6810312, IEEE Computer Society, pp. 428-432, 2013 47th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, United States, 11/3/13. https://doi.org/10.1109/ACSSC.2013.6810312
Zhang X, Tepedelenlioglu C, Banavar MK, Spanias A. Distributed location detection in wireless sensor networks. In Conference Record - Asilomar Conference on Signals, Systems and Computers. IEEE Computer Society. 2013. p. 428-432. 6810312 https://doi.org/10.1109/ACSSC.2013.6810312
Zhang, Xue ; Tepedelenlioglu, Cihan ; Banavar, Mahesh K. ; Spanias, Andreas. / Distributed location detection in wireless sensor networks. Conference Record - Asilomar Conference on Signals, Systems and Computers. IEEE Computer Society, 2013. pp. 428-432
@inproceedings{61a6fc49d3d7431ca1142931d87ac8b4,
title = "Distributed location detection in wireless sensor networks",
abstract = "A distributed location detection problem in wireless sensor networks (WSNs) with M anchors and one node is considered in this paper. In the presence of the transmitting node at a known location, each anchor receives a noisy signal in the presence of node. In the absence of the node, the anchors receive only noise. Each anchor makes a decision as to whether the node is present or not by using a Neyman-Pearson detector. The bit denoting the decision is transmitted to a fusion center (FC). If an anchor detects the node, a bit '1' will be sent; otherwise, a bit '0' will be sent. The FC will count the number of '1's and '0's, and declares the node present if it receives at least K '1's from the anchors, where K ≤ M is a design parameter. We also consider the case of detecting a node in a known region, and detecting one node of interest with multiple interfering nodes. In comparison to the centralized location detection scheme, the distributed scheme benefits from both time and energy efficiency. Simulation results show that the choice of K depends on the requirement of the overall probability of false alarm.",
author = "Xue Zhang and Cihan Tepedelenlioglu and Banavar, {Mahesh K.} and Andreas Spanias",
year = "2013",
doi = "10.1109/ACSSC.2013.6810312",
language = "English (US)",
isbn = "9781479923908",
pages = "428--432",
booktitle = "Conference Record - Asilomar Conference on Signals, Systems and Computers",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Distributed location detection in wireless sensor networks

AU - Zhang, Xue

AU - Tepedelenlioglu, Cihan

AU - Banavar, Mahesh K.

AU - Spanias, Andreas

PY - 2013

Y1 - 2013

N2 - A distributed location detection problem in wireless sensor networks (WSNs) with M anchors and one node is considered in this paper. In the presence of the transmitting node at a known location, each anchor receives a noisy signal in the presence of node. In the absence of the node, the anchors receive only noise. Each anchor makes a decision as to whether the node is present or not by using a Neyman-Pearson detector. The bit denoting the decision is transmitted to a fusion center (FC). If an anchor detects the node, a bit '1' will be sent; otherwise, a bit '0' will be sent. The FC will count the number of '1's and '0's, and declares the node present if it receives at least K '1's from the anchors, where K ≤ M is a design parameter. We also consider the case of detecting a node in a known region, and detecting one node of interest with multiple interfering nodes. In comparison to the centralized location detection scheme, the distributed scheme benefits from both time and energy efficiency. Simulation results show that the choice of K depends on the requirement of the overall probability of false alarm.

AB - A distributed location detection problem in wireless sensor networks (WSNs) with M anchors and one node is considered in this paper. In the presence of the transmitting node at a known location, each anchor receives a noisy signal in the presence of node. In the absence of the node, the anchors receive only noise. Each anchor makes a decision as to whether the node is present or not by using a Neyman-Pearson detector. The bit denoting the decision is transmitted to a fusion center (FC). If an anchor detects the node, a bit '1' will be sent; otherwise, a bit '0' will be sent. The FC will count the number of '1's and '0's, and declares the node present if it receives at least K '1's from the anchors, where K ≤ M is a design parameter. We also consider the case of detecting a node in a known region, and detecting one node of interest with multiple interfering nodes. In comparison to the centralized location detection scheme, the distributed scheme benefits from both time and energy efficiency. Simulation results show that the choice of K depends on the requirement of the overall probability of false alarm.

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

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

U2 - 10.1109/ACSSC.2013.6810312

DO - 10.1109/ACSSC.2013.6810312

M3 - Conference contribution

AN - SCOPUS:84901260274

SN - 9781479923908

SP - 428

EP - 432

BT - Conference Record - Asilomar Conference on Signals, Systems and Computers

PB - IEEE Computer Society

ER -