Abstract
In this paper, we study the area coverage of directional sensor networks (DSNs) with random node distribution. The coverage of DSNs depends on the sensor’s locations, the sensing radiuses, and the working directions, as well as the angle of view (AoV), which is challenging to analyze. We transform the network area coverage problem into cell coverage problems by exploiting the Voronoi diagram, which only needs to optimize local coverage for each cell in a decentralized way. To address the cell coverage problem, we propose three local coverage optimization algorithms to improve the cell coverage, namely Move Inside Cell Algorithm (MIC), Rotate Working Direction Algorithm (RWD) and Rotation based on boundary (RB), respectively. Extensive simulations are performed to prove the effectiveness of our proposed algorithms in terms of the coverage ratio.
Highlights
With the rapid development of information technologies, wireless sensor networks (WSNs) are playing an increasingly important role in environment monitoring, disaster rescuing target tracking, and industrial process control, etc
Compared with the WSNs, the nodes in directional sensor networks (DSNs) have the ability of directional sensing, which results in a lower energy consumption and mutual interference
We studied the area coverage problem of DSNs
Summary
With the rapid development of information technologies, wireless sensor networks (WSNs) are playing an increasingly important role in environment monitoring, disaster rescuing target tracking, and industrial process control, etc. The sensor nodes are deployed in a target area to collect environment information for further processing Such a complex network calls for novel approaches for system design to make it operate efficiently. Due to its flexibility with rotation and lower energy consumption, directional sensor networks (DSNs) have been widely investigated in the literature. Compared with the WSNs, the nodes in DSNs have the ability of directional sensing, which results in a lower energy consumption and mutual interference. We adopt a Voronoi diagram to investigate the coverage problem of DSNs with random node deployment. By adopting a node’s moving or rotation actions, we propose three local coverage optimization algorithms to improve the cell coverage, i.e., Move Inside Cell Algorithm (MIC), Rotate Working. Conclusions and future works are shown in the final section
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
