<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>5248</id>
    <completedYear/>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1292</pageFirst>
    <pageLast>1311</pageLast>
    <pageNumber/>
    <edition/>
    <issue>9</issue>
    <volume>12</volume>
    <type>article</type>
    <publisherName>Verlag der Technischen Universität Graz</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Resource efficient maintenance of wireless network topologies</title>
    <abstract language="eng">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.&#13;
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).&#13;
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&#13;
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.</abstract>
    <parentTitle language="eng">Journal of Universal Computer Science</parentTitle>
    <identifier type="doi">10.3217/jucs-012-09-1292</identifier>
    <enrichment key="opus.import.date">2022-08-20T07:06:56+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Tamas Lukovszki</author>
    <author>Christian Schindelhauer</author>
    <author>Klaus Volbert</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>ad hoc networks</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>topology control</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>distributed algorithms</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
  </doc>
</export-example>
