Resource Efficient Maintenance of 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 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. -graph) and some also known related models, which will be called the SymmYgraph (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 o...

• Type: Journal
• Year: 2006
• Where: JUCS
• Authors: Tamás Lukovszki, Christian Schindelhauer, Klaus Volbert
• Keywords: Ad Hoc, Basic Networks, JUCS 2006, Mobile Ad Hoc Network