English
Related papers

Related papers: Random Access for Massive Machine-Type Communicati…

200 papers

Secured opportunistic Medium Access Control (MAC) and complexity reduction in channel estimation are proposed in the Cross layer design Cognitive Radio Networks deploying the secured dynamic channel allocation from the endorsed channel…

Networking and Internet Architecture · Computer Science 2012-03-19 Niraj Shakhakarmi

This paper applies Information Theoretic analysis to packet-based random multiple access communication systems. A new channel coding approach is proposed for coding within each data packet with built-in support for bursty traffic…

Information Theory · Computer Science 2016-11-17 Jie Luo , Anthony Ephremides

The analogies between successive interference cancellation (SIC) in slotted ALOHA framework and iterative belief-propagation erasure-decoding, established recently, enabled the application of the erasure-coding theory and tools to design…

Information Theory · Computer Science 2016-11-17 Cedomir Stefanovic , Miyu Momoda , Petar Popovski

We address the problem of uncoordinated massive random-access in the Gaussian multiple access channel (MAC). The performance of low-complexity T-fold irregular repetition slotted ALOHA (IRSA) scheme is investigated and achievability bounds…

Information Theory · Computer Science 2018-11-20 Anton Glebov , Nikolay Matveev , Kirill Andreev , Alexey Frolov , Andrey Turlikov

The high risk of random access collisions leads to huge challenge for the deployment massive Machine-Type Communications (mMTC), which cannot be sufficiently overcome by current solutions in LTE/LTE-A networks such as the extended access…

Networking and Internet Architecture · Computer Science 2017-11-29 Bin Han , Mohammad Asif Habibi , Hans D. Schotten

The massive machine-type communications (mMTC) paradigm based on media modulation in conjunction with massive MIMO base stations (BSs) is emerging as a viable solution to support the massive connectivity for the future Internet-of-Things,…

Information Theory · Computer Science 2021-07-07 Li Qiao , Jun Zhang , Zhen Gao , Derrick Wing Kwan Ng , Marco Di Renzo , Mohamed-Slim Alouini

Recently, it has been shown that CSMA-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can…

Networking and Internet Architecture · Computer Science 2019-11-13 Jian Ni , Bo Tan , R. Srikant

Grant-free access schemes are candidates to support future massive multiple access applications owing to their capability to reduce control signaling and latency. As a promising class of grant-free schemes, coded random access schemes can…

Information Theory · Computer Science 2022-08-25 Lorenzo Valentini , Marco Chiani , Enrico Paolini

To improve signal-to-interference ratio (SIR) and make better use of file diversity provided by random caching, we consider two types of linear receivers, i.e., maximal ratio combining (MRC) receiver and partial zero forcing (PZF) receiver,…

Information Theory · Computer Science 2018-01-10 Dongdong Jiang , Ying Cui

This paper studies randomly spread code-division multiple access (CDMA) and multiuser detection in the large-system limit using the replica method developed in statistical physics. Arbitrary input distributions and flat fading are…

Information Theory · Computer Science 2007-07-13 Dongning Guo , Sergio Verdu

With the increasing number of wireless communication systems and the demand for bandwidth, the wireless medium has become a congested and contested environment. Operating under such an environment brings several challenges, especially for…

Information Theory · Computer Science 2022-02-17 Onur Dizdar , Bruno Clerckx

Machine-to-Machine (M2M) communication is now playing a market-changing role in a wide range of business world. However, in event-driven M2M communications, a large number of devices activate within a short period of time, which in turn…

Information Theory · Computer Science 2016-11-18 Huasen Wu , Chenxi Zhu , Richard J. La , Xin Liu , Youguang Zhang

This article considers the massive MIMO unsourced random access problem on a quasi-static Rayleigh fading channel. Given a fixed message length and a prescribed number of channel uses, the objective is to construct a coding scheme that…

Information Theory · Computer Science 2022-03-09 Michail Gkagkos , Krishna R. Narayanan , Jean-Francois Chamberland , Costas N. Georghiades

We present a novel access protocol for crowd scenarios in massive MIMO (Multiple-input multiple-output) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereby orthogonal scheduling…

Information Theory · Computer Science 2016-05-20 Jesper H. Sørensen , Elisabeth de Carvalho , Čedomir Stefanović , Petar Popovski

With the explosively increasing demands on the network capacity, throughput and number of connected wireless devices, massive connectivity is an urgent problem for the next generation wireless communications. In this paper, we propose a…

Signal Processing · Electrical Eng. & Systems 2020-11-02 Shanshan Zhang , Wen Chen , Shaoyuan Chen

With the continuous growth of machine-type devices (MTDs), it is expected that massive machine-type communication (mMTC) will be the dominant form of traffic in future wireless networks. Applications based on this technology, have…

Multiagent Systems · Computer Science 2021-07-12 Joao V. C. Evangelista , Zeeshan Sattar , Georges Kaddoum , Bassant Selim , Aydin Sarraf

In this paper, we investigate unsourced random access for massive machine-type communications (mMTC) in the sixth-generation (6G) wireless networks. Firstly, we establish a high-efficiency uncoupled framework for massive unsourced random…

Information Theory · Computer Science 2024-05-07 Feiyan Tian , Xiaoming Chen , Yong Liang Guan , Chau Yuen

Recently years, the attempts on distilling mobile data into useful knowledge has been led to the deployment of machine learning algorithms at the network edge. Principal component analysis (PCA) is a classic technique for extracting the…

Information Theory · Computer Science 2022-04-04 Zezhong Zhang , Guangxu Zhu , Rui Wang , Vincent K. N. Lau , Kaibin Huang

We propose an uncoordinated all-to-all broadcast protocol for periodic messages in vehicular networks based on coded slotted ALOHA (CSA). Unlike classical CSA, each user acts as both transmitter and receiver in a half-duplex mode. As in…

Information Theory · Computer Science 2015-01-27 Mikhail Ivanov , Fredrik Brannstrom , Alexandre Graell i Amat , Petar Popovski

An efficient, joint transmission delay and channel parameter estimation algorithm is proposed for uplink asynchronous direct-sequence code-division multiple access (DS-CDMA) systems based on the space-alternating generalized expectation…

Information Theory · Computer Science 2016-11-17 E. Panayirci , A. Kocian , H. V. Poor , M. Ruggieri