Elsevier

Computer Networks

Volume 57, Issue 11, 5 August 2013, Pages 2348-2363
Computer Networks

Mobility increases the surface coverage of distributed sensor networks

https://doi.org/10.1016/j.comnet.2013.04.008Get rights and content

Abstract

Coverage is a fundamental issue in sensor networks, which usually dictates the overall network performance. Previous studies on coverage issues mainly focused on sensor networks deployed on a 2D plane or in 3D space. However, in many real world applications, the target fields can be complex 3D surfaces where the existing coverage analysis methodology cannot be applied. This paper investigates the coverage of mobile sensor networks deployed over convex 3D surfaces. This setting is highly challenging because this dynamic type of coverage depends on not only sensors’ movement but also the characteristics of the target field. Specifically, we have made three major contributions. First, we generalize the previous analysis of coverage in the 2D plane case. Second, we derive the coverage characterization for the sphere case. Finally, we consider the general convex 3D surface case and derive the coverage ratio as a function of sensor mobility, sensor density and surface features. Our work timely fills the blank of coverage characterization for sensor networks and provides insights into the essence of the coverage hole problem. Numerical simulation and real-world evaluation verify our theoretical results. The results can serve as basic guidelines for mobile sensor network deployment in applications concerning complex sensing fields.

Introduction

Sensor networks are widely deployed in many commercial and military scenarios because of their unique advantages, such as low cost, ease of deployment and unattended operation. Typical applications include tracking wild animals [1], [2], forest fire detection [3], forest carbon monitoring [4], volcano surveillance [5] and environmental data reconstruction [6], [7].

Ensuring coverage is a fundamental problem in sensor networks and one of the main considerations for system designers [8]. The investigation of the coverage of a sensor network answers important questions, e.g., what are the traces of the moving objects? What are the chances that an abnormal event like an intrusion will be detected during its lifetime? How well can the sensor network monitor a target field? How accurate is it if the sampled data are used to virtually reconstruct the environmental conditions of the field? Furthermore, the coverage property closely relates to the surveillance quality of a sensor network, the monitoring ability of an intrusion detection system and the connectivity of a k-hop clustered mobile wireless network [9]. Thus, it is important to understand the relationship between coverage and system parameters including the sensor density, sensors’ mobility and the sensing field’s properties. This will help designers better deploy sensor networks for various practical applications concerning complex sensing fields.

Recent years have witnessed the increasing adoption of mobile sensor networks. Sensors can be mounted on autonomous robots, such as the Pioneer 3DX [10] and the Starburg [11], or be mounted on wild animals [1], [2]. System designers embrace mobile sensors since mobility enables self-deployment and adaptability. For example, in a hostile environment where sensors cannot be manually deployed, mobile sensors can move to the desired positions during the redeployment phase [12], [13], [14]; in ocean environments where sensors move with the surrounding ocean currents [11], mobile sensors can adapt to the floating water. Moreover, mobility can be exploited to compensate for the insufficient number of sensors, to improve the area coverage of a randomly deployed sensor network [18], [19] and to optimize the data collection operation [6]. Recent studies have already shown that mobility can increase communication capacity [20], network connectivity [9] and security [21] in ad hoc networks.

For coverage characterization, most existing works assume that the target field is a 2D plane or 3D space. However, in many real world applications, the fields of interest (FoIs) are complex 3D surfaces (Fig. 1a). Such examples appear in the ZebraNet project [1], the GreenOrbs project [4], and the Tungurahua volcano monitoring project [5]. In a 2D plane or 3D space, sensors can move freely within the whole FoI, but for 3D surfaces, sensors are restricted to move only on the surface. This implies that existing results derived under the 2D plane or 3D space model may be inappropriate when being applied to the 3D surface case.

Surface coverage is first introduced by Zhao et al. [22] and extended in [23]. They point out that coverage strategies derived on 2D planes do not work for 3D surfaces since they will encounter the coverage hole problem (Fig. 1b). In [22], [23], however, only the surface coverage of static sensor networks is studied. The coverage ratio is determined by the initial network configuration and remains unchanged over time. Liu et al. [18] have analyzed the coverage of mobile sensor networks, but they concentrate on the 2D plane case and their results cannot be directly applied to the 3D surface case since their analysis fails to take into account the properties of the FoI. As a result, it is still not clear how mobility affects the coverage of mobile sensor networks on 3D surfaces.

