Conference Paper

Data fusion improves the coverage of wireless sensor networks.

DOI: 10.1145/1614320.1614338 In proceeding of: Proceedings of the 15th Annual International Conference on Mobile Computing and Networking, MOBICOM 2009, Beijing, China, September 20-25, 2009
Source: DBLP

ABSTRACT Wireless sensor networks (WSNs) have been increasingly available for critical applications such as security surveillance and environmental monitoring. An important performance measure of such applications is sensing coverage that characterizes how well a sensing field is monitored by a network. Although advanced collaborative signal processing algorithms have been adopted by many existing WSNs, most previous analytical studies on sensing coverage are conducted based on overly simplistic sensing models (e.g., the disc model) that do not capture the stochastic nature of sensing. In this paper, we attempt to bridge this gap by exploring the fundamental limits of coverage based on stochastic data fusion models that fuse noisy measurements of multiple sensors. We derive the scaling laws between coverage, network density, and signal-to-noise ratio (SNR). We show that data fusion can significantly improve sensing coverage by exploiting the collaboration among sensors. In particular, for signal path loss exponent of k (typically between 2.0 and 5.0), rho_f=O(rho_d^(1-1/k)), where rho_f and rho_d are the densities of uniformly deployed sensors that achieve full coverage under the fusion and disc models, respectively. Our results help understand the limitations of the previous analytical results based on the disc model and provide key insights into the design of WSNs that adopt data fusion algorithms. Our analyses are verified through extensive simulations based on both synthetic data sets and data traces collected in a real deployment for vehicle detection.

0 Bookmarks
 · 
63 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper develops a mathematical and computational framework for performing data fusion, or joint statistical inference, within a sensor network and calculating the fusion system's expected performance. Using variational techniques in an abstract probabilistic graphical model setting, we find the Bayes optimal fusion rule under a deterministic constraint and a quadratic cost, and establish properties of its Bayes risk and classification performance. For a certain class of fusion problems, we prove that this fusion rule is also optimal in a much wider sense and satisfies strong asymptotic convergence results. We show how these results apply to examples with Gaussian statistics, compare the performance of different fusion configurations in this illustrative case, and discuss computational methods for determining the fusion system's performance in more general, large-scale problems. These results are motivated by fusing multi-modal radar and acoustic sensors for detecting explosive substances, but have broad applicability to other Bayesian decision problems.
    11/2013;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Volcano monitoring is of great interest to public safety and scientific explorations. However, traditional volcanic instrumentation such as broadband seismometers are expensive, power hungry, bulky, and difficult to install. Wireless sensor networks (WSNs) offer the potential to monitor volcanoes on unprecedented spatial and temporal scales. However, current volcanic WSN systems often yield poor monitoring quality due to the limited sensing capability of low-cost sensors and unpredictable dynamics of volcanic activities. In this article, we propose a novel quality-driven approach to achieving real-time, distributed, and long-lived volcanic earthquake detection and timing. By employing novel in-network collaborative signal processing algorithms, our approach can meet stringent requirements on sensing quality (i.e., low false alarm/missing rate, short detection delay, and precise earthquake onset time) at low power consumption. We have implemented our algorithms in TinyOS and conducted extensive evaluation on a testbed of 24 TelosB motes as well as simulations based on real data traces collected during 5.5 months on an active volcano. We show that our approach yields near-zero false alarm/missing rate, less than one second of detection delay, and millisecond precision earthquake onset time while achieving up to six-fold energy reduction over the current data collection approach.
    ACM Transactions on Sensor Networks (TOSN). 03/2013; 9(2).
  • [Show abstract] [Hide abstract]
    ABSTRACT: Range-free localization methods are suitable for large scale wireless ad hoc and sensor networks due to their less-demanding hardware requirements. Many existing connectivity- or hop-count-based range-free localization methods suffer from the hop-distance ambiguity problem where a node has a same distance estimation to all of its one-hop neighbors. In this paper, we define a new measure, called regulated neighborhood distance (RND), to address this problem by relating the proximity of two neighbors to their neighbor partitions. Furthermore, we propose a new RND-based range-free localization method, and compare our localization algorithm with peer classical algorithms in different network scenarios, which include grid deployment, random uniform deployment, non-uniform deployment and uniform deployment with a coverage hole. Simulation results show that ours can achieve better and reliable localization accuracy in these network scenarios.
    Computer Networks. 11/2012; 56(16):3581–3593.

Full-text

View
0 Downloads
Available from