Current flat-id based routing schemes promise support for mobility and scalability. However, providing efficient routing with minimal overheads for mobility is still a challenge. In this paper we provide a solution to these problems by introducing Virtual Id Routing (VIR). VIR meets these basic requirements of future id-based routing schemes: namely, i) scalability–by using distributed hash table based routing framework; ii) mobility support–by separating the nodeidentifier from the network location; and iii) routing efficiency– by exploiting network topology information, which is done by introducing a dynamic, self-organizing virtual id (vid) space layer in between the node id space (uid) andthe network topology. Preliminary evaluation of the protocol shows promising results, specifically routing stretch for VIR is very close to 1, and the overheads due to mobility are also much smaller than existing schemes such as VRR
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.