English
Related papers

Related papers: An Enhanced Multiple Random Access Scheme for Sate…

200 papers

To efficiently utilize the scarce wireless resource, the random access scheme has been attaining renewed interest primarily in supporting the sporadic traffic of a large number of devices encountered in the Internet of Things (IoT). In this…

Information Theory · Computer Science 2024-10-24 Dick Maryopi , Daud Al Adumy , Osman Musa , Peter Jung , Agus Virgono

Being an effective non-orthogonal multiple access (NOMA) technique, sparse code multiple access (SCMA) is promising for future wireless communication. Compared with orthogonal techniques, SCMA enjoys higher overloading tolerance and lower…

Information Theory · Computer Science 2018-04-03 Chuan Zhang , Chao Yang , Wei Xu , Shunqing Zhang , Zaichen Zhang , Xiaohu You

This paper considers an unsourced random access (URA) set-up equipped with a passive reconfigurable intelligent surface (RIS), where a massive number of unidentified users (only a small fraction of them being active at any given time) are…

Information Theory · Computer Science 2024-08-27 Mohammad Javad Ahmadi , Mohammad Kazemi , Tolga M. Duman

In nonorthogonal multiple access (NOMA), the power difference of multiple signals is exploited for multiple access and successive interference cancellation (SIC) is employed at a receiver to mitigate co-channel interference. Thus, NOMA is…

Information Theory · Computer Science 2017-06-28 Jinho Choi

Motivated by the analogy between successive interference cancellation and iterative belief-propagation on erasure channels, irregular repetition slotted ALOHA (IRSA) strategies have received a lot of attention in the design of medium access…

Information Theory · Computer Science 2015-01-06 Laura Toni , Pascal Frossard

The performance of grant-free random access (GF-RA) is limited by the number of accessible random access resources (RRs) due to the absence of collision resolution. Compressive sensing (CS)-based RA schemes scale up the RRs at the expense…

Information Theory · Computer Science 2021-03-23 Ameha Tsegaye Abebe , Chung G. Kang

We propose a novel random multiple access (RMA) scheme with quality of service (QoS) guarantees for machine-to-machine (M2M) communications. We consider a slotted uncoordinated data transmission period during which machine type…

Information Theory · Computer Science 2016-10-25 Rana Abbas , Mahyar Shirvanimoghaddam , Yonghui Li , Branka Vucetic

Massive machine-type communications (mMTC) or massive access is a critical scenario in the fifth generation (5G) and the future cellular network. With the surging density of devices from millions to billions, unique pilot allocation becomes…

Information Theory · Computer Science 2025-04-03 Zhentian Zhang , Jian Dang , Zaichen Zhang , Liang Wu , Bingcheng Zhu , Lei Wang

Rate-splitting multiple access (RSMA) has been recognized as a promising physical layer strategy for 6G. Motivated by ever increasing popularity of cache-enabled content delivery in wireless communications, this paper proposes an innovative…

Information Theory · Computer Science 2022-04-26 Robert-Jeron Reifert , Alaa Alameer Ahmad , Yijie Mao , Aydin Sezgin , Bruno Clerckx

The next generation of interactive satellite terminals is going to play a crucial role in the future of DVB standards. As a matter of fact in the current standard, satellite terminals are expected to be interactive thus offering apart from…

Information Theory · Computer Science 2015-01-27 Alessio Meloni , Maurizio Murroni

The efficiency of tag identification in an RFID system can be low down due to the tag collision problems. the tag collision problem occurs when a reader try to read multiple tags in an interrogation zone. as a result the reader does not…

Networking and Internet Architecture · Computer Science 2014-05-27 Tanveer Ahmad , Yan tian feng

In this letter we motivate the need to revisit the MAC protocol used in Gen2 RFID system in order to leverage receiver structures with Collision Recovery capabilities at the PHY layer. To this end we propose to consider a simple variant of…

Networking and Internet Architecture · Computer Science 2012-09-24 Fabio Ricciato , Paolo Castiglione

Supporting massive device transmission is challenging in Machine-to-Machine (M2M) communications. Particularly, in event-driven M2M communications, a large number of devices activate within a short period of time, which in turn causes high…

Information Theory · Computer Science 2012-08-16 Huasen Wu , Chenxi Zhu , Richard J. La , Xin Liu , Youguang Zhang

A cross-layer scheme, namely ALOHA With Collision Resolution (ALOHA-CR), is proposed for high throughput wireless communications in a cellular scenario. Transmissions occur in a time-slotted ALOHA-type fashion but with an important…

Networking and Internet Architecture · Computer Science 2015-05-14 Xin Liu , John Kountouriotis , Athina P. Petropulu , Kapil R. Dandekar

The random access methods used for support of machine-type communications (MTC) in current cellular standards are derivatives of traditional framed slotted ALOHA and therefore do not support high user loads efficiently. Motivated by the…

Information Theory · Computer Science 2012-07-03 Nuno K. Pratas , Henning Thomsen , Cedomir Stefanovic , Petar Popovski

We evaluate a modification of irregular repetition slotted ALOHA (IRSA) involving intermediate decoding and early transmission termination by some nodes, upon their decoding success. This is meant to avoid unnecessary transmissions, thereby…

Emerging Technologies · Computer Science 2026-01-05 Estefanía Recayte , Leonardo Badia , Andrea Munari

In this paper, we develop a probabilistic framework for analyzing coded random access. Our framework is based on a new abstract receiver (decoder), called a Poisson receiver, that is characterized by a success probability function of a…

Networking and Internet Architecture · Computer Science 2021-07-23 Che-Hao Yu , Lin Huang , Cheng-Shang Chang , Duan-Shin Lee

Sparse Code Multiple Access (SCMA) is an enabling code-domain non-orthogonal multiple access (NOMA)scheme for massive connectivity and ultra low-latency in future machine-type communication networks. As an evolved variant of code division…

Information Theory · Computer Science 2021-05-17 Saumya Chaturvedi , Zilong Liu , Vivek Ashok Bohara , Anand Srivastava , Pei Xiao

Slotted ALOHA can benefit from physical-layer network coding (PNC) by decoding one or multiple linear combinations of the packets simultaneously transmitted in a timeslot, forming a system of linear equations. Different systems of linear…

Information Theory · Computer Science 2015-02-16 Shenghao Yang , Yi Chen , Soung Chang Liew , Lizhao You

We consider the unsourced random access problem with multiple receivers and propose a cell-free type solution for that. In our proposed scheme, the active users transmit their signals to the access points (APs) distributed in a geographical…

Emerging Technologies · Computer Science 2025-01-20 Mert Ozates , Mohammad Kazemi , Eduard Jorswieck , Deniz Gunduz