Multi-dimension resource allocation algorithm based on QoS guarantee in dense WLAN by Qi ZHANG, Lin-jing ZHAO, Jian-dong LI

Get full text

Virtual Network Resource Allocation Algorithm Based on Load Balance in Carrier-SDN by Li Wang, Jihong Zhao, Hua Qu, Ya Guo

“…Resource allocation algorithm for virtual networks in carrier-SDN based on load balance was proposed.Firstly,multiple-layered model of carrier-SDN was constructed.Secondly,the binaryzation of particle swarm optimization algorithm with the characteristic of virtual network embedding（VNE）algorithm was realized.Finally,load balance was set as optimization object,then the solution of VNE problem was got.The simulation results demonstrate that the proposed algorithm has superior performance in terms of load balance,acceptance ratio and average compared with existing methods.…”
Get full text

Energy-efficient resource allocation algorithm for massive MIMO OFDMA downlink system by Ying HU, Bao-feng JI, Yong-ming HUANG, Fei YU, Lv-xi YANG

“…An algorithm is proposed for energy-efficient resource allocation scheme in massive MIMO OFDMA downlink mobile communication system.A mathematical formulation of optimization issue is provided with the objective of maximizing system energy efficiency lower bound under the minimum data rate requirement of user,meanwhile the BS uses a zero-forcing(ZF) precoding.And then for optimizing energy efficiency function,the bandwidth allocation,power allocation and the number of antenna arrays at the BS are adjusted synchronously.First,an iterative algorithm derived from optimality condition for bandwidth assignment is proposed.Second,the properties of fractional programming and convex optimization are used to maximize the energy efficiency.Specifically,both the number of antenna arrays at the BS and the transmit data rate at the user are adjusted.Simulation results show that the proposed schemes not only have less iteration number but also have good perform for system energy efficiency and throughput.…”
Get full text

Wide area cooperative resource allocation algorithm for shortwave communication access network by Guojun LI, Xu HOU, Changrong YE, Yiping LUO

“…Aiming at the problem that short-wave point-to-point communication was not reliable enough to meet the actual needs, a wide area cooperative resource allocation algorithm based on shortwave communication access network was proposed.The reliability of the shortwave communication was improved by invoking multiple stations to coordinately guarantee users from different channels.The resource allocation problem was decomposed into two sub-problems of channel and station matching and station allocation.Firstly, the maximum expected success rate matching model was established to match the channel and the station, and the stations allocated to the channel were combined into different guarantee schemes.Then, the fuzzy analytic hierarchy process and the entropy weight method were used to obtain the subjective and objective scores of the scheme, and the optimal scheme was selected through fusion of evidence reasoning.The results show that the proposed algorithm can effectively improve the success rate of shortwave communication and has good adaptability.…”
Get full text

Resource allocation algorithm based on the multi-relay decoding-and-forwarding in OFDM system by Tao GUO, Youming LI, Ting LI, Yuzhi YAN

“…For the rate maximization problem in OFDM decode-and-forward relay system，a resource allocation algorithm based on the multi-relay forwarding was proposed. …”
Get full text

Research on IoV resource allocation algorithm assisted by reconfigurable intelligent surface by Fatang CHEN, Ruofan ZHANG

“…In order to meet the higher requirements of vehicle communication quality and spectral efficiency, a IoV resource allocation algorithm assisted by reconfigurable intelligent surface (RIS) was proposed.The RIS reflection coefficient matrix, power allocation, and spectrum sharing schemes were combined to solve the problem of maximizing the total capacity of V2I link under the condition of ensuring the reliability of V2V link.As this problem was a non-convex optimization problem with highly coupled variables, it was difficult to solve it directly.Therefore, after introducing an analytic expression to approximate the interrupt probability of V2V link, the problem was decomposed into three sub-problems by using the block coordinate descent (BCD) method, and the sub-problems were solved by introducing auxiliary variables, successive convex approximation (SCA), Hungarian algorithm, etc., and then the approximate suboptimal solution of the problem was obtained.Simulation results show that the proposed algorithm has good convergence performance and can effectively improve the total capacity of V2I link.…”
Get full text

Research on heterogeneous radio access and resource allocation algorithm in vehicular fog computing by Kai XIONG, Supeng LENG, Ke ZHANG, Hao LIU

Subjects: “…Internet of vehicles (IoV);vehicular fog;vehicular delay tolerant network (VDTN);Q-learning algorithm;resource allocation…”
Get full text

Research on resource allocation algorithm of centralized and distributed Q-learning in machine communication by Yunhe YU, Jun SUN

“…Under the premise of ensuring partial machine type communication device (MTCD)’s quality of service (QoS) requirements, the resource allocation problem was studied with the goal of maximizing system throughput in the massive machine type communication (mMTC) scenario.Two resource allocation algorithms based on Q-learning were proposed: centralized Q-learning algorithm (team-Q) and distributed Q-learning algorithm (dis-Q).Firstly, taking into account MTCD’s geographic location and multi-level QoS requirements, a clustering algorithm based on cosine similarity (CS) was designed.In the clustering algorithm, multi-dimensional vectors that represent MTCD and data aggregator (DA) were constructed, and MTCDs can be grouped according to the CS value between multi-dimensional vectors.Then in the MTC network, the team-Q learning algorithm and dis-Q learning algorithm were used to allocate resource blocks and power for the MTCD.In terms of throughput performance, team-Q and dis-Q algorithms have an average increase of 16% and 23% compared to the dynamic resource allocation algorithm and the greedy algorithm, respectively.In terms of complexity performance, the dis-Q algorithm is only 25% of team-Q algorithm and even below, the convergence speed is increased by nearly 40%.…”
Get full text

