• search hit 3 of 4
Back to Result List

Resource efficient maintenance of wireless network topologies

  • 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 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.

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics
Metadaten
Author:Tamas Lukovszki, Christian Schindelhauer, Klaus VolbertORCiD
DOI:https://doi.org/10.3217/jucs-012-09-1292
Parent Title (English):Journal of Universal Computer Science
Publisher:Verlag der Technischen Universität Graz
Document Type:Article
Language:English
Year of first Publication:2006
Release Date:2022/11/30
Tag:ad hoc networks; distributed algorithms; topology control
Volume:12
Issue:9
First Page:1292
Last Page:1311
Institutes:Fakultät Informatik und Mathematik
Publication:Externe Publikationen
research focus:Digitalisierung
Licence (German):Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG