Results 11 to 20 of about 3,513,631 (178)
Index Modulation–Aided Mixed Massive Random Access
Frontiers in Communications and Networks, 2021 In this study, a mixed massive random access scheme is considered where part of users transmit both common information and user-specific information, while others transmit only common information.
Zijie Liang, Jianping Zheng, Jie Ni
doaj +1 more source
D2D Assisted Q-Learning Random Access for NOMA-Based MTC Networks
IEEE Access, 2022 Machine-type communications (MTC) should account for half the connections to the internet by 2030. The use case massive MTC (mMTC) allows for applications to connect a massive number of low-power and low-complexity devices, leading to challenges in ...
Matheus V. da Silva +4 more
doaj +1 more source
Performance optimization for mMTC in 5G network with multiple random access schemes
物联网学报, 2022 To optimize the support for massive machine type communication (mMTC) services with different traffic characteristics, packet-based random access (PBRA) scheme coexists with the connection-based random access (CBRA) scheme in 5G networks.Yet, given the ...
Wen ZHAN +3 more
doaj +2 more sources
On multiple access random medium access control [PDF]
, 2009 In this paper, we develop a new class of medium access control protocol, which allows each user to transmit at different data rates chosen randomly from an appropriately determined set of rates.
Cui, Tao, Ho, Tracey
core +2 more sources
Collision Resolution for Random Access [PDF]
IEEE Transactions on Wireless Communications, 2022 As a building block toward a simple and scalable solution for massive random access, we introduce collision-resolution algorithms using successive interference cancellation (SIC) based on the received signals, with no need for any coordination or codebook differentiation. We first consider two-user multiple access with the ZigZag algorithm.
Mohammad Kazemi +2 more
openaire +5 more sources
Random Access Game and Medium Access Control Design [PDF]
, 2010 Motivated partially by a control-theoretic viewpoint, we propose a game-theoretic model, called random access game, for contention control. We characterize Nash equilibria of random access games, study their dynamics, and propose distributed algorithms (
Chen, Lijun +2 more
core +3 more sources
A Robust Quantum Random Access Memory [PDF]
, 2012 A "bucket brigade" architecture for a quantum random memory of $N=2^n$ memory cells needs $n(n+5)/2$ times of quantum manipulation on control circuit nodes per memory call.
Hong, Fang-Yu +4 more
core +1 more source
Sliding Group Window with Rebacking off for Collision Avoidance in High-Efficiency Wireless Networks
Mathematics, 2021 It is difficult for wireless local area networks (WLANs), IEEE 802.11ax high-efficiency WLAN (HEW), to join next-generation innovations such as 5th generation (5G) and Internet of Things (IoT) because they still have their conventional channel access ...
Alaa Omran Almagrabi +4 more
doaj +1 more source
Multi-Channel Random Access with Replications [PDF]
, 2017 This paper considers a class of multi-channel random access algorithms, where contending devices may send multiple copies (replicas) of their messages to the central base station.
Andreev, Sergey +3 more
core +2 more sources
Spatially-Coupled Random Access on Graphs [PDF]
, 2012 In this paper we investigate the effect of spatial coupling applied to the recently-proposed coded slotted ALOHA (CSA) random access protocol. Thanks to the bridge between the graphical model describing the iterative interference cancelation process of ...
Chiani, Marco +4 more
core +1 more source