Performance of Prediction in Wireless Ad Hoc Routing Algorithms
H. Larkin · 2006
Existing wireless ad hoc routing protocols suffer from unexpected dropoffs and delays in re-establishing routes. This is due to both the mobility of nodes and the varying signal propagation environments within which nodes operate. The ability to predict when the future communication capability between two or more wireless nodes terminate offers a significant solution to unexpected dropoffs by predicting them. In predicting them it becomes possible for routing algorithms to handover connections to more stable routes in a controlled manner. Several algorithms have been designed which aim to predict such events, however to date no comparison study has been performed on the effectiveness of their designs. This paper provides the first known comparison between a number of solutions which aim to improve connectivity in wireless ad hoc routing protocols.