Abstract

In a multi-hop WSN a sensor node spends most of its energy for relaying data packets due to which energy reduction is one of the major issue in the designing of a wireless sensor network to prolong the lifetime of a network. One of the solutions of this problem is to shorten the hop distance a sensor's data that has to travel until reaching the sink. These distances can be reduced effectively by deploying multiple sinks instead of one and every sensor communicates with its closest sink. In order to achieve the shortest distances the sinks have to be deployed carefully. In this paper we have considered the problem of optimal deployment of k sink nodes in a wireless sensor network for minimizing average hop distance between sensors and its nearest sink with maximizing degree of each sink node which can solve hot spot problem which is another critical issue of WSN design. Given a wireless sensor network where the location of each sensor node is known, partition the whole sensor network into k disjoint clusters and place sink nodes optimally. We propose multi sink placement algorithm, based on Particle swarm optimization. The simulation results show that our proposed optimization based algorithm perform better over algorithm without optimization.

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.