Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Optimality of Rate Balancing in Wireless Sensor Networks
KTH, Skolan för elektro- och systemteknik (EES), Signalbehandling.ORCID-id: 0000-0003-1569-3527
KTH, Skolan för elektro- och systemteknik (EES), Signalbehandling.ORCID-id: 0000-0001-6630-243X
2016 (engelsk)Inngår i: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 64, nr 14Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

We consider the problem of distributed binary hypothesis testing in a parallel network topology where sensors independently observe some phenomenon and send a finite rate summary of their observations to a fusion center for the final decision. We explicitly consider a scenario under which (integer) rate messages are sent over an error free multiple access channel, modeled by a sum rate constraint at the fusion center. This problem was previously studied by Chamberland and Veeravalli, who provided sufficient conditions for the optimality of one bit sensor messages. Their result is however crucially dependent on the feasibility of having as many one bit sensors as the (integer) sum rate constraint of the multiple access channel, an assumption that can often not be satisfied in practice. This prompts us to consider the case of an a-priori limited number of sensors and we provide sufficient condition under which having no two sensors with rate difference more than one bit, so called rate balancing, is an optimal strategy with respect to the Bhattacharyya distance between the hypotheses at the input to the fusion center. We further discuss explicit observation models under which these sufficient conditions are satisfied.

sted, utgiver, år, opplag, sider
IEEE Signal Processing Society, 2016. Vol. 64, nr 14
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-184672DOI: 10.1109/TSP.2016.2551691ISI: 000377370500014Scopus ID: 2-s2.0-84974633341OAI: oai:DiVA.org:kth-184672DiVA, id: diva2:916426
Merknad

QC 20160414

Tilgjengelig fra: 2016-04-02 Laget: 2016-04-02 Sist oppdatert: 2017-11-30bibliografisk kontrollert
Inngår i avhandling
1. Decentralized Hypothesis Testing in Sensor Networks
Åpne denne publikasjonen i ny fane eller vindu >>Decentralized Hypothesis Testing in Sensor Networks
2016 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)
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.

sted, utgiver, år, opplag, sider
KTH Royal Institute of Technology, 2016. s. 50
Serie
TRITA-EE, ISSN 1653-5146
HSV kategori
Forskningsprogram
Elektro- och systemteknik
Identifikatorer
urn:nbn:se:kth:diva-195173 (URN)978-91-7729-185-5 (ISBN)
Disputas
2016-11-30, F3, Lindstedtsvagen, Stockholm, 10:00 (engelsk)
Opponent
Veileder
Merknad

QC 20161103

Tilgjengelig fra: 2016-11-03 Laget: 2016-11-02 Sist oppdatert: 2016-11-16bibliografisk kontrollert

Open Access i DiVA

fulltext(1072 kB)91 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 1072 kBChecksum SHA-512
b84f4c6283250e954697a8e7e97e953d7df3c9d136adf3372db3ba4dc5fe5e5b884acfdbe7f50898aed00bec56b5db6e7ee95b8f93a60c207de684da192cab4f
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekstScopus

Søk i DiVA

Av forfatter/redaktør
Tarighati, AllaJalden, Joakim
Av organisasjonen
I samme tidsskrift
IEEE Transactions on Signal Processing

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 91 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 274 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf