arXiv subjects

Ahmed Abdelhadi

Publications and source records attributed to Ahmed Abdelhadi.

At least 37 records · Page 2Linked to original sources

arXiv2015

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

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.

cs.NI↗

arXiv2015

Network MIMO with Partial Cooperation between Radar and Cellular Systems

To meet the growing spectrum demands, future cellular systems are expected to share the spectrum of other services such as radar. In this paper, we consider a network multiple-input multiple-output (MIMO) with partial cooperation model where radar stations cooperate with cellular base stations (BS)s to deliver messages to intended mobile users. So the radar stations act as BSs in the cellular system. However, due to the high power transmitted by radar stations for detection of far targets, the cellular receivers could burnout when receiving these high radar powers. Therefore, we propose a new projection method called small singular values space projection (SSVSP) to mitigate these harmful high power and enable radar stations to collaborate with cellular base stations. In addition, we formulate the problem into a MIMO interference channel with general constraints (MIMO-IFC-GC). Finally, we provide a solution to minimize the weighted sum mean square error minimization problem (WSMMSE) with enforcing power constraints on both radar and cellular stations.

cs.IT↗

arXiv2015

Context-Aware Resource Allocation in Cellular Networks

We define and propose a resource allocation architecture for cellular networks. The architecture combines content-aware, time-aware and location-aware resource allocation for next generation broadband wireless systems. The architecture ensures content-aware resource allocation by prioritizing real-time applications users over delay-tolerant applications users when allocating resources. It enables time-aware resource allocation via traffic-dependent pricing that varies during different hours of day (e.g. peak and off-peak traffic hours). Additionally, location-aware resource allocation is integrable in this architecture by including carrier aggregation of various frequency bands. The context-aware resource allocation is an optimal and flexible architecture that can be easily implemented in practical cellular networks. We highlight the advantages of the proposed network architecture with a discussion on the future research directions for context-aware resource allocation architecture. We also provide experimental results to illustrate a general proof of concept for this new architecture.

cs.NI↗

arXiv2015

An Optimal Resource Allocation with Frequency Reuse in Cellular Networks

In this paper, we introduce a novel approach for optimal resource allocation with frequency reuse for users with elastic and inelastic traffic in cellular networks. In our model, we represent users' applications running on different user equipments (UE)s by logarithmic and sigmoid utility functions. We applied utility proportional fairness allocation policy, i.e. the resources are allocated among users with fairness in utility percentage of the application running on each mobile station. Our objective is to allocate the cellular system resources to mobile users optimally from a multi-cell network. In our model, a minimum quality-of-service (QoS) is guaranteed to every user subscribing for the mobile service with priority given to users with real-time applications. We show that the novel resource allocation optimization problem with frequency reuse is convex and therefore the optimal solution is tractable. We present a distributed algorithm to allocate the resources optimally from Mobility Management Entity (MME) to base stations (BS)s sectors. Finally, we present the simulation results for the performance of our rate allocation algorithm.

cs.NI↗

arXiv2015

Optimal Downlink Power Allocation in Cellular Networks

In this paper, we introduce a novel approach for power allocation in cellular networks. In our model, we use sigmoidal-like utility functions to represent different users' modulation schemes. Each utility function is a representation of the probability of successfully transmitted packets per unit of power consumed by a user, when using a certain modulation scheme. We consider power allocation with utility proportional fairness policy, where the fairness among users is in utility percentage i.e. percentage of successfully transmitted packets of the corresponding modulation scheme. We formulate our network utility maximization problem as a product of utilities of all users and prove that our power allocation optimization problem is convex and therefore the optimal solution is tractable. We present a distributed algorithm to allocate base station (BS) powers optimally with priority given to users running lower modulation schemes while ensuring non-zero power allocation to users running higher modulation schemes. Our algorithm prevents fluctuation in the power allocation process and is capable of traffic and modulation dependent pricing i.e. charges different price per unit power from different users depending in part on their modulation scheme and total power available at the BS. This is used to flatten traffic and decrease the service price for users.

cs.NI↗

arXiv2015

An Optimal Resource Allocation with Joint Carrier Aggregation in 4G-LTE

In this paper, we introduce a novel approach for optimal resource allocation from multiple carriers for users with elastic and inelastic traffic in fourth generation long term evolution (4G-LTE) system. In our model, we use logarithmic and sigmoidal-like utility functions to represent the user applications running on different user equipments (UE)s. We use utility proportional fairness policy, where the fairness among users is in utility percentage of the application running on the mobile station. Our objective is to allocate the resources to the users optimally from multiple carriers. In addition, every user subscribing for the mobile service is guaranteed to have a minimum quality-of-service (QoS) with a priority criterion. Our rate allocation algorithm selects the carrier or multiple carriers that provide the minimum price for the needed resources. We prove that the novel resource allocation optimization problem with joint carrier aggregation is convex and therefore the optimal solution is tractable. We present a distributed algorithm to allocate the resources optimally from multiple evolved NodeBs (eNodeB)s. Finally, we present simulation results for the performance of our rate allocation algorithm.

