1 Ocak 2020 Konferans bildirisi Açık Erişim

Atabay, Doga Can; Uysal, Elif; Kaya, Onur

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" 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:creator>Atabay, Doga Can</dc:creator>
  <dc:creator>Uysal, Elif</dc:creator>
  <dc:creator>Kaya, Onur</dc:creator>
  <dc:date>2020-01-01</dc:date>
  <dc:description>We study Age of Information (AoI) in a random access channel where a number of devices try to send status updates over a common medium. Assuming a time-slotted scenario where multiple transmissions result in collision, we propose a threshold-based lazy version of Slotted ALOHA and derive the time average AoI achieved by this policy. We demonstrate that the average AoI performance of the lazy policy is significantly better than Slotted ALOHA, and close to the ideal round robin benchmark.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/3137</dc:identifier>
  <dc:identifier>oai:zenodo.org:3137</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:title>Improving Age of Information in Random Access Channels</dc:title>
  <dc:type>info:eu-repo/semantics/conferencePaper</dc:type>
  <dc:type>publication-conferencepaper</dc:type>
</oai_dc:dc>