Academic literature on the topic 'Irregular Repetition Slotted Aloha (IRSA)'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Irregular Repetition Slotted Aloha (IRSA).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Irregular Repetition Slotted Aloha (IRSA)"

1

PAMUKTI, BRIAN, NACHWAN MUFTI ADRIANSYAH, and REYVALDO FAHREZY NILADBRATA. "Evaluasi Coded Random Access untuk Visible Light Communication pada Model Kanal Non-Line Of Sight." ELKOMIKA: Jurnal Teknik Energi Elektrik, Teknik Telekomunikasi, & Teknik Elektronika 10, no. 2 (April 12, 2022): 405. http://dx.doi.org/10.26760/elkomika.v10i2.405.

Full text
Abstract:
ABSTRAKPenggunaan Non-Orthogonal Multiple Access (NOMA) pada sistem komunikasi dapat memberi kebebasan bagi user untuk mengirimkan informasi secara bersamaan tanpa harus memperebutkan timeslot ataupun frekuensi. Coded Random Access (CRA) adalah salah satu bagian dari Coded Comain-NOMA (CDNOMA) yang menggunakan kode tanpa ortogonal untuk komunikasi uplink. Terinspirasi dari Additive Links On Line Hawaii Area (ALOHA), kami menggunakan metode Irregular Repetition Slotted ALOHA (IRSA) dengan tiga jumlah slot node dan sembilan degree distribution pada model kanal Line Of Sight (LOS) dan Non-LOS (NLOS). Kami menggunakan metrik pengukuran berupa throughput dan Packet Loss Ratio (PLR) untuk memperoleh hasil simulasi. Dari simulasi yang ekstensif, kami membuktikan bahwa IRSA stabil pada jumlah slot node yaitu 75, 150 dan 300 yang memperoleh throughput di sekitar 0.75 paket/slot.Kata kunci: Coded Random Access, Non-Orthogonal Multiple Access, Slotted ALOHA, Successive Interference Cancellation ABSTRACTThe use of Non-Orthogonal Multiple Access (NOMA) in communication systems can provide users the freedom to transmit information simultaneously without having to fight over timeslots or frequencies. Coded Random Access (CRA) is a part of Coded Domain-NOMA (CD-NOMA) that uses orthogonal code for uplink communication. Inspired by the Additive Links On Line Hawaii Area (ALOHA), we use the Irregular Repetition Slotted ALOHA (IRSA) method with three number of node slots and nine degree distributions on the Line Of Sight (LOS) and Non-LOS (NLOS) channel models. We use measurements in the form of throughput and Packet Loss Ratio (PLR) to obtain simulation results. From extensive simulations, we prove that IRSA is stable on a wide number of node slots of 75, 150 and 300 that acquire throughput in about 0.75 packets/slot.Keywords: Coded Random Access, Non-Orthogonal Multiple Access, Slotted ALOHA, Successive Interference Cancellation
APA, Harvard, Vancouver, ISO, and other styles
2

Babich, Fulvio, Giulia Buttazzoni, Francesca Vatta, and Massimiliano Comisso. "Energy-Constrained Design of Joint NOMA-Diversity Schemes with Imperfect Interference Cancellation." Sensors 21, no. 12 (June 18, 2021): 4194. http://dx.doi.org/10.3390/s21124194.

Full text
Abstract:
This study proposes a set of novel random access protocols combining Packet Repetition (PR) schemes, such as Contention Resolution Diversity Slotted Aloha (CRDSA) and Irregular Repetition SA (IRSA), with Non Orthogonal Multiple Access (NOMA). Differently from previous NOMA/CRDSA and NOMA/IRSA proposals, this work analytically derives the energy levels considering two realistic elements: the residual interference due to imperfect Interference Cancellation (IC), and the presence of requirements on the power spent for the transmission. More precisely, the energy-limited scenario is based on the relationship between the average available energy and the selected code modulation pair, thus being of specific interest for the implementation of the Internet of Things (IoT) technology in forthcoming fifth-generation (5G) systems. Moreover, a theoretical model based on the density evolution method is developed and numerically validated by extensive simulations to evaluate the limiting throughput and to explore the actual performance of different NOMA/PR schemes in energy-constrained scenarios.
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Yuanjie, Kai Niu, Chao Dong, Shiqiang Suo, and Jiaru Lin. "Joint Intra/Inter-Slot Code Design for Unsourced Multiple Access in 6G Internet of Things." Sensors 23, no. 1 (December 26, 2022): 242. http://dx.doi.org/10.3390/s23010242.

