Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
A General Method for the Design of Tree Networks Under Communication Constraints
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
2014 (English)In: Information Fusion (FUSION), 2014 17th International Conference on, IEEE conference proceedings, 2014, , 7 p.-7 p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider a distributed detection system with communication constraints, where several nodes are arranged in an arbitrary tree topology, under the assumption of conditionally independent observations. We propose a cyclic design procedure using the minimum expected error probability as a design criterion while adopting a person-by-person methodology. We design each node jointly together with the fusion center, while other nodes are kept fixed, and show that the design of each node using the person-by-person methodology is analogous to the design of a network with two nodes, a network which we refer to as the restricted model. We further show how the parameters in the restricted model for the design of a node in the tree network can be found in a computationally efficient manner. The proposed numerical methodology can be applied for the design of nodes arranged in arbitrary tree topologies with arbitrary channel rates for the links between nodes and for a general M-ary hypothesis testing problem.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2014. , 7 p.-7 p.
Keyword [en]
Decentralized detection, Bayesian criterion, tree topology, person-by-person optimization
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-145647ISI: 000363896100324Scopus ID: 2-s2.0-84910665324ISBN: 978-849012355-3 (print)OAI: oai:DiVA.org:kth-145647DiVA: diva2:719403
Conference
17th Int. Conf. Information Fusion,7-10 July 2014, Salamanca, Spain
Note

QC 20141208

QC 20151214

Available from: 2014-05-23 Created: 2014-05-23 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(325 kB)57 downloads
File information
File name FULLTEXT01.pdfFile size 325 kBChecksum SHA-512
c6a0093a20e9cc28b1cc91d10295a996e3d005f1f4ded7f85d599f58e83401ba735a9742f539617a2309a283cb7ae6ee85a6183f44497dba5cb32580795f8981
Type fulltextMimetype application/pdf

Other links

ScopusIEEEXplore

Authority records BETA

Tarighati, AllaJalden, Joakim

Search in DiVA

By author/editor
Tarighati, AllaJalden, Joakim
By organisation
Signal Processing
Signal Processing

Search outside of DiVA

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

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 115 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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