Conference Paper

Data fusion improves the coverage of wireless sensor networks.

DOI: 10.1145/1614320.1614338 Conference: 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
 · 
84 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposes an information quality IQ aware tracking algorithm that reduces energy consumption for moving target tracking in uncertain sensor networks with guarantee of given quality constraints. We first model the uncertainty in sensor networks. Then, we map information quality to the combination of sensed data error, residual energy and energy cost of sensor nodes. Moreover, the problem of IQ-aware nodes selection is induced and an energy-efficient tracking algorithm based on nodes selection is presented. Finally, a comprehensive set of simulations is presented. We conclude that the proposed tracking algorithm yields excellent tracking performance in sensor networks under uncertainty.
    International Journal of Sensor Networks. 09/2013; 14(1):33-41.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks (WSNs) are typically com- posed of low-cost sensors that are deeply integrated with phys- ical environments. As a result, the sensing performance of a WSN is inevitably undermined by various physical uncertainties, which include stochastic sensor noises, unpredictable environment changes and dynamics of the monitored phenomenon. Traditional solutions (e.g., sensor calibration and collaborative signal pro- cessing) work in an open-loop fashion and hence fail to adapt to these uncertainties after system deployment. In this paper, we propose an adaptive system-level calibration approach for a class of sensor networks that employ data fusion to improve system sensing performance. Our approach features a feedback control loop that exploits sensor heterogeneity to deal with the aforementioned uncertainties in calibrating system performance. In contrast to existing heuristic based solutions, our control- theoretical calibration algorithm can ensure provable system stability and convergence. We also systematically analyze the impacts of communication reliability and delay, and propose an optimal routing algorithm that minimizes the impact of packet loss on system stability. Our approach is evaluated by both experiments on a testbed of Tmotes as well as extensive simulations based on data traces gathered from a real vehicle detection experiment. The results demonstrate that our calibration algorithm enables a network to maintain the optimal detection performance in the presence of various system and environmental dynamics.
    INFOCOM 2010. 29th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 15-19 March 2010, San Diego, CA, USA; 01/2010
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In wireless sensor networks, clustering is an effective technique to extend the network lifetime. However, in the multi-hop clustering model, if the nodes are uniformly distributed and the clusters are of equal size, the cluster heads closer to the sink have to relay much heavier traffic, leading to the “energy hole” problem. Unequal clustering structures have been proposed to mitigate the “energy hole” problem; but, how to quantify the cluster sizes for the aim of scalability and energy hole avoidance remains as a challenging problem. In this paper, we first investigate the theoretical issues of the unequal clustering strategy in uniformly distributed sensor networks. We then propose a method to construct optimal clustering architecture to minimize the total energy consumption of all sensor nodes. Furthermore, we design simple but effective and distributed protocols for energy-aware cluster-head rotation and routing that achieve even energy consumption among all nodes. Extensive simulations show that the performance of our approach extends the network lifetime in two to three times of the one achieved in the best-so-far unequal clustering-based routing.
    Computer Communications. 02/2013; 36(3):256–268.

Full-text

View
0 Downloads
Available from