Abstract
Efficient sensor node deployment is extremely important in wireless sensor networks. It earns great practical meanings through using fewer sensor nodes as far as possible to satisfy different requirements such as the requirement on coverage and overcoming the potential sensor node failures and the adverse influence from the environment. We propose an efficient approach for the deployment of sensor nodes in wireless networks, termed as EDSNDA, which is excellent in taking both the requirements of sensor coverage and network connectivity into consideration when minimizing the number of necessary sensor nodes to the best of its ability. We proposed a new coverage model of sensor node. Based on the sensor coverage model, we establish four dynamic programming models in four different practical situations, respectively. The algorithms are then proposed which are used for solving the corresponding dynamic programming models. The validity of the method is justified by simulation studies in which the method is compared with the current representative methods. The simulation results show that our method performs better than the other ones with fewer sensor nodes, better coverage and network connectivity result in the same circumstance.
Published Version
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.
