Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA

By Gianluigi Liva. IEEE Transactions on Communications, 2011

720 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/98ad4b5531effc6404b133f3c639a24034eac442

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Yury Polyanskiy
2. Enrico Paolini
3. Marco Chiani
4. Ramjee Prasad
5. Gianluigi Liva
6. Petar Popovski

In Electrical and Electronic Engineering

1. Yury Polyanskiy
2. Enrico Paolini
3. Marco Chiani
4. Gianluigi Liva
5. Petar Popovski

Citations in the corpus

• Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access (2014, methodology): “More recently, irregular repetition slotted ALOHA (IRSA) was introduced i n [16] to provide a further throughput gain over CRDSA, by allowing a variable and judiciously desi gned repetition rate for each packet.”
• Satellite Communications Supporting Internet of Remote Things (2016, background): “Therefore, the definition of efficient radio resource management strategies is challenging, because the same spectrum is expected to be utilized for human-to-human (H2H) communications as well as M2M communications [60].”
• A perspective on massive random-access (2017, methodology): “This difficulty is alleviated with Coded Slotted ALOHA (CSA) [27], [28] which requires a lot fewer subframes in order to tolerate the given number of users.”