Due to the global pandemic of COVID-19, there is an urgent need to utilize existing technologies to their full potential. Internet of Things (IoT) is regarded as one of the most trending technologies with a great potential in fighting against the coronavirus outbreak. The IoT comprises of a scarce network in which the IoT devices sense the environment and send useful data on the Internet. In this paper, we examine the current status of IoT applications related to COVID-19, identify their deployment and operational challenges, and suggest possible opportunities to further contain the pandemic. Furthermore, we perform analysis for implementing IoT in which internal and external factors are discussed.

IoT meets COVID-19: Status, Challenges, and Opportunities.

We consider the single-stage servicing model for a group of stationary objects distributed along a one-dimensional working zone of a moving processor. Each object is associated with an individual penalty function with respect to one or two criteria; we consider total penalty minimization and maximal individual penalty minimization criteria. For these bicriterial problems, we study the problems of constructing complete collections of efficient estimates and synthesizing Pareto-optimal solutions; we also consider the computational complexity of the resulting problems.

Bicriterial servicing problems for stationary objects in a one-dimensional working zone of a processor

Consideration was given to scheduling service of the stationary objects distributed over a one-dimensional zone by a processor moving within this zone. Servicing is performed in the course of two processor passes, direct, from the initial to the final point of the zone, and reverse. Schedules are designed with account for the early start of service prescribed to the objects and/or the deadlines of service completion. For the problems accounting for the early timing of service start, studied were the questions of finding the criterion-optimal time schedules. For the problems with prescribed deadlines, existence of schedules meeting such deadlines was investigated.

Accounting for the time characteristics of a class of scheduling problems for moving processor

We consider a servicing model for a stationary processor that services a finite collection of objects arriving in packets. A packet is considered to be serviced if all objects in this packet have finished servicing. For each packet, we know an individual penalty function which is monotone increasing from zero with the time a packet spends in the servicing system. We pose and study optimization problems with one and two criteria for evaluating the quality of servicing strategies. With the scheme shown in the paper, we construct a general solving algorithm based on the principle of dynamic programming and show examples of its implementation.

Models and optimization problems for single-processor servicing of packets of objects

The paper analyses computational model based on dynamic programming for platforms with multicore processors and heterogeneous architectures with FPGA. The models are applied for solving a canonical problem of dispatching where the computation time significantly depends on the problem scale factor. The parallel algorithms of NP-hard problem of dispatching are complicate and require intensive RAM data exchange. In order to reduce the computation time, it is suggested to use FPGA as a coprocessor providing massively parallel computation and increase the operational performance of the system in one order.

/pdf/scaling-analysis-of-solving-algorithms-for-canonical-problem-491o945xl6.pdf

Scaling analysis of solving algorithms for canonical problem of dispatching in the context of dynamic programming

We introduce a model of one-stage service for a group of stationary objects located along a one-dimensional working zone of a moving processor. For the servicing, the processor sequentially performs two passes between boundary points of the working zone: the direct pass, servicing some of the objects, and the reverse pass, servicing all remaining objects of a group. With each object, we associate an individual penalty function that increases monotonely with the time of finishing its servicing. We formulate design problems for optimal servicing strategies, give algorithms of their solutions, and study the issues of computational complexity.

Optimal servicing strategy design problems for stationary objects in a one-dimensional working zone of a processor

We consider a model for single-stage servicing of a finite deterministic stream of objects by a processor with a storage component, a reservoir of bounded capacity. The stream consists of a stream of objects that fill the reservoir and a stream of objects that are filled from the reservoir. With each object, we associate a linear individual penalty function for the time it spends in the servicing system. We study the problem of constructing a schedule that minimizes total penalty over all objects in the stream. Our algorithms are based on dynamic programming, branch and bound techniques, and their joint implementation. We show results of computational experiments.

The problems of servicing of the binary object flow in system with refillable storage component

In this article is considered the problem of operational frequency management in terms of its dynamic use, taking into account non-linear distortion in high cascades transceivers. Main results contain the new method for operational management establishing, taking into account nonlinear distortions in communication channels. This method satisfies the modern requirements for its use in the systems of dynamic allocation of frequency resources. The method improves the use of communication channels efficiency.

Yu. S. Fedosenko

Papers

Optimal servicing strategy design problems for stationary objects in a one-dimensional working zone of a processor

Bicriterial servicing problems for stationary objects in a one-dimensional working zone of a processor

The problems of servicing of the binary object flow in system with refillable storage component

Models and optimization problems for single-processor servicing of packets of objects

Frequency Distribution Algorithms in Extensive Use Cognitive Radio Systems and Internet of Things