The problem of wireless sensor-actuator network design as a part of the mobile cyber-physical system is considered. The ways of implementation of the wireless connections scheme are analyzed. The network structure and algorithms of its operation are proposed. The design of the sensor and actuator nodes based on the wireless SoC ESP8266 is presented.

In this paper, after analyzing the known memory access methods, conventional memory organization and its challenging problems, we propose new ordered memory access method and a new type of memory - the ordered access memory. This method is aimed at working with data arrays and provides memory access in the prescribed manner. Proposed method unlike widely used method of sequential memory access allows extending the functionality of the memory as it provides not only sequential, but also any other ordered memory access. Unlike another widely used method of address memory access, the implementation of the proposed method provides parallel conflict-free memory access. It also allows eliminating data binding to a specific memory location that makes it possible to disintegrate the apparatus for data ordering and eliminates the need to store addresses of locations the data are placed in, and the need to submit the address to the address inputs during data writing and reading. The new method distinctive features compared to the known memory access methods are considered. Input data, their indices and output data of the ordered access memory are described as well as the approaches to this type of memory design and use. The interface of the ordered access memory is considered as well as its advances compared to the random, associative, and sequential access memories. An example of the ordered access memory usage in application-specific processors with parallel and pipeline structures is demonstrated and the results of the ordered access memory implementation in FPGA are considered.

Multilevel structure of cyber physical parking lot operation system. Classification of the ways of driver identification has been given. The functions and algorithms of parking lot equipment unit's work have been described. The succession of cars entering the parking lot has been shown. Structural scheme of parking equipment control board has been suggested. The calculation methods of the configuration parameters for cyber physical parking lots operation system have been produced.

The aspects of design and operation of information measuring subsystem of Cyber-Physical System of coke and chemical plant are considered. This subsystem of mass parameters definition, based on industrial internet, provides coded remote access aiming at the execution of both weighing and verification metrological operations by using an embedded multivalued mass measure. To ensure the quality and reproducibility of Cyber-Physical System a remote access on the basis of TCP/IP protocol to balances was studied and developed. Installation was equipped with the standard built-in mass measure that enabled to perform in-place operations of metrological checking, verification, calibration etc. not interrupting the production cycle.

The article is devoted to the invariant of internal electrical noise of electronic devices, which are components of cyber-physical systems. Time series of noise signals show chaotic behavior. Invariants are based on the autocorrelation function of dynamic time series. Insignificant differences on the micro-level devices lead to changes in the dynamics of time series. It is shown that the form of the autocorrelation function is unchanged for each electronic device of the cyber-physical system. The dynamic authentication algorithm has been developed, which consists of choosing a range of time series, defining and calculating invariants, making decisions about authentication. The result of the operation of the algorithm can be transferred to the executive mechanism, depending on the practical problems in cyber-physical systems. Also for the pseudorandom sequence of the embedded program generator, the following values are predicted on the basis of invariants. Estimated errors are calculated.

Currently, elliptic curves are the mathematical basis for digital signature processing. Elliptic curve points processing is based on the performance of operations in Galois field GF(2m) in normal or polynomial bases. Characteristics of multipliers for these bases are different. In this paper, the time complexity of software multipliers for binary Galois fields GF(2m) and fields GF(dn) was investigated. Fields with approximately the same number of elements were investigated. Elements of these fields were represented in a polynomial basis. It is established that the Galois field GF(3т) provides the greatest time complexity of software multiplication, and the prime Galois field GF(P) has the least time complexity. It is also shown that the use of polynomial basis allows, in contrast to the normal basis, to realize larger part of multiplier on FPGA chip.