Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "sensor scheduling" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Distributed scheduling of measurements in a sensor network for parameter estimation of spatio-temporal systems
    Autorzy:
    Patan, M.
    Kowalów, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/331122.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    sensor network
    distributed parameter system
    parameter estimation
    experimental design
    sensor scheduling
    sieć sensorowa
    układ o parametrach rozłożonych
    estymacja parametrów
    projekt eksperymentalny
    Opis:
    The main aim of the paper is to develop a distributed algorithm for optimal node activation in a sensor network whose measurements are used for parameter estimation of the underlying distributed parameter system. Given a fixed partition of the observation horizon into a finite number of consecutive intervals, the problem under consideration is to optimize the percentage of the total number of observations spent at given sensor nodes in such a way as to maximize the accuracy of system parameter estimates. To achieve this, the determinant of the Fisher information matrix related to the covariance matrix of the parameter estimates is used as the qualitative design criterion (the so-called D-optimality). The proposed approach converts the measurement scheduling problem to a convex optimization one, in which the sensor locations are given a priori and the aim is to determine the associated weights, which quantify the contributions of individual gaged sites to the total measurement plan. Then, adopting a pairwise communication scheme, a fully distributed procedure for calculating the percentage of observations spent at given sensor locations is developed, which is a major novelty here. Another significant contribution of this work consists in derivation of necessary and sufficient conditions for the optimality of solutions. As a result, a simple and effective computational scheme is obtained which can be implemented without resorting to sophisticated numerical software. The delineated approach is illustrated by simulation examples of a sensor network design for a two-dimensional convective diffusion process.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2018, 28, 1; 39-54
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Scheduling Based Wireless Sensor Networks Integrated with IoT Environment
    Autorzy:
    Mahendran, N.
    Powiązania:
    https://bibliotekanauki.pl/articles/1193556.pdf
    Data publikacji:
    2016
    Wydawca:
    Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
    Tematy:
    Data Scheduling Schemes
    Energy Efficient
    IoT
    Network lifetime
    Sensor Network
    Opis:
    Wireless Sensor networks are widely adopt in military, target tracking, signal processing and monitoring applications like traffic and structural, the small and low cost unreliable sensor nodes in these applications uses batteries as the sole energy source. The energy efficiency becomes difficult task as the tiny and less weight battery act as source of each node. Scheduling the different category of data packets is a way to reduce the power consumption and increasing the lifetime of sensor nodes. The existing scheduling algorithms are not adapted to the environment changes. The basic FCFS (First Come First Serve) suffered by long delay while transmit the real time data packets. In DMP (Dynamic Multilevel Priority) real time data packets occupies highest priority, the remaining non real time data packets sent to lower priority level queues. Some real time task holds the resources for longer time, the other task have to wait, it makes the deadlock condition. The NJN (Nearest Job Next) will select the nearest requesting sensor node for service, real time packets have to wait long time. The proposed Adaptive weighted scheduling scheme changes the behavior of the network queue by adaptively changes the weights based on network traffic. Simulation results proof that, adaptive weighted scheduling algorithm works better than the FCFS and DMP data scheduling in terms of energy consumption and lifetime. Our future scheme to integrate Internet of Things (IoT) with the WSN to increase the performance of the wireless networks.
    Źródło:
    World Scientific News; 2016, 41; 116-127
    2392-2192
    Pojawia się w:
    World Scientific News
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Underwater Acoustic Sensor Node Scheduling using an Evolutionary Memetic Algorithm
    Autorzy:
    Sivakumar, V.
    Rekha, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/307911.pdf
    Data publikacji:
    2018
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    broadcast UASN scheduling
    memetic algorithm
    time division multiple access
    underwater acoustic sensor network
    Opis:
    Underwater Acoustic Sensor Networks (UWASNs) play an important role in monitoring the aqueous environment which has created a lot of interest for researchers and scientists. Utilization of underwater acoustic sensor node (UASN) scheduling for transmission remains, due to the limited acoustic bandwidth available, a challenge in such an environment. One of the methods to overcome this problem is to efficiently schedule UASN data using time division multiple access (TDMA) protocols the parallel transmissions, simultaneously avoiding interference. The paper shows how to optimize the utilization of acoustic sensor node bandwidth by maximizing the possible node transmissions in the TDMA frame and also by minimizing the node's turnaround wait time for its subsequent transmissions by using an evolutionary memetic algorithm (MA). The simulation of MA-TDMA proves that as the size of the network increases, every node in UWASN transmits with an average minimal turnaround transmission time. It also proves that as the TDMA cycle repeats, the overall network throughput gets maximized by increasing the possible node transmissions in the MA-TDMA frame.
    Źródło:
    Journal of Telecommunications and Information Technology; 2018, 1; 88-94
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    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ł
      Wyświetlanie 1-4 z 4

      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