Abstract
Global flooding and expanding ring search are two commonly used methods in searching for an interested object in multi-hop wireless networks. Global flooding is not scalable for large networks. To take advantage of expanding ring search, in this paper, we propose an improved algorithm named HP-ERS-AODV which executes an efficient route discovery scheme by predicting current location of destination using hop counts of history. We provide detailed performance evaluation using simulation modeling and compare HP-ERS-AODV with both ERS-AODV and Flood-AODV. Our findings show that HP-ERS-AODV outperforms both ERS-AODV and Flood-AODV by reducing end-to-end delay and by improving routing overhead.
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.
