Results 1 - 10
of
26
Deploying Sensor Networks with Guaranteed Fault Tolerance
, 2005
"... We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multi-path connectivity (k-connectivity) between all nodes. Such a guarantee simultaneously provides fault tolerance against node failures and high overall network capacity (by the max-flow min-cut t ..."
Abstract
-
Cited by 76 (4 self)
- Add to MetaCart
We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multi-path connectivity (k-connectivity) between all nodes. Such a guarantee simultaneously provides fault tolerance against node failures and high overall network capacity (by the max-flow min-cut theorem). We design and analyze the first algorithms that place an almostminimum number of additional sensors to augment an existing network into a k-connected network, for any desired parameter k. Our algorithms have provable guarantees on the quality of the solution. Specifically, we prove that the number of additional sensors is within a constant factor of the absolute minimum, for any fixed k. We have implemented greedy and distributed versions of this algorithm, and demonstrate in simulation that they produce high-quality placements for the additional sensors.
Barrier Coverage of Line-Based Deployed Wireless Sensor Networks
"... Abstract — Barrier coverage of wireless sensor networks has been studied intensively in recent years under the assumption that sensors are deployed uniformly at random in a large area (Poisson point process model). However, when sensors are deployed along a line (e.g., sensors are dropped from an ai ..."
Abstract
-
Cited by 25 (1 self)
- Add to MetaCart
Abstract — Barrier coverage of wireless sensor networks has been studied intensively in recent years under the assumption that sensors are deployed uniformly at random in a large area (Poisson point process model). However, when sensors are deployed along a line (e.g., sensors are dropped from an aircraft along a given path), they would be distributed along the line with random offsets due to wind and other environmental factors. It is important to study the barrier coverage of such linebased deployment strategy as it represents a more realistic sensor placement model than the Poisson point process model. This paper presents the first set of results in this direction. In particular, we establish a tight lower-bound for the existence of barrier coverage under line-based deployments. Our results show that the barrier coverage of the line-based deployments significantly outperforms that of the Poisson model when the random offsets are relatively small compared to the sensor’s sensing range. We then study sensor deployments along multiple lines and show how barrier coverage is affected by the distance between adjacent lines and the random offsets of sensors. These results demonstrate that sensor deployment strategies have direct impact on the barrier coverage of wireless sensor networks. Different deployment strategies may result in significantly different barrier coverage. Therefore, in the planning and deployment of wireless sensor networks, the coverage goal and possible sensor deployment strategies must be carefully and jointly considered. The results obtained in this paper will provide important guidelines to the deployment and performance of wireless sensor networks for barrier coverage.
Barrier Coverage in Camera Sensor Networks
"... Barrier coverage has attracted much attention in the past few years. However, most of the previous works focused on traditional scalar sensors. We propose to study barrier coverage in camera sensor networks. One fundamental difference between camera and scalar sensor is that cameras from different p ..."
Abstract
-
Cited by 16 (1 self)
- Add to MetaCart
(Show Context)
Barrier coverage has attracted much attention in the past few years. However, most of the previous works focused on traditional scalar sensors. We propose to study barrier coverage in camera sensor networks. One fundamental difference between camera and scalar sensor is that cameras from different positions can form quite different views of the object. As a result, simply combining the sensing range of the cameras across the field does not necessarily form an effective camera barrier since the face image (or the interested aspect) of the object may be missed. To address this problem, we use the angle between the object’s facing direction and the camera’s viewing direction to measure the quality of sensing. An object is full-view covered if there is always a camera to cover it no matter which direction it faces and the camera’s viewing direction is sufficiently close to the object’s facing direction. We study the problem of constructing a camera barrier, which is essentially a connected zone across the monitored field such that every point within this zone is full-view covered. We propose a novel method to select camera sensors from an arbitrary deployment to form a camera barrier, and present redundancy reduction techniques to effectively reduce the number of cameras used. We also present techniques to deploy cameras for barrier coverage in a deterministic environment, and analyze and optimize the number of cameras required for this specific deployment under various parameters.
Barrier Coverage with Sensors of Limited Mobility
"... Barrier coverage is a critical issue in wireless sensor networks for various battlefield and homeland security applications. The goal is to effectively detect intruders that attempt to penetrate the region of interest. A sensor barrier is formed by a connected sensor cluster across the entire deploy ..."
Abstract
-
Cited by 15 (0 self)
- Add to MetaCart
Barrier coverage is a critical issue in wireless sensor networks for various battlefield and homeland security applications. The goal is to effectively detect intruders that attempt to penetrate the region of interest. A sensor barrier is formed by a connected sensor cluster across the entire deployed region, acting as a “trip wire ” to detect any crossing intruders. In this paper we study how to efficiently improve barrier coverage using mobile sensors with limited mobility. After the initial deployment, mobile sensors can move to desired locations and connect with other sensors in order to create new barriers. However, simply moving sensors to form a large local cluster does not necessarily yield a global barrier. This global nature of barrier coverage makes it a challenging task to devise effective sensor mobility schemes. Moreover, a good sensor mobility scheme should efficiently improve barrier coverage under the constraints of available mobile sensors and their moving range. We first explore the fundamental limits of sensor mobility on barrier coverage and present a sensor mobility scheme that constructs the maximum number of barriers with minimum sensor moving distance. We then present an efficient algorithm to compute the existence of barrier coverage with sensors of limited mobility, and examine the effects of the number of mobile sensors and their moving ranges on the barrier coverage improvement. Both the analytical results and performance of the algorithms are evaluated via extensive simulations.
Barrier information coverage with wireless sensors
- In Proceedings of IEEE Infocom
, 2009
"... Abstract—Sensor networks have been deployed for many barrier coverage applications such as intrusion detection and border surveillance. In these applications, it is critical to operate a sensor network in an energy-efficient manner so the barrier can be covered with as few active sensors as possible ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
(Show Context)
Abstract—Sensor networks have been deployed for many barrier coverage applications such as intrusion detection and border surveillance. In these applications, it is critical to operate a sensor network in an energy-efficient manner so the barrier can be covered with as few active sensors as possible. In this paper, we study barrier information coverage which exploits collaborations and information fusion between neighboring sensors to reduce the number of active sensors needed to cover a barrier and hence to prolong the network lifetime. Moreover, we propose a practical solution to identify the barrier information coverage set which can information-cover the barrier with a small number of active sensors. The effectiveness of the proposed solution is demonstrated by numerical and simulation results. I.
Optimal Patterns for Four-Connectivity and Full Coverage in Wireless Sensor Networks
"... Abstract—In this paper, we study optimal deployment in terms of the number of sensors required to achieve four-connectivity and full coverage under different ratios of sensors ’ communication range (denoted by rc) to their sensing range (denoted p ffiffiffi by rs). We propose a new pattern, the Diam ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper, we study optimal deployment in terms of the number of sensors required to achieve four-connectivity and full coverage under different ratios of sensors ’ communication range (denoted by rc) to their sensing range (denoted p ffiffiffi by rs). We propose a new pattern, the Diamond pattern, which can be viewed as a series of evolving patterns. When rc=rs p ffiffiffi 3, the Diamond pattern coincides with the well-known triangle lattice pattern; when rc=rs 2, it degenerates to a Square pattern (i.e., a square grid). We prove that our proposed pattern is asymptotically optimal when rc=rs> ffiffiffi p 2 to achieve four-connectivity and full coverage. We also discover another new deployment pattern called the Double-strip pattern. This pattern provides a new aspect to research on optimal deployment patterns. Our work is the first to propose an asymptotically optimal deployment pattern to achieve four-connectivity and full coverage for WSNs. Our work also provides insights on how optimal patterns evolve and how to search for them. Index Terms—Wireless sensor networks, topology, full coverage, four-connectivity, optimal deployment pattern. Ç 1
Placement and Orientation of Rotating Directional Sensors
"... Abstract—In this paper, we address several problems that arise in the context of rotating directional sensors. Rotating directional sensors (RDS) have a “directional ” coverage region that “rotates” at a certain speed. For RDS with fixed given locations, we address three problems with the objective ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper, we address several problems that arise in the context of rotating directional sensors. Rotating directional sensors (RDS) have a “directional ” coverage region that “rotates” at a certain speed. For RDS with fixed given locations, we address three problems with the objective to minimize different functions of the dark time (i.e., uncovered time) of the given points in the area. In addition, we also consider the problem of placement and orientation of the minimum number of given RDS, so as to reduce the dark time of all given points to zero. Finally, we address the barrier coverage problems wherein we wish to place and/or orient the RDS to ensure “detection ” of maximum number of intruders who are attempting to cross the monitored area. We prove the addressed problems to be NP-hard; some of the them are showed to be even NP-hard to approximate. We provide approximation algorithms which are easy to decentralize. I.
Approximating barrier resilience in wireless sensor networks
"... Abstract. Barrier coverage in a sensor network has the goal of ensuring that all paths through the surveillance domain joining points in some start region ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
(Show Context)
Abstract. Barrier coverage in a sensor network has the goal of ensuring that all paths through the surveillance domain joining points in some start region
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.
