Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Distributed Maintenance of Resource Efficient Wireless Network Topologies
Extended Abstract
| |
|
Distributed Maintenance of Resource Efficient Wireless Network Topologies
Extended Abstract
Matthias Grünewald5, Tamás Lukovszki5, Christian Schindelhauer5 and Klaus Volbert5
| (5) |
Heinz Nixdorf Institute, Paderborn University, USA |
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.
Dept. of Electrical Engineering and Information Technology, System & Circuit Technology, gruenewa@hni.uni-paderborn.de. Partially
supported by the DFG-SFB 376.
Dept. of Mathematics and Computer Science, tamas@hni.upb.de, hindel, kvolbert@upb.de. Partially supported by the DFG-SFB 376 and by the Future and Emerging Technologies programme of the EU, contract
nr. IST-1999-14186 (ALCOM-FT).
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|