Resource Efficient Maintenance of Wireless Network Topologies

Tamás Lukovszki, Christian Schindelhauer, Klaus Volbert


Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if the routes are restricted to a basic network based on local neighborhoods, these interferences can be reduced such that standard routing algorithms can be applied.

We compare different network topologies for these basic networks, i.e. the Yao-graph (aka. Theta-graph and some also known related models, which will be called the SymmY-graph (aka. YS-graph), the SparsY-graph (aka. YY-graph and the BoundY-graph. Further, we present a promising network topology called the HL-graph (based on Hierarchical Layers).

We compare these topologies regarding degree, spanner-properties, and communication features. We investigate how these network topologies bound the number of (uni- and bidirectional) interferences and whether these basic networks provide energy-optimal or congestion-minimal routing. Then, we compare the ability of these topologies to handle dynamic changes of the network when radio stations appear and disappear. For this we measure the number of involved radio stations and present distributed algorithms for repairing the network structure.