Optimal Resource Allocation Scheme Research Articles

IRI deterioration model for asphalt concrete pavements: capturing performance improvements over time

Pavement deterioration models are an essential component of performance-based management of transportation infrastructure. This study aims to improve existing techniques by developing a deterioration model that captures the effect of pavement performance improvement across time. By using an iterative reweighted least squares approach, the model is applied to publicly available roughness data of asphalt concrete pavements collected as part of FHWA’s Long-Term Pavement Performance (LTPP) program. The results of the case study demonstrate that pavement performance has significantly improved over time. The parametric model suggests that the expected serviceable life of a typical asphalt pavement built in 1970 is only 22 years whereas a section with identical structural capacity and traffic loading built in 2000 achieves a 31-year serviceable life. These discrepancies highlight the importance of incorporating the construction year of a pavement as another explanatory factor within pavement deterioration models. The proposed model accounts for biases in existing approaches and will allow decision-makers to improve their current deterioration models and produce more optimal resource allocation strategies for existing pavement assets.

FRAC: a flexible resource allocation for vehicular cloud system

Vehicular cloud computing (VCC) is a promising technology for the intelligent transport system. It provides a better quality of transport and vehicular services that will increase the safety and comfort of drivers and passengers. A group of vehicles creates VCC and offers vehicular services for its users in the absence of infrastructure to support the system. The vehicles having computing, storage, communication, and sensing devices can share these resources with other vehicles. VCC creates a resource pool by aggregating all the shared resources of nearby vehicles. The major challenge for VCC is to manage the resources from different vehicles in a resource pool and to allocate necessary resources to its user on-demand. The authors propose a semi-Markov decision process based resource allocation method for the VCC system called flexible resource allocation for vehicular cloud system to manage and allocate the resources. The proposed method finds optimal resource allocation strategies for different states of the VCC system and maximises the long-term expected reward under different parameter settings.

A Cross-Layer Defense Scheme for Edge Intelligence-Enabled CBTC Systems Against MitM Attacks

While communication-based train control (CBTC) systems play a crucial role in the efficient and reliable operation of urban rail transits, its high penetration level of communication networks opens doors to Man-in-the-Middle (MitM) attacks. Current researches regarding MitM attacks do not consider the characteristics of CBTC systems. Particularly, the limited computing capability of the on-board computers prevents the direct implementation of most existing intrusion detection and defense algorithms against the MitM attack. In order to tackle this dilemma, in this article, we first introduce edge intelligence (EI) into CBTC systems to enhance the computing capability of the system. A cross-layer defense scheme, which includes the detection and defense stages, are proposed next. For the cross-layer detection stage, we propose a Long Short-Term Memory (LSTM) and Support Vector Machine (SVM) based detection method to combine the detection probability calculated from the train control parameter sequence and operation log files. For the cross-layer defense stage, we construct a Bayesian game based defense model to derive the optimal defense policy against MitM attacks. To further improve the accuracy of the defense scheme as well as optimize the communication resource allocation scheme, we propose an optimal communication resource allocation scheme based on the Asynchronous Advantage Actor-Critic (A3C) algorithm at last. Extensive simulation results show that the proposed scheme achieves excellent performance in defending against MitM attacks.

Energy Efficient Relay Selection and Resource Allocation in D2D-Enabled Mobile Edge Computing

In order to improve resource utilization and network capacity, we propose the Device-to-Device (D2D) enabled Mobile Edge Computing (MEC) system, where multiple Smart Devices (SDs) transmit the offloading data to the MEC server with the help of wireless access point (WAP) selected from multiple WAPs. The SD uses the chosen WAP as the communication relay between the MEC server and itself. Aimed to minimize the total energy consumption of the system and satisfy the SDs demand on delay, we jointly optimize relay selection and resource allocation in D2D-enabled MEC system. The problem is formulated as an integer-mixed non-convex optimization problem which is a NP-hard problem. We thus propose a two-phase optimization algorithm that jointly optimizes relay selection policy and resource allocation strategy. In first phase, the original problem is converted into a convex optimization problem by using convex optimization techniques, and the optimal relay selection policy can be achieved by solving the relay selection problem. After obtaining the relay selection policy, the original problem is transformed into a resource allocation problem solved by leveraging the Lagrange Method in the second phase. Furthermore, the proposed algorithm is a low-complexity algorithm which is associated with the root finding method. The optimal relay selection policy and resource allocation strategy can be found in polynomial time. The extensive simulation results are provided to indicate that the D2D-enabled MEC system achieves remarkable results in energy saving. Compared with other baseline methods, our proposed algorithm can not only achieve the optimal solution with less time cost, but also improve the energy efficiency and network capacity.

