Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ISIT.2014.6875099 | Information Theory |
Keywords | Field | DocType |
decoding,interference,probability,base stations,communication radius,decode messages,decoding algorithm,decoding probability,interference cancellation mechanism,networked base stations,prescribed distribution,slots per frame,slotted aloha,space across neighboring base stations,spatial diversity,temporal diversity,users station | Base station,Discrete mathematics,Telecommunications,Aloha,Computer science,Computer network,Temporal diversity | Conference |
Volume | Citations | PageRank |
abs/1401.6810 | 1 | 0.35 |
References | Authors | |
4 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dusan Jakovetic | 1 | 345 | 25.15 |
| Dragana Bajovic | 2 | 5 | 1.15 |
| Dejan Vukobratovic | 3 | 1 | 1.03 |
| Vladimir S. Crnojevic | 4 | 186 | 17.82 |