Content area
Full text
Junguo Zhang 1 and Yutong Lei 1 and Chen Chen 2 and Fantao Lin 3
Academic Editor:Janos Botzheim
1, School of Technology, Beijing Forestry University, Beijing 100083, China
2, Department of Electrical Engineering, University of Texas at Dallas, Richardson, TX 75080, USA
3, China Electric Power Research Institute, Beijing 100192, China
Received 6 October 2015; Revised 7 March 2016; Accepted 29 March 2016; 17 April 2016
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.
1. Introduction
In recent years, with the rapid development of wireless multimedia technology, visual sensor nodes are receiving significant attention [1], which leads to the emergence of directional sensor network [2]. In order to ensure normal operation of the directional sensor network, the sensor nodes in internal target area need to deploy well.
The node deployment is the first step in wireless sensor networks [3]; it is directly related to accuracy, integrity, and effectiveness of the network monitoring information.
According to different methods of nodes deployment, wireless sensor networks can be divided into random deployment and deterministic deployment. When using directional sensing node for monitoring area coverage, it can be divided into Boolean model [4] deployment and probability model [5] deployment according to the node sensing model.
Most of the researches on directional coverage are focused on the Boolean model in random deployment. Gupta et al. [6] addressed the problem of optimal deployment in terms of the number of nodes required to achieve [figure omitted; refer to PDF] -coverage in [figure omitted; refer to PDF] -connected. The communication is the region over which a node can communicate with others. The object of study was omnidirectional nodes, and the characteristics of directional nodes are different from them. Li et al. [7] derived a variant of perceived direction of nodes and developed a node scheduling rule and distributed algorithm. In the three-dimensional space, Fan et al. [8] presented a distributed 3D localization scheme for an irregular wireless sensor network using multidimensional scaling. Greedy algorithm was proposed in [9] to solve the problem of random area maximum deployment. Sung and Yang [10] utilized the structure and characteristic of Voronoi cells and proposed...