Abstract
Data collection using mobile sink is a popular method that mitigates the sink hole problem in wireless sensor networks. In this regard, rendezvous point based data collection is a well-researched topic as it overcomes the problems of latency in data delivery and the scalability of the network. However, finding the optimal number of rendezvous points and their locations for the construction of the mobile sink tour is a challenging issue. An optimal path reduces delay in data collection and balances the energy consumption of the network. In this paper, we propose an algorithm that builds an efficient path for the mobile sink. The algorithm is based on the affinity propagation clustering which obtains an optimal set of rendezvous points. The extensive simulation results of the proposed algorithm show better performance over the existing algorithms in terms of number of the rendezvous points and path length.
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.