5G network-oriented hierarchical distributed cloud computing system resource optimization scheduling and allocation

As the core technology of the next generation mobile communication system, the development of 5G key technologies needs to be able to efficiently and effectively support massive data services. Aiming at the impact of massive data traffic on mobile communication networks in 5G communication systems, this paper proposes a 5G-oriented hierarchical distributed cloud service mobile communication system architecture. The model consists of a cloud access layer, a distributed micro-cloud system, and a core cloud data center. The distributed micro cloud system consists of multiple micro clouds that are deployed to the edge of the network. The service content in the core cloud data center can be deployed and cached to the local micro cloud server in advance to reduce repeated redundant transmission of user requested content in the network. Aiming at the problem of how to determine the migration object when dynamically optimizing the resource structure, a heuristic function-based dynamic optimization algorithm for cloud resources is proposed. The experimental results show that the dynamic expansion algorithm of cloud resources based on dynamic programming ideas can better improve the performance of virtual resources, and the dynamic optimization algorithm of cloud resources based on heuristic functions can effectively and quickly optimize the resource structure, thereby improving the operating efficiency of user virtual machine groups. An efficient resource allocation scheme based on cooperative Q (Quality) learning is proposed. The environmental knowledge obtained by the base station learning and exchanging information is used for distributed resource block allocation. This resource allocation scheme can obtain the optimal resource allocation strategy in a short learning time, and can terminate the learning process at any time according to the delay requirements of different services. Compared with traditional resource allocation schemes, it can effectively improve system throughput.

Edge Intelligence for Energy-Efficient Computation Offloading and Resource Allocation in 5G Beyond

5G beyond is an end-edge-cloud orchestrated network that can exploit heterogeneous capabilities of the end devices, edge servers, and the cloud and thus has the potential to enable computation-intensive and delay-sensitive applications via computation offloading. However, in multi user wireless networks, diverse application requirements and the possibility of various radio access modes for communication among devices make it challenging to design an optimal computation offloading scheme. In addition, having access to complete network information that includes variables such as wireless channel state, available bandwidth and computation resources, is a major issue. Deep Reinforcement Learning (DRL) is an emerging technique to address such an issue with limited and less accurate network information. In this paper, we utilize DRL to design an optimal computation offloading and resource allocation strategy for minimizing system energy consumption. We first present a multi-user end-edge-cloud orchestrated network where all devices and base stations have computation capabilities. Then, we formulate the joint computation offloading and resource allocation problem as a Markov Decision Process (MDP) and propose a new DRL algorithm to minimize system energy consumption. Numerical results based on a real-world dataset demonstrate that the proposed DRL-based algorithm significantly outperforms the benchmark policies in terms of system energy consumption. Extensive simulations show that learning rate, discount factor, and number of devices have considerable influence on the performance of the proposed algorithm.

Optimal energy efficiency resource allocation strategy for cognitive clustering network under PUEA attack

5G has pushed the use of radio spectrum to a new level, and cognitive clustering network can effectively improve the utilization of radio spectrum, which is a feasible way to solve the growing demand for wireless communications. However, cognitive clustering network is vulnerable to PUEA attack, which will lead to the degradation of system detection performance, thereby reducing the energy efficiency. Aiming at these problems, this paper investigates the optimal energy efficiency resource allocation scheme for cognitive clustering network under PUEA attack. A cooperative user selection algorithm based on selection factor is proposed to effectively resist PUEA user attack and improve detection performance. We construct the energy efficiency optimization problem under multi-constraint conditions and transform the nonlinear programming problem into parametric programming problem, which is solved by Lagrangian function and Karush-Kuhn-Tucker condition. Then the sub-gradient iterative algorithm based on optimal energy efficiency under PUEA attack is proposed and its complexity is analyzed. Simulation results indicate that proposed method is effective when subjected to PUEA attacks, and the impact of different parameters on energy efficiency is analyzed.

Physical layer security and energy efficiency driven resource optimisation for cognitive relay networks

