arXiv 1409.69022014-09-24cs.ITmath.IT

Sign-Compute-Resolve for Random Access

Jasper Goseling, Cedomir Stefanovic, Petar Popovski

备注：: Accepted for presentation at 52nd Annual Allerton Conference on Communication, Control, and Computing

英文摘要：

We present an approach to random access that is based on three elements: physical-layer network coding, signature codes and tree splitting. Upon occurrence of a collision, physical-layer network coding enables the receiver to decode the sum of the information that was transmitted by the individual users. For each user this information consists of the data that the user wants to communicate as well as the user's signature. As long as no more than $K$ users collide, their identities can be recovered from the sum of their signatures. A splitting protocol is used to deal with the case that more than $K$ users collide. We measure the performance of the proposed method in terms of user resolution rate as well as overall throughput of the system. The results show that our approach significantly increases the performance of the system even compared to coded random access, where collisions are not wasted, but are reused in successive interference cancellation.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

A Pseudo-Bayesian Approach to Sign-Compute-Resolve Slotted ALOHA

Access reservation based on slotted ALOHA is commonly used in wireless cellular access. In this paper we investigate its enhancement based on the use of physical-layer network coding and signature coding, whose main feature is enabling simultaneous resolution of up to K users contending for access, where K >= 1. We optimise the slot access probability such that the expected throughput is maximised. In particular, the slot access probability is chosen in line with an estimate of the number of users in the system that is obtained relying on the pseudo-Bayesian approach by Rivest, which we genera…

2017-06-29cs.ITmath.IT

Sign-Compute-Resolve for Tree Splitting Random Access

We present a framework for random access that is based on three elements: physical-layer network coding (PLNC), signature codes and tree splitting. In presence of a collision, physical-layer network coding enables the receiver to decode, i.e. compute, the sum of the packets that were transmitted by the individual users. For each user, the packet consists of the user's signature, as well as the data that the user wants to communicate. As long as no more than K users collide, their identities can be recovered from the sum of their signatures. This framework for creating and transmitting packets …

2018-05-16cs.ITmath.IT

Identifying Randomly Activated Users via Sign-Compute-Resolve on Graphs

In this paper we treat the problem of identification of a subset of active users in a set of a large number of potentially active users. The users from the subset are activated randomly, such that the access point (AP) does not know the subset or its size a priori. The active users are contending to report their activity to the AP over a multiple access channel. We devise a contention algorithm that assumes a combination of physical-layer network coding and K-out-of-N signature coding, allowing for multiple detection of up to K users at the access point. In addition, we rely on the principles …

2016-03-07cs.ITmath.IT

Random Access Protocol for Massive MIMO: Strongest-User Collision Resolution (SUCR)

Wireless networks with many antennas at the base stations and multiplexing of many users, known as Massive MIMO systems, are key to handle the rapid growth of data traffic. As the number of users increases, the random access in contemporary networks will be flooded by user collisions. In this paper, we propose a reengineered random access protocol, coined strongest-user collision resolution (SUCR). It exploits the channel hardening feature of Massive MIMO channels to enable each user to detect collisions, determine how strong the contenders' channels are, and only keep transmitting if it has t…

2016-03-11cs.ITmath.IT

Random Access in Uplink Massive MIMO Systems: How to exploit asynchronicity and excess antennas

Massive MIMO systems, where the base stations are equipped with hundreds of antennas, are an attractive way to handle the rapid growth of data traffic. As the number of users increases, the initial access and handover in contemporary networks will be flooded by user collisions. In this work, we propose a random access procedure that resolves collisions and also performs timing, channel, and power estimation by simply utilizing the large number of antennas envisioned in massive MIMO systems and the inherent timing misalignments of uplink signals during network access and handover. Numerical res…

2016-05-03cs.ITmath.IT

User-Centric Perspective in Random Access Cell-Free Aided by Spatial Separability

In a cell-free massive multiple-input multiple-output (CF-mMIMO) network, multiple access points (APs) actively cooperate to serve users' equipment (UEs). We consider how the random access (RA) problem can be addressed by such a network under the occurrence of pilot collisions. To find a solution, we embrace the user-centric perspective, which basically dictates that only a preferred set of APs needs to serve a UE. Due to the success of the strongest-user collision resolution (SUCRe) protocol for cellular (Ce) mMIMO, we extend it by considering the new setting. Besides, we establish that the u…

2022-01-05cs.ITeess.SPmath.IT

更多相关论文收起更多论文

Collision Resolution with Deep Reinforcement Learning for Random Access in Machine-Type Communication

Grant-free random access (RA) techniques are suitable for machine-type communication (MTC) networks but they need to be adaptive to the MTC traffic, which is different from the human-type communication. Conventional RA protocols such as exponential backoff (EB) schemes for slotted-ALOHA suffer from a high number of collisions and they are not directly applicable to the MTC traffic models. In this work, we propose to use multi-agent deep Q-network (DQN) with parameter sharing to find a single policy applied to all machine-type devices (MTDs) in the network to resolve collisions. Moreover, we co…

2022-05-04cs.ITmath.IT

A High Throughput Pilot Allocation for M2M Communication in Crowded Massive MIMO Systems