To fill this gap, we study the surface coverage of a mobile sensor network deployed over a convex 3D surface. Specifically, we are interested in the surface coverage ratio over a time period, which is achieved by the continuous movement of sensors. Unlike traditional approaches that aim to provide simultaneous coverage of all locations at each time instant, or exploit mobility to obtain a new stationary configuration that improves the coverage ratio after the sensors move to the desired positions, the surface coverage in mobile scenarios aims at covering the locations once during an event’s lifetime. This kind of surface coverage can be reduced to the scenario in [22], [23] by making the sensors move at zero speed. Characterizing the surface coverage ratio of a mobile sensor network requires comprehensive consideration of the initial network configuration, features of the convex 3D surface and dynamic aspects of the sensors’ movement. In contrast, the stationary 2D plane coverage, mobile 2D plane coverage and stationary surface coverage consider only one or two of those three aspects.

The main contributions in this paper are summarized as following:

  • To the best of our knowledge, this is the first attempt at characterizing the surface coverage of distributed mobile sensor networks. We propose a theoretical analysis framework for coverage studies on general convex 3D surfaces.

  • We derive theoretical results for 2D planes, spheres and general convex 3D surfaces under three mobility models. Our results show that mobility increases the surface coverage.

  • Numerical simulation and real-world evaluation verify the accuracy of our theoretical results. Results using a 2D plane model perform poorly for 3D surfaces due to the coverage hole problem, which verifies our motivation.

  • Our theoretical results provide insights into the essence of the coverage hole problem: the nonzero Gaussian curvature is the root cause for the invalidity of the 2D plane model for the surface coverage case.

The paper is organized as follows. Section 2 gives a brief review of related works, then in Section 3 we summarize our main results and give corresponding interpretations. The network model and coverage metrics are introduced in Section 4. Section 5 is devoted to considering the 2D plane case, while the sphere case is presented in Section 6. Section 7 shows our analysis framework for general surfaces, followed by our simulation and evaluation results in Section 8. In Section 9, we give a brief discussion, then conclude our work and point out possible directions for future work.

Section snippets

Related works

The coverage of sensor networks has been extensively studied in recent years. Existing works on coverage can be divided into two categories: those focusing on stationary sensor networks and those focusing on mobile sensor networks. For the first class, various types of coverage have been investigated, such as area coverage [24], [8][25], [26], barrier coverage [27] and path coverage [28]. For the second class, two mobility models have been investigated: limited mobility [10], [12], [19], [13],

Main results

This section presents the main results and the corresponding implications. The notations are listed in Table 1, and readers can refer to it easily. Throughout the paper, ∥ · ∥ denotes the area of a region, or the arc length of a curve; d(x1, x2) denotes the Euclidean distance between points x1 and x2; A′ denotes the complement of set A. We define a function Gi(kn,r,s) to characterize the properties of the FoI and the mobility of a sensor, with the following form:Gi(kn,r,s)=kn(s)k¯n(s)r4-(k¯n(s)r)2+

Network models and metrics

This section describes models for FoI, sensing, deployment and mobility pattern, respectively, and presents several measures to assess the surface coverage performance of mobile sensor networks.

To understand our work, the reader must be familiar with preliminaries of the integral and differential geometry theories. For convenience, Appendix A lists the related definitions and theorems.

Mobility on a 2D plane

The 2D plane is a special case of a complex surface with Gaussian curvature of zero. The results seem to be straightforward, but can provide a brief overview of the proving process in the following sections. Liu et al. [18] discussed the situation where sensors move under the SL Walk. In this section, we further study the area coverage achieved under the CA and GC Walk. As the SL and CA Walk are special cases of the GC Walk, we thus generalize the results of [18].

Lemma 5.1

The SP3 distribution model can

Mobility on a sphere

A sphere is another special case of a 3D surface. A sphere with radius R has constant Gaussian curvature K = 1/R2. In this section, we study the scenario when sensors move under the CA and GC Walks.

Lemma 6.1

On a sphere of radius R, the geodesic curvature kg of a circular arc curve with radius ρ satisfies:kg=±R2-ρ2Rρ.

Proof

From Lemma 9.1, and kn = 1/R, we have:kg=±k2-kn2=±1ρ2-1R2=±R2-ρ2Rρ.

The sign is determined by the projection direction of the curve on it tangent plane: if the projection directs to the inner of

Mobility on a general convex 3D surface

