EFFICIENT CAMERA SELECTION FOR MAXIMIZED TARGET COVERAGE IN UNDERWATER ACOUSTIC SENSOR NETWORKS

In Underwater Acoustic Sensor Networks (UWASNs), cameras have recently been deployed for enhanced monitoring. However, their use has faced several obstacles. Since video capturing and processing consume significant amounts of camera battery power, they are kept in sleep mode and activated only when ultrasonic sensors detect a target. The present study proposes a camera relocation structure in UWASNs to maximize the coverage of detected targets with the least possible vertical camera movement. This approach determines the coverage of each acoustic sensor in advance by getting the most applicable cameras in terms of orientation and frustum of camera in 3-D that are covered by such sensors. Whenever a target is exposed, this information is then used and shared with other sensors that detected the same target. Compared to a flooding-based approach, experiment results indicate that this proposed solution can quickly capture the detected targets with the least camera movement

Sensor Coverage Strategy in Underwater Wireless Sensor Networks

This paper mainly describes studies hydrophone placement strategy in a complex underwater environment model to compute a set of "good" locations where data sampling will be most effective. Throughout this paper it is assumed that a 3-D underwater topographic map of a workspace is given as input.Since the negative gradient direction is the fastest descent direction, we fit a complex underwater terrain to a differentiable function and find the minimum value of the function to determine the low-lying area of the underwater terrain.The hydrophone placement strategy relies on gradient direction algorithm that solves a problem of maximize underwater coverage: Find the maximize coverage set of hydrophone inside a 3-D workspace. After finding the maximize underwater coverage set, to better take into account the optimal solution to the problem of data sampling, the finite VC-dimension algorithm computes a set of hydrophone that satisfies hydroacoustic signal energy loss constraints. We use the principle of the maximize splitting subset of the coverage set and the ”dual” set of the coverage covering set, so as to find the hitting set, and finally find the suboptimal set (i.e., the sensor suboptimal coverage set).Compared with the random deployment algorithm, although the computed set of hydrophone is not guaranteed to have minimum size, the algorithm does compute with high network coverage quality

Coverage and Connectivity in Three-Dimensional Networks

Most wireless terrestrial networks are designed based on the assumption that the nodes are deployed on a two-dimensional (2D) plane. However, this 2D assumption is not valid in underwater, atmospheric, or space communications. In fact, recent interest in underwater acoustic ad hoc and sensor networks hints at the need to understand how to design networks in 3D. Unfortunately, the design of 3D networks is surprisingly more difficult than the design of 2D networks. For example, proofs of Kelvin's conjecture and Kepler's conjecture required centuries of research to achieve breakthroughs, whereas their 2D counterparts are trivial to solve. In this paper, we consider the coverage and connectivity issues of 3D networks, where the goal is to find a node placement strategy with 100% sensing coverage of a 3D space, while minimizing the number of nodes required for surveillance. Our results indicate that the use of the Voronoi tessellation of 3D space to create truncated octahedral cells results in the best strategy. In this truncated octahedron placement strategy, the transmission range must be at least 1.7889 times the sensing range in order to maintain connectivity among nodes. If the transmission range is between 1.4142 and 1.7889 times the sensing range, then a hexagonal prism placement strategy or a rhombic dodecahedron placement strategy should be used. Although the required number of nodes in the hexagonal prism and the rhombic dodecahedron placement strategies is the same, this number is 43.25% higher than the number of nodes required by the truncated octahedron placement strategy. We verify by simulation that our placement strategies indeed guarantee ubiquitous coverage. We believe that our approach and our results presented in this paper could be used for extending the processes of 2D network design to 3D networks.Comment: To appear in ACM Mobicom 200

On Mobility Management in Multi-Sink Sensor Networks for Geocasting of Queries

In order to efficiently deal with location dependent messages in multi-sink wireless sensor networks (WSNs), it is key that the network informs sinks what geographical area is covered by which sink. The sinks are then able to efficiently route messages which are only valid in particular regions of the deployment. In our previous work (see the 5th and 6th cited documents), we proposed a combined coverage area reporting and geographical routing protocol for location dependent messages, for example, queries that are injected by sinks. In this paper, we study the case where we have static sinks and mobile sensor nodes in the network. To provide up-to-date coverage areas to sinks, we focus on handling node mobility in the network. We discuss what is a better method for updating the routing structure (i.e., routing trees and coverage areas) to handle mobility efficiently: periodic global updates initiated from sinks or local updates triggered by mobile sensors. Simulation results show that local updating perform very well in terms of query delivery ratio. Local updating has a better scalability to increasing network size. It is also more energy efficient than ourpreviously proposed approach, where global updating in networks have medium mobility rate and speed

Factors that May Influence the Performance of Wireless Sensor Networks

International audienc