Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/7655
Nаziv: | Slotted Aloha for networked base stations with spatial and temporal diversity | Аutоri: | Jakovetić, Dušan Bajović, Dragana Vukobratović, Dejan Crnojević, Vladimir |
Dаtum izdаvаnjа: | 1-јан-2014 | Čаsоpis: | IEEE International Symposium on Information Theory - Proceedings | Sažetak: | 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. | URI: | https://open.uns.ac.rs/handle/123456789/7655 | ISBN: | 9781479951864 | ISSN: | 21578095 | DOI: | 10.1109/ISIT.2014.6875099 |
Nаlаzi sе u kоlеkciјаmа: | FTN Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
3
prоvеrеnо 09.09.2023.
Prеglеd/i stаnicа
20
Prоtеklа nеdеljа
9
9
Prоtеkli mеsеc
2
2
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.