Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/7655
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jakovetić, Dušan | en |
dc.contributor.author | Bajović, Dragana | en |
dc.contributor.author | Vukobratović, Dejan | en |
dc.contributor.author | Crnojević, Vladimir | en |
dc.date.accessioned | 2019-09-30T09:03:28Z | - |
dc.date.available | 2019-09-30T09:03:28Z | - |
dc.date.issued | 2014-01-01 | en |
dc.identifier.isbn | 9781479951864 | en |
dc.identifier.issn | 21578095 | en |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/7655 | - |
dc.description.abstract | We consider framed slotted Aloha where m base stations cooperate to decode messages from n users. Users and base stations are placed uniformly at random over an area. At each frame, each user sends multiple replicas of its packet according to a prescribed distribution, and it is heard by all base stations within the communication radius r. Base stations employ a decoding algorithm that utilizes the successive interference cancellation mechanism, both in space-across neighboring base stations, and in time-across different slots, locally at each base station. We show that there exists a threshold on the normalized load G = n/(τm), where τ is the number of slots per frame, below which decoding probability converges asymptotically (as n, m, τ → ∞, r → 0) to the maximal possible value-the probability that a user is heard by at least one base station, and we find a lower bound on the threshold. Further, we give a heuristic evaluation of the decoding probability based on the and-or-tree analysis. Finally, we show that the peak throughput increases linearly in the number of base stations. © 2014 IEEE. | en |
dc.relation.ispartof | IEEE International Symposium on Information Theory - Proceedings | en |
dc.title | Slotted Aloha for networked base stations with spatial and temporal diversity | en |
dc.type | Conference Paper | en |
dc.identifier.doi | 10.1109/ISIT.2014.6875099 | en |
dc.identifier.scopus | 2-s2.0-84906539576 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84906539576 | en |
dc.relation.lastpage | 1582 | en |
dc.relation.firstpage | 1578 | en |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.dept | Departman za matematiku i informatiku | - |
crisitem.author.dept | Departman za energetiku, elektroniku i telekomunikacije | - |
crisitem.author.dept | Departman za energetiku, elektroniku i telekomunikacije | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
crisitem.author.parentorg | Fakultet tehničkih nauka | - |
crisitem.author.parentorg | Fakultet tehničkih nauka | - |
Appears in Collections: | FTN Publikacije/Publications |
SCOPUSTM
Citations
3
checked on Sep 9, 2023
Page view(s)
20
Last Week
9
9
Last month
2
2
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.