Digitala Vetenskapliga Arkivet

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
Distributed detection in energy harvesting 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), Kommunikationsteori.ORCID-id: 0000-0001-6682-6559
KTH, Skolan för elektro- och systemteknik (EES), Signalbehandling.ORCID-id: 0000-0001-6630-243X
2016 (engelsk)Inngår i: European Signal Process. Conf. (EUSIPCO), Aug. 2016, Institute of Electrical and Electronics Engineers (IEEE), 2016Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

We consider a decentralized hypothesis testing problem in which several peripheral energy harvesting sensors arearranged in parallel. Each sensor makes a noisy observation of a time varying phenomenon, and sends a message about the present hypothesis towards a fusion center at each time instance t. The fusion center, using the aggregate of the received messages during the time instance t, makes a decision about the state of the present hypothesis. We assume that each sensor is an energy harvesting device and is capable of harvesting all the energy it needs to communicate from its environment. Our contribution is to formulate and analyze the decentralized detection problem when the energy harvesting sensors are allowed to form a long term energy usage policy. Our analysis is based on a queuing-theoretic model for the battery. Then, by using numerical simulations, we show how the resulting performance differs from the energy-unconstrained case.

sted, utgiver, år, opplag, sider
Institute of Electrical and Electronics Engineers (IEEE), 2016.
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-189862OAI: oai:DiVA.org:kth-189862DiVA, id: diva2:949487
Konferanse
European Signal Process. Conf. (EUSIPCO). August 29-Sept. 2, 2016
Merknad

QC 20160907

Tilgjengelig fra: 2016-07-20 Laget: 2016-07-20 Sist oppdatert: 2024-03-18bibliografisk 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: 2022-06-27bibliografisk kontrollert

Open Access i DiVA

ALLA_EUSIPCO(191 kB)151 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 191 kBChecksum SHA-512
6c14e5914d7f47879ef9c1b1a13ba1574856e9ad8f0bd9ebd40d3668f54ee68913aab1ca13e52f1ca1b28f7388476d4e943f3b50ac4f2c8c7cdc84b173ced736
Type fulltextMimetype application/pdf

Søk i DiVA

Av forfatter/redaktør
Tarighati, AllaGross, JamesJalden, Joakim
Av organisasjonen

Søk utenfor DiVA

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

urn-nbn

Altmetric

urn-nbn
Totalt: 258 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