Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "wireless scheduling" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
A feasible schedule for parallel assembly tasks in flexible manufacturing systems
Autorzy:
Majdzik, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/2055155.pdf
Data publikacji:
2022
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
parallel system
synchronization
scheduling
discrete event system
wireless equipment
system równoległy
system zdarzeń dyskretnych
sprzęt bezprzewodowy
Opis:
The paper concerns the design of a framework for implementing fault-tolerant control of hybrid assembly systems that connect human operators and fully automated technical systems. The main difficulty in such systems is related to delays that result from objective factors influencing human operators’ work, e.g., fatigue, experience, etc. As the battery assembly system can be considered a firm real-time one, these delays are treated as faults. The presented approach guarantees real-time compensation of delays, and the fully automated part of the system is responsible for this compensation. The paper begins with a detailed description of a battery assembly system in which two cooperating parts can be distinguished: fully automatic and semi-automatic. The latter, nonderministic in nature, is the main focus of this paper. To describe and analyze the states of the battery assembly system, instead of the most commonly used simulation, the classic max-plus algebra with an extension allowing one to express non-deterministic human operators’ work is used. In order to synchronize tasks and schedule (according to the reference schedule) automated and human operators’ tasks, it is proposed to use a wireless IoT platform called KIS.ME. As a result, it allows a reference model of human performance to be defined using fuzzy logic. Having such a model, predictive delays tolerant planning is proposed. The final part of the paper presents the achieved results, which clearly indicate the potential benefits that can be obtained by combining the wireless KIS.ME architecture (allocated in the semi-automatic part of the system) with wired standard production networks.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2022, 32, 1; 51--63
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Innovative Multiple Attribute Based Distributed Clustering with Sleep/Wake Scheduling Mechanism for WSN
Autorzy:
Chavan, Shankar D.
Jagdale, Shahaji R.
Kulkarni, Dhanashree A.
Jadhav, Sneha R.
Powiązania:
https://bibliotekanauki.pl/articles/1844582.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
advanced distributed
energy efficient
adaptive clustering
clustering
lifetime
sleep-wake cluster head scheduling
throughput
wireless sensor network
Opis:
Wireless sensor network is a dynamic field of networking and communication because of its increasing demand in critical Industrial and Robotics applications. Clustering is the technique mainly used in the WSN to deal with large load density for efficient energy conservation. Formation of number of duplicate clusters in the clustering algorithm decreases the throughput and network lifetime of WSN. To deal with this problem, advance distributive energy-efficient adaptive clustering protocol with sleep/wake scheduling algorithm (DEACP-S/W) for the selection of optimal cluster head is presented in this paper. The presented sleep/wake cluster head scheduling along with distributive adaptive clustering protocol helps in reducing the transmission delay by properly balancing of load among nodes. The performance of algorithm is evaluated on the basis of network lifetime, throughput, average residual energy, packet delivered to the base station (BS) and CH of nodes. The results are compared with standard LEACH and DEACP protocols and it is observed that the proposed protocol performs better than existing algorithms. Throughput is improved by 8.1% over LEACH and by 2.7% over DEACP. Average residual energy is increased by 6.4% over LEACH and by 4% over DEACP. Also, the network is operable for nearly 33% more rounds compared to these reference algorithms which ultimately results in increasing lifetime of the Wireless Sensor Network.
Źródło:
International Journal of Electronics and Telecommunications; 2021, 67, 3; 437-443
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Quasi-offline fair scheduling in third generation wireless data networks
Autorzy:
Martyna, J.
Powiązania:
https://bibliotekanauki.pl/articles/309495.pdf
Data publikacji:
2013
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
Birkhoff-von Neumann
max-min fairness
statistical optimization
wireless scheduling
Opis:
In 3G wireless data networks, network operators would like to balance system throughput while serving users fairly. This is achieved through the use of fair scheduling. However, this approach provides non-Pareto optimal bandwidth allocation when considering a network as a whole. In this paper an optimal offline algorithm that is based on the decomposition result for a double stochastic matrix by Birkhoff and von Neumann is proposed. A utility max-min fairness is suggested for the derivation of a double stochastic matrix. Using a numerical experiment, new approach improves the fairness objective and is close to the optimal solution.
Źródło:
Journal of Telecommunications and Information Technology; 2013, 3; 112-114
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies