اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMultiple Transmit Power Levels based NOMA for Massive Machine-type Communications
145
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper proposes a tractable solution for integrating non-orthogonal multiple access (NOMA) into massive machine-type communications (mMTC) to increase the uplink connectivity. Multiple transmit power levels are provided at the user end to enable open-loop power control, which is absent from the traditional uplink NOMA with the fixed transmit power. The basics of this solution are firstly presented to analytically show the inherent performance gain in terms of the average arrival rate (AAR). Then, a practical framework based on a novel power map is proposed to associate a set of well-designed transmit power levels with each geographical region for handling the no instantaneous channel state information problem. Based on this framework, the semi-grant-free (semi-GF) transmission with two practical protocols is introduced to enhance the connectivity, which has higher AAR than both the conventional grand-based and GF transmissions. When the number of active GF devices in mMTC far exceeds the available resource blocks, the corresponding AAR tends to zero. To solve this problem, user barring techniques are employed into the semi-GF transmission to stable the traffic flow and thus increase the AAR. Lastly, promising research directions are discussed for improving the proposed networks.
قيم البحث
اقرأ أيضاً
This paper jointly optimizes the flying location and wireless communication transmit power for an unmanned aerial vehicle (UAV) conducting covert operations. This is motivated by application scenarios such as military ground surveillance from airborn
e platforms, where it is vital for a UAVs signal transmission to be undetectable by those within the surveillance region. Specifically, we maximize the communication quality to a legitimate ground receiver outside the surveillance region, subject to: a covertness constraint, a maximum transmit power constraint, and a physical location constraint determined by the required surveillance quality. We provide an explicit solution to the optimization problem for one of the most practical constraint combinations. For other constraint combinations, we determine feasible regions for flight, that can then be searched to establish the UAVs optimal location. In many cases, the 2-dimensional optimal location is achieved by a 1-dimensional search. We discuss two heuristic approaches to UAV placement, and show that in some cases they are able to achieve close to optimal, but that in other cases significant gains can be achieved by employing our developed solutions.
In this paper, we exploit the capability of multi-agent deep reinforcement learning (MA-DRL) technique to generate a transmit power pool (PP) for Internet of things (IoT) networks with semi-grant-free non-orthogonal multiple access (SGF-NOMA). The PP
is mapped with each resource block (RB) to achieve distributed transmit power control (DPC). We first formulate the resource (sub-channel and transmit power) selection problem as stochastic Markov game, and then solve it using two competitive MA-DRL algorithms, namely double deep Q network (DDQN) and Dueling DDQN. Each GF user as an agent tries to find out the optimal transmit power level and RB to form the desired PP. With the aid of dueling processes, the learning process can be enhanced by evaluating the valuable state without considering the effect of each action at each state. Therefore, DDQN is designed for communication scenarios with a small-size action-state space, while Dueling DDQN is for a large-size case. Our results show that the proposed MA-Dueling DDQN based SGF-NOMA with DPC outperforms the SGF-NOMA system with the fixed-power-control mechanism and networks with pure GF protocols with 17.5% and 22.2% gain in terms of the system throughput, respectively. Moreover, to decrease the training time, we eliminate invalid actions (high transmit power levels) to reduce the action space. We show that our proposed algorithm is computationally scalable to massive IoT networks. Finally, to control the interference and guarantee the quality-of-service requirements of grant-based users, we find the optimal number of GF users for each sub-channel.
Secure communication is a promising technology for wireless networks because it ensures secure transmission of information. In this paper, we investigate the joint subcarrier (SC) assignment and power allocation problem for non-orthogonal multiple ac
cess (NOMA) amplify-and-forward two-way relay wireless networks, in the presence of eavesdroppers. By exploiting cooperative jamming (CJ) to enhance the security of the communication link, we aim to maximize the achievable secrecy energy efficiency by jointly designing the SC assignment, user pair scheduling and power allocation. Assuming the perfect knowledge of the channel state information (CSI) at the relay station, we propose a low-complexity subcarrier assignment scheme (SCAS-1), which is equivalent to many-to-many matching games, and then SCAS-2 is formulated as a secrecy energy efficiency maximization problem. The secure power allocation problem is modeled as a convex geometric programming problem, and then solved by interior point methods. Simulation results demonstrate that the effectiveness of the proposed SSPA algorithms under scenarios of using and not using CJ, respectively.
The integration of non-orthogonal multiple access in millimeter-Wave communications (mmWave-NOMA) can significantly improve the spectrum efficiency and increase the number of users in the fifth-generation (5G) mobile communication. In this paper we c
onsider a downlink mmWave-NOMA cellular system, where the base station is mounted with an analog beamforming phased array, and multiple users are served in the same time-frequency resource block. To guarantee user fairness, we formulate a joint beamforming and power allocation problem to maximize the minimal achievable rate among the users, i.e., we adopt the max-min fairness. As the problem is difficult to solve due to the non-convex formulation and high dimension of the optimization variables, we propose a sub-optimal solution, which makes use of the spatial sparsity in the angle domain of the mmWave channel. In the solution, the closed-form optimal power allocation is obtained first, which reduces the joint optimization problem into an equivalent beamforming problem. Then an appropriate beamforming vector is designed. Simulation results show that the proposed solution can achieve a near-upper-bound performance in terms of achievable rate, which is significantly better than that of the conventional mmWave orthogonal multiple access (mmWave-OMA) system.
In this paper, a backscatter cooperation (BC) scheme is proposed for non-orthogonal multiple access (NOMA) downlink transmission. The key idea is to enable one user to split and then backscatter part of its received signals to improve the reception a
t another user. To evaluate the performance of the proposed BC-NOMA scheme, three benchmark schemes are introduced. They are the non-cooperation (NC)-NOMA scheme, the conventional relaying (CR)-NOMA scheme, and the incremental relaying (IR)-NOMA scheme. For all these schemes, the analytical expressions of the minimum total power to avoid information outage are derived, based on which their respective outage performance, expected rates, and diversity-multiplexing trade-off (DMT) are investigated. Analytical results show that the proposed BC-NOMA scheme strictly outperforms the NC-NOMA scheme in terms of all the three metrics. Furthermore, theoretical analyses are validated via Monte-Carlo simulations. It is shown that unlike the CR-NOMA scheme and the IR-NOMA scheme, the proposed BC-NOMA scheme can enhance the transmission reliability without impairing the transmission rate, which makes backscattering an appealing solution to cooperative NOMA downlinks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
