TBRA: A scalable routing algorithm in highly mobile large scale pure ad hoc wireless mesh networks

In highly mobile pure ad-hoc wireless mesh networks, fast rerouting within low routing discovery delay is a mandatory requirement for routing algorithm to support interactive applications such as VoIP. Also, the communication overhead should be thwarted when networks grow to a large scale. We propose a tree-based routing algorithm - TBRA to facilitate such two goals. On one hand, TBRA has very low routing discovery delay due to its proactive property. On the other hand, TBRA performs more efficiently than other proactive protocols with respect to low communication overhead, which thanks to its short routing packet length, less numbers and smaller routing table size. Our modeling analysis and simulation results verify that routing setup delay of TBRA grows only linear to hop counts (scalable to node´s speed) and communication overhead increases only linear to the number of nodes.