Distributed maintenance of resource efficient wireless network topologies

Abstract

Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remains. 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 with respect to degree, spanner-properties, radio interferences, energy, and congestion, i.e. the Yao-graph (aka. Θ-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). Further, 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.