Abstract
In Wireless Sensor Network the delay in delivery of data problem can be reduced by using mobile sink. Mobility of the sink has been demonstrated to be the best method to reduce delay in the network. So the path selection for the movement of the sink plays an important role. Hence the selection of minimum number of stopping points are called Rendezvous Points (RPs) is very challenging in WSNs. So a productive procedure was proposed to choose the RPs to develop path for moving sink. At first set of potential points will be generated by using a technique and then using greedy algorithm the RPs were selected from the potential points set. Then an optimization method is used to get still more optimized points. At that point these points are utilized to select path for sink. Proposed algorithm was simulated with some current algorithms and results will be compared based on different performance metrics to demonstrate the viability of the present work.
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 callMore From: International Journal of Recent Technology and Engineering (IJRTE)
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.
