INtERCEDE: An algorithmic approach to networked control system design

2011-07-01
Networked Control Systems (NCS) are distributed control systems where the sensor signals to the controllers and the control data to the actuators are enclosed in messages and sent over a communication network. On the one hand, the design of an NCS requires ensuring the stability of the control system and achieving system response that is as close as possible to that of an ideal system which demands network resources. On the other hand, these resources are limited and have to be allocated efficiently to accommodate for future system extensions as well as applications other than control purpose. Furthermore the NCS design parameters for the control system messages and the message transmission over the network are interdependent. In this paper, we propose "Integrated NCS Design (INtERCEDE: Integrated NEtwoRked Control systEm DEsign)" a novel algorithmic approach for the design of NCS which ensures the stability of the control system, brings system response to that of an ideal system as close as desired and conserves network bandwidth at the same time. The core of INtERCEDE is a bargaining game approach which iteratively calculates the message parameters and network service parameters. Our experimental results demonstrate the operation of INtERCEDE and how it computes the optimal design parameters for the example NCS.
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS

Suggestions

QoC And QoS bargaining for message scheduling in networked control systems
Şenol, Sinan; Leblebicioğlu, Mehmet Kemal; Schmidt, Şenan Ece; Department of Electrical and Electronics Engineering (2012)
Networked Control Systems (NCS) are distributed control systems where the sensor signals to the controllers and the control data to the actuators are enclosed in messages and sent over a communication network. On the one hand, the design of an NCS requires ensuring the stability of the control system and achieving system response that is as close as possible to that of an ideal system which demands network resources. On the other hand, these resources are limited and have to be allocated efficiently to acco...
Wireless Passive Sensor Networks
Akan, Ozgur B.; Isik, M. Talha; Baykal, Buyurman (Institute of Electrical and Electronics Engineers (IEEE), 2009-08-01)
The primary challenge in wireless sensor network deployment is the limited network lifetime due to finite-capacity batteries. Hence, the vast majority of research efforts thus far have focused on the development of energy-efficient communication and computing mechanisms for WSNs. In this article a fundamentally different approach and hence completely new WSN paradigm, the wireless passive sensor network, is introduced. The objective of the WPSN is to eliminate the limitation on system lifetime of the WSN. I...
How many sensors for an acceptable breach detection probability?
Onur, Ertan; Delic, H (Elsevier BV, 2006-01-10)
Determining the required number of sensors to be deployed is a critical decision for surveillance wireless sensor networks. In this paper, we discuss the trade-off between the number of sensors and the breach detection probability considering the effects of sensor parameters. We present the weakest breach path problem formulation and provide a solution by utilizing the Dijkstra's shortest path algorithm. We propose a method to determine the required number of sensors to be deployed and to gain insight about...
Path planning for mobile-anchor based wireless sensor network localization: Static and dynamic schemes
Erdemir, Ecenaz; Tuncer, Temel Engin (Elsevier BV, 2018-08-01)
In wireless sensor networks, node locations are required for many applications. Usually, anchors with known positions are employed for localization. Sensor positions can be estimated more efficiently by using mobile anchors (MAs). Finding the best MA trajectory is an important problem in this context. Various path planning algorithms are proposed to localize as many sensors as possible by following the shortest path with minimum number of anchors. In this paper, path planning algorithms for MA assisted loca...
Cooperative Communications in Future Home Networks
Genc, Zulkuf; Rizvi, Umar H.; Onur, Ertan; Niemegeers, Ignas (Springer Science and Business Media LLC, 2010-05-01)
The basic idea behind cooperative communications is that mobile terminals collaborate to send data to each other. This effectively adds diversity in the system and improves the overall performance. In this paper, we investigate the potential gains of cooperative communication in future home networks. We derive analytical expressions for the error probability of binary phase shift keying (BPSK) signals over Nakagami-m fading channels in a multi relay communication network. Following to the analytical study, ...
Citation Formats
S. Senol, M. K. Leblebicioğlu, and Ş. E. Schmidt, “INtERCEDE: An algorithmic approach to networked control system design,” JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, pp. 1326–1341, 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/42726.