Dominating Set Based Routing
André Schumacher · 2003
The task of constructing stable and e cient routing algorithms for ad hoc networks represents a greater challenge compared to routing in networks based on a fixed and wired infrastructure. One has to deal with mobility as well as lack of energy and computation resources. Abstracting the view on the network as a graph model gives the chance to use the full arsenal of algorithms and concepts that are well known from graph theory. Routing based on dominating sets is such an approach.