2012
DOI: 10.1016/j.automatica.2012.06.009
|View full text |Cite
|
Sign up to set email alerts
|

Redundant data transmission in control/estimation over lossy networks

Abstract: In lossy networks the probability of successful communication can be significantly increased by transmitting multiple copies of a same message through independent channels. In this paper we show that communication protocols that exploit this by dynamically assigning the number of transmitted copies of the same data can significantly improve the control performance in a networked control system with only a modest increase in the total number of transmissions. We develop techniques to design communication protoc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
28
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 57 publications
(28 citation statements)
references
References 16 publications
0
28
0
Order By: Relevance
“…A similar model has been considered in [17]: our problem formulation is different since we perform network coding and we wish to optimize the network coding weights. Moreover, our model allows that each path can be associated to a different delay: as a direct consequence it is not trivial to decide what is the best strategy when receiveing packets.…”
Section: Introductionmentioning
confidence: 99%
“…A similar model has been considered in [17]: our problem formulation is different since we perform network coding and we wish to optimize the network coding weights. Moreover, our model allows that each path can be associated to a different delay: as a direct consequence it is not trivial to decide what is the best strategy when receiveing packets.…”
Section: Introductionmentioning
confidence: 99%
“…First assume a single channel system where only channel m * is available. Consider a suboptimal policy where at each time instant the sensor with the largest holding time is chosen to transmit, provided that this holding time is greater than some L > 2N [26]. Using an argument similar to the proof of Theorem 3 in [26], we can show that this policy has bounded average cost if…”
Section: B Stability Conditionmentioning
confidence: 99%
“…In [20], the sampling time is kept constant and the number of transmitted packets is increased after a loss. Unfortunately, this might temporarily overload the communication system, resulting in even more loss, see, e.g., [21], [22].…”
Section: Trading Loss Against Sampling Timementioning
confidence: 99%