body: <record xmlns="http://www.openarchives.org/OAI/2.0/">
                          <header>
                              <identifier>oai:research.chalmers.se:182509</identifier>
                              <datestamp>2018-06-15T13:13:55Z</datestamp>
                              <setSpec>openaire</setSpec>
                          </header>
                          <metadata>
                              <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
                                  <dc:title>Self-Stabilizing TDMA Algorithms for Dynamic Wireless Ad Hoc Networks</dc:title>
                                  <dc:identifier>https://research.chalmers.se/en/publication/182509</dc:identifier>
                                  <dc:date>2013</dc:date>
                                              <dc:creator>Leone, P.</dc:creator>
                                              <dc:creator>Schiller, Elad</dc:creator>
                                                  <dc:subject>Computer Science</dc:subject>
                                          <dc:description>In dynamic wireless ad hoc networks (DynWANs), autonomous computing devices set up a network for the communication needs of the moment. These networks require the implementation of a medium access control (MAC) layer. We consider MAC protocols for DynWANs that need to be autonomous and robust as well as have high bandwidth utilization, high redictability degree of bandwidth allocation, and low communication delay in the presence of frequent topological changes to the communication network. Recent studies have shown that existing implementations cannot guarantee the necessary satisfaction of these timing requirements. We propose a self-stabilizing MAC algorithm for DynWANs that guarantees a short convergence period, and by that, it can facilitate the satisfaction of severe timing requirements, such as the above. Besides the contribution in the algorithmic front of research, we expect that our proposal can enable quicker adoption by practitioners and faster deployment of DynWANs that are subject changes in the network topology.</dc:description>
                                                                  <dc:relation>info:eu-repo/grantAgreement/EC/FP7/288195//Kernel-based ARchitecture for safetY-critical cONtrol (Karyon)/</dc:relation>
                                                  <dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1155/2013/639761</dc:relation>
                                          <dc:type>info:eu-repo/semantics/article</dc:type>
                                          <dc:source>International Journal of Distributed Sensor Networks (1550-1329) vol.2013(2013)</dc:source>
                                                      <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:language>eng</dc:language>
                                  <dc:audience>Researchers</dc:audience>
                                  <dc:format>application/pdf</dc:format>
                              </oai_dc:dc>
                          </metadata>
                      </record>