Full text
Abstract:
Unsourced multiple access (UMA) is the technology for massive, low-power, and uncoordinated Internet-of-Things in the 6G wireless system, improving connectivity and energy efficiency on guaranteed reliability. The multi-user coding scheme design is a critical problem for UMA. This paper proposes a UMA coding scheme based on the T-Fold IRSA (irregular repetition slotted Aloha) paradigm by using joint Intra/inter-slot code design and optimization. Our scheme adopts interleave-division multiple access (IDMA) to enhance the intra-slot coding gain and the low-complexity joint intra/inter-slot SIC (successive interference cancellation) decoder structure to recover multi-user payloads. Based on the error event decomposition and density evolution analysis, we build a joint intra/inter-slot coding parameter optimization algorithm to minimize the SNR (signal-to-noise ratio) requirement at an expected system packet loss rate. Numerical results indicate that the proposed scheme achieves energy efficiency gain by balancing the intra/inter-slot coding gain while maintaining relatively low implementation complexity.
APA, Harvard, Vancouver, ISO, and other styles
4

Shieh, Shin-Lin, and Shih-Hung Yang. "Enhanced Irregular Repetition Slotted ALOHA Under SIC Limitation." IEEE Transactions on Communications 70, no. 4 (April 2022): 2268–80. http://dx.doi.org/10.1109/tcomm.2022.3147505.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Demirhan, Umut, and Tolga M. Duman. "Irregular Repetition Slotted ALOHA With Energy Harvesting Nodes." IEEE Transactions on Wireless Communications 18, no. 9 (September 2019): 4505–17. http://dx.doi.org/10.1109/twc.2019.2926077.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hmedoush, Iman, Cedric Adjih, Kinda Khawam, and Paul Muhlethaler. "A Game Theoretic Approach to Irregular Repetition Slotted Aloha." IEEE Access 10 (2022): 4600–4614. http://dx.doi.org/10.1109/access.2022.3140495.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Shao, Xinye, Zhili Sun, Mingchuan Yang, Sai Gu, and Qing Guo. "NOMA-Based Irregular Repetition Slotted ALOHA for Satellite Networks." IEEE Communications Letters 23, no. 4 (April 2019): 624–27. http://dx.doi.org/10.1109/lcomm.2019.2900319.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Graell i Amat, Alexandre, and Gianluigi Liva. "Finite-Length Analysis of Irregular Repetition Slotted ALOHA in the Waterfall Region." IEEE Communications Letters 22, no. 5 (May 2018): 886–89. http://dx.doi.org/10.1109/lcomm.2018.2812845.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Munari, Andrea. "Modern Random Access: An Age of Information Perspective on Irregular Repetition Slotted ALOHA." IEEE Transactions on Communications 69, no. 6 (June 2021): 3572–85. http://dx.doi.org/10.1109/tcomm.2021.3060429.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nisioti, Eleni, and Nikolaos Thomos. "Fast Q-Learning for Improved Finite Length Performance of Irregular Repetition Slotted ALOHA." IEEE Transactions on Cognitive Communications and Networking 6, no. 2 (June 2020): 844–57. http://dx.doi.org/10.1109/tccn.2019.2957224.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Irregular Repetition Slotted Aloha (IRSA)"

1

Hmedoush, Iman. "Connectionless Transmission in Wireless Networks (IoT)." Electronic Thesis or Diss., Sorbonne université, 2022. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2022SORUS143.pdf.

