TLDV: Tree-Like Locator Distance Vector routing protocol for MANETs

Abstract

Most routing protocols in MANETs don't scale well in networks with large numbers of nodes where the scalability of the routing protocols plays a vital role. And it is well known that these routing protocols usually use node locator (e.g. IP address) as pure identifier. In this paper, we propose a scalable Tree-Like Locator Distance Vector routing protocol for MANETs, which is inspired by DART. This protocol splits node's ID and locator in network layer. Each node has one unique permanent ID and a temporary dynamic 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">b</sup> -ary tree locator. Node's locator describes the node's relative position in the network's topology, and should change whenever the topology changes.