Heterogeneous network optimization using robust power-and-resource based algorithm

In order to meet the increasing mobile data-traffic, spatial densification of network with several low-power nodes, the high-power macro BS and HetNet are the major key enabling solution. However, the HetNet is unplanned in nature, causes irregularities and interferences that without any user association rules. The appropriate deployment of the femto-cell in HetNet can provide effective traffic offloading, where the alleviate mobbing in the macro-cells can decrease the power consumption therefore it optimizes the user experience. Moreover, the protection is also important for the macro and femto cell users in a network through maintaining the min-max level of interferences. In this paper, we proposed RPRA that comprises two robust approach such as robust power-controller and the robust channel-allocation approach, which can improve the spectral efficiency and user experiences at lower network coverage areas via eliminating the week coverage zones. Also provide high user rate connection by effective interference in an efficient spectrum, lowering in transmission power and cost-effectiveness via less time delay. To show the effectiveness of our proposed model we have compared with several existing techniques and we got significant improvement in throughput, also reduction in time delay and transmission power

Cross-layer design for OFDMA wireless networks with finite queue length based on game theory

This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University London.In next generation wireless networks such as 4G- LTE and WiMax, the demand for high data rates, the scarcity of wireless resources and the time varying channel conditions has led to the adoption of more sophisticated and robust techniques in PHY such as orthogonal frequency division multiplexing (OFDM) and the corresponding access technique known as orthogonal frequency division multiplexing access (OFDMA). Cross-layer schedulers have been developed in order to describe the procedure of resource allocation in OFDMA wireless networks. The resource allocation in OFDMA wireless networks has received great attention in research, by proposing many different ways for frequency diversity exploitation and system’s optimization. Many cross-layer proposals for dynamic resource allocation have been investigated in literature approaching the optimization problem from different viewpoints i.e. maximizing total data rate, minimizing total transmit power, satisfying minimum users’ requirements or providing fairness amongst users. The design of a cross-layer scheduler for OFDMA wireless networks is the topic of this research. The scheduler utilizes game theory in order to make decisions for subcarrier and power allocation to the users with the main concern being to maintain fairness as well as to maximize overall system’s performance. A very well known theorem in cooperative game theory, the Nash Bargaining Solution (NBS), is employed and solved in a close form way, resulting in a Pareto optimal solution. Two different cases are proposed. The first one is the symmetric NBS (S-NBS) where all users have the same weight and therefore all users have the same opportunity for resources and the second one, is the asymmetric NBS (A-NBS), where users have different weights, hence different priorities where the scheduler favours users with higher priorities at expense of lower priority users. As MAC layer is vital for cross-layer, the scheduler is combined with a queuing model based on Markov chain in order to describe more realistically the incoming procedure from the higher layers

Social-sine cosine algorithm-based cross layer resource allocation in wireless network

Cross layer resource allocation in the wireless networks is approached traditionally either by communications networks or information theory. The major issue in networking is the allocation of limited resources from the users of network. In traditional layered network, the resource are allocated at medium access control (MAC) and the network layers uses the communication links in bit pipes for delivering the data at fixed rate with the occasional random errors. Hence, this paper presents the cross-layer resource allocation in wireless network based on the proposed social-sine cosine algorithm (SSCA). The proposed SSCA is designed by integrating social ski driver (SSD) and sine cosine algorithm (SCA). Also, for further refining the resource allocation scheme, the proposed SSCA uses the fitness based on energy and fairness in which max-min, hard-fairness, proportional fairness, mixed-bias and the maximum throughput is considered. Based on energy and fairness, the cross-layer optimization entity makes the decision on resource allocation to mitigate the sum rate of network. The performance of resource allocation based on proposed model is evaluated based on energy, throughput, and the fairness. The developed model achieves the maximal energy of 258213, maximal throughput of 3.703, and the maximal fairness of 0.868, respectively

WIMAX LINK PERFORMANCE ANALYSIS FOR WIRELESS AUTOMATION APPLICATIONS

Wireless broadband access technologies are rapidly growing and a corresponding growth in the demand of its applicability transcends faster internet access, high speed file download and different multimedia applications such as voice calls, video streaming, teleconferencing etc, to industrial operations and automation. Industrial and automation systems perform operations that requires the transmission of real time information from one end to another through high-performance wireless broadband communication links. WiMAX, based on IEEE 802.16 standard is one of the wireless broadband access technologies that has overcome location, speed, and access limitations of the traditional Digital Subscriber Line and Wireless Fidelity, and offers high efficient data rates. This thesis presents detailed analysis of operational WiMAX link performance parameters such as throughput, latency, jitter, and packet loss for suitable applicability in wireless automation applications. The theoretical background of components and functionalities of WiMAX physical and MAC layers as well as the network performance features are presented. The equipment deployed for this field experiment are Alvarion BreeZeMAX 3000 fixed WiMAX equipment operating in the 3.5 GHz licensed band with channel bandwidth of 3.5 MHz. The deployed equipment consisting of MBSE and CPE are installed and commissioned prior to field tests. Several measurements are made in three link quality scenarios (sufficient, good and excellent) in the University of Vaasa campus. Observations and results obtained are discussed and analyzed.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format

Proportional fair buffer scheduling algorithm for 5G enhanced mobile broadband

The impending next generation of mobile communications denoted 5G intends to interconnect user equipment, things, vehicles, and cities. It will provide an order of magnitude improvement in performance and network efficiency, and different combinations of use cases enhanced mobile broadband (eMBB), ultra reliable low latency communications (URLLC), massive internet of things (mIoT) with new capabilities and diverse requirements. Adoption of advanced radio resource management procedures such as packet scheduling algorithms is necessary to distribute radio resources among different users efficiently. The proportional fair (PF) scheduling algorithm and its modified versions have proved to be the commonly used scheduling algorithms for their ability to provide a tradeoff between throughput and fairness. In this article, the buffer status is combined with the PF metric to suggest a new scheduling algorithm for efficient support for eMBB. The effectiveness of the proposed scheduling strategy is proved through à comprehensive experimental analysis based on the evaluation of different quality of service key performance indicators (QoS KPIs) such as throughput, fairness, and buffer status