Obstacle-Aware Wireless Video Sensor Network Deployment For 3D Indoor Space Monitoring

In recent years wireless video sensors networks (WVSNs) have emerged as a leading technology for monitoring 3D indoor space in campus, industrial and medical areas as well as other types of environments. In contrast to traditional sensors such as heat or light sensors often considered with omnidirectional sensing range, the sensing range of a video sensor is directional and can be deemed as a pyramid-shape in 3D. Moreover, in an indoor environment, there are often obstacles such as lamp stands or furniture, which introduce additional challenges and further render the deployment solutions for traditional sensors and 2D sensing field inapplicable or incapable of solving the WVSN deployment problem for 3D indoor space monitoring. In this thesis, we take the first attempt to address this by modeling the general problem in a continuous space and strive to minimize the number of required video sensors to cover the given 3D regions. We then convert it into a discrete version by incorporating 3D grids for our discrete model, which can achieve arbitrary approximation precision by adjusting the grid granularity. We also create two strategies for dealing with stationary obstacles existed in the 3D indoor space, namely, Divide and Conquer Detection strategy and Accurate Detection strategy. We propose a greedy heuristic and an enhanced Depth First Search (DFS) algorithm to solve the discrete version problem where the latter, if given enough time can return the optimal solution. We evaluate our solutions with a customized simulator that can emulate the actual WVSN deployment and 3D indoor space coverage. The evaluation results demonstrate that our greedy heuristic can reduce the required video sensors by up to 47% over a baseline algorithm, and our enhanced DFS can achieve an additional reduction of video sensors by up to 25%

Deployment, Coverage And Network Optimization In Wireless Video Sensor Networks For 3D Indoor Monitoring

As a result of extensive research over the past decade or so, wireless sensor networks (wsns) have evolved into a well established technology for industry, environmental and medical applications. However, traditional wsns employ such sensors as thermal or photo light resistors that are often modeled with simple omni-directional sensing ranges, which focus only on scalar data within the sensing environment. In contrast, the sensing range of a wireless video sensor is directional and capable of providing more detailed video information about the sensing field. Additionally, with the introduction of modern features in non-fixed focus cameras such as the pan, tilt and zoom (ptz), the sensing range of a video sensor can be further regarded as a fan-shape in 2d and pyramid-shape in 3d. Such uniqueness attributed to wireless video sensors and the challenges associated with deployment restrictions of indoor monitoring make the traditional sensor coverage, deployment and networked solutions in 2d sensing model environments for wsns ineffective and inapplicable in solving the wireless video sensor network (wvsn) issues for 3d indoor space, thus calling for novel solutions. In this dissertation, we propose optimization techniques and develop solutions that will address the coverage, deployment and network issues associated within wireless video sensor networks for a 3d indoor environment. We first model the general problem in a continuous 3d space to minimize the total number of required video sensors to monitor a given 3d indoor region. We then convert it into a discrete version problem by incorporating 3d grids, which can achieve arbitrary approximation precision by adjusting the grid granularity. Due in part to the uniqueness of the visual sensor directional sensing range, we propose to exploit the directional feature to determine the optimal angular-coverage of each deployed visual sensor. Thus, we propose to deploy the visual sensors from divergent directional angles and further extend k-coverage to ``k-angular-coverage\u27\u27, while ensuring connectivity within the network. We then propose a series of mechanisms to handle obstacles in the 3d environment. We develop efficient greedy heuristic solutions that integrate all these aforementioned considerations one by one and can yield high quality results. Based on this, we also propose enhanced depth first search (dfs) algorithms that can not only further improve the solution quality, but also return optimal results if given enough time. Our extensive simulations demonstrate the superiority of both our greedy heuristic and enhanced dfs solutions. Finally, this dissertation discusses some future research directions such as in-network traffic routing and scheduling issues