This section is devoted to analyzing the surface coverage ratio on general surfaces when sensors move under the GC Walk. We follow a similar methodology as in the 2D plane case and the sphere cases, but this case is much more complicated. First we study the diameter and area of the region covered by a moving sensor; then characterize the probability of the following event: a random chosen point from a surface convex set lies in a subset of that set; finally we are able to obtain the formula of F

Surface generation

In order to compare the coverage property of surfaces with different curvatures, we consider the following surfaces which can be expressed as a single valued function z = h(x, y):z=100+50sinCπx1000sinCπy1000,where x, y  [0, 3000]m, and the parameter C is taken as C = 1, 3, 9 to generate three surfaces with 9, 81 and 729 peaks and valleys in the region [0, 3000]m × [0, 3000]m, respectively. Fig. 5 gives the contours of these surfaces. Here, the unit of length is the meter.

Numerical results

The first simulation is

Conclusion and future work

In this section, we discuss some practical issues of our models, identify future extensions, and conclude our work.

  • Surface is non-convex. Our analytical result is derived by modeling the target FoI as a convex surface. However, a real world surface can be more complicated, i.e., it may consist of multiple separate regions due to obstacles (e.g., rocks, trees, lakes, etc.). Combine existing integral and differential geometry results, we will extend the derived results to take these scenarios.

  • The

Acknowledgement

This research was supported by NSF of China (Nos. 61073158, 61100210, 61170238, 60903190, and 61027009), STCSM Project (No. 12dz1507400), Doctoral Program Foundation of Institutions of Higher Education (No. 20110073120021), Doctoral Fund of Ministry of Education of China (No. 20100073120021), National 863 Program (Nos. 2009AA012201 and 2011AA010500), SJTU SMC Project (No. 201120), and Singapore NRF (No. CREATE E2S2).

Xiao-Yang Liu received his B.E. Degree in computer science and technology from the Huazhong University of Science and Technology, Wuhan, China, in 2010. He is now a Ph.D. candidate in the Department of Computer at the Shanghai Jiao Tong University. His research interests include wireless communication, sensor networks, pervasive computing, sparse signal processing, and network security.

References (38)

  • P. Juang, H. Oki, Y. Wang, M. Martonosi, L.S. Peh, D. Rubenstein. Energy-efficient computing for wildlife tracking:...
  • S. Xing, C. Shahabi, B. Pan, Continuous monitoring of nearest neighbor on land surface, in: Proceedings of VLDB, August...
  • M. Hefeeda, M. Bagheri, Wireless sensor networks for early detection for forest fires, in: Proceedings of MASS, October...
  • Y. Liu, Y. He, M. Li, J. Wang, K. Liu, L. Mo, W. Dong, Z. Yang, M. Xi, J. Zhao, X.-Y. Li, Does wireless sensor network...
  • G. Werner-Allen, K. Lorincz, J. Johnson, J. Lees, M. Welsh, Fidelity and yield in a volcano monitoring sensor network,...
  • L. Kong, D. Jiang, M.-Y. Wu, Optimizing the spatio-temporal distribution of cyber-physical systems for environment...
  • L. Kong, M. Xia, X.-Y. Liu, M.-Y. Wu, X. Liu, Data loss and reconstruction in sensor networks, in: IEEE INFOCOM, April...
  • S. Meguerdichian, F. Koushanfar, M. Potkonjak, M.B. Srivastava, Coverage problems in wireless ad-hoc sensor networks,...
  • Q. Wang, X. Wang, X. Lin, Mobility increases the connectivity of k-hop clustered wireless Networks, in: Proceedings of...
  • Y. Mei et al.

    Deployment of mobile robots with energy and timing constraints

    IEEE Transactions on Robotics

    (2006)
  • J. Luo, D. Wang, Q. Zhang, Double mobility: coverage of the sea surface with mobile sensor networks, in: IEEE INFOCOM,...
  • A. Howard, M.J. Mataric, G.S. Sukhatme, Mobile sensor network deployment using potential fields: a distributed,...
  • Y. Zhou, K. Chakrabarty, Sensor deployment and target localization based on virtual forces, in: INFOCOM,...
  • G. Wang, G. Cao, T.L. Porta, Movement-assisted sensor deployment, in: INFOCOM,...
  • H. Zhou, H. Wu, S. Xia, M. Jin, N. Ding, A distributed triangulation algorithm for wireless sensor networks on 2D and...
  • M. Jin, G. Rong, H. Wu, L. Shuai, X. Guo, Optimal surface deployment problem in wireless sensor networks, in: IEEE...
  • L. Liu et al.

    On coverage of wireless sensor networks for rolling terrains

    IEEE Transactions on Parallel and Distributed Systems

    (2012)
  • B. Liu, P. Brass, O. Dousse, P. Nain, D. Towsley, Mobility improves coverage of sensor networks, in: Proceedings of...
  • W. Wang et al.

    Trade-off between mobility and density for coverage in wireless sensor networks

  • Cited by (25)

    • Coverage problem with uncertain properties in wireless sensor networks: A survey

      2017, Computer Networks
      Citation Excerpt :

      Coverage ratio reflects how much of the ROI is covered and is typically discussed as the partial coverage problem, which are elaborated in Section 2.2.2 by a series of researches [4,8,48,114,160,161,174–176]. Coverage probability reflects the degree of coverage for the entire ROI and is usually discussed as the probabilistic coverage problems, which are elaborated in Section 2.2.3 through many literatures [28,62,99,113,129,177]. As the second kind of objective, we present three kinds of optimization objectives considering efficiency of WSNs, namely, maximizing coverage quality, maximizing network lifetime, and minimizing the number of sensors.

    • Autonomous deployment of wireless sensor networks for optimal coverage with directional sensing model

      2016, Computer Networks
      Citation Excerpt :

      Finally, we conclude our paper in Section 8. There is a vast body of recent work related to sensor deployments for area coverage, including joint coverage and connectivity solutions to static sensor deployments (e.g., [14–16]) and intermittent coverage with mobile nodes (e.g. [17–19]). However, we focus only on those about deploying WSNs for better constant coverage using mobile nodes.

    • ICP: Instantaneous clustering protocol for wireless sensor networks

      2016, Computer Networks
      Citation Excerpt :

      From the perspective of time-efficiency, a fast clustering is significant in WSNs, especially in mission-critical applications. For example, in military surveillance [7,28], gathering enemies’ information immediately after deployment is critical to build up the informational competitive advantage. Disaster relief [21] is another example that an early detection of danger can save more lives.

    • Optimal coverage in wireless sensor networks

      2020, Springer Optimization and Its Applications
    View all citing articles on Scopus

    Xiao-Yang Liu received his B.E. Degree in computer science and technology from the Huazhong University of Science and Technology, Wuhan, China, in 2010. He is now a Ph.D. candidate in the Department of Computer at the Shanghai Jiao Tong University. His research interests include wireless communication, sensor networks, pervasive computing, sparse signal processing, and network security.

    Kailiang Wu received his B.E. Degree in School of mathematics and statistics from Huazhong University of Science and Technology, Wuhan, China, in 2011. He is now a Ph.D. candidate in the School of Mathematical Science at Peking University. His research interests include nonlinear equations, computational fluid dynamics, computational modeling of physical problems, hyperbolic conservation laws and numerical methods.

    Yanmin Zhu received the B.E. degree in computer science from the Xi’an Jiao Tong University in 2002 and the Ph.D. degree in computer science from Hong Kong University of Science and Technology in 2007. He was a research associate in the Department of Computing, Imperial College London. Now, he is an associate professor in the Department of Computer Science and Engineering at the Shanghai Jiao Tong University. His research interests include ad hoc sensor networks, mobile computing, grid computing, and resource management in distributed systems. He is a member of the IEEE and IEEE Communication Society.

    Linghe Kong received his B.E. degree in Automation Department from Xidian University, China, in 2005. He received his Dipl. Ing. degree in Telecommunication from TELECOM SudParis (ex. INT), in 2007. Now he is a fourth-year Ph.D. student in Department of Computer Science and Engineering in Shanghai Jiao Tong University. His research interests include wireless communication, sensor networks, vehicular networks and distributed systems.

    Min-You Wu received the M.S. degree from the Graduate School of Academia Sinica, Beijing, China, and the Ph.D. degree from Santa Clara University, Santa Clara, CA. He is an IBM Chair Professor with the Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China. He serves as the Chief Scientist at the Grid Center, Shanghai Jiao Tong University. He is also a Research Professor with the University of New Mexico, Albuquerque. His research interests include grid computing, wireless networks, sensor networks, multimedia networking, parallel and distributed systems, and compilers for parallel computers. He has published over 150 journal and conference papers in the aforementioned areas. He is a senior member of the IEEE and IEEE Communication Society.

    View full text