Change search
ReferencesLink to record
Permanent link

Direct link
Reducing Packet Loss Bursts in a Wireless Mesh Network for Stochastic Bounds on Estimation Error
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-7228-0249
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Automatic Control.ORCID iD: 0000-0001-9940-5929
2011 (English)In: Proceedings of the IEEE Conference on Decision and Control, IEEE conference proceedings, 2011, 3130-3135 p.Conference paper (Other academic)
Abstract [en]

A big challenge for wireless networked control systems is how to design the underlying networking algorithms and protocols to provide high reliability, defined as the end-to-end probability of packet delivery, despite the high packet loss rates of individual wireless links. This paper formulates the problem of jointly designing a set of packet forwarding policies on a multipath mesh network to meet control application requirements. We derive several results to help understand the problem space. First, we demonstrate that some common approaches, like applying a single forwarding policy to all packets or always routing packets on disjoint paths, are not optimal for the application when the links are bursty. Second, we introduce the notion of dominance to give a partial ordering to sets of forwarding policies, used to prove that an optimal policy schedules all outgoing links at each node and that an upper bound on the performance attained by unicast forwarding policies on the network graph can be computed assuming a flooding policy. Third, we demonstrate how to convert application performance metrics to packet forwarding policy objectives, using the probability that the error covariance of a Kalman filter stays within a bound as our application metric. Fourth, we provide an algorithm to compute the joint probability mass function that a sequence of packets are delivered, given a set of policies and a network graph. Finally, we describe how to obtain optimal policies via an exhaustive search, motivating future research for more computationally efficient solutions.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2011. 3130-3135 p.
National Category
Engineering and Technology
URN: urn:nbn:se:kth:diva-121401DOI: 10.1109/CDC.2011.616119ISI: 000303506203119ScopusID: 2-s2.0-84860662466ISBN: 978-1-61284-801-3OAI: diva2:618618
50th IEEE Conference of Decision and Control (CDC)/European Control Conference (ECC)

QC 20130429

Available from: 2013-04-29 Created: 2013-04-29 Last updated: 2013-06-24Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Chen, PhoebusRamesh, ChithrupaJohansson, Karl H.
By organisation
ACCESS Linnaeus CentreAutomatic Control
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
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

Altmetric score

Total: 30 hits
ReferencesLink to record
Permanent link

Direct link