Abstract

In recent years several studies have been carried to explore the potential metrics of a mobile sink node to optimize the complex WSN routing and also to regulate the packet delivery rate among the sensor nodes. However, it has major limitations particularly in delay-bound applications, where all data gathered must be forwarded within a given time delay. These bound delays are dependent on the travelling path taken by the mobile sink. Here in order to regulate the mobile sink path a hybrid approach is proposed to address this challenge and also formulated new moving pattern where the mobile-sink node visits only rendezvous points (RPs), as opposed to travelling each nodes in WSN. Information from all other nodes all Sensor nodes that are not RPs forward their payload data via multi-hopping to the nearest RP. Then two basic fundamental problems are arises: computation of mobile sink travelling paths that can visit all RPs within a given time delay and conserving the energy consumption of mobile sink to improve the life time of the WSN. To address the first problem, a heuristic called adoptive rendezvous planning (WRP) is proposed, where each sensor node is assigned a priority corresponding to its hop distance from the mobile sink path taken and the traffic rate that forwards to the closest RP. And energy aware local routing is used for energy efficiency. Finally RP based mobile sink model is validated via extensive network simulation, and through simulation results we proved that proposed RP model allows mobile sink to gather all information within a given time while. Local routing for each RP node reduces energy consumption by 39% and increases network lifetime by 12%, as compared with all other state-of-the-art algorithms.

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.