Resource allocation of wireless backhaul in heterogeneous network based on the large-scale MIMO

2018 ◽  
Vol 88 ◽  
pp. 117-126 ◽  
Author(s):  
Yang Wang ◽  
Hongjie Cen ◽  
Sunan Wang
Keyword(s):  
Resource Allocation ◽  
Heterogeneous Network ◽  
Large Scale ◽  
Wireless Backhaul

scholarly journals Resource Allocation for Energy Efficient User Association in User-Centric Ultra-Dense Networks Integrating NOMA and Beamforming

2020 ◽  
Author(s):  
Long Zhang ◽  
Guobin Zhang ◽  
Xiaofang Zhao ◽  
Yali Li ◽  
Chuntian Huang ◽  
...  
Keyword(s):  
Resource Allocation ◽  
Energy Efficient ◽  
Large Scale ◽  
Mixed Integer ◽  
Joint Optimization ◽  
User Association ◽  
Dual Decomposition ◽  
Dense Networks ◽  
Wireless Backhaul ◽  
User Centric

A coupling of wireless access via non-orthogonal multiple access and wireless backhaul via beamforming is a promising way for downlink user-centric ultra-dense networks (UDNs) to improve system performance. However, ultra-dense deployment of radio access points in macrocell and user-centric view of network design in UDNs raise important concerns about resource allocation and user association, among which notably is energy efficiency (EE) balance. To overcome this challenge, we develop a framework to investigate the resource allocation problem for energy efficient user association in such a scenario. The joint optimization framework aiming at the system EE maximization is formulated as a large-scale non-convex mixed-integer nonlinear programming problem, which is NP-hard to solve directly with lower complexity. Alternatively, taking advantages of sum-of-ratios decoupling and successive convex approximation methods, we transform the original problem into a series of convex optimization subproblems. Then we solve each subproblem through Lagrangian dual decomposition, and design an iterative algorithm in a distributed way that realizes the joint optimization of power allocation, sub-channel assignment, and user association simultaneously. Simulation results demonstrate the effectiveness and practicality of our proposed framework, which achieves the rapid convergence speed and ensures a beneficial improvement of system-wide EE.<br>

scholarly journals Resource Allocation for Energy Efficient User Association in User-Centric Ultra-Dense Networks Integrating NOMA and Beamforming,

2020 ◽  
Author(s):  
Long Zhang ◽  
Guobin Zhang ◽  
Xiaofang Zhao ◽  
Yali Li ◽  
Chuntian Huang ◽  
...  
Keyword(s):  
Resource Allocation ◽  
Energy Efficient ◽  
Large Scale ◽  
Mixed Integer ◽  
Joint Optimization ◽  
User Association ◽  
Dual Decomposition ◽  
Dense Networks ◽  
Wireless Backhaul ◽  
User Centric

A coupling of wireless access via non-orthogonal multiple access (NOMA) and wireless backhaul via beamforming is a promising way for downlink user-centric ultra-dense networks (UDNs) to improve system performance. However, the ultra-dense deployment of radio access points in macrocell and the user-centric view of network design in UDNs raise important concerns about resource allocation and user association, among which notably is energy efficiency (EE) balance. To overcome this challenge, we develop a framework to investigate the resource allocation problem for energy efficient user association in such a scenario. The joint optimization framework aiming at the system EE maximization is formulated as a large-scale non-convex mixed-integer nonlinear programming problem, which is NP-hard to solve directly with lower complexity. Alternatively, taking advantages of the sum-of-ratios decoupling and successive convex approximation methods, we transform the original problem into a series of convex optimization subproblems. Furthermore, we solve each subproblem through the Lagrangian dual decomposition, and design an iterative algorithm in a distributed way that realizes the joint optimization of power allocation, sub-channel assignment, and user association simultaneously. Simulation results demonstrate the effectiveness and practicality of our proposed framework, which achieves the rapid convergence speed and ensures a beneficial improvement of system-wide EE.

scholarly journals Resource Allocation for Energy Efficient User Association in User-Centric Ultra-Dense Networks Integrating NOMA and Beamforming,

2020 ◽  
Author(s):  
Long Zhang ◽  
Guobin Zhang ◽  
Xiaofang Zhao ◽  
Yali Li ◽  
Chuntian Huang ◽  
...  
Keyword(s):  
Resource Allocation ◽  
Energy Efficient ◽  
Large Scale ◽  
Mixed Integer ◽  
Joint Optimization ◽  
User Association ◽  
Dual Decomposition ◽  
Dense Networks ◽  
Wireless Backhaul ◽  
User Centric

