Results 1 - 10
of
16
Barrier coverage in hybrid directional sensor networks
- in Mobile Ad-Hoc and Sensor Systems (MASS), 2013 IEEE 10th International Conference on, Oct 2013
"... Abstract-Barrier coverage is a critical issue in wireless sensor networks for security applications (e.g., border protection) where directional sensors (e.g., cameras) are becoming more popular and advantageous than omni-directional scalar sensors for the extra dimensional information they provide. ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Abstract-Barrier coverage is a critical issue in wireless sensor networks for security applications (e.g., border protection) where directional sensors (e.g., cameras) are becoming more popular and advantageous than omni-directional scalar sensors for the extra dimensional information they provide. However, barrier coverage can not be guaranteed after initial random deployment of sensors, especially for directional sensors with limited sensing angles. In this paper, we study how to efficiently achieve barrier coverage in hybrid directional sensor networks by moving mobile sensors to fill in gaps and form a barrier with stationary sensors. In specific, we introduce the notion of directional barrier graph to model the barrier coverage formation problem. We prove that the minimum number of mobile sensors required to form a barrier with stationary sensors is the length of the shortest path from the source node to the destination node on the directional barrier graph. We then formulate the problem of minimizing the cost of moving mobile sensors to fill in the gaps on the shortest path as a minimum cost bipartite assignment problem, and solve it in polynomial time using the Hungarian algorithm. Both analytical and experimental studies demonstrate the effectiveness of the proposed algorithm.
Full-View Barrier Coverage with Rotatable Camera
- Sensors, IEEE/CIC International Conference on Communications in China (ICCC
, 2014
"... Abstract—Camera sensors can collect visual information from regions of interest (RoI) and provide more informa-tion to classify the intruder. In practice, randomly deployed camera sensors can not guarantee that the barrier is full-view covered, and lead to a waste of sensing resources. Our work take ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract—Camera sensors can collect visual information from regions of interest (RoI) and provide more informa-tion to classify the intruder. In practice, randomly deployed camera sensors can not guarantee that the barrier is full-view covered, and lead to a waste of sensing resources. Our work takes the first attempt to explore the deploy-ment strategy to achieve full-view barrier coverage with rotatable camera sensors. We propose a method to select camera sensors from an existing and arbitrary deployment and determine their orientation to obtain a full-view barrier coverage. Our simulation results demonstrate that our algorithm outperforms existing algorithms for fixed directional camera sensors in saving the number of camera sensors. I.
Critical Sensing Range for Mobile Heterogeneous Camera Sensor Networks
, 2013
"... Abstract—In camera sensor networks (CSNs), full view cov-erage, in which any direction of any point in the operational region is covered by at least one camera sensor, is of great significance since image shot at the frontal viewpoint considerably increases the possibility to recognize the object. H ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—In camera sensor networks (CSNs), full view cov-erage, in which any direction of any point in the operational region is covered by at least one camera sensor, is of great significance since image shot at the frontal viewpoint considerably increases the possibility to recognize the object. However, finding the critical condition to achieve full view coverage in mobile heterogeneous CSNs remains an open question. In this paper, we analyze both the static and mobile random deployed camera sensor networks. A centralized parameter – equivalent sensing radius (ESR) – is defined to evaluate the critical requirement for asymptotic full view coverage in heterogeneous CSNs. We derive the critical sensing range for full view coverage under static model, 2-dimensional random walk mobility model, 1-dimensional random walk mobility model and random rotating model. We then discuss the impact of various mobility patterns on sensing energy consumption and study the power-delay tradeoff and show that random walk mobility model can decrease the sensing energy consumption under certain delay tolerance. To our knowledge, our work is the very first that derive the critical condition to achieve full view coverage in mobile heterogeneous CSNs. I.
Critical Sensing Range for Camera Sensor Networks
, 2014
"... In camera sensor networks (CSNs), full view coverage, in which any direction of any point in the operational region is covered by at least one camera sensor, is of great sig-nificance since image shot at the frontal viewpoint considerably increases the possibility to recognize the object. However, f ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
In camera sensor networks (CSNs), full view coverage, in which any direction of any point in the operational region is covered by at least one camera sensor, is of great sig-nificance since image shot at the frontal viewpoint considerably increases the possibility to recognize the object. However, finding the critical condition to achieve full view cov-erage in CSNs remains an open question. In this paper, we analyze both the static and mobile random deployed camera sensor networks. A centralized parameter – equivalent sensing radius (ESR) – is defined to evaluate the critical requirement for asymptotic full view coverage in heterogeneous CSNs. We derive ESR for full view coverage under static model, 2-dimensional random walk mobility model, 1-dimensional random walk mobility model and random rotating model. We also proof that the critical ESR to achieve almost surely coverage is 1.225 times of the critical ESR to achieve coverage with high probability, and extend the result to homogeneous network. We then discuss the impact of various mobility patterns on sensing energy consumption and study the power-delay tradeo ↵ and show that random walk mobility model can decrease the sensing energy consumption under certain delay tolerance. To our knowledge, our work is the very first that derive the critical condition to achieve full view coverage in mobile heterogeneous CSNs. 1 21
SmartPhoto: A Resource-Aware Crowdsourcing Approach for Image Sensing with Smartphones
"... Photos obtained via crowdsourcing can be used in many critical applications. Due to the limitations of communi-cation bandwidth, storage and processing capability, it is a challenge to transfer the huge amount of crowdsourced photos. To address this problem, we propose a framework, called SmartPhoto ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Photos obtained via crowdsourcing can be used in many critical applications. Due to the limitations of communi-cation bandwidth, storage and processing capability, it is a challenge to transfer the huge amount of crowdsourced photos. To address this problem, we propose a framework, called SmartPhoto, to quantify the quality (utility) of crowd-sourced photos based on the accessible geographical and geo-metrical information (called metadata) including the smart-phone’s orientation, position and all related parameters of the built-in camera. From the metadata, we can infer where and how the photo is taken, and then only transmit the most useful photos. Three optimization problems regard-ing the tradeoffs between photo utility and resource con-straints, namely the Max-Utility problem, the online Max-Utility problem and the Min-Selection problem, are stud-ied. Efficient algorithms are proposed and their perfor-mance bounds are theoretically proved. We have imple-mented SmartPhoto in a testbed using Android based smart-phones, and proposed techniques to improve the accuracy of the collected metadata by reducing sensor reading errors and solving object occlusion issues. Results based on real implementations and extensive simulations demonstrate the effectiveness of the proposed algorithms.
Fault Tolerant Barrier Coverage for Wireless Sensor Networks
"... Abstract-Barrier coverage is a critical issue in wireless sensor networks for security applications (e.g., border protection), the performance of which is highly related with locations of sensor nodes. Existing work on barrier coverage mainly assume that sensor nodes have accurate location informat ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract-Barrier coverage is a critical issue in wireless sensor networks for security applications (e.g., border protection), the performance of which is highly related with locations of sensor nodes. Existing work on barrier coverage mainly assume that sensor nodes have accurate location information, however, little work explores the effects of location errors on barrier coverage. In this paper, we study the barrier coverage problem when sensor nodes have location errors and deploy mobile sensor nodes to improve barrier coverage if the network is not barrier covered after initial deployment. We analyze the relationship between the true distance and the measured distance of two stationary sensor nodes and derive the minimum number of mobile sensor nodes needed to connect them with a guarantee when nodes location errors. Furthermore, we propose a fault tolerant weighted barrier graph, based on which we prove that the minimum number of mobile sensor nodes needed to form barrier coverage with a guarantee is the length of the shortest path on the graph. Simulation results validate the correctness of our analysis.
Maximum Lifetime Suspect Monitoring on the Street with Battery-powered Camera Sensors
- WIRELESS NETWORKS
, 2015
"... A camera sensor network is a sensor net-work of a group of camera sensors and is being deployed for various surveillance and monitoring applications. In this paper, we propose a new surveillance model for camera sensor network, namely half-view model, which requires a camera sensor network to capt ..."
Abstract
- Add to MetaCart
A camera sensor network is a sensor net-work of a group of camera sensors and is being deployed for various surveillance and monitoring applications. In this paper, we propose a new surveillance model for camera sensor network, namely half-view model, which requires a camera sensor network to capture the face image of any object if it moves forward to pass over an area of interest. Based on this new surveillance model, we introduce a new sleep-wakeup scheduling problem in camera sensor network, namely the maximum life-time half-view barrier-coverage (MaxL-HV-BC) prob-lem, whose goal is to find an on-off schedule of battery-operated camera sensors such that the continuous time duration providing half-view barrier-coverage over an area of interest is maximized. We develop a strategy to check if a region is half-view covered by a given set of camera sensors, and use this strategy to design two new heuristic algorithms for MaxL-HV-BC. We also conduct simulations to compare the average performance of the proposed algorithms with a trivial solution as well as the theoretical upper bound.
A Survey on Topology Control inWireless Sensor Networks: Taxonomy, Comparative Study, and Open Issues
, 2013
"... Topology control techniques for wireless sensor networks are systematically classified into two categories, namely, network coverage and network connectivity. The relevant basic principles, state of the art, and future research directions are summarized in this paper. ..."
Abstract
- Add to MetaCart
Topology control techniques for wireless sensor networks are systematically classified into two categories, namely, network coverage and network connectivity. The relevant basic principles, state of the art, and future research directions are summarized in this paper.
Mobility and Intruder Prior Information Improving the Barrier Coverage of Sparse Sensor Networks
, 2014
"... Barrier coverage problem in emerging mobile sensor networks has been an interesting research issue due to many related real-life applications. Existing solutions are mainly con-cerned with deciding one-time movement for individual sensors to construct as many barriers as possible, which may not be ..."
Abstract
- Add to MetaCart
Barrier coverage problem in emerging mobile sensor networks has been an interesting research issue due to many related real-life applications. Existing solutions are mainly con-cerned with deciding one-time movement for individual sensors to construct as many barriers as possible, which may not be suitable when there are no sufficient sensors to form a single barrier. In this paper, we aim to achieve barrier coverage in sensor scarcity scenario by dynamic sensor patrolling. In specific, we design a periodic monitoring scheduling (PMS) algorithm in which each point along the barrier line is monitored periodically by mobile sensors. Based on the insight from PMS, we then propose a coordinated sensor patrolling (CSP) algorithm to further improve the barrier coverage, where each sensor’s current movement strategy is derived from the information of intruder arrivals in the past. By jointly exploiting sensor mobility and intruder arrival information, CSP is able to significantly enhance barrier coverage. We prove that the total distance that sensors move during each time slot in CSP is the minimum. Considering the decentralized nature of mobile sensor networks, we further introduce two distributed versions of CSP: S-DCSP and G-DCSP. We study the scenario where sensors are moving on two barriers and propose two heuristic algorithms to guide the movement of sensors. Finally, we generalize our results to work for different intruder arrival models. Through extensive simulations, we demonstrate that the proposed algorithms have desired barrier coverage performances.