In this study, a resource allocation problem considering physical layer security and power consumption for cognitive relay networks is studied. In a secondary network, the ratio of secret rate to power consumption is defined as a secret rate per watt (SRW). Fixed circuit power, dynamic circuit power, and transmit power are all considered in the power consumption model. Under the constraints of the maximum total transmit power of secondary user transmitters and relay nodes, minimum secret rate requirement of secondary user receiver and tolerable interference threshold of each primary user receiver, the authors propose a SRW maximisation algorithm to maximise SRW. The resource allocation problem is formulated as a non-linear fractional programming and it is transformed into an equivalent subtraction based on the Dinkelbach method. They incorporate the non-convex constraints into the objective function to convert the feasible region into a convex set and achieve an optimal resource allocation scheme with the nested loop iteration algorithm through the Lagrange dual theory and the difference of convex programming. By the Dinkelbach method and the nested loop iteration algorithm, the optimal SRW is obtained. Simulation results demonstrate the effectiveness and the out-performance of the proposed algorithm comparing with other algorithms.

A Graph Convolutional Network-Based Deep Reinforcement Learning Approach for Resource Allocation in a Cognitive Radio Network.

Cognitive radio (CR) is a critical technique to solve the conflict between the explosive growth of traffic and severe spectrum scarcity. Reasonable radio resource allocation with CR can effectively achieve spectrum sharing and co-channel interference (CCI) mitigation. In this paper, we propose a joint channel selection and power adaptation scheme for the underlay cognitive radio network (CRN), maximizing the data rate of all secondary users (SUs) while guaranteeing the quality of service (QoS) of primary users (PUs). To exploit the underlying topology of CRNs, we model the communication network as dynamic graphs, and the random walk is used to imitate the users’ movements. Considering the lack of accurate channel state information (CSI), we use the user distance distribution contained in the graph to estimate CSI. Moreover, the graph convolutional network (GCN) is employed to extract the crucial interference features. Further, an end-to-end learning model is designed to implement the following resource allocation task to avoid the split with mismatched features and tasks. Finally, the deep reinforcement learning (DRL) framework is adopted for model learning, to explore the optimal resource allocation strategy. The simulation results verify the feasibility and convergence of the proposed scheme, and prove that its performance is significantly improved.

Multi-Objective Approach for Optimization of City Logistics Considering Energy Efficiency

Urban population increase results in more supply chain operations in these areas, which leads to increased energy consumption and environmental pollution. City logistics represents a strategy of efficient freight transportation and material handling to fulfill customer and business demands. Within the frame of this paper, the authors describe an optimization model of a multi-echelon collection and distribution system, focusing on downtown areas and energy efficiency, sustainability, and emission reduction. After a systematic literature review, this paper introduces a mathematical model of collection and distribution problems, including package delivery, municipal waste collection, home delivery services, and supply of supermarkets and offices. The object of the optimization model is twofold: firstly, to design the optimal structure of the multi-echelon collection and distribution system, including layout planning and the determination of required transportation resources, like e-cars, e-bikes, and the use of public transportation; and secondly, to optimize the operation strategy of the multi-echelon supply chain, including resource allocation and scheduling problems. Next, a heuristic approach is described, whose performance is validated with common benchmark functions, such as metaheuristic evaluation. The scenario analysis demonstrates the application of the described model and shows the optimal layout, resource allocation, and operation strategy focusing on energy efficiency.

Energy-Efficient Resource Allocation in Cognitive Radio Networks Under Cooperative Multi-Agent Model-Free Reinforcement Learning Schemes

The most prominent challenge to the wireless community is to meet the demand for radio resources. Cognitive Radio (CR) is envisioned as a potential solution that utilizes its cognition ability intended to enhance the proper utilization of available radio resources and improves energy efficiency. However, due to the co-existence of Primary Base Stations (PU-BSs) and Cognitive Base Stations (CR-BSs) in CR networks, the problem of aggregated interference occurs which poses a critical challenge for resource allocation in CR networks. Moreover, in practical scenarios, it is difficult to form the correct network model due to complex network dynamics beforehand. Therefore, this work presents Multi-Agent Model-Free Reinforcement Learning schemes namely Q-Learning (Q-L) and State-Action-Reward- (next) State- (next) Action (SARSA) for resource allocation which mitigates interference and eliminate the need of network model. The proposed schemes are implemented in a decentralized cooperative manner with CRs act as multi-agent, forms a stochastic dynamic team to obtain optimal energy-efficient resource allocation strategy. Numerical results reveal that: 1) proposed cooperative scheme 1 (Cooperative Q-L scheme) expedites the convergence; 2) proposed cooperative scheme 2 (Cooperative SARSA scheme) achieves significant improvement in network capacity. Both the proposed cooperative schemes demonstrate its effectiveness by providing significant improvement in energy efficiency and maintain users’ QoS.

Multiple UAV-Mounted Base Station Placement and User Association With Joint Fronthaul and Backhaul Optimization

