Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Building a ldquostraightforwardrdquo path in wireless ad hoc sensor networks (WASNs) not only avoids wasting energy in detours, but also incurs less interference in other transmissions when fewer nodes are involved in the transmission. This plays an important role in recent WASN applications that require a streaming service to deliver large amount of data. In this paper, we extend our early work on...
In this paper, a constrained random perturbation based pairwise keY establishment (CARPY) scheme and its variant, a CARPY+ scheme, for Wireless Sensor Networks (WSNs), are presented. Compared to all existing schemes which satisfy only some requirements in so-called sensor-key criteria, including: 1) resilience to the adversary's intervention, 2) directed and guaranteed key establishment, 3) resilience...
Passive wireless sensors have emerged as a new technology to measure a vast majority of phenomena in our daily life. Passive sensors require no power source, and therefore their application domains are numerous, including health care, infrastructure protection, and national security, among many others. The deployment of wireless passive sensors and their readers has changed how detection needs to...
Sensing the radio spectrum is an essential feature of cognitive radio. What is mostly important for a cognitive transmitter is to know the power spectral density at the location of its intended receiver and of the primary receivers. This requires, as a whole, knowledge of the spatial distribution of the power spectral density, an information that could be delivered by a network of sensors distributed...
This paper proposes a data acquisition scheme which supports probabilistic data quality assurance in an error-prone wireless sensor network (WSN). Given a query and a statistical model of real-world data which is highly correlated, the aim of the scheme is to find a sensor selection scheme which is used to deal with inaccurate data and probabilistic guarantee on the query result. Since most sensor...
Recently, it has been shown that heterogeneous wireless sensor networks (HWSN) outperform homogeneous WSN. However, security is still the critical issue. In this paper, we study the impact of node capture attack on three key management schemes designed for heterogeneous wireless sensor networks (HWSN): asymmetric pre-distribution key management (AP scheme), HERO and TLA schemes. We formalize this...
Broadcast of information in wireless sensor networks is an important operation, e.g., for code updates, queries, membership information, etc. In this paper, we analyze and experimentally compare the performance of vanilla versions of several well-known broadcast mechanisms namely, flooding, site percolation, bond percolation, and modified bond percolation. We carry out our comparison for different...
We extend the probabilistic key-based approach for wireless sensor networks concerning the slow rekeying and path key reestablishment processes. By introducing a novel, energy efficient, distributed, and faster scheme, we attempt to replace the existing ordinary rekeying method of probabilistic key management scheme through a deterministic algorithm that works on both the base station and on each...
In this paper we propose an adaptive random walk for wireless networks. The lifetime of the walk is varied in such a way that at least a given fraction of nodes is covered, in expectation. The only parameter of the random walk, alpha, depends on the nominal network size N and on the required coverage. For sizes lower than N the required coverage is satisfied with lifetime slightly higher than the...
Aggregation operations are important for users to get summarization information in WSN applications. As large numbers of applications only require approximate aggregation results rather than the exact ones, some approximate aggregation algorithms are proposed to save energy. However, the error bounds of these algorithms are fixed and it is impossible to adjust their error bounds automatically. Therefore,...
Coverage is an essential task in sensor deployment for the design of wireless sensor networks. While most existing studies on coverage consider homogeneous sensors, the deployment of heterogeneous sensors represents more accurately the network design for real-world applications. In this paper, we focus on the problem of connected k-coverage in heterogeneous wireless sensor networks. Precisely, we...
In this paper, we address the problem of decentralized parameter estimation with a Wireless Sensor Network (WSN). The network is hierarchical in that sensors are grouped into clusters, being each cluster under the supervision of a cluster-head (CH). The CH is also in charge of consolidating the sensor observations into a local estimate before its transmission to the Fusion Center (FC). In this context,...
Wireless sensor network coverage completeness is an important Quality of Service measure. It is frequently assumed that events occurring in the sensor field will always be detected. However, this is not necessary the case, particularly if there are holes in the sensor network coverage. This paper introduces a novel method for detection and relative localization of sensor network coverage holes in...
This paper reports on our work of integrating low-cost sensors, probabilistic localization, and stochastic learning in a wireless sensor network-based system applied to warehouse management. This work is on-going, and our next step will be running the actor-critic policy optimization on a realistic scale in the real warehouse environment.
In this paper we present a new information consensus filter for distributed dynamic-state estimation. Estimation is handled by the traditional information filter, while communication of measurements is handled by a consensus filter. First and second-order statistics of local estimates are discussed. It is shown that local information consensus filter estimates are unbiased, and the actual variance...
Localization is a crucial service for various applications in wireless sensor networks (WSNs). Although most researches assume stationary nodes, sensor mobility can enrich the application scenarios. Existing dynamic localization approaches require high seed density or incur a large communication overhead. In order to address these problems, we propose an efficient rang-free localization algorithm,...
In previous literature on cooperative relay communications, the emphasis has been on the study of multi-hop networks. In this paper we address mesh wireless networks that use decode-and-forward relays for which we derive the optimal node decision rules in case of binary transmission. We also obtain the expression for the overall bit error probability. We compare the mesh networks with multi-hop networks...
A Wireless Sensor Network is engaged in a binary detection task and the operational modality is that known as running consensus: Each node continuously collects data and simultaneously exchanges informations with its neighbors, with the final aim of reaching agreement about a common detection statistic. This paper exploits an appropriate framework for investigating the detection performance of the...
The sensor network localization problem with distance information is to determine the positions of all sensors in a network given the positions of some sensors and the distances between some pairs of sensors. We present a sequential algorithm for estimating sensor positions when only inaccurate distance measurements are available, and evaluate the performance of the algorithm on simulations of randomly...
Energy conservation, coverage and connectivity are three critical application requirements in wireless sensor networks. Related researches have either concerned coverage, connectivity, and energy conservation separately or required sensing/communication range restrictions. In this paper, we aim to maximize the network lifetime, while maintaining coverage and connectivity simultaneously, without any...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.