English
Related papers

Related papers: Joint Activity and Data Detection for Massive Gran…

200 papers

Grant-free transmission is an important feature to be supported by future wireless networks since it reduces the signalling overhead caused by conventional grant-based schemes. However, for grant-free transmission, the number of users…

Information Theory · Computer Science 2018-12-20 Zhiguo Ding , Robert Schober , Pingzhi Fan , H. Vincent Poor

In massive connectivity scenarios with short packets, of interest is the regime where users share wireless resources in a non-orthogonal fashion. Small payloads combined with sporadic user activation call for approaches that jointly address…

Signal Processing · Electrical Eng. & Systems 2021-01-12 Johannes Dommel , Zoran Utkovski , Petar Popovski , Slawomir Stanczak

Cell-Free (CF) Massive Multiple-Input Multiple-Output (MaMIMO) is considered one of the leading candidates for enabling next-generation wireless communication. With the growing interest in the Internet of Things (IoT), the Grant-Free (GF)…

Information Theory · Computer Science 2025-08-05 Zilu Zhao , Christian Forsch , Laura Cottatellucci , Dirk Slock

This paper presents several analytic closed-form approximations of the aggregated interference statistics within the framework of uplink massive machine-type communications (mMTC), taking into account the random activity of the sensors.…

Signal Processing · Electrical Eng. & Systems 2024-12-10 Sergi Liesegang , Antonio Pascual-Iserte , Olga Muñoz

Towards the realization of ultra-reliable low-latency wireless communications required in critical industrial Internet of Things (IIoT) applications, this paper presents a new noncoherent and non-orthogonal massive single-input…

Information Theory · Computer Science 2019-03-06 He Chen , Zheng Dong , Branka Vucetic

In this paper, we study how to efficiently and reliably detect active devices and estimate their channels in a multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) based grant-free non-orthogonal multiple…

Information Theory · Computer Science 2022-11-14 Wenjun Jiang , Mingyang Yue , Xiaojun Yuan , Yong Zuo

This work considers uplink asynchronous massive machine-type communications, where a large number of low-power and low-cost devices asynchronously transmit short packets to an access point equipped with multiple receive antennas. If…

Information Theory · Computer Science 2025-07-22 Z. Shao , X. Yuan , R. de Lamare

Grant-free non-orthogonal multiple access (GF-NOMA) is a potential technique to support massive Ultra-Reliable and Low-Latency Communication (mURLLC) service. However, the dynamic resource configuration in GF-NOMA systems is challenging due…

Information Theory · Computer Science 2021-03-29 Yan Liu , Yansha Deng , Hui Zhou , Maged Elkashlan , Arumugam Nallanathan

We consider unsourced random access (uRA) in a cell-free (CF) user-centric wireless network, where a large number of potential users compete for a random access slot, while only a finite subset is active. The random access users transmit…

Information Theory · Computer Science 2025-05-01 Burak Çakmak , Eleni Gkiouzepi , Manfred Opper , Giuseppe Caire

Uplink (UL) dominated sporadic transmission and stringent latency requirement of massive machine type communication (mMTC) forces researchers to abandon complicated grant-acknowledgment based legacy networks. UL grant-free non-orthogonal…

Signal Processing · Electrical Eng. & Systems 2020-10-02 Shah Mahdi Hasan , Kaushik Mahata , Md Mashud Hyder

Modern wireless machine-to-machine-type communications aim to provide both ultra reliability and low latency, stringent requirements that appear to be mutually exclusive. From the noisy channel coding theorem, we know that reliable…

Information Theory · Computer Science 2020-12-04 Diego Barragán Guerrero , Minh Au , Ghyslain Gagnon , François Gagnon , Pascal Giard

To support machine-type communication (MTC), massive multiple-input multiple-output (MIMO) has been considered for grant-free random access. In general, the performance of grant-free random access with massive MIMO is limited by the number…

Information Theory · Computer Science 2020-09-03 Jinho Choi

Reliable and prompt identification of active users is critical for enabling random access in massive machine-to-machine type networks which typically operate within stringent access delay and energy constraints. In this paper, an energy…

Information Theory · Computer Science 2023-03-31 Jyotish Robin , Elza Erkip

One objective of the 5G communication system and beyond is to support massive machine type of communication (mMTC) to propel the fast growth of diverse Internet of Things use cases. The mMTC aims to provide connectivity to tens of billions…

Signal Processing · Electrical Eng. & Systems 2021-11-03 Mehmood Alam , Qi Zhang

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

802.11 device fingerprinting is the action of characterizing a target device through its wireless traffic. This results in a signature that may be used for identification, network monitoring or intrusion detection. The fingerprinting method…

Cryptography and Security · Computer Science 2014-04-28 Christoph Neumann , Olivier Heen , Stéphane Onno

Cell-free massive MIMO is one of the key technologies for future wireless communications, in which users are simultaneously and jointly served by all access points (APs). In this paper, we investigate the minimum mean square error (MMSE)…

Information Theory · Computer Science 2021-12-28 Mangqing Guo , M. Cenk Gursoy

The thesis is dedicated to studying methods to improve the efficiency of random access schemes and to facilitate their deployment in machine-type communications (MTC). First, a joint user activity identification and channel estimation…

Information Theory · Computer Science 2019-06-11 Zhuo Sun

We study a scenario in which multiple uncoordinated devices aim to achieve reliable transmissions within a given time frame. The devices are intermittently active and access a shared pool of channel resources in a grant-free manner by…

Information Theory · Computer Science 2024-04-19 Radosław Kotaba , Roope Vehkalahti , Čedomir Stefanović , Olav Tirkkonen , Petar Popovski

Traditional random access schemes are designed based on the aggregate process of user activation, which is created on the basis of independent activations of the users. However, in Machine-Type Communications (MTC), some users are likely to…

Information Theory · Computer Science 2018-03-12 Anders Ellersgaard Kalør , Osama A. Hanna , Petar Popovski