Spectrum sharing is a promising solution for the problem of spectrum congestion. We consider a spectrum sharing scenario between a multiple-input multiple-output (MIMO) radar and Long Term Evolution (LTE) Advanced cellular system. In this paper, we consider resource allocation optimization problem with carrier aggregation. The LTE Advanced system has N BS base stations (BS) which it operates in the radar band on a sharing basis. Our objective is to allocate resources from the LTE Advanced carrier and the MIMO radar carrier to each user equipment (UE) in an LTE Advanced cell based on the running application of UE. Each user application is assigned a utility function based on the type of application. We propose a carrier aggregation resource allocation algorithm to allocate the LTE Advanced and the radar carriers' resources optimally among users based on the type of user application. The algorithm gives priority to users running inelastic traffic when allocating resources. Finally we present simulation results on the performance of the proposed carrier aggregation resource allocation algorithm.
In this paper, we consider a resource allocation with carrier aggregation optimization problem in long term evolution (LTE) cellular networks. In our proposed model, users are running elastic or inelastic traffic. Each user equipment (UE) is assigned an application utility function based on the type of its application. Our objective is to allocate multiple carriers resources optimally among users in their coverage area while giving the user the ability to select one of the carriers to be its primary carrier and the others to be its secondary carriers. The UE's decision is based on the carrier price per unit bandwidth. We present a price selective centralized resource allocation with carrier aggregation algorithm to allocate multiple carriers resources optimally among users while providing a minimum price for the allocated resources. In addition, we analyze the convergence of the algorithm with different carriers rates. Finally, we present simulation results for the performance of the proposed algorithm.
Abstract-In this paper, we introduce an application-aware approach for resource block scheduling with carrier aggregation in Long Term Evolution Advanced (LTE-Advanced) cellular networks. In our approach, users are partitioned in different groups based on the carriers coverage area. In each group of users, users equipments (UE)s are assigned resource blocks (RB)s from all in band carriers. We use a utility proportional fairness (PF) approach in the utility percentage of the application running on the UE. Each user is guaranteed a minimum quality of service (QoS) with a priority criterion that is based on the type of application running on the UE. We prove that our scheduling policy exists and therefore the optimal solution is tractable. Simulation results are provided to compare the performance of the proposed RB scheduling approach with other scheduling policies.
Abstract-In this paper, we consider resource allocation optimization problem in cellular networks for different types of users running multiple applications simultaneously. In our proposed model, each user application is assigned a utility function that represents the application type running on the user equipment (UE). The network operators assign a subscription weight to each UE based on its subscription. Each UE assigns an application weight to each of its applications based on the instantaneous usage percentage of the application. Additionally, UEs with higher priority assign applications target rates to their applications. Our objective is to allocate the resources optimally among the UEs and their applications from a single evolved node B (eNodeB) based on a utility proportional fairness policy with priority to realtime application users. A minimum quality of service (QoS) is guaranteed to each UE application based on the UE subscription weight, the UE application weight and the UE application target rate. We propose a two-stage rate allocation algorithm to allocate the eNodeB resources among users and their applications. Finally, we present simulation results for the performance of our rate allocation algorithm.
In this paper, we present our spectrum sharing algorithm between a multi-input multi-output (MIMO) radar and Long Term Evolution (LTE) cellular system with multiple base stations (BS)s. We analyze the performance of MIMO radars in detecting the angle of arrival, propagation delay and Doppler angular frequency by projecting orthogonal waveforms onto the null-space of interference channel matrix. We compare and analyze the radar's detectable target parameters in the case of the original radar waveform and the case of null-projected radar waveform. Our proposed spectrum-sharing algorithm causes minimum loss in radar performance by selecting the best interference channel that does not cause interference to the i th LTE base station due to the radar signal. We show through our analytical and simulation results that the loss in the radar performance in detecting the target parameters is minimal when our proposed spectrum sharing algorithm is used to select the best channel onto which radar signals are projected.
Abstract-In this paper, we present a novel approach for robust optimal resource allocation with joint carrier aggregation to allocate multiple carriers resources optimally among users with elastic and inelastic traffic in cellular networks. We use utility proportional fairness allocation policy, where the fairness among users is in utility percentage of the application running on the user equipment (UE). Each UE is assigned an application utility function based on the type of its application. Our objective is to allocate multiple carriers resources optimally among users subscribing for mobile services. In addition, each user is guaranteed a minimum quality of service (QoS) that varies based on the user's application type. We present a robust algorithm that solves the drawback in the algorithm presented in [1] by preventing the fluctuations in the resource allocation process, in the case of scarce resources, and allocates optimal rates for both high-traffic and low-traffic situations. Our distributed resource allocation algorithm allocates an optimal rate to each user from all carriers in its range while providing the minimum price for the allocated rate. In addition, we analyze the convergence of the algorithm with different network traffic densities and show that our algorithm provides traffic dependent pricing for network providers. Finally, we present simulation results for the performance of our resource allocation algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with đź’™ for researchers
Part of the Research Solutions Family.