Haya Shajaiah

Utility Proportional Fairness Resource Allocation with Carrier Aggregation in 4G-LTE

In this paper, we consider a resource allocation optimization problem with carrier aggregation in fourth generation long term evolution (4G-LTE). In our proposed model, each user equipment (UE) is assigned a utility function that represents the application type running on the UE. Our objective is to allocate the resources from two carriers to each user based on its application that is represented by the utility function assigned to that user. We consider two groups of users, one with elastic traffic and the other with inelastic traffic. Each user is guaranteed a minimum resource allocation. In addition, a priority resource allocation is given to the UEs running adaptive real time applications. We prove that the optimal rate allocated to each UE by the single carrier resource allocation optimization problem is equivalent to the aggregated optimal rates allocated to the same user by the primary and secondary carriers when their total resources is equivalent to the single carrier resources. Our goal is to guarantee a minimum quality of service (QoS) that varies based on the user application type. We present a carrier aggregation rate allocation algorithm to allocate two carriers resources optimally among users. Finally we present simulation results with the carrier aggregation rate allocation algorithm.

Spectrum sharing between public safety and commercial users in 4G-LTE

In this paper, we consider resource allocation optimization problem in fourth generation long term evolution (4G-LTE) for public safety and commercial users running elastic or inelastic traffic. Each mobile user can run delay-tolerant or real-time applications. In our proposed model, each user equipment (UE) is assigned a utility function that represents the application type running on the UE. Our objective is to allocate the resources from a single evolved node B (eNodeB) to each user based on the user application that is represented by the utility function assigned to that user. We consider two groups of users, one represents public safety users with elastic or inelastic traffic and the other represents commercial users with elastic or inelastic traffic. The public safety group is given priority over the commercial group and within each group the inelastic traffic is prioritized over the elastic traffic. Our goal is to guarantee a minimum quality of service (QoS) that varies based on the user type, the user application type and the application target rate. A rate allocation algorithm is presented to allocate the eNodeB resources optimally among public safety and commercial users. Finally, the simulation results are presented on the performance of the proposed rate allocation algorithm.

Multi-application resource allocation with users discrimination in cellular networks

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.

A price selective centralized algorithm for resource allocation with carrier aggregation in LTE cellular networks

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 UEs 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.

A Multitier Wireless Spectrum Sharing System Leveraging Secure Spectrum Auctions

Secure spectrum auctions can revolutionize the spectrum utilization of cellular networks and satisfy the ever increasing demand for resources. In this paper, a multitier dynamic spectrum sharing system is studied for efficient sharing of spectrum with commercial wireless system providers (WSPs), with an emphasis on federal spectrum sharing. The proposed spectrum sharing system provides an efficient usage of spectrum resources, manages intra-WSP and inter-WSP interference, and provides essential level of security, privacy, and obfuscation to enable the most efficient and reliable usage of the shared spectrum. It features an intermediate spectrum auctioneer responsible for allocating resources to commercial WSPs by running secure spectrum auctions. The proposed secure spectrum auction, MTSSA, leverages Paillier cryptosystem to avoid possible fraud and bid-rigging. Numerical simulations are provided to compare the performance of MTSSA and its computational and communication complexity, in the considered spectrum sharing system, with other spectrum auction mechanisms for realistic cellular systems.

Spectrum Sharing Approach between Radar and Communication Systems and Its Impact on Radar's Detectable Target Parameters

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 radars 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 ith 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.

An Efficient Multi-carrier Resource Allocation with User Discrimination Framework for 5G Wireless Systems

In this paper, we present an efficient resource allocation with user discrimination framework for 5G Wireless Systems to allocate multiple carriers resources among users with elastic and inelastic traffic. Each application running on the user equipment (UE) is assigned an application utility function. In the proposed model, different classes of user groups are considered and users are partitioned into different groups based on the carriers coverage area. Each user has a minimum required application rate based on its class and the type of its application. Our objective is to allocate multiple carriers resources optimally among users, that belong to different classes, located within the carriers’ coverage area. We use a utility proportional fairness approach in the utility percentage of the application running on the UE. Each user is guaranteed a minimum quality of service with a priority criterion that is based on user’s class and the type of application running on the UE. In addition, we prove the existence of optimal solutions for the proposed resource allocation optimization problem and present a multi-carrier resource allocation with user discrimination algorithm. Finally, we present simulation results for the performance of the proposed algorithm.

Towards an Application-Aware Resource Scheduling With Carrier Aggregation in Cellular Systems

In this letter, 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.

Utility Functions and Resource Allocation for Spectrum Sharing

The user satisfaction with the provided service can be expressed using utility functions that represent the degree of satisfaction of the user function of the rate allocated by the cellular network [1–9]. We assume that the applications utility functions U(r) are strictly concave or sigmoidal-like functions [10–16].

Resource Allocation with Carrier Aggregation for Commercial Use of 3.5 GHz Spectrum

It is better to use the second paragraph of the chapter as an abstract as follows: In this chapter, we introduce an application-aware spectrum sharing approach for sharing the Federal under-utilized 3.5 GHz spectrum with commercial users. In our model, users are running elastic or inelastic traffic and each application running on the UE is assigned a utility function based on its type. Furthermore, each of the small cells’ users has a minimum required target utility for its application. In order for users located under the coverage area of the small cells’ eNodeBs, with the 3.5 GHz band resources, to meet their minimum required quality of experience (QoE), the network operator makes a decision regarding the need for sharing the macro cell’s resources to obtain additional resources. Our objective is to provide each user with a rate that satisfies its application’s minimum required utility through spectrum sharing approach and improve the overall QoE in the network. We present an application-aware spectrum sharing multi-stage algorithm that is based on resource allocation with carrier aggregation to allocate macro cell permanent resources and small cells’ leased resources to UEs based on a utility proportional fairness policy, and allocate each user’s application an aggregated rate that can at minimum achieve the application’s minimum required utility