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
Bayesian Design of Tandem Networks for Distributed Detection With Multi-bit Sensor Decisions
KTH, School of Electrical Engineering (EES), Signal Processing.ORCID iD: 0000-0003-1569-3527
KTH, School of Electrical Engineering (EES), Signal Processing.ORCID iD: 0000-0001-6630-243X
2015 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 63, no 7, 1821-1831 p.Article in journal (Refereed) Published
Abstract [en]

We consider the problem of decentralized hypothesis testing under communication constraints in a topology where several peripheral nodes are arranged in tandem. Each node receives an observation and transmits a message to its successor, and the last node then decides which hypothesis is true. We assume that the observations at different nodes are, conditioned on the true hypothesis, independent and the channel between any two successive nodes is considered error-free but rate-constrained. We propose a cyclic numerical design algorithm for the design of nodes using a person-by-person methodology with the minimum expected error probability as a design criterion, where the number of communicated messages is not necessarily equal to the number of hypotheses. The number of peripheral nodes in the proposed method is in principle arbitrary and the information rate constraints are satisfied by quantizing the input of each node. The performance of the proposed method for different information rate constraints, in a binary hypothesis test, is compared to the optimum rate-one solution due to Swaszek and a method proposed by Cover, and it is shown numerically that increasing the channel rate can significantly enhance the performance of the tandem network. Simulation results for $M$-ary hypothesis tests also show that by increasing the channel rates the performance of the tandem network significantly improves.

Place, publisher, year, edition, pages
IEEE Signal Processing Society, 2015. Vol. 63, no 7, 1821-1831 p.
National Category
Electrical Engineering, Electronic Engineering, Information Engineering Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-159597DOI: 10.1109/TSP.2015.2401535ISI: 000350880900016Scopus ID: 2-s2.0-84924674518OAI: oai:DiVA.org:kth-159597DiVA: diva2:786235
Note

QC 201502010

Available from: 2015-02-05 Created: 2015-02-05 Last updated: 2017-12-05Bibliographically 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(324 kB)63 downloads
File information
File name FULLTEXT01.pdfFile size 324 kBChecksum SHA-512
ab1f0d3546c5db794a1827a947f8a620a3d68c3f5f761fd4766080ddd5cfa0d3d977215c41ac44786512631ccc71e51afd868bd27a35674ed81397c8db093bc1
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusIEEEXplore

Search in DiVA

By author/editor
Tarighati, AllaJalden, Joakim
By organisation
Signal Processing
In the same journal
IEEE Transactions on Signal Processing
Electrical Engineering, Electronic Engineering, Information EngineeringSignal Processing

Search outside of DiVA

GoogleGoogle Scholar
Total: 63 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: 144 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