Optimizing Residential Electricity Demand with Bipartite Models for Enhanced Demand Response by Jonathan Campoverde, Marcelo Garcia Torres, Luis Tipan

Subjects: Get full text

User allocation technology for multi-dimensional resource optimization of LEO satellite by ZHOU Jiaen, ZHAO Yafei, PENG Mugen

Subjects: Get full text

Dynamic fair allocation of multi-resources based on shared resource quantity by Xiao-lu ZHANG, Xi LIU, Wei-dong LI, Xue-jie ZHANG

“…A dynamic fair allocation of multi-resources was proposed based on shared resource quantity for multi-resoures allocation problem in cloud shared computing system. …”
Get full text

Research on dynamic allocation of network slicing resources based on OS-MBRL by YAN Jiahui, ZHONG Weixuan, DONG Ligang, JIANG Xian, WANG Guangchang, LU Lingrong

Subjects: Get full text

Predictive Algorithms and Perceptions of Fairness: Parent Attitudes Toward Algorithmic Resource Allocation in K-12 Education by Rebecca A. Johnson, Simone Zhang

Subjects: Get full text

Primary-user behavior based joint routing and channel allocation algorithm in cognitive radio networks by Jing LIU, Pin-yi REN, Shao-li XUE, Chao ZHANG

“…To resolve the unstable routing problem due to the variation of spectrum availability caused by primary users’ behaviors in cognitive radio networks (CRN),a primary-user behavior based joint routing and channel allocation (PUB-JRCA) algorithm was proposed.The PUC-JRCA algorithm characterized the primary-user behavior by using the call-based model.According to the route discovery mechanism in the dynamic source routing protocol,the destination node selected the route which received the least impact from primary-user behaviors after receiving a number of route requests.Then,the destination sent back the route reply packet (RREP) along the selected route,and the channel allocation was performed when the RREP passed each node on this route.Theoretic analyses prove that the expected available transmission time for the packet delivery is inversely proportional to the probability that PU is active.Moreover,the computational complexity of the proposed algorithm is proportional to the number of nodes in the CRN.Simulation results show that the proposed algorithm has higher packet delivery ratio and lower average packet delay than the Gymkhana routing scheme.…”
Get full text

Demand Response: A Promising Solution to DG Allocation Problem by Soheil Dolatabadi, Saeed Ghassem Zadeh

“…In this paper, a comprehensive algorithm using modified invasive weed optimization is introduced for allocating distribution generation (DG) sources along with considering demand response (DR). …”
Get full text

Optimization of Combat Resource Allocation Based on Restricted Tournament Selection Social Genetic Algorithm by Shandong Yuan, Yun Ren, Han Zhou, Yongjing Cheng, Kai Yan

Subjects: “…Combat resource allocation problem…”
Get full text

Network slicing resource allocation algorithm based on bipartite graph matching in smart grids by Weiwei XIA, Yifei XIN, Dong LIANG, Jun WU, Xin WANG, Feng YAN, Lianfeng SHEN

“…To solve the problem of simultaneously satisfying the quality of service requirements of multiple types of services in smart grids and considering the economic utility of power terminals and network side, a network slicing resource allocation algorithm based on bipartite graph matching was proposed.For the control and collection services in smart grids, the corresponding bidding information was formulated for the power terminals, and the payment price and utility matrix were calculated accordingly.The resource allocation between the network slices and the power terminals was modeled as a bipartite graph matching problem.Different slicing resources were allocated to the terminals according to the latency, transmission rate, or energy consumption requirements of different services to maximize the system utility.Simulation results show that the proposed algorithm is able to improve the system utility by 10%～20% compared to the existing double auction algorithm and greedy algorithm.…”
Get full text

Resource allocation algorithm for multi-beam LEO satellite based on decision performance evaluation by WANG Chaowei, PANG Mingliang, WANG Su, ZHAO Lingli, GAO Feifei, CUI Gaofeng, WANG Weidong

“…To address challenges such as co-frequency interference, spectrum scarcity, and uneven traffic distribution in multi-beam LEO satellites, a resource allocation algorithm based on decision performance evaluation was proposed. …”
Get full text

Research on resource allocation algorithm in D2D networks based on alliance game by Chen Yujie, Ma Caihong

“…Aiming at the communication resource allocation problem in the SCMA system in the single-cell scenario, this paper aims to maximize the system throughput and ensure the minimum threshold rate of all users, and model it as an alliance game to solve it. …”
Get full text

A distributed CRN resource allocation algorithm based on CBR and cooperative Q-learning by Lin XU, Zhijin ZHAO

Get full text