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
Estimation over wireless sensor networks: tradeoff between communication, computation and estimation qualities
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-9940-5929
2008 (English)In: Proceedings of the 17th IFAC World Congress, 2008, 2008, 605-611 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we consider a state estimation problem over a wireless sensor network. A fusion center dynamically forms a local multi-hop tree of sensors and fuses the data into a state estimate. It is shown that the optimal estimator over a sensor tree is given by a Kalman filter of certain structure. Using estimation quality as a metric, two communication schemes are studied and compared. In scheme one, sensor nodes communicate measurement data to their parent nodes, while in scheme two, sensor nodes communicate their local state estimates to their parent nodes. We show that under perfect communication links, the two schemes produce the same estimate at the fusion center with unlimited computation at each sensor node; scheme one is always better than scheme two with limited computation. When data packet drops occur on the communication links, we show that scheme two always outperforms scheme one with unlimited computation; with limited computation, we show that there exists a critical packet arrival rate, above which, scheme one outperforms scheme two. Simulations are provided to demonstrate the two schemes under various circumstances.

Place, publisher, year, edition, pages
2008. 605-611 p.
Keyword [en]
Control under communication constraints, Control under computation constraints, Sensor networks
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-81120DOI: 10.3182/20080706-5-KR-1001.00102OAI: oai:DiVA.org:kth-81120DiVA: diva2:497136
Conference
17th World Congress, International Federation of Automatic Control, IFAC; Seoul; 6 July 2008 through 11 July 2008
Note
QC 20120214Available from: 2012-02-14 Created: 2012-02-10 Last updated: 2012-02-14Bibliographically approved

Open Access in DiVA

wsn_estimation_ifac08(454 kB)892 downloads
File information
File name FULLTEXT01.pdfFile size 454 kBChecksum SHA-512
4b6b1d2e1219cf0c38d29d11ed01943016d819d8cd67198a0f68d07bb23f6501ac9946a58a06bcc66fb35cae4fb7a59b562cbcab6ea7b8cc56aa76eba13ad3c4
Type fulltextMimetype application/pdf

Other links

Publisher's full textifac-papersonline.net

Authority records BETA

Johansson, Karl Henrik

Search in DiVA

By author/editor
Johansson, Karl Henrik
By organisation
Automatic ControlACCESS Linnaeus Centre
Communication Systems

Search outside of DiVA

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