By Topic

A Robust, Responsive, Distributed Tree-Based Routing Algorithm Guaranteeing N Valid Links per Node in Wireless Ad-Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ikikardes, T. ; Siemens Switzerland, Zurich ; Hoftauer, M. ; Kaelin, A. ; May, M.

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.

Published in:

Computers and Communications, 2007. ISCC 2007. 12th IEEE Symposium on

Date of Conference:

1-4 July 2007