A coupling of wireless access via non-orthogonal multiple access and wireless backhaul via beamforming is a promising way for downlink user-centric ultra-dense networks (UDNs) to improve system performance. However, ultra-dense deployment of radio access points in macrocell and user-centric view of network design in UDNs raise important concerns about resource allocation and user association, among which notably is energy efficiency (EE) balance. To overcome this challenge, we develop a framework to investigate the resource allocation problem for energy efficient user association in such a scenario. The joint optimization framework aiming at the system EE maximization is formulated as a large-scale non-convex mixed-integer nonlinear programming problem, which is NP-hard to solve directly with lower complexity. Alternatively, taking advantages of sum-of-ratios decoupling and successive convex approximation methods, we transform the original problem into a series of convex optimization subproblems. Then we solve each subproblem through Lagrangian dual decomposition, and design an iterative algorithm in a distributed way that realizes the joint optimization of power allocation, sub-channel assignment, and user association simultaneously. Simulation results demonstrate the effectiveness and practicality of our proposed framework, which achieves the rapid convergence speed and ensures a beneficial improvement of system-wide EE.<br>

scholarly journals Resource Allocation in Large-Scale Wireless Control Systems with Graph Neural Networks

2020 ◽  
Vol 53 (2) ◽  
pp. 2634-2641
Author(s):  
Vinicius Lima ◽  
Mark Eisen ◽  
Konstatinos Gatsis ◽  
Alejandro Ribeiro
Keyword(s):  
Neural Networks ◽  
Resource Allocation ◽  
Control Systems ◽  
Large Scale ◽  
Wireless Control ◽  
Graph Neural Networks

scholarly journals Resource allocation in the Covid-19 health crisis: are Covid-19 preventive measures consistent with the Rule of Rescue?

2021 ◽  
Author(s):  
Julian W. März ◽  
Søren Holm ◽  
Michael Schlander
Keyword(s):  
Resource Allocation ◽  
Large Scale ◽  
Preventive Measures ◽  
Risk Groups ◽  
Healthcare Resources ◽  
Health Crisis ◽  
Rule Of Rescue ◽  
Post War ◽  
Vaccination Campaigns ◽  
N95 Respirators

AbstractThe Covid-19 pandemic has led to a health crisis of a scale unprecedented in post-war Europe. In response, a large amount of healthcare resources have been redirected to Covid-19 preventive measures, for instance population-wide vaccination campaigns, large-scale SARS-CoV-2 testing, and the large-scale distribution of protective equipment (e.g., N95 respirators) to high-risk groups and hospitals and nursing homes. Despite the importance of these measures in epidemiological and economic terms, health economists and medical ethicists have been relatively silent about the ethical rationales underlying the large-scale allocation of healthcare resources to these measures. The present paper seeks to encourage this debate by demonstrating how the resource allocation to Covid-19 preventive measures can be understood through the paradigm of the Rule of Rescue, without claiming that the Rule of Rescue is the sole rationale of resource allocation in the Covid-19 pandemic.

scholarly journals DRIVE: A Distributed Economic  Meta-Scheduler for the Federation  of Grid and Cloud Systems

2021 ◽  
Author(s):  
◽  
Kyle Chard
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Large Scale ◽  
Service Providers ◽  
Distributed Environment ◽  
Resource Managers ◽  
Virtual Organisation ◽  
Open Service ◽  
Social Cloud ◽  
Computing Infrastructure

