Abstract

WSN has been playing a significant role in various applications in recent days. The main issue in wireless sensor network, particularly for target coverage problem is to achieve maximum quality of coverage with limited sensors. To short out these issues, identify the optimal position for each sensor to satisfy the coverage requirement. This paper proposes a particle swarm optimization for Q-Coverage problem, where each target can be covered by one or more sensors. The main objective of the proposed algorithm is to optimize the position of sensors for satisfying Q-Coverage constraints. Simulation results show that the proposed algorithm achieves a good Q-coverage compared with random deployment of sensors.

Full Text
Paper version not known

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 call

Disclaimer: 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.