Full text
Abstract:
L'origine concernant l'idée d'ajouter de l'intelligence aux objets de base et de les faire communiquer n'est pas connue précisément. Mais ces derniers temps, l'émergence d'Internet en tant que réseau de communication global a aussi motivé l'utilisation de son architecture et de ses protocoles pour connecter des objets. C'est par exemple le cas célèbre du distributeur automatique de sodas connecté à l'ARPANET dans les années 1980. Au cours des deux dernières décennies, de nombreuses améliorations technologiques ont été développées pour rendre possible l'Internet des objets (IoT). Un scénario d'un réseau IoT typique consiste à connecter des dispositifs embarqués composés de capteurs environnementaux, de microcontrôleurs et de matériel de communication à un nœud de collecte central. L'ensemble des données recueillies par ces nœuds permettra d'analyser et de comprendre précisément les phénomènes et comportements se produisant dans cet environnement. Les applications des technologies IoT sont infinies, car elles sont adaptables à presque tous les systèmes, que l'on doit surveiller et contrôler à distance, pouvant fournir des informations sur son état, son fonctionnement et son environnement. Les villes intelligentes, les soins, l'automatisation industrielle et la technologie portable sont quelques-unes des applications de l'IoT qui promettent de rendre notre vie plus sûre et plus facile. Certains défis en matière de recherche et de technologie doivent être relevés pour la mise en œuvre et la large dissémination des applications de l'IoT comme le déploiement, la mise en réseau, la sécurité, la résilience et le contrôle de l'alimentation des équipements. Cette demande massive de connexion dans les réseaux IoT introduit de nouveaux défis en termes de connectivité, de fiabilité et de technologie. Au niveau de la radio, les réseaux IoT représentent un énorme afflux de divers appareils qui communiquent via le même support radio partagé. Cependant, bon nombre de ces appareils sont difficiles à sécuriser et à manipuler. L'un des principaux défis du déploiement des réseaux IoT est le manque de solutions efficaces qui permettent un nombre massif de connexions tout en répondant en même temps aux exigences de faible latence et de faible coût. De plus, il y a eu récemment une tendance vers des systèmes de communication à longue portée pour l'IoT et aussi pour les réseaux cellulaires. Pour de nombreux cas d'utilisation, tels que les communications massives de type machine (mMTC), les performances peuvent être améliorées en s'éloignant du modèle classique d'établissement de connexion et en adoptant des méthodes d'accès aléatoire sans attribution prédéterminée. Associé à des techniques de couche physique telles que l'annulation successive des interférences (SIC) ou l'accès multiple non orthogonal (NOMA), les performances de l'accès aléatoire peuvent être améliorées, donnant lieu à de nouvelles conceptions de protocoles d'accès aléatoire. Dans cette thèse, nous nous concentrons sur l'un des candidats modernes pour les protocoles d'accès aléatoire bien adaptés à l'IoT :ALOHA à répétition irrégulière (IRSA). Comme des solutions sont nécessaires pour surmonter les défis de l'IoT, nous étudions le schéma d'accès aléatoire IRSA sous de nouveaux points de vue et nous commençons par une analyse des performances des différentes variantes grâce à l'outil de l'évolution de la densité du débit. Précisément, nous commençons par revisiter le scénario du protocole IRSA avec la capacité de réception de paquets multiples (MPR) au niveau du récepteur. Ensuite, nous étudions IRSA dans différents scénarios où des hypothèses plus réalistes sont considérées comme : IRSA avec plusieurs puissances de transmission, avec effet de capture et avec des erreurs de décodage. Dans la deuxième partie de la thèse, nous nous concentrons sur l'apprentissage et l'ajustement dynamique des paramètres du protocole IRSA. Dans un premier temps, nous analysons les performances [...]
The origin of the idea of adding intelligence to basic objects and making them communicate has been lost to history. But in recent times, the emergence of the Internet as a global communication network has also motived the use of its architecture and protocols to connect objects (such as the soda vending machine famously connected to the ARPANET in the 1980s). In the past two decades, many technological enhancements have been developed to enable the ``Internet of Things'' (IoT). A scenario of a typical IoT network is to connect embedded devices composed of environmental sensors, microcontrollers, and communication hardware, to a central collection node. The set of data gathered by these nodes will increasingly help in analyzing and precisely understanding the phenomenons and behaviors occurring in this environment. The applications of IoT technologies are endless because they are adaptable to almost any system that can provide information about its status, operation, and the environment and that one needs to monitor and control at a distance. Smart cities, healthcare, industrial automation, and wearable technology are some IoT applications that promise to make our life safer and easier. Some research and technology challenges need to be addressed for the implementation and full popularization of IoT applications including deployment, networking, security, resilience, and power control. This massive demand for connection in IoT networks will introduce new challenges in terms of connectivity, reliability, and technology. At the radio network level, IoT networks represent a huge inflow of various devices that communicate through the same shared radio medium. However, many of these devices are difficult to secure and handle. One major challenge to deploying IoT networks is the lack of efficient solutions that allow for a massive number of connections while meeting the low-latency and low-cost demands at the same time. In addition, recently, there has been a trend towards long-range communications systems for the IoT, including cellular networks. For many use cases, such as massive machine-type communications (mMTC), performance can be gained by moving away from the classical model of connection establishment and adopting grant-free, random access methods. Associated with physical layer techniques such as Successive Interference Cancellation (SIC), or Non-Orthogonal Multiple Access (NOMA), the performance of random access can be dramatically improved, giving rise to novel random access protocol designs. In this thesis, we focus on one of the modern candidates for random access protocols ``well-fitted'' to the IoT: Irregular Repetition Slotted ALOHA (IRSA). As solutions are needed to overcome the challenges of IoT, we study the IRSA random access scheme from new points of view and we start with an analysis of the performance of different variations through the density evolution tool. Precisely, we start by revisiting the scenario of the IRSA protocol in the case of Multiple Packet Reception (MPR) capability at the receiver. Then, we study IRSA in different scenarios where more realistic assumptions are considered, such as IRSA with multiple transmissions powers, with capture effect, and with decoding errors. In the second part of the thesis, we concentrate on learning and dynamically adjusting IRSA protocol parameters. First, we analyze the protocol performance in a centralized approach through a variant of Reinforcement Learning and in a distributed approach through Game Theory. We also optimize short frame length IRSA through a Deep Reinforcement Learning approach. Finally, we introduce a sensing capability to IRSA, in line with carrier sense principles, and we tentatively explore how one can learn part of sensing protocols with the help of Deep Learning tools
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Irregular Repetition Slotted Aloha (IRSA)"

