Abstract
Node deployment is a matter of considerable concern in designing wireless sensor networks (WSNs). This paper studies this issue in the context of rechargeable WSNs (RWSNs). We propose an efficient algorithm, namely node deployment for target coverage in RWSNs (NDTCR), which determines the number and positions of installed sensors in two phases. The first phase applies genetic algorithm to construct a mesh over a subset of positions. The mentioned mesh covers the targets and connects them to the sink. In the second phase of NDTCR, we propose an integer linear programming (ILP) model to install some sensors at each position of the mesh. The advantage of applying the first phase is that it prunes the solution space considerably. Therefore, the proposed ILP model can be solved in a reasonable time. The experimental results demonstrate that NDTCR requires 29% fewer sensors on average in comparison with the previous approaches.
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.