cs.NI↗

arXiv2015

A Multi-Tier 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 multi-tier 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 optimizes 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, in the considered spectrum sharing system, with other spectrum auction mechanisms for realistic cellular systems.

cs.NI↗

arXiv2015

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 (QoS) 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.

cs.NI↗

arXiv2015

Resource Allocation in Cellular Systems for Applications with Random Parameters

In this paper, we conduct a study to optimize resource allocation for adaptive real-time and delay-tolerant applications in cellular systems. To represent the user applications via several devices and equipment, sigmoidal-like and logarithm utility functions are used. A fairness proportional utility functions policy approach is used to allocate the resources among the user equipment (UE)s in a utility percentage form and to ensure a minimum level of customer satisfaction for all the subscribers. Meanwhile, the priority of resources allocation is given to the real-time applications. We measure the effect of the stochastic variations of the adaptive real-time applications on the optimal rate allocation process and compare the results of deterministic and stochastic systems. Our work is distinct from the other resource allocation optimization works in that we use bisection method besides convex optimization techniques to optimally allocate rates, and we present the adaptive real- time applications in a stochastic form. We use Microsoft Visual Basic for Applications with Arena Simulation Software interface to simulate the optimization problem. Finally, we present our optimization algorithm results.

cs.NI↗

arXiv2015

Optimal Power Allocation for LTE Users with Different Modulations

In this paper, we demonstrate the optimal power allocation for QPSK, 16-QAM, and 64-QAM modulation schedules and the role of channel quality indicator (CQI). We used sigmoidal-like utility functions to represent the probability of successful reception of packets at user equipment (UE). CQI as a feedback to the base station (BS) indicates the data rate that a downlink channel can support. With Levenberg-Marquardt (LM) Optimization method, we present utility functions of different CQI values for standardized 15 Modulation order and Coding Scheme (MCS) in $3^{rd}$ Generation Partnership Project (3GPP). Finally, we simulate and show the results of the optimal power allocation algorithm.

cs.NI↗

arXiv2015

A QoS-based Power Allocation for Cellular Users with Different Modulations

In this paper, we propose a novel optimal power allocation method that features a power limit function and is able to ensure more users reach the desired Quality-of-Service (QoS). In our model we use sigmoidal-like utility functions to represent the probability of successful reception of packets at user equipment (UE)s. Given that each UE has a different channel quality and different location from base station (BS), it has different CQI and modulation. For each CQI zone, we evaluate the power threshold which is required to achieve the minimum QoS for each UE and show that the higher CQI the lower power threshold is. We present a resource allocation algorithm that gives limited resources to UEs who have already reached their pre-specified minimum QoS, and provides more possible resources to UEs who can not reach it. We also compare this algorithm with the optimal power allocation algorithm in [1] to show the enhancement.

cs.NI↗

arXiv2015

Robust Resource Allocation with Joint Carrier Aggregation for Multi-Carrier Cellular Networks

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.

cs.NI↗

arXiv2015

Three-dimensional (3D) Channel Modeling between Seaborne MIMO Radar and MIMO Cellular System

Sharing radar spectrum with communication systems is an emerging area of research. Deploying commercial wireless communication services in radar bands give wireless operators the much needed additional spectrum to meet the growing bandwidth demands. However, to enable spectrum sharing between these two fundamentally different systems interference concerns must be addressed. In order to assess interference concerns we design a three-dimensional (3D) channel model between radar and cellular base stations (BSs) in which the radar uses a two-dimensional (2D) antenna array and the BS uses a one-dimensional (1D) antenna array. We formulate a line-of-sight (LoS) channel and then propose an algorithm that mitigates radar interference to BSs. We extend the previously proposed null space projection algorithm for 2D channels to 3D channels and show that effective nulls can be placed by utilizing both the azimuth and elevation angle information of BSs. This results in effective interference mitigation. In addition we show that the 3D channel model allows us to accurately classify the size of radar's search space when null space projection algorithm is used for interference mitigation.

cs.IT↗

arXiv2015

Channel Modeling between Seaborne MIMO Radar and MIMO Cellular System

Spectrum sharing between radars and cellular systems is an emerging area of research. In this paper, we model channel between a seaborne MIMO radar and MIMO cellular system. We model a 2D channel to capture the azimuth aspect of the spectrum sharing scenario. Our channel modeling methodology allows MIMO radar to place accurate nulls in the azimuth location of base stations (BS), thus, protecting them from harmful radar interference. We use a projection based approach, where radar waveform is projected onto null space of channel, for mitigating radar interference to BSs. This is also known as an approach based on eigen-nulling which is different from spatial-nulling commonly employed by radars. We show through simulations that the proposed spatial channel model allows eigen-nulling which performs superior to traditional spatial-nulling for interference mitigation. The proposed channel model can be leveraged to use eigen-nulling that enhances target detection and beampattern resolution of MIMO radar while mitigating interference to BSs.