In this paper, we study a joint placement, resource allocation, and user association problem for UAV-assisted wireless networks with constrained backhaul links, where multiple UAV-mounted base stations (UBSs) are deployed to provide wireless services for ground users. We propose a novel framework to maximize the user throughput within the flight-time of UBSs and provides fairness among the users. We first obtain the optimal resource allocation schemes based on different fronthaul and backhaul conditions, and an efficient iterative algorithm is then developed to jointly optimize user association and UBS placement. The optimal UBS placement can be achieved by solving an unconstrained optimization problem which is a simplification of the initial constrained optimization problem based on the optimal resource allocation. We develop a dual-domain coordinated descent and bipartite graph matching based sub-process to identify an optimal user association that prefers the nearby UBSs, as the user association under constrained backhaul links have non-unique optimal solutions. Extensive simulations are conducted to verify the effectiveness of the proposed algorithm, and results show that our proposed method under constrained backhaul can improve both the average throughput by 49% and the fairness among the users by 47% in comparison with the method under ideal backhaul.

Optimal resource allocation and prolonged dormancy strategies in herbaceous plants

Abstract Understanding the fitness consequences of different life histories is critical for explaining their diversity and for predicting effects of changing environmental conditions. However, current theory on plant life histories relies on phenomenological, rather than mechanistic, models of resource production. We combined a well‐supported mechanistic model of ontogenetic growth that incorporates differences in the size‐dependent scaling of gross resource production and maintenance costs with a dynamic optimization model to predict schedules of reproduction and prolonged dormancy (plants staying below ground for ≥1 growing season) that maximize lifetime offspring production. Our model makes three novel predictions: First, maintenance costs strongly influence the conditions under which a monocarpic or polycarpic life history evolves and how resources should be allocated to reproduction by polycarpic plants. Second, in contrast to previous theory, our model allows plants to compensate for low survival conditions by allocating a larger proportion of resources to storage and thereby improving overwinter survival. Incorporating this ecological mechanism in the model is critically important because without it our model never predicts significant investment into storage, which is inconsistent with empirical observations. Third, our model predicts that prolonged dormancy may evolve solely in response to resource allocation trade‐offs. Significance. Our findings reveal that maintenance costs and the effects of resource allocation on survival are primary determinants of the fitness consequences of different life history strategies, yet previous theory on plant life history evolution has largely ignored these factors. Our findings also validate recent arguments that prolonged dormancy may be an optimal response to costs of sprouting. These findings have broad implications for understanding patterns of plant life history variation and predicting plant responses to changing environments.

Two‐agent scheduling with linear resource‐dependent processing times

AbstractThis paper considers a two‐agent scheduling problem with linear resource‐dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is ‐hard in the ordinary sense, and there does not exist a polynomial‐time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.

Multiple resource allocation for precision marketing

In the precision marketing of a new product, it is a challenge to allocate limited resources to the target customer groups with different characteristics. We presented a framework using distance-based algorithm, K-Nearest-Neighbour, and support vector machine to capture customers’ preference towards promotion channel. Additionally, on-line learning programming was combined with machine learning strategies to fit a dynamic environment, evaluating its performance through a parsimonious model of minimum regret. A resource optimization model was proposed using classification results as input. In particular, we collected data from a loan agency that offers loans to small business merchants. Our sample contained 525,919 customers who will be introduced to a new financial product. By simulating different scenarios between resources and demand, we showed an up to 22.42% increase in the number of expected merchants when K-NN was performed with optimal resource allocation strategy. Our results also show that K-NN is the most stable method to perform classification, and that distance-based algorithm has the most efficient adoption with on-line learning.

Fast Globally Optimal Transmit Antenna Selection and Resource Allocation Scheme in mmWave D2D Networks

Transmit antenna selection (TAS) at base station has been widely studied and employed in many communication networks (such as those using massive multiple-input multiple-output (MIMO) systems). Thanks to the small size of microstrip antenna elements applicable to millimeter-wave (mmWave) frequencies, the implementation of TAS in small user equipments (UEs) employing switchable directional antennas is recently becoming popular. In this paper, we consider device-to-device (D2D) communications underlaying a cellular network wherein each D2D UE is equipped with switchable transmit antennas. By employing Generalized Bender’s Decomposition (GBD) algorithm, we obtained the solution to the problem of globally optimal transmit antenna selection and channel allocation to D2D UEs together with transmit powers of cellular and D2D UEs. Although we reformulated the non-convex primal subproblem of the proposed GBD-based method into convex form, we further managed to obtain the corresponding closed-form solution through analytical manipulations; this extensively increased (at least 60 times) the execution speed of the proposed method as shown in the simulation results.

