Virtual Trellis Routing: how Regular Structures can ease Network Layer operations
Résumé
The mobility characteristic of Ad Hoc and Sensor networks implies that the topological information contained in the traditional IP address can no longer reflect the position of a node in the network. In this paper we propose a new approach to resolve the location-identification coupling contained in the IP address. The approach uses a Virtual Regular Structure (VRS) to describe the addressing space of the entire network; such a structure provides additional desired properties such as robustness and multi-paths. Our approach explores a distributed implementation of the VRS based on a trellis graph description of routing tables instead of the traditional trees. We show that the construction of the optimal structure is an NP-Complete problem; in this paper, we propose a heuristic and evaluate its performance via simulations.