Dynamic (reactive or on-demand) routing protocols used in wireless ad hoc networks suffer from transmitting a huge number of control packets during the route discovery phase of the protocols, which increases the overhead significantly. Therefore, a number of optimization protocols have been developed throughout the years. This chapter compares the performance of various route discovery algorithms in ad hoc wireless networks, namely, pure flooding, probabilistic, Location-Aided Routing scheme 1 (LAR-1), LAR-1-Probabilsitic (LAR-1P), and Optimal Multipoint Relying (OMPR). The results obtained through the different simulations are analyzed and compared. This chapter will help practitioners of various kinds (academics, professionals, researchers, and students) grasp a solid understanding of the behavior of ad hoc wireless network route discovery algorithms and develop an appreciation for flooding optimization mechanisms. It also substantiates the case of experimenting via simulation with such models and shows how the different simulation parameters interplay.
Intelligent route discovery towards rushing attacks in ad hoc wireless networks