scholarly journals Resource Allocation by Demand Based Optimization and Machine

In real-time multimedia usage the resource allocation for the modern communication is very much needed in-order to overcome certain problems or degradation happening in the communication channels. The quality of the communication is reduced due to the TVWS (Television White Space), variable BER signal requires variable channel allocation procedures and Qos depends on the various applications. These problems in the OFDM should be corrected continuously by keeping track of channel situation so that to provide a long term video streaming in good QoS. The energy distribution for the video is high the application requirement is higher also the occurrence of multiple BER will leads to the challenging environment to control. The main objective of this paper is to enhance a Game theory based algorithm incorporated with demand optimization algorithm and scheduling algorithm for machine learning to take decision in nonlinear space, which results in a system with good channel awareness and an adaptive resource allocation process. The effect of interference due to this procedure is checked and accordingly allocations are done

Author(s):  
Shivapanchakshari T. G. ◽  
H. S. Aravinda

The growing usage of wireless services is lacking in providing high-speed data communication in recent times. Hence, many of the modulation techniques are evolved to attain these communication needs. The recent researches have widely considered OFDM technology as the prominent modulation mechanism to fulfill the futuristic needs of wireless communication. The OFDM can bring effective usage of resources, bandwidth, and system performance enhancement in collaboration with the smart antenna and resource allocation mechanism (adaptive). However, the usage of adaptive beamforming with the OFDM leads to complication in the design of medium access layer and which causes a problem in adaptive resource allocation mechanism (ARAM). Hence, the proposed manuscript intends to design an OFDM system by considering different switched beam smart antenna (SBSA) along with the cross-layer adaptive resource allocation (CLARA) and hybrid adaptive array (HAA). In this, various smart antenna mechanism are considered to analyze the quality of service (QoS) and complexity reduction in the OFDM system. In this paper, various SA schemes are used as per the quality of service (QoS) requirement of the different users. The performance analysis is conducted by considering data traffic reduction, bit-rate reduction, and average delay.


Author(s):  
Johann Max Hofmann Magalhães ◽  
Saulo Henrique da Mata ◽  
Paulo Roberto Guardieiro

The design of a scheduling algorithm for LTE networks is a complex task, and it has proven to be one of the main challenges for LTE systems. There are many issues to be addressed in order to obtain a high spectral efficiency and to meet the application's QoS requirements. In this context, this chapter presents a study of the resource allocation process in LTE networks. This study starts with an overview of the main concepts involved in the LTE resource allocation, and brings two new proposals of scheduling algorithms for downlink and uplink, respectively. Simulations are used to compare the performance of these proposals with other scheduler proposals widely known and explored in the literature.


2020 ◽  
Vol 4 ◽  
pp. 91-96
Author(s):  
Olga Lopateeva ◽  
◽  
Anatoly Popov ◽  
Alexey Ovsyankin ◽  
Mikhail Satsuk

A greedy resource allocation algorithm is understood as an algorithm according to which the resource allocation process can be represented as a sequence of steps. At each step, an optimal, under certain conditions, distribution of a part of the resources occurs, which does not change in the future. The problem of improving the quality of the organization of the educational process in a higher educational institution is solved on the basis of the use of greedy algorithms. A well-designed timetable should ensure an even workload of student groups and faculty. The purpose of this work is to develop an algorithm that can improve the quality of the formation of the educational schedule based on the use of greedy algorithms.


2003 ◽  
Vol 1840 (1) ◽  
pp. 148-157 ◽  
Author(s):  
Douglas W. Harwood ◽  
Emilia R. Kohlman Rabbani ◽  
Karen R. Richard

Highway agencies face a dilemma in determining the appropriate balance of resurfacing and safety improvements in their programs to maintain the structural integrity and ride quality of highway pavements. Highway agencies currently lack a tool that would allow them to determine which sites should be resurfaced without accompanying safety improvements and which sites should be resurfaced and improved in other ways that would enhance safety. A resource allocation process that maximizes the benefits from resurfacing and safety improvements within a specified improvement budget can provide such a tool. A resource allocation process that accomplishes this goal has been developed and implemented in a software tool known as the Resurfacing Safety Resource Allocation Program (RSRAP). RSRAP uses an optimization process based on integer programming to determine which improvement alternatives (or combinations of alternatives) would optimize the benefits for a specified set of improvement projects. RSRAP incorporates the best available estimates of the safety effectiveness of specific geometric and safety improvements. RSRAP also gives consideration to the potential effects of resurfacing on vehicle speeds and on safety. The goal of the optimization process is not to optimize safety at any particular site but to optimize systemwide safety for a given set of resurfacing projects while not exceeding a user-specified improvement budget.


2019 ◽  
Vol 107 (2) ◽  
pp. 849-867 ◽  
Author(s):  
Mahboubeh Afzali ◽  
Kamalrulnizam AbuBakar ◽  
Jaime Lloret

Algorithms ◽  
2021 ◽  
Vol 14 (3) ◽  
pp. 80
Author(s):  
Qiuqi Han ◽  
Guangyuan Zheng ◽  
Chen Xu

Device-to-Device (D2D) communications, which enable direct communication between nearby user devices over the licensed spectrum, have been considered a key technique to improve spectral efficiency and system throughput in cellular networks (CNs). However, the limited spectrum resources cannot be sufficient to support more cellular users (CUs) and D2D users to meet the growth of the traffic data in future wireless networks. Therefore, Long-Term Evolution-Unlicensed (LTE-U) and D2D-Unlicensed (D2D-U) technologies have been proposed to further enhance system capacity by extending the CUs and D2D users on the unlicensed spectrum for communications. In this paper, we consider an LTE network where the CUs and D2D users are allowed to share the unlicensed spectrum with Wi-Fi users. To maximize the sum rate of all users while guaranteeing each user’s quality of service (QoS), we jointly consider user access and resource allocation. To tackle the formulated problem, we propose a matching-iteration-based joint user access and resource allocation algorithm. Simulation results show that the proposed algorithm can significantly improve system throughput compared to the other benchmark algorithms.


Sign in / Sign up

Export Citation Format

Share Document