Abstract
The directional connected target coverage (DCTC) problem that schedules directional sensors to cover all targets and forward target information back to the sink to maximize system lifetime is still an important research issue in directional sensor networks. In this paper, a Sector Cover and Transmission Weighted Greedy Algorithm (SCTW-greedy algorithm) is proposed to construct the scheduling of sensors for the DCTC problem. The directional sensor nodes used in the previous works are composed of fixed number of sensors, and the orientations of sensors are fixed. This paper considers the directional sensors with arbitrary sensing orientations. To evaluate the performance of the proposed algorithm, several simulations are conducted. Experimental results show that our algorithm can contribute to extending the network lifetime than previous algorithms.
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.
