Skip to Main Content
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.
Date of Conference: 25-27 June 2010