Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Real-time communication in wireless lossy networks
KTH, School of Electrical Engineering (EES), Automatic Control.
2014 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

The last decades’ tremendous advances in wireless communications havebeen driven mainly by personal communications. Radio resource allocationmechanisms for optimizing key metrics, such as average throughput and delay,are by now rather well-developed. However, with the increased interest inwireless machine-to-machine communication, new challenges emerge, such asmulti-hop connectivity, lossy and bursty links, battery-powered nodes, andchanging/unknown link parameters, among others. With these challenges inmind, this thesis studies real-time communication in wireless lossy networks,and how the resulting networking primitive can be used to design networkedcontrol systems with optimal closed-loop performance.

First, we study optimal forwarding of deadline-constrained traffic overmulti-hop networks with losses on links described by finite-state Markovchains. We consider two problems: maximizing the probability that packetsare delivered within specified deadlines; and minimizing the expected energycost with a guaranteed probability of on-time delivery. Both problems fallinto the category of Markov Decision Processes and can be studied in a generaldynamic programming framework. Particular instances with Bernoulliand Gilbert-Elliot loss models, which admit insight and efficient computations,are discussed. Moreover, a number of extensions and variations ofthe deadline-constrained forwarding problem are investigated. These extensionsinclude systems with unknown channel states and unknown link lossmodels, scenarios with multiple concurrent flows, and solutions adapted toopportunistic routing and the recent WirelessHART standard.

Second, we show how the solution for the deadline-constrained forwardingproblem can be used in the optimal co-design of networked control systems.Specifically, we consider the joint design of packet forwarding policies andcontrollers for wireless control loops where sensor data are sent to the controllerover an unreliable and energy-constrained multi-hop wireless network.For fixed sampling rate of the sensor, the co-design problem separates into twowell-defined and independent subproblems: transmission scheduling for maximizingthe deadline-constrained reliability and optimal control under packetloss. We develop optimal and implementable solutions for these subproblemsand show that the optimally co-designed system can be efficiently found.

Finally, we study online shortest-path routing problems in which link delaysare time-varying and modeled by random processes with initially unknownparameters. The optimal path can only be estimated by routing packetsthrough the network and observing the realized delays. The aim is to finda routing policy that minimizes the regret (the cumulative delay difference)between the path chosen by the policy and the unknown optimal path. Weformulate the problem as a combinatorial bandit optimization problem andconsider several scenarios. For each scenario, we derive the tight asymptoticlower bound on the regret that has to be satisfied by any online routing policy.These bounds help us to understand the performance improvements wecan expect when (i) taking routing decisions at each hop rather than at thesource only, and (ii) observing per-link costs rather than aggregate path costs.Efficient algorithms are proposed and evaluated against the state-of-the-art.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2014. , p. viii, 191
Series
TRITA-EE, ISSN 1653-5146 ; 2014:046
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-153431ISBN: 978-91-7595-294-9 (print)OAI: oai:DiVA.org:kth-153431DiVA, id: diva2:752401
Public defence
2014-10-30, F3, Lindstedtsvägen 26, KTH, Stockholm, 10:00 (English)
Opponent
Supervisors
Note

QC 20141006

Available from: 2014-10-06 Created: 2014-10-03 Last updated: 2015-10-30Bibliographically approved

Open Access in DiVA

Thesis(5112 kB)215 downloads
File information
File name FULLTEXT02.pdfFile size 5112 kBChecksum SHA-512
38ef9b8cfaa73e8e35ff3ef6b379a2b0b3ac9f05e007ce1477d0072b57339b343352b00a1c12d28242f0a29b1f65c7973a0a88ca322c16d0b9845dcd112edadb
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Zou, Zhenhua
By organisation
Automatic Control
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 215 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: 631 hits
CiteExportLink to record
Permanent link

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