Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

access icon free Sampling and control strategy: networked control systems subject to packet disordering

This study proposes a novel sampling and control strategy to find a suboptimal sampling period sequence and control input sequence, such that a quadratic cost function of state and control input of a networked control system (NCS) with packet disordering is minimised. First, a discrete-time system model of the NCS with packet disordering, transmission delay and packet loss in terms of displacement values of packets is put forward. Second, a linear quadratic regulation (LQR) problem of the NCS is formulated, showing that the optimal controller depends on sampling period and quality of services (QoS) of networks. Interactive effects between sampling period and QoS of networks pose a challenge in solving the LQR problem of the NCS. To overcome this difficulty, different from traditional transmission-delay-based or packet-loss-based sampling scheme, a novel packet-disordering-based sampling period selection scheme is proposed. Furthermore, an algorithm is presented to find a suboptimal solution to the LQR problem in this study. Finally, simulation results demonstrate the effectiveness of the proposed approach.

References

    1. 1)
    2. 2)
    3. 3)
      • 19. Iannaccone, G., Jaiswal, S., Diot, C.: ‘Packet reordering inside the sprint backbone’. Technical Report, TR01-ATL-062917, Sprint ATL, June2001..
    4. 4)
    5. 5)
    6. 6)
    7. 7)
      • 8. Pontryagin, L.S., Boltyanskii, V.G., Gamkrelidze, R.V., et al: ‘The Mathematical Theory of Optimal Processes TranslNew York: Interscience Publisher, Inc., 1962..
    8. 8)
    9. 9)
    10. 10)
    11. 11)
      • 22. Gharai, L., Perkins, C., Lehman, T.: ‘Packet reordering, high speed networks and transport protocol performance’, Proc. 13th Int. Computer Communications and Networks, Chicago, IL, October 2004, pp. 7378.
    12. 12)
    13. 13)
    14. 14)
    15. 15)
    16. 16)
    17. 17)
    18. 18)
    19. 19)
    20. 20)
    21. 21)
      • 21. Luo, X., Chang, R: ‘Novel approaches to end-to-end packet reordering measurement’, Proc. ACM/USENIX Conf. for Internet Measurement, USA, October 2005, pp. 227238.
    22. 22)
      • 20. Piratla, N.M., Jayasumana, A.P., Bare, A.A.: ‘Reorder density (RD): a formal, comprehensive metric for packet reordering’, Proc. IFIP Networking, Waterloo Ontario, Canada, May 2005, pp. 7889.
    23. 23)
    24. 24)
    25. 25)
    26. 26)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cta.2015.0757
Loading

Related content

content/journals/10.1049/iet-cta.2015.0757
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address