Improving age of information in random access channels
dc.authorid | 0000-0002-9133-4190 | |
dc.authorid | 0000-0002-7258-4872 | |
dc.authorid | 0000-0003-2592-3701 | |
dc.contributor.author | Atabay, Doğa Can | en_US |
dc.contributor.author | Uysal, Elif | en_US |
dc.contributor.author | Kaya, Onur | en_US |
dc.date.accessioned | 2020-10-05T08:28:21Z | |
dc.date.available | 2020-10-05T08:28:21Z | |
dc.date.issued | 2020-07 | |
dc.department | Işık Üniversitesi, Mühendislik Fakültesi, Elektrik-Elektronik Mühendisliği Bölümü | en_US |
dc.department | Işık University, Faculty of Engineering, Department of Electrical-Electronics Engineering | en_US |
dc.description.abstract | 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. | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.citation | Kaya, O., Atabay, D. C. & Uysal, E. (2020). Improving age of information in random access channels. Paper presented at the IEEE International Conference on Computer Communications, 912-917. doi:10.1109/INFOCOMWKSHPS50562.2020.9163053 | en_US |
dc.identifier.endpage | 917 | |
dc.identifier.isbn | 9781728186955 | |
dc.identifier.issn | 2159-4228 | |
dc.identifier.scopus | 2-s2.0-85091513073 | |
dc.identifier.scopusquality | N/A | |
dc.identifier.startpage | 912 | |
dc.identifier.uri | https://hdl.handle.net/11729/2543 | |
dc.identifier.uri | http://dx.doi.org/10.1109/INFOCOMWKSHPS50562.2020.9163053 | |
dc.identifier.wos | WOS:000593830400151 | |
dc.identifier.wosquality | N/A | |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.indekslendigikaynak | Conference Proceedings Citation Index – Science (CPCI-S) | en_US |
dc.institutionauthor | Kaya, Onur | en_US |
dc.institutionauthorid | 0000-0003-2592-3701 | |
dc.language.iso | en | en_US |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | en_US |
dc.relation.isversionof | 10.1109/INFOCOMWKSHPS50562.2020.9163053 | |
dc.relation.journal | IEEE International Conference on Computer Communications | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Age minimization | en_US |
dc.subject | Age of information | en_US |
dc.subject | Random access | en_US |
dc.subject | Slotted ALOHA | en_US |
dc.subject | Communication | en_US |
dc.subject | Computer networks | en_US |
dc.subject | Multiple transmission | en_US |
dc.subject | Random access channel | en_US |
dc.subject | Round Robin | en_US |
dc.subject | Status updates | en_US |
dc.subject | Time averages | en_US |
dc.subject | Benchmarking | en_US |
dc.subject | Access protocols | en_US |
dc.subject | Average AoI performance | en_US |
dc.subject | Common medium | en_US |
dc.subject | Delays | en_US |
dc.subject | Lazy policy | en_US |
dc.subject | Markov processes | en_US |
dc.subject | Multi-access systems | en_US |
dc.subject | Multiple transmissions | en_US |
dc.subject | Steady-state | en_US |
dc.subject | Synchronization | en_US |
dc.subject | Threshold-based lazy version | en_US |
dc.subject | Time average AoI | en_US |
dc.subject | Time-slotted scenario | en_US |
dc.subject | Wireless channels | en_US |
dc.subject | Wireless communication | en_US |
dc.subject | Wireless sensor networks | en_US |
dc.title | Improving age of information in random access channels | en_US |
dc.type | Conference Object | en_US |