A new scheme to resolve the intra-cell pilot collision for M2M communication in crowded massive multiple-input multiple-output (MIMO) systems is proposed. The proposed scheme permits those failed user equipments (UEs), judged by a strongest-user collision resolution (SUCR) protocol, to contend for the idle pilots, i.e., the pilots that are not selected by any UE in the initial step. This scheme is called as SUCR combined idle pilots access (SUCR-IPA). To analyze the performance of the SUCR-IPA scheme, we develop a simple method to compute the access success probability of the UEs in each rando…

2016-11-02cs.ITmath.IT

Online Estimation and Adaptation for Random Access with Successive Interference Cancellation

This paper proposes an adaptive transmission algorithm for slotted random access systems supporting the successive interference cancellation (SIC) at the access point (AP). When multiple users transmit packets simultaneously in a slot, owing to the SIC technique, the AP is able to decode them through SIC resolve procedures (SRPs), which may occupy multiple consequent slots. While such an SRP could potentially improve the system throughput, how to fully exploit this capability in practical systems is still questionable. In particular, the number of active users contending for the channel varies…

2020-01-09cs.ITmath.IT

Deep Learning Methods for Joint Optimization of Beamforming and Fronthaul Quantization in Cloud Radio Access Networks

Jeonbuk National University（全北国立大学）；Pukyong National University（釜庆国立大学）；Electronics and Telecommunications Research Institute（韩国电子通信研究院）

Cooperative beamforming across access points (APs) and fronthaul quantization strategies are essential for cloud radio access network (C-RAN) systems. The nonconvexity of the C-RAN optimization problems, which is stemmed from per-AP power and fronthaul capacity constraints, requires high computational complexity for executing iterative algorithms. To resolve this issue, we investigate a deep learning approach where the optimization module is replaced with a well-trained deep neural network (DNN). An efficient learning solution is proposed which constructs a DNN to produce a low-dimensional rep…

2021-07-06cs.ITcs.LGeess.SP

关于树型随机接入协议中提前终止对信息年龄的作用研究

On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols

本文首次对外生流量下门控接入的Capetanakis树型随机接入协议的平均信息年龄进行理论分析，并提出提前终止变体，揭示可靠性与时效性之间的权衡。

2025-06-05cs.ITcs.NImath.IT

Spatio-temporal Modeling for Massive and Sporadic Access

The vision for smart city imperiously appeals to the implementation of Internet-of-Things (IoT), some features of which, such as massive access and bursty short packet transmissions, require new methods to enable the cellular system to seamlessly support its integration. Rigorous theoretical analysis is indispensable to obtain constructive insight for the networking design of massive access. In this paper, we propose and define the notion of massive and sporadic access (MSA) to quantitatively describe the massive access of IoT devices. We evaluate the temporal correlation of interference and s…

2020-07-23cs.ITcs.NImath.IT

LTE/LTE-A Random Access for Massive Machine-Type Communications in Smart Cities

Massive Machine-Type Communications (MTC) over cellular networks is expected to be an integral part of wireless "Smart City" applications. The Long Term Evolution (LTE)/LTE-Advanced (LTE-A) technology is a major candidate for provisioning of MTC applications. However, due to the diverse characteristics of payload size, transmission periodicity, power efficiency, and quality of service (QoS) requirement, MTC poses huge challenges to LTE/LTE-A technologies. In particular, efficient management of massive random access is one of the most critical challenges. In case of massive random access attemp…

2016-08-10cs.ITcs.NImath.IT

Efficient LTE Access with Collision Resolution for Massive M2M Communications

LTE random access procedure performs satisfactorily in case of asynchronous, uncorrelated traffic arrivals. However, when the arrivals are correlated and arrive synchronously, the performance of the random access channel (RACH) is drastically reduced, causing a large number of devices to experience outage. In this work we propose a LTE RACH scheme tailored for delay-sensitive M2M services with synchronous traffic arrivals. The key idea is, upon detection of a RACH overload, to apply a collision resolution algorithm based on splitting trees. The solution is implemented on top of the existing LT…

2014-10-24cs.ITcs.NImath.IT

A Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems

The Massive MIMO (multiple-input multiple-output) technology has great potential to manage the rapid growth of wireless data traffic. Massive MIMO achieves tremendous spectral efficiency by spatial multiplexing of many tens of user equipments (UEs). These gains are only achieved in practice if many more UEs can connect efficiently to the network than today. As the number of UEs increases, while each UE intermittently accesses the network, the random access functionality becomes essential to share the limited number of pilots among the UEs. In this paper, we revisit the random access problem in…

2017-02-11cs.ITcs.NImath.IT

Sparsity-Aware Intelligent Massive Random Access Control in Open RAN: A Reinforcement Learning Based Approach

Xiamen University（厦门大学）；Stevens Institute of Technology（史蒂文斯理工学院）；Mohamed Bin Zayed University of Artificial Intelligence（穆罕默德·本·扎耶德人工智能大学）

Massive random access of devices in the emerging Open Radio Access Network (O-RAN) brings great challenge to the access control and management. Exploiting the bursting nature of the access requests, sparse active user detection (SAUD) is an efficient enabler towards efficient access management, but the sparsity might be deteriorated in case of uncoordinated massive access requests. To dynamically preserve the sparsity of access requests, a reinforcement-learning (RL)-assisted scheme of closed-loop access control utilizing the access class barring technique is proposed, where the RL policy is d…

2023-03-05cs.AIcs.ITcs.LG