Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rate Allocation for Decentralized Detection in Wireless Sensor Networks
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0003-1569-3527
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-6630-243X
2015 (English)In: 16th IEEE International Workshop on Signal Processing Advances in Wireless Communications, Stockholm, June 28 - July 1, 2015, IEEE conference proceedings, 2015, 341-345 p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider the problem of decentralized detection where peripheral nodes make noisy observations of a phenomenon and send quantized information about the phenomenon towards a fusion center over a sum-rate constrained multiple access channel. The fusion center then makes a decision about the state of the phenomenon based on the aggregate received data. Using the Chernoff information as a performance metric, Chamberland and Veeravalli previously studied the structure of optimal rate allocation strategies for this scenario under the assumption of an unlimited number of sensors. Our key contribution is to extend these result to the case where there is a constraint on the maximum number of active sensors. In particular, we find sufficient conditions under which the uniform rate allocation is an optimal strategy, and then numerically verify that these conditions are satisfied for some relevant sensor design rules under a Gaussian observation model.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2015. 341-345 p.
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-165257DOI: 10.1109/SPAWC.2015.7227056ISI: 000380547100069Scopus ID: 2-s2.0-84953389066OAI: oai:DiVA.org:kth-165257DiVA: diva2:807633
Conference
IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), June 28 -July 1 2015, Stockholm, Sweden
Note

QC 20150904

Available from: 2015-04-24 Created: 2015-04-24 Last updated: 2016-11-02Bibliographically approved
In thesis
1. Decentralized Hypothesis Testing in Sensor Networks
Open this publication in new window or tab >>Decentralized Hypothesis Testing in Sensor Networks
2016 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Wireless sensor networks (WSNs) play an important role in the future ofInternet of Things IoT systems, in which an entire physical infrastructurewill be coupled with communication and information technologies. Smartgrids, smart homes, and intelligent transportation systems are examples ofinfrastructure that will be connected with sensors for intelligent monitoringand management. Thus, sensing, information gathering, and efficientprocessing at the sensors are essential.

An important problem in wireless sensor networks is that of decentralizeddetection. In a decentralized detection network, spatially separatedsensors make observations on the same phenomenon and send informationabout the state of the phenomenon towards a central processor. The centralprocessor (or the fusion center, FC) makes a decision about the state of thephenomenon, base on the aggregate received messages from the sensors. Inthe context of decentralized detection, the object is often to make the bestdecision at the FC. Since this decision is made based on the received messagesfrom the sensors, it is of interest to optimally design decision rules atthe remote sensors.

This dissertation deals mainly with the problem of designing decisionrules at the remote sensors and at the FC, while the network is subjectto some limitation on the communication between nodes (sensors and theFC). The contributions of this dissertation can be divided into three (overlapping)parts. First, we consider the case where the network is subjectto communication rate constraint on the links connecting different nodes.Concretely, we propose an algorithm for the design of decision rules at thesensors and the FC in an arbitrary network in a person-by-person (PBP)methodology. We first introduce a network of two sensors, labeled as therestricted model. We then prove that the design of sensors’ decision rules,in the PBP methodology, is in an arbitrary network equivalent to designingthe sensors’ decision rules in the corresponding restricted model. We alsopropose an efficient algorithm for the design of the sensors’ decision rules inthe restricted model.

Second, we consider the case where remote sensors share a commonmultiple access channel (MAC) to send their messages towards the FC, andwhere the MAC channel is subject to a sum rate constraint. In this situation,ithe sensors compete for communication rate to send their messages. Wefind sufficient conditions under which allocating equal rate to the sensors,so called rate balancing, is an optimal strategy. We study the structure ofthe optimal rate allocation in terms of the Chernoff information and theBhattacharyya distance.

Third, we consider a decentralized detection network where not onlyare the links between nodes subject to some communication constraints,but the sensors are also subject to some energy constraints. In particular,we study the network under the assumption that the sensors are energyharvesting devices that acquire all the energy they need to transmit theirmessages from their surrounding environment. We formulate a decentralizeddetection problem with system costs due to the random behavior of theenergy available at the sensors in terms of the Bhattacharyya distance.

Place, publisher, year, edition, pages
KTH Royal Institute of Technology, 2016. 50 p.
Series
TRITA-EE, ISSN 1653-5146
National Category
Signal Processing
Research subject
Electrical Engineering
Identifiers
urn:nbn:se:kth:diva-195173 (URN)978-91-7729-185-5 (ISBN)
Public defence
2016-11-30, F3, Lindstedtsvagen, Stockholm, 10:00 (English)
Opponent
Supervisors
Note

QC 20161103

Available from: 2016-11-03 Created: 2016-11-02 Last updated: 2016-11-16Bibliographically approved

Open Access in DiVA

fulltext(163 kB)34 downloads
File information
File name FULLTEXT01.pdfFile size 163 kBChecksum SHA-512
5720d88b8bfb2c6bc77967a7621b876096a945a818444c181bbc69aa62ff4c35ac7b26d589448ceadac9151929d70b2f036168e35e87e0d174d20268465d2607
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusIEEEXplore

Search in DiVA

By author/editor
Tarighati, AllaJaldén, Joakim
By organisation
Signal ProcessingACCESS Linnaeus Centre
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar
Total: 34 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 79 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf