In this paper, we consider the mobility effect with a jointly optimal design of cross-layer congestion control, routing and scheduling for ad-hoc networks. We first formulate the rate constraint and scheduling constraint. In this way, we use multi-commodity flow variables. Then formulate resource allocation in networks with fixed wireless channel and single-rate devices. Because of entrance of ...

A model of honey bee social foraging is introduced to create an algorithm that solves a class of dynamic resource allocation problems. We prove that if several such algorithms (‘‘hives’’) compete in the same problem domain, the strategy they use is a Nash equilibrium and an evolutionarily stable strategy. Moreover, for a single or multiple hives we prove that the allocation strategy is globally...

Resource allocation approaches play a very important role in improving the performance of a communication system. Load matrix (LM) [3] is a resource allocation approach used in single carrier mobile communication systems in a multi-cell scenario to reduce the interference (both inter-cell and intra –cell) to increase the system throughput decrease the packet delay. In this paper a resource allo...

Finding the right allocation of virtual machines (VM) in cloud data centers is one of the key optimization problems in cloud computing. Accordingly, many algorithms have been proposed for the problem. However, lacking a single, generally accepted formulation of the VM allocation problem, there are many subtle differences in the problem formulations that these algorithms address; moreover, in se...

We characterize the incentive compatible allocation that maximizes the expected social surplus in a single-unit sale when the efficient allocation is not implementable. We then show that allowing for the possibility that the good remains unsold may increase the expected social surplus even when allocating the good to no bidder generates less social surplus than allocating to any of the bidders....

local variation in data statistics. A code that incoruorates a variety of bit allocation options and allows the bitallocawe introduce a two-stage bit allocation algorithm gous to the algorithm for weighted vector quanpossible bit allocations (typically in the form of a collection of quantization matrices) rather than a single bit allocation tion to change from image to image or even from data b...

Allocation of construction risks between clients and their contractors has a significant impact on the total construction costs. This paper presents a system dynamics (SD)-based approach for quantitative risk allocation. Using the proposed SD based approach, all the factors affecting the risk allocation process are modeled. The contractor’s defensive strategies against the one-sided risk alloca...

Abstract Aiming at the optimal allocation of irrigation water in a multi-water source project resource shortage area, this study developed joint scheduling optimization model for reservoir and pumping station under deficit conditions. In model, maximum annual yield area was objective function; supply, spill replenishment pump each stage were decision variables; total supply system, operation cr...

Under just-in-time production, this paper studies a single machine common due-window (denoted by CONW) assignment scheduling problem with position-dependent weights and resource allocations. A job’s actual processing time can be determined the assigned to job. allocation model is divided into linear convex models, our goal find an optimal location, job sequence allocation. We prove that weighte...

We propose and demonstrate a novel optical orthogonal frequency-division multiple access (OFDMA)-based metro-access integrated network with dynamic resource allocation. It consists of a single fiber OFDMA ring and many single fiber OFDMA trees, which transparently integrates metropolitan area networks with optical access networks. The single fiber OFDMA ring connects the core network and the ce...