Dynamic Resource Allocation on Multi-Category Two-Sided Platforms

Platform businesses are typically resource-intensive and must scale up their business quickly in the early stage to compete successfully against fast-emerging rivals. We study a critical question faced by such firms in the novel context of multicategory two-sided platforms: how to optimally make investment decisions across two sides, multiple categories, and different time periods to achieve fast and sustainable growth. We first develop a two-category two-period theoretical model and propose optimal resource allocation strategies that account for heterogeneous within-category direct and indirect network effects and cross-category interdependence. We find that the proposed strategy shares the spirit of the allocation rules for multiproduct nonplatform firms and single-product platform firms, yet it does not amount to a simple combination of the existing rules. Interestingly, the business model that platforms adopt crucially determines the optimal strategy. Platforms that charge by user should adopt a “reinforcing” rule for both within- and cross-category allocations by allocating more resources toward the stronger growth driver. Platforms that charge by transaction should also adopt the reinforcing rule for within-category allocation, but follow a “compensatory” rule for cross-category and intertemporal allocations by allocating more resources toward the weaker growth driver. We use data from the daily deals industry to empirically identify the network effects, propose alternative allocation strategies stemming from our theoretical findings, and use simulations to show the benefits of these strategies. For instance, we show that reallocating 10% of the average observed investment from Fitness to Beauty can increase profits by up to 15.5% for some cities. This paper was accepted by Matthew Shum, marketing.

An Edge Computing-Based Photo Crowdsourcing Framework for Real-Time 3D Reconstruction

Image-based three-dimensional (3D) reconstruction utilizes a set of photos to build 3D model and can be widely used in many emerging applications such as augmented reality (AR) and disaster recovery. Most of existing 3D reconstruction methods require a mobile user to walk around the target area and reconstruct objectives with a hand-held camera, which is inefficient and time-consuming. To meet the requirements of delay intensive and resource hungry applications in 5G, we propose an edge computing-based photo crowdsourcing (EC-PCS) framework in this paper. The main objective is to collect a set of representative photos from ubiquitous mobile and Internet of Things (IoT) devices at the network edge for real-time 3D model reconstruction, with network resource and monetary cost considerations. Specifically, we first propose a photo pricing mechanism by jointly considering their freshness, resolution and data size. Then, we design a novel photo selection scheme to dynamically select a set of photos with the required target coverage and the minimum monetary cost. We prove the NP-hardness of such problem, and develop an efficient greedy-based approximation algorithm to obtain a near-optimal solution. Moreover, an optimal network resource allocation scheme is presented, in order to minimize the maximum uploading delay of the selected photos to the edge server. Finally, a 3D reconstruction algorithm and a 3D model caching scheme are performed by the edge server in real time. Extensive experimental results based on real-world datasets demonstrate the superior performance of our EC-PCS system over the existing mechanisms.

DEA‐based centralized resource allocation with network flows

AbstractThis study investigates the centralized resource allocation problem among individual units using network flow theory in a data envelopment analysis (DEA) framework. Existing research on DEA‐based resource allocation is primarily concerned with the amount of allocated resources to individual units, and only a few studies have considered resource flows when resources are allocated. To identify the internal structure of the resource allocation process, network structure is introduced and network flow theory is used to search for the optimal resource allocation scheme. Moreover, resource allocation cost is considered in network flows and a resource allocation gain (RAG) function is formulated to provide a quantitative analysis of the trade‐off between production gains from resource allocation and resource allocation cost in the resource allocation process. In addition, several characteristics of the RAG function are also discussed. Lastly, the proposed method is demonstrated through an expository example with several random data and an application of the centralized resource reallocation to bank systems.

Multi-objective resource allocation in mobile edge computing using PAES for Internet of Things

In recent years, mobile edge computing (MEC), as a powerful computing paradigm, provides sufficient computing resources for Internet of Things (IoT). Generally, the deployment of MEC servers closer to mobile users has effectively reduced access delays and the cost of using cloud services. However, the multi-objective resource allocation for IoT applications to meet service requirements (i.e., the shortest completion time of IoT applications, the load balance and lower energy consumption of MEC servers, etc.) still faces severe challenges. To address this challenge, a multi-objective resource allocation method, named MRAM, is proposed in this paper for IoT. Technically, the pareto archived evolution strategy is leveraged to optimize the time cost of IoT applications, load balance and energy consumption of MEC servers. Furthermore, the multiple criteria decision making and the technique for order preference by similarity to ideal solution are utilized to obtain the optimal multi-objective resource allocation strategy. Ultimately, the comprehensive analysis of MRAM is introduced in detail.