A novel random access scheme for stationary machine-type communication devices

2018 ◽  
Vol 12 (19) ◽  
pp. 2448-2453
Author(s):  
Mingyu Zhang ◽  
Ying Li ◽  
Xudong Guo
Keyword(s):  
Random Access ◽  
Machine Type ◽  
Access Scheme ◽  
Communication Devices ◽  
Machine Type Communication

scholarly journals Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications

2017 ◽  
Vol 2017 ◽  
pp. 1-7 ◽  
Author(s):  
Minjoong Rim ◽  
Seungyeob Chae
Keyword(s):  
Interference Cancellation ◽  
Communication Systems ◽  
Random Access ◽  
Single Copy ◽  
Machine Type ◽  
Access Scheme ◽  
Machine Type Communications ◽  
Communication Devices ◽  
Multiple Copies ◽  
Different Characteristics

One of the main requirements for next generation mobile or wireless communication systems is to effectively support a large number of machine type communication devices for Internet of things applications. In order to improve the random access capability in frame-based slotted Aloha environments, coded random access techniques have been proposed, in which multiple copies of a packet are transmitted per frame and the copies are cancelled out from the received signal if any single copy is successfully received. They, however, may increase the transmission power by sending multiple copies per frame. Above all, for systems with a small number of slots per frame, they may not be able to improve the performance by readily reaching a congested state. This paper proposes a new frame-based random access scheme, which sends at most one copy of a packet per frame but uses interference cancellation to improve the performance. If a successfully received packet is a retransmitted one, the previously transmitted signals for the packet can be cancelled out from the received signals for trying to decode other received packets. The proposed scheme has different characteristics than coded random access schemes and can be also combined with them to further improve the performance.

scholarly journals Distributed Algorithm for Base Station Assignment in 4G/5G Machine-Type Communication Scenarios with Backhaul Limited Conditions

Sensors ◽  
2020 ◽  
Vol 20 (22) ◽  
pp. 6553
Author(s):  
Edgar A. Esquivel-Mendiola ◽  
Hiram Galeana-Zapién ◽  
David H. Covarrubias ◽  
Edwin Aldana-Bobadilla
Keyword(s):  
Assignment Problem ◽  
Path Loss ◽  
Base Station ◽  
System Throughput ◽  
Dual Decomposition ◽  
Minimum Path ◽  
Machine Type ◽  
Assignment Algorithm ◽  
Communication Devices ◽  
Machine Type Communication

A progressive paradigm shift from centralized to distributed network architectures has been consolidated since the 4G communication standard, calling for novel decision-making mechanisms with distributed control to operate at the network edge. This situation implies that each base station (BS) must manage resources independently to meet the quality of service (QoS) of existing human-type communication devices (HTC), as well as the emerging machine type communication (MTC) devices from the internet of things (IoT). In this paper, we address the BS assignment problem, whose aim is to determine the most appropriate serving BS to each mobile device. This problem is formulated as an optimization problem for maximizing the system throughput and imposing constraints on the air interface and backhaul resources. The assignment problem is challenging to solve, so we present a simple yet valid reformulation of the original problem while using dual decomposition theory. Subsequently, we propose a distributed price-based BS assignment algorithm that performs at each BS the assignment process, where a novel pricing update scheme is presented. The simulation results show that our proposed solution outperforms traditional maximum signal to interference plus noise ratio (Max-SINR) and minimum path-loss (Min-PL) approaches in terms of system throughput.

Sign in / Sign up

Export Citation Format

Share Document