A Robust, Responsive, Distributed Tree-Based Routing Algorithm Guaranteeing N Valid Links per Node in Wireless Ad-Hoc Networks
Tunc Ikikardes, Markus Hofbauer, A. Kaelin, Martin May · 2007
In this paper, we present two new tree growing algorithms. The pairing algorithm allows for the local approximate implementation of global algorithms such as Prim's or Dijkstra 's algorithm. A node requires only information from its neighborhood acquired by local message exchange. Any global cost function that can be locally calculated can be used with this algorithm. The N-SafeLinks Algorithm establishes look-up tables with N possible links per node. Implementing an additional constraint it is guaranteed that each link leads to the sink, ruling out the possibility of loops. Therefore, if maximal N-l links per node are broken there is still a guaranteed connection to the destination node (sink) for every node. A proof of this property is presented. As demonstrated in simulations the trees are close to optimum. The algorithms can be utilized for static routing in wireless single-sink Ad-Hoc networks with safety critical applications where timeliness, robustness and energy efficiency is crucial.