<p>The computational landscape is littered with islands of disjoint resource providers including commercial Clouds, private Clouds, national Grids, institutional Grids, clusters, and data centers. These providers are independent and isolated due to a lack of communication and coordination, they are also often proprietary without standardised interfaces, protocols, or execution environments. The lack of standardisation and global transparency has the effect of binding consumers to individual providers. With the increasing ubiquity of computation providers there is an opportunity to create federated architectures that span both Grid and Cloud computing providers effectively creating a global computing infrastructure. In order to realise this vision, secure and scalable mechanisms to coordinate resource access are required. This thesis proposes a generic meta-scheduling architecture to facilitate federated resource allocation in which users can provision resources from a range of heterogeneous (service) providers. Efficient resource allocation is difficult in large scale distributed environments due to the inherent lack of centralised control. In a Grid model, local resource managers govern access to a pool of resources within a single administrative domain but have only a local view of the Grid and are unable to collaborate when allocating jobs. Meta-schedulers act at a higher level able to submit jobs to multiple resource managers, however they are most often deployed on a per-client basis and are therefore concerned with only their allocations, essentially competing against one another. In a federated environment the widespread adoption of utility computing models seen in commercial Cloud providers has re-motivated the need for economically aware meta-schedulers. Economies provide a way to represent the different goals and strategies that exist in a competitive distributed environment. The use of economic allocation principles effectively creates an open service market that provides efficient allocation and incentives for participation. The major contributions of this thesis are the architecture and prototype implementation of the DRIVE meta-scheduler. DRIVE is a Virtual Organisation (VO) based distributed economic metascheduler in which members of the VO collaboratively allocate services or resources. Providers joining the VO contribute obligation services to the VO. These contributed services are in effect membership “dues” and are used in the running of the VOs operations – for example allocation, advertising, and general management. DRIVE is independent from a particular class of provider (Service, Grid, or Cloud) or specific economic protocol. This independence enables allocation in federated environments composed of heterogeneous providers in vastly different scenarios. Protocol independence facilitates the use of arbitrary protocols based on specific requirements and infrastructural availability. For instance, within a single organisation where internal trust exists, users can achieve maximum allocation performance by choosing a simple economic protocol. In a global utility Grid no such trust exists. The same meta-scheduler architecture can be used with a secure protocol which ensures the allocation is carried out fairly in the absence of trust. DRIVE establishes contracts between participants as the result of allocation. A contract describes individual requirements and obligations of each party. A unique two stage contract negotiation protocol is used to minimise the effect of allocation latency. In addition due to the co-op nature of the architecture and the use of secure privacy preserving protocols, DRIVE can be deployed in a distributed environment without requiring large scale dedicated resources. This thesis presents several other contributions related to meta-scheduling and open service markets. To overcome the perceived performance limitations of economic systems four high utilisation strategies have been developed and evaluated. Each strategy is shown to improve occupancy, utilisation and profit using synthetic workloads based on a production Grid trace. The gRAVI service wrapping toolkit is presented to address the difficulty web enabling existing applications. The gRAVI toolkit has been extended for this thesis such that it creates economically aware (DRIVE-enabled) services that can be transparently traded in a DRIVE market without requiring developer input. The final contribution of this thesis is the definition and architecture of a Social Cloud – a dynamic Cloud computing infrastructure composed of virtualised resources contributed by members of a Social network. The Social Cloud prototype is based on DRIVE and highlights the ease in which dynamic DRIVE markets can be created and used in different domains.</p>

scholarly journals Research on the Revolution of Multidimensional Learning Space in the Big Data Environment

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Weihua Huang
Keyword(s):  
Resource Allocation ◽  
Big Data ◽  
Performance Optimization ◽  
Resource Sharing ◽  
Large Scale ◽  
Cluster Computing ◽  
Multidimensional Analysis ◽  
Experimental Simulation ◽  
Learning Resources ◽  
Learning Resource

Multiuser fair sharing of clusters is a classic problem in cluster construction. However, the cluster computing system for hybrid big data applications has the characteristics of heterogeneous requirements, which makes more and more cluster resource managers support fine-grained multidimensional learning resource management. In this context, it is oriented to multiusers of multidimensional learning resources. Shared clusters have become a new topic. A single consideration of a fair-shared cluster will result in a huge waste of resources in the context of discrete and dynamic resource allocation. Fairness and efficiency of cluster resource sharing for multidimensional learning resources are equally important. This paper studies big data processing technology and representative systems and analyzes multidimensional analysis and performance optimization technology. This article discusses the importance of discrete multidimensional learning resource allocation optimization in dynamic scenarios. At the same time, in view of the fact that most of the resources of the big data application cluster system are supplied to large jobs that account for a small proportion of job submissions, while the small jobs that account for a large proportion only use the characteristics of a small part of the system’s resources, the expected residual multidimensionality of large-scale work is proposed. The server with the least learning resources is allocated first, and only fair strategies are considered for small assignments. The topic index is distributed and stored on the system to realize the parallel processing of search to improve the efficiency of search processing. The effectiveness of RDIBT is verified through experimental simulation. The results show that RDIBT has higher performance than LSII index technology in index creation speed and search response speed. In addition, RDIBT can also ensure the scalability of the index system.

Sign in / Sign up

Export Citation Format

Share Document