cs.IT↗

arXiv2015

Radar Precoder Design for Spectral Coexistence with Coordinated Multi-point (CoMP) System

This paper details the design of precoders for a MIMO radar spectrally coexistent with a MIMO cellular network. We focus on a coordinated multi-point (CoMP) system where a cluster of base stations (BSs) coordinate their transmissions to the intended user. The radar operates in two modes, interference-mitigation mode when it avoids interference with the CoMP system and cooperation mode when it exchanges information with it. Using either the conventional Switched Null Space Projection (SNSP) or the newly proposed Switched Small Singular Value Space Projection (SSSVSP), the radar beam sweeps across the BS clusters focusing on the optimal ones, optimal in either nullity or difference between the precoded and original radar signal. Taking the channel estimation error into account, the design of precoder is pivoted on the minimal radar interference at the BS clusters during interference-mitigation mode and minimal bit-error-rate at the BSs during cooperation mode while interfering minimally with the radar target detection capability. Our investigation shows that loss in radar performance can be compensated using SSSVSP instead of SNSP to some extent but increasing the number of radar antenna elements goes a long way to serve the purpose. Simulations verify our theoretical predictions about the proposed SSSVSP.

cs.IT↗

arXiv2015

Overlapped-MIMO Radar Waveform Design for Coexistence With Communication Systems

This paper explores an overlapped-multiple-input multiple-output (MIMO) antenna architecture and a spectrum sharing algorithm via null space projection (NSP) for radar-communications coexistence. In the overlapped-MIMO architecture, the transmit array of a collocated MIMO radar is partitioned into a number of subarrays that are allowed to overlap. Each of the antenna elements in these subarrays have signals orthogonal to each other and to the elements of the other subarrays. The proposed architecture not only improves sidelobe suppression to reduce interference to communications system, but also enjoys the advantages of MIMO radar without sacrificing the main desirable characteristics. The radar-centric spectrum sharing algorithm then projects the radar signal onto the null space of the communications system's interference channel, which helps to avoid interference from the radar. Numerical results are presented which show the performance of the proposed waveform design algorithm in terms of overall beampattern and sidelobe levels of the radar waveform and finally shows a comparison of the proposed system with existing collocated MIMO radar architectures.

cs.IT↗

arXiv2014

Optimal Radio Resource Allocation for Hybrid Traffic in Cellular Networks: Centralized and Distributed Architecture

Optimal resource allocation is of paramount importance in utilizing the scarce radio spectrum efficiently and provisioning quality of service for miscellaneous user applications, generating hybrid data traffic streams in present-day wireless communications systems. A dynamism of the hybrid traffic stemmed from concurrently running mobile applications with temporally varying usage percentages in addition to subscriber priorities impelled from network providers' perspective necessitate resource allocation schemes assigning the spectrum to the applications accordingly and optimally. This manuscript concocts novel centralized and distributed radio resource allocation optimization problems for hybrid traffic-conveying cellular networks communicating users with simultaneously running multiple delay-tolerant and real-time applications modelled as logarithmic and sigmoidal utility functions, volatile application percent usages, and diverse subscriptions. Casting under a utility proportional fairness entail no lost calls for the proposed modi operandi, for which we substantiate the convexity, devise computationally efficient algorithms catering optimal rates to the applications, and prove a mutual mathematical equivalence. Ultimately, the algorithms performance is evaluated via simulations and discussing germane numerical results.

cs.NI↗

arXiv2014

Optimal Radio Resource Allocation for Hybrid Traffic in Cellular Networks: Traffic Analysis and Implementation

In part I of this paper, a distributed and a centralized architecture for an optimal radio resource allocation aware of the traffic delay-tolerance nature, user subscription type, and application usage variations were developed. In the current article, a transmission overhead analysis of the aforementioned distributed and a centralized architectures is investigated and it is proved that the centralized scheme endures a significantly lower transmission overhead than does the distributed approach. Furthermore, the lower bounds of the transmission overhead for both the centralized and the distributed architectures are derived. Moreover, a sensitivity analysis of the resource allocation procedures of the aforesaid centralized and distributed architectures to the changes in the number of users in the system is presented. Besides, a sensitivity analysis of the centralized and distributed approaches to the temporal changes in application usages are investigated. Ultimately, the transmission overhead and sensitivity relevant statements are verified through appropriate simulations. And last but not the least, a real-world implementation of the resource allocation methods developed in Part I is provided.

cs.NI↗