Skip to main content
SpringerLink
Log in

Network robustness depth and topology management of networked dynamic systems

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

Networked control systems are subject to adversary conditions that affect their network topologies. To ensure reliable system operations, network topologies need to be characterized and managed for their impact on the overall system performance. This paper introduces the concept of network robustness depth for this pursuit. Discrete event systems are used as a foundation to model dynamic behavior of network topologies, support their analysis, and carry out their management. Stochastic analysis relates the link reliability probabilities to a probabilistic characterization of network robustness depth. Several topology management strategies are discussed, including passive methods, random strategies, and optimization methodologies. Their respective benefits and limitations are quantified. By using platoon control as a platform of hybrid (continuous and discrete event) systems and packet erasure channels as a communication protocol, the results are demonstrated with case studies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Lynch N A, Distributed Algorithms, Morgan Kaufmann Publishers, Inc., 1997.

    Google Scholar 

  2. Viseck T, Czirook A, Ben-Jacob E, Cohen O, and Shochet I, Novel type of phase transition in a system of self-driven particles, Physical Review Letters, 1995, 75(6): 1226–1229.

    Article  Google Scholar 

  3. Wang L Y, Syed A, Yin G, Pandya A, and Zhang H W, Coordinated vehicle platoon control: Weighted and constrained consensus and communication network topologies, CDC 2012, Hawaii, Dec. 2012, 4057–4062.

    Google Scholar 

  4. Xiao L, Boyd S, and Kim S J, Distributed average consensus with least-mean-square deviation, Journal of Parallel and Distributed Computing, 2007, 67: 33–46.

    Article  MATH  Google Scholar 

  5. Toner J and Tu Y, Flocks, herds, and schools: A quantitative theory of flocking, Physical Review E, 1998, 58(4): 4828–4858.

    Article  MathSciNet  Google Scholar 

  6. Wang L Y, Wang C, Yin G, and Wang Y, Weighted and constrained consensus for distributed power flow control, 12th International Conference on Probabilistic Methods Applied to Power Systems PMAPS 2012, Istanbul, Turkey, 2012.

    Google Scholar 

  7. Huang M and Manton J H, Coordination and consensus of networked agents with noisy measurements: Stochastic algorithms and asymptotic behavior, SIAM J. Control Optim., 2009, 48(1): 134–161.

    Article  MathSciNet  MATH  Google Scholar 

  8. Wang L and Liu Z, Robust consensus of multi-agent systems with noise, Science in China, Series F: Information Sciences, 2009, 52(5): 824–834.

    Article  MathSciNet  MATH  Google Scholar 

  9. Li T and Zhang J F, Consensus conditions of multi-agent systems with time-varying topologies and stochastic communication noises, IEEE Trans. on Automatic Control, 2010, 55(9): 2043–2057.

    Article  Google Scholar 

  10. Bai F, Stancil D D, and Krishnan H, Toward understanding characteristics of dedicated short range communications (DSRC) from a perspective of vehicular network engineers, Proceedings of MobiCom 10, Chicargo, IL, USA, 2010, 329–340.

    Google Scholar 

  11. Yin G, Wang L Y, Sun D, Casbeer R H, and Kingston D, Asymptotic optimality for consensustype stochastic approximation algorithms using iterate averaging, Journal of Control Theory and Applications, 2013, 11(1): 1–9.

    Article  MathSciNet  MATH  Google Scholar 

  12. Yin G, Sun Y, and Wang L Y, Asymptotic properties of consensus-type algorithms for networked systems with regime-switching topologies, Automatica, 2011, 47: 1366–1378.

    Article  MathSciNet  MATH  Google Scholar 

  13. Yin G, Wang L Y, and Sun Y, Stochastic Recursive algorithms for networked systems with delay and random switching: Multiscale formulations and asymptotic properties, Multiscale Modeling & Simulation, 2011, 9(3): 1087–1112.

    Article  MathSciNet  MATH  Google Scholar 

  14. Bollobás B, Random Graphs, 2nd Edition, Cambridge University Press, 2001.

    Book  MATH  Google Scholar 

  15. Cassandras C G and Lafortune S, Introduction to Discrete Event Systems, 2nd Edition, Springer, 2008.

    Book  MATH  Google Scholar 

  16. Lafortune S and Lin F, On tolerable and desirable behaviors in supervisory control of discrete event systems, Discrete Event Dynamic Systems: Theory and Applications, 1990, 1(1): 61–92.

    Article  Google Scholar 

  17. Li Y, Lin F, and Lin Z H, Supervisory control of probabilistic discrete event systems with recovery, IEEE Transactions on Automatic Control, 1999, 44(10): 1971–1974.

    Article  MATH  Google Scholar 

  18. Brualdi R A and Ryser H J, Combinatorial Matrix Theory, Cambridge University Press, 1991.

    Book  MATH  Google Scholar 

  19. Godsil C and Royle G, Algebraic Graph Theory, Springer-Verlag, New York, 2001.

    Book  MATH  Google Scholar 

  20. Reingold O, Undirected connectivity in log-space, Journal of the ACM, 2008, 55(4): 1–20.

    Article  MathSciNet  Google Scholar 

  21. Lapidoth A, The performance of convolutional codes on the block erasure channel using various finite interleaving techniques, IEEE Trans. on Inform. Theory, 1994, 40(5): 1459–1473.

    Article  MATH  Google Scholar 

  22. Knopp R and Humblet P, On coding for block fading channels, IEEE Trans. on Inform. Theory, 1999, 46(1): 1643–1646.

    Google Scholar 

  23. Guillen A, Fabregas I, and Caire G, Coded modulation in the blockfading channel: Code construction and coding theorems, IEEE Trans. on Inform. Theory, 2006, 52(1): 91–114.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Wayne State University, Detroit, MI, 48202, USA

    Leyi Wang & Feng Lin

  2. Department of Mathematics, Wayne State University, Detroit, MI, 48202, USA

    George Yin

Authors
  1. Leyi Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Feng Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. George Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Leyi Wang.

Additional information

This research was supported in part by the National Science Foundation under Grant No. CPS-1136007.

This paper was recommended for publication by Editor XIE Liangliang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, L., Lin, F. & Yin, G. Network robustness depth and topology management of networked dynamic systems. J Syst Sci Complex 29, 1–21 (2016). https://doi.org/10.1007/s11424-015-4074-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-015-4074-4

Keywords

Search

Navigation