2,068 research outputs found
Coverage Protocols for Wireless Sensor Networks: Review and Future Directions
The coverage problem in wireless sensor networks (WSNs) can be generally
defined as a measure of how effectively a network field is monitored by its
sensor nodes. This problem has attracted a lot of interest over the years and
as a result, many coverage protocols were proposed. In this survey, we first
propose a taxonomy for classifying coverage protocols in WSNs. Then, we
classify the coverage protocols into three categories (i.e. coverage aware
deployment protocols, sleep scheduling protocols for flat networks, and
cluster-based sleep scheduling protocols) based on the network stage where the
coverage is optimized. For each category, relevant protocols are thoroughly
reviewed and classified based on the adopted coverage techniques. Finally, we
discuss open issues (and recommend future directions to resolve them)
associated with the design of realistic coverage protocols. Issues such as
realistic sensing models, realistic energy consumption models, realistic
connectivity models and sensor localization are covered
A Multi-hop Topology Control Based on Inter-node Range Measurement for Wireless Sensor Networks Node Localization
In centralized range-based localization techniques, sufficiency of inter-node range information received by the base station strongly affects node position estimation results. Successful data aggregation is influenced by link stability of each connection of routes, especially in a multi-hop topology model. In general, measuring the inter-node range is only performed for position determination purposes. This research introduces the use of inter-node range measurement information for link selection in a multi-hop route composition in order to increase the rate of data aggregation. Due to irregularity problems of wireless media, two areas of node communication have been considered. The regular communication area is the area in which other nodes are able to perform symmetrical communication to the node without failure. The irregular area is the area in which other nodes are seldom able to communicate. Due to its instability, some existing methods tried to avoid the irregular area completely. The proposed method, named Virtual Boundaries (VBs) prioritizes these areas. The regular communication area’s nodes have high priority to be selected as link vertices; however, when there is no link candidate inside this area, nodes within the irregular area will be selected with respect to their range to the parent node. This technique resulted in a more robust multi-hop topology that can reduce isolated node numbers and increase the percentage of data collected by the base station accordingly
Fingerprinting Smart Devices Through Embedded Acoustic Components
The widespread use of smart devices gives rise to both security and privacy
concerns. Fingerprinting smart devices can assist in authenticating physical
devices, but it can also jeopardize privacy by allowing remote identification
without user awareness. We propose a novel fingerprinting approach that uses
the microphones and speakers of smart phones to uniquely identify an individual
device. During fabrication, subtle imperfections arise in device microphones
and speakers which induce anomalies in produced and received sounds. We exploit
this observation to fingerprint smart devices through playback and recording of
audio samples. We use audio-metric tools to analyze and explore different
acoustic features and analyze their ability to successfully fingerprint smart
devices. Our experiments show that it is even possible to fingerprint devices
that have the same vendor and model; we were able to accurately distinguish
over 93% of all recorded audio clips from 15 different units of the same model.
Our study identifies the prominent acoustic features capable of fingerprinting
devices with high success rate and examines the effect of background noise and
other variables on fingerprinting accuracy
Precise Packet Loss Pattern Generation by Intentional Interference
Abstract—Intermediate-quality links often cause vulnerable
connectivity in wireless sensor networks, but packet losses caused by such volatile links are not easy to trace. In order to equip link layer protocol designers with a reliable test and debugging tool, we develop a reactive interferer to generate packet loss patterns precisely. By using intentional interference to emulate parameterized lossy links with very low intrusiveness, our tool facilitates both robustness evaluation of protocols and flaw detection in protocol implementation
The Triangle Metric: Fast Link Quality Estimation for Mobile Wireless Sensor Networks (Invited Paper)
ReSensesuppleCONE
On Modeling Coverage and Rate of Random Cellular Networks under Generic Channel Fading
In this paper we provide an analytic framework for computing the expected
downlink coverage probability, and the associated data rate of cellular
networks, where base stations are distributed in a random manner. The provided
expressions are in computable integral forms that accommodate generic channel
fading conditions. We develop these expressions by modelling the cellular
interference using stochastic geometry analysis, then we employ them for
comparing the coverage resulting from various channel fading conditions namely
Rayleigh and Rician fading, in addition to the fading-less channel.
Furthermore, we expand the work to accommodate the effects of random frequency
reuse on the cellular coverage and rate. Monte-Carlo simulations are conducted
to validate the theoretical analysis, where the results show a very close
match
Spray, Embracing Multimodality
We present Spray, a localization system that compensates
for low accuracy of individual localization measurements by combining measurements from multiple localization modalities
- …