Next Article in Journal
An Approach to Speed up Single-Frequency PPP Convergence with Quad-Constellation GNSS and GIM
Next Article in Special Issue
Non-Convex Sparse and Low-Rank Based Robust Subspace Segmentation for Data Mining
Previous Article in Journal
Remote Sensing Image Change Detection Based on NSCT-HMT Model and Its Application
Previous Article in Special Issue
Distributed and Modular CAN-Based Architecture for Hardware Control and Sensor Data Integration
Article Menu
Issue 6 (June) cover image

Export Article

Open AccessArticle
Sensors 2017, 17(6), 1303;

Node Scheduling Strategies for Achieving Full-View Area Coverage in Camera Sensor Networks

School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing 210003, China
Nanjing University of Information Science & Technology, Nanjing 210044, China
Department of Mathematics and Computer Science, Northeastern State University, Tahlequah, OK 74464, USA
Author to whom correspondence should be addressed.
Academic Editor: Leonhard M. Reindl
Received: 4 April 2017 / Revised: 26 May 2017 / Accepted: 2 June 2017 / Published: 6 June 2017
Full-Text   |   PDF [3112 KB, uploaded 9 June 2017]   |  


Unlike conventional scalar sensors, camera sensors at different positions can capture a variety of views of an object. Based on this intrinsic property, a novel model called full-view coverage was proposed. We study the problem that how to select the minimum number of sensors to guarantee the full-view coverage for the given region of interest (ROI). To tackle this issue, we derive the constraint condition of the sensor positions for full-view neighborhood coverage with the minimum number of nodes around the point. Next, we prove that the full-view area coverage can be approximately guaranteed, as long as the regular hexagons decided by the virtual grid are seamlessly stitched. Then we present two solutions for camera sensor networks in two different deployment strategies. By computing the theoretically optimal length of the virtual grids, we put forward the deployment pattern algorithm (DPA) in the deterministic implementation. To reduce the redundancy in random deployment, we come up with a local neighboring-optimal selection algorithm (LNSA) for achieving the full-view coverage. Finally, extensive simulation results show the feasibility of our proposed solutions. View Full-Text
Keywords: full-view area coverage; camera sensor networks; sleep scheduling full-view area coverage; camera sensor networks; sleep scheduling

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Wu, P.-F.; Xiao, F.; Sha, C.; Huang, H.-P.; Wang, R.-C.; Xiong, N.-X. Node Scheduling Strategies for Achieving Full-View Area Coverage in Camera Sensor Networks. Sensors 2017, 17, 1303.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top