1

Zheng, Huaicui, Changle Li, Ni Tian, and Jun Cheng. "Slot Assign Algorithm with Threshold Based on Irregular Repetition Slotted ALOHA (IRSA)." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 225–31. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-14657-3_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hmedoush, Iman, Cédric Adjih, and Paul Mühlethaler. "A Regret Minimization Approach to Frameless Irregular Repetition Slotted Aloha: IRSA-RM." In Machine Learning for Networking, 73–92. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-70866-5_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Irregular Repetition Slotted Aloha (IRSA)"

1

Sun, Jingyun, Rongke Liu, Yan Wang, and Chang Wen Chen. "Irregular Repetition Slotted ALOHA with Priority (P-IRSA)." In 2016 IEEE 83rd Vehicular Technology Conference (VTC Spring). IEEE, 2016. http://dx.doi.org/10.1109/vtcspring.2016.7504302.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jia, Dai, Hanxiao Yu, Ce Sun, Zesong Fei, and Jingming Kuang. "Feedback-aided irregular repetition slotted ALOHA (F-IRSA)." In 2017 9th International Conference on Wireless Communications and Signal Processing (WCSP). IEEE, 2017. http://dx.doi.org/10.1109/wcsp.2017.8171170.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Paolini, Enrico. "Finite length analysis of irregular repetition slotted Aloha (IRSA) access protocols." In 2015 ICC - 2015 IEEE International Conference on Communications Workshops (ICC). IEEE, 2015. http://dx.doi.org/10.1109/iccw.2015.7247494.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ayoub, Ibrahim, Iman Hmedoush, Cedric Adjih, Kinda Khawam, and Samer Lahoud. "Deep-IRSA: A Deep Reinforcement Learning Approach to Irregular Repetition Slotted ALOHA." In 2021 10th IFIP International Conference on Performance Evaluation and Modeling in Wireless and Wired Networks (PEMWN). IEEE, 2021. http://dx.doi.org/10.23919/pemwn53042.2021.9664720.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jia, Dai, and Junli Jia. "Information Coupled Irregular Repetition Slotted ALOHA." In 2019 IEEE 19th International Conference on Communication Technology (ICCT). IEEE, 2019. http://dx.doi.org/10.1109/icct46805.2019.8946999.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ghanbarinejad, Majid, and Christian Schlegel. "Irregular repetition slotted ALOHA with multiuser detection." In 2013 10th Annual Conference on Wireless On-demand Network Systems and Services (WONS). IEEE, 2013. http://dx.doi.org/10.1109/wons.2013.6578348.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Munari, Andrea, and Alexey Frolov. "Average Age of Information of Irregular Repetition Slotted ALOHA." In GLOBECOM 2020 - 2020 IEEE Global Communications Conference. IEEE, 2020. http://dx.doi.org/10.1109/globecom42002.2020.9322355.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Paolini, Enrico, Lorenzo Valentini, Velio Tralli, and Marco Chiani. "Irregular Repetition Slotted ALOHA in an Information-Theoretic Setting." In 2022 IEEE International Symposium on Information Theory (ISIT). IEEE, 2022. http://dx.doi.org/10.1109/isit50566.2022.9834627.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ngo, Khac–Hoang, Alexandre Graelli Amat, and Giuseppe Durisi. "Irregular Repetition Slotted ALOHA Over the Binary Adder Channel." In ICC 2023 - IEEE International Conference on Communications. IEEE, 2023. http://dx.doi.org/10.1109/icc45041.2023.10279321.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Demirhan, Umut, and Tolga M. Duman. "Energy-Harvesting Irregular Repetition Slotted ALOHA with Unit-Sized Battery." In 2018 IEEE International Conference on Communications (ICC 2018). IEEE, 2018. http://dx.doi.org/10.1109/icc.2018.8422090.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography