Do you want to publish a course? Click here

Self-Organized Scheduling Request for Uplink 5G Networks: A D2D Clustering Approach

96   0   0.0 ( 0 )
 Added by Mohammad Gharbieh
 Publication date 2018
and research's language is English




Ask ChatGPT about the research

In one of the several manifestations, the future cellular networks are required to accommodate a massive number of devices; several orders of magnitude compared to todays networks. At the same time, the future cellular networks will have to fulfill stringent latency constraints. To that end, one problem that is posed as a potential showstopper is extreme congestion for requesting uplink scheduling over the physical random access channel (PRACH). Indeed, such congestion drags along scheduling delay problems. In this paper, the use of self-organized device-to-device (D2D) clustering is advocated for mitigating PRACH congestion. To this end, the paper proposes two D2D clustering schemes, namely; Random-Based Clustering (RBC) and Channel-Gain-Based Clustering (CGBC). Accordingly, this paper sheds light on random access within the proposed D2D clustering schemes and presents a case study based on a stochastic geometry framework. For the sake of objective evaluation, the D2D clustering is benchmarked by the conventional scheduling request procedure. Accordingly, the paper offers insights into useful scenarios that minimize the scheduling delay for each clustering scheme. Finally, the paper discusses the implementation algorithm and some potential implementation issues and remedies.



rate research

Read More

This paper studies the problem of distributed beam scheduling for 5G millimeter-Wave (mm-Wave) cellular networks where base stations (BSs) belonging to different operators share the same spectrum without centralized coordination among them. Our goal is to design efficient distributed scheduling algorithms to maximize the network utility, which is a function of the achieved throughput by the user equipment (UEs), subject to the average and instantaneous power consumption constraints of the BSs. We propose a Media Access Control (MAC) and a power allocation/adaptation mechanism utilizing the Lyapunov stochastic optimization framework and non-cooperative games. In particular, we first decompose the original utility maximization problem into two sub-optimization problems for each time frame, which are a convex optimization problem and a non-convex optimization problem, respectively. By formulating the distributed scheduling problem as a non-cooperative game where each BS is a player attempting to optimize its own utility, we provide a distributed solution to the non-convex sub-optimization problem via finding the Nash Equilibrium (NE) of the game whose weights are determined optimally by the Lyapunov optimization framework. Finally, we conduct simulation under various network settings to show the effectiveness of the proposed game-based beam scheduling algorithm in comparison to that of several reference schemes.
Different from public 4G/5G networks that are dominated by downlink traffic, emerging 5G non-public networks (NPNs) need to support significant uplink traffic to enable emerging applications such as industrial Internet of things (IIoT). The uplink-and-downlink spectrum sharing is becoming a viable solution to enhance the uplink throughput of NPNs, which allows the NPNs to perform the uplink transmission over the time-frequency resources configured for downlink transmission in coexisting public networks. To deal with the severe interference from the downlink public base station (BS) transmitter to the coexisting uplink non-public BS receiver, we propose an adaptive asymmetric successive interference cancellation (SIC) approach, in which the non-public BS receiver is enabled to have the capability of decoding the downlink signals transmitted from the public BS and successively cancelling them for interference mitigation. In particular, this paper studies a basic uplink-and-downlink spectrum sharing scenario when an uplink non-public BS and a downlink public BS coexist in the same area, each communicating with multiple users via orthogonal frequency-division multiple access (OFDMA). Under this setup, we aim to maximize the common uplink throughput of all non-public users, under the condition that the downlink throughput of each public user is above a certain threshold. The decision variables include the subcarrier allocation and user scheduling for both non-public (uplink) and public (downlink) BSs, the decoding mode of the non-public BS over each subcarrier (i.e., with or without SIC), as well as the rate and power control over subcarriers. Numerical results show that the proposed adaptive asymmetric SIC design significantly improves the common uplink throughput as compared to benchmark schemes without such design.
In this paper, we study the resource allocation problem for a cooperative device-to-device (D2D)-enabled wireless caching network, where each user randomly caches popular contents to its memory and shares the contents with nearby users through D2D links. To enhance the throughput of spectrum sharing D2D links, which may be severely limited by the interference among D2D links, we enable the cooperation among some of the D2D links to eliminate the interference among them. We formulate a joint link scheduling and power allocation problem to maximize the overall throughput of cooperative D2D links (CDLs) and non-cooperative D2D links (NDLs), which is NP-hard. To solve the problem, we decompose it into two subproblems that maximize the sum rates of the CDLs and the NDLs, respectively. For CDL optimization, we propose a semi-orthogonal-based algorithm for joint user scheduling and power allocation. For NDL optimization, we propose a novel low-complexity algorithm to perform link scheduling and develop a Difference of Convex functions (D.C.) programming method to solve the non-convex power allocation problem. Simulation results show that the cooperative transmission can significantly increase both the number of served users and the overall system throughput.
This paper provides the signal-to-interference-plus-noise ratio (SINR) complimentary cumulative distribution function (CCDF) and average data rate of the normalized SNR-based scheduling in an uplink cellular network using stochastic geometry. The uplink analysis is essentially different from the downlink analysis in that the per-user transmit power control is performed and that the interferers are composed of at most one transmitting user in each cell other than the target cell. In addition, as the effect of multi-user diversity varies from cell to cell depending on the number of users involved in the scheduling, the distribution of the number of users is required to obtain the averaged performance of the scheduling. This paper derives the SINR CCDF relative to the typical scheduled user by focusing on two incompatible cases, where the scheduler selects a user from all the users in the corresponding Voronoi cell or does not select users near cell edges. In each case, the SINR CCDF is marginalized over the distribution of the number of users involved in the scheduling, which is asymptotically correct if the BS density is sufficiently large or small. Through the simulations, the accuracies of the analytical results are validated for both cases, and the scheduling gains are evaluated to confirm the multi-user diversity gain.
Novel bitwise retransmission schemes are devised which retransmit only the bits received with small reliability. The retransmissions are used to accumulate the reliabilities of individual bits. Unlike the conventional automatic repeat request (ARQ) schemes, the proposed scheme does not require a checksum for the error detection. The bits to be retransmitted are reported as a combination number, or two synchronized random number generators (RNGs) at the transmitter and receiver are used to greatly compress the feedback message. The bitwise retransmission decisions and/or combining can be performed after the demodulation or after the channel decoding at the receiver. The bit-error rate (BER) expressions are derived for the case of one and two retransmissions, and verified by computer simulations. Assuming three specific retransmission strategies, the scheme parameters are optimized to minimize the overall BER. For the same number of retransmissions and packet length, the proposed schemes always outperform the frequently used stop-and-wait ARQ. The impact of feedback errors is also considered. Finally, practical designs of the bitwise retransmissions for data fusion from sensor nodes in Zigbee, Wifi and Bluetooth networks are presented.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا