4 research outputs found

    A novel HGBBDSA-CTI approach for subcarrier allocation in heterogeneous network

    Get PDF
    In recent times, Heterogeneous Network (HetNet) achieves the capacity and coverage for indoors through the deployment of small cells i.e. femtocells (HeNodeBs). These HeNodeBs are plug-and-play Customer Premises Equipment’s which are associated with the internet protocol backhaul to macrocell (macro-eNodeB). The random placement of HeNodeBs deployed in co-channel along with macro-eNodeB is causing severe system performance degradation. Thereby, these HeNodeBs are suggested as the ultimate and the most significant cause of interference in Orthogonal Frequency-Division Multiple-Access based HetNets due to the restricted co-channel deployment. The CTI in such systems can significantly reduce the throughput, and the outages can rise to the unacceptable limit or extremely high levels. These lead to severe system performance degradation in HetNets. This paper presents a novel HGBBDSA-CTI approach capable of strategically allocate the subcarriers and thereby improves the throughput as well as the outage. The enhanced system performance is able to mitigate CTI issues in HetNets. This paper also analyses the time complexity for the proposed HGBBDSA algorithm and also compares it with the Genetic Algorithm-based Dynamic Subcarrier Allocation (DSA), and Particle Swarm Optimization-based DSA as well. The key target of this study is to allocate the unoccupied subcarriers by sharing among the HeNodeBs. The reason is also to enhance the system performance such as throughput of HeNodeB, the average throughput of HeNodeB Users, and outage. The simulation results show that the proposed HGBBDSA-CTI approach enhances the average throughput (92.05 and 74.44%), throughput (30.50 and 74.34%), and the outage rate reduced to 52.9 and 50.76% compare with the existing approaches. The result also indicates that the proposed HGBBDSA approach has less time complexity than the existing approaches

    Energy and computationally efficient resource allocation methods for cellular relay-aided networks with system stability consideration

    Get PDF
    The increasing demand for coverage extension and power gain, along with the need for decreasing implementation costs, raised the idea of relaying cellular systems. Developing relay stations as a coverage extension and low cost mechanism has also brought up the challenge of utilizing the available network resources cooperatively between base stations and relays. The topic of resource allocation in the downlink of a relaying cellular system is studied in the current dissertation with the objective of maximizing transmission rate, encompassing system stability and managing the interference as it has not been investigated as a comprehensive allocation problem in the previous literature. We begin our study by modeling a single cell downlink transmission system with the objective to enhance the throughput of cell-edge users by employing decode-and-forward relay stations. We study the queue length evolution at each hop and propose a rate control mechanism to stabilize the considered queues. Accordingly, we propose a novel allocation model which maximizes user throughput with respect to the channel condition and the stability requirements. To solve the proposed allocation problem, we introduced optimization algorithm as well as heuristic approaches which offer low computation complexity. Next, we enhance the initial allocation method by considering a multi-cell system that accounts for more general and practical cellular networks. The multi-cell model embodies extra constraints for controlling the interference to the users of neighboring cells. We propose a different set of stability constraints which do not enquire a priori knowledge of the statistics of the arriving traffic. In an approach to improve the energy efficiency while respecting the stability and interference criteria, we also suggest an energy-conservative allocation scheme. We solve the defined allocation problems in a central controlling system. As our final contribution, we enhance the proposed multi-cell allocation model with a low overhead and distributed approach. The proposed method is based on the idea of dividing the resource allocation task between each base station and its connected relay stations. In addition, the messaging overhead for controlling inter-cell interference is minimized using the reference-station method. This distributed approach offers high degree of energy efficiency as well as more scalability in comparison to centralized schemes, when the system consists of larger number of cells and users. Since the defined problems embody multiple variables and constraints, we develop a framework to cast the joint design in the optimization form which gives rise to nonlinear and nonconvex problems. In this regard, we employ time-sharing technique to tackle the combinatorial format of the allocation problem. In addition, it is important to consider the situation that the time-shared approach is not beneficial when subcarriers are not allowed to be shared during one time-slot. To overcome this obstacle, we apply heuristic algorithms as well as convex optimization techniques to obtain exclusive subcarrier allocation schemes. To evaluate the performance of the proposed solutions, we compare them in terms of the achieved throughput, transmitted power, queue stability, feedback overhead, and computation complexity. By the means of extensive simulation scenarios as well as numerical analysis, we demonstrate the remarkable advantages of the suggested approaches. The results of the present dissertation are appealing for designing of future HetNet systems specifically when the communication latency and the energy consumption are required to be minimized
    corecore