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
Packet Loss Performance and MAC Design for Estimation in Wireless Sensor Networks
KTH, School of Electrical Engineering (EES), Automatic Control.
2005 (English)Student paper other, 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Recent advances in wireless communications and electronics has enabled the development of low-cost sensor networks. Wireless sensor networks can be used for various application areas (e.g., military, home, environment). Each application poses its own particular technical issues. One key problem that arises in many applications is how to organize the computation and communication in a sensor network to enable accurate estimation of the state of a dynamic system. As a starting point in this thesis, we demonstrate that packet loss and delays have a strong influence on the performance of optimal estimators. Thus, when we want to use a sensor network platform to collect and forward measurements to a data collector for estimation, it is critical to understand the loss performance of current hardware platforms and, possibly, to design MAC schemes that eliminate losses and minimize data collection latency. We investigate on the problem of packet loss, with practical experiments on a real wireless sensor network built up with Telos platform. The experiments in this thesis are made with single hop and multi-hop protocols in a star and linear network topology. To solve the problem of data delay and to avoid the collisions that lead to packet losses, we propose an overlay TDMA over CSMA. The underlying idea is to have a distributed protocol which is able to schedule the transmission of the nodes in order to have a data flow that converges from the furthest nodes toward the fusion center. To show the benefits of our protocol we simulate the behavior of a network in which nodes are randomly scheduled by the fusion center. Our protocol permits to obtain, in a distributed way, the optimal solution of such a network giving a strong improvement over a casual schedule.

Place, publisher, year, edition, pages
2005. , 87 p.
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-107529OAI: oai:DiVA.org:kth-107529DiVA: diva2:576410
Uppsok
Technology
Examiners
Available from: 2012-12-13 Created: 2012-12-12 Last updated: 2012-12-13Bibliographically approved

Open Access in DiVA

fulltext(733 kB)1142 downloads
File information
File name FULLTEXT01.pdfFile size 733 kBChecksum SHA-512
0be6490ee6e1c05171741c7f636a180f609d52136328daef84262652b3610882567fe57c542c68af535ec359ca9e53b83c9c212ae8e78e3c43c083cc4e454878
Type fulltextMimetype application/pdf

By organisation
Automatic Control
Control Engineering

Search outside of DiVA

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

urn-nbn

Altmetric score

urn-nbn
Total: 64 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