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.

  • [Show abstract] [Hide abstract]
    ABSTRACT: Barrier coverage in wireless sensor networks has been studied extensively in recent years, which aims at detecting any movement crossing a given belt, regardless of the direction of movement. For many intrusion detection applications, only the intruders from one side of the belt are illegal such as border guarding. Therefore, we introduce a new coverage model called one-way barrier coverage in this article, which requires that the network reports illegal intruders while ignores legal ones. An appropriate definition for one-way barrier coverage is proposed. However, one-way barrier coverage is much more challenging than conventional barrier coverage since it needs to identify illegal intruders from normal targets.
    Computer Communications 11/2014; 57. DOI:10.1016/j.comcom.2014.11.003 · 1.35 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: As wireless sensor networks applied to 3D spaces gain in prominence, it becomes necessary to develop means of understanding how to optimize 3D sensor coverage while taking into account the environmental conditions in which they operate. To accomplish this goal, this paper presents the Sensor Placement Optimization via Queries (SPOQ) simulation algorithm. It determines where to place the minimal number of simulated bistatic sensors such that they cover as much of the single-source-illuminated virtual environment as possible. SPOQ performs virtual sensor placement optimization by means of making queries to the photon map generated by the photon mapping algorithm and uses this query output as input to a prevailing modified sensor placement algorithm. Since SPOQ uses photon mapping, SPOQ can take into account static or dynamic simulated environmental conditions and can use exploratory or precomputed sensing. The SPOQ method is computationally efficient, requiring less memory than other sensor placement solutions.
    2013 Winter Simulation Conference - (WSC 2013); 12/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: Network lifetime maximization with guaranteed coverage is an important issue in wireless sensor networks. Based on our recently proposed confident information coverage (CIC) model, this paper studies the multi-modal confident information coverage (M2CIC) problem. Assuming that each node is equipped with different types of sensors, the objective is to schedule the multi-modal sensors' activity, such that the confident information coverage for each sensing modality can be guaranteed while the network lifetime can be maximized. We model the M2CIC problem as a multi-modal set cover problem (M2SC) and prove its NP-completeness. For solving the M2SC problem, we design two energy-efficient heuristics including a centralized one and a distributed one. In the proposed algorithms, different modal sensors are organized into a family of set covers, each of which can provide confident information coverage for all the monitored physical phenomena. Simulation results show that both the proposed algorithms can efficiently prolong the network lifetime and outperform two classical peer algorithms in terms of the extended network lifetime.
    IEEE Transactions on Parallel and Distributed Systems 03/2015; 26(3):902-913. DOI:10.1109/TPDS.2014.2315193 · 2.17 Impact Factor

Full-text (2 Sources)

1 Download
Available from
Feb 9, 2015