163,557 research outputs found
Optimality Properties, Distributed Strategies, and Measurement-Based Evaluation of Coordinated Multicell OFDMA Transmission
The throughput of multicell systems is inherently limited by interference and
the available communication resources. Coordinated resource allocation is the
key to efficient performance, but the demand on backhaul signaling and
computational resources grows rapidly with number of cells, terminals, and
subcarriers. To handle this, we propose a novel multicell framework with
dynamic cooperation clusters where each terminal is jointly served by a small
set of base stations. Each base station coordinates interference to neighboring
terminals only, thus limiting backhaul signalling and making the framework
scalable. This framework can describe anything from interference channels to
ideal joint multicell transmission.
The resource allocation (i.e., precoding and scheduling) is formulated as an
optimization problem (P1) with performance described by arbitrary monotonic
functions of the signal-to-interference-and-noise ratios (SINRs) and arbitrary
linear power constraints. Although (P1) is non-convex and difficult to solve
optimally, we are able to prove: 1) Optimality of single-stream beamforming; 2)
Conditions for full power usage; and 3) A precoding parametrization based on a
few parameters between zero and one. These optimality properties are used to
propose low-complexity strategies: both a centralized scheme and a distributed
version that only requires local channel knowledge and processing. We evaluate
the performance on measured multicell channels and observe that the proposed
strategies achieve close-to-optimal performance among centralized and
distributed solutions, respectively. In addition, we show that multicell
interference coordination can give substantial improvements in sum performance,
but that joint transmission is very sensitive to synchronization errors and
that some terminals can experience performance degradations.Comment: Published in IEEE Transactions on Signal Processing, 15 pages, 7
figures. This version corrects typos related to Eq. (4) and Eq. (28
Train schedule coordination at an interchange station through agent negotiation
In open railway markets, coordinating train schedules at an interchange station requires negotiation between two independent train operating companies to resolve their operational conflicts. This paper models the stakeholders as software agents and proposes an agent negotiation model to study their interaction. Three negotiation strategies have been devised to represent the possible objectives of the stakeholders, and they determine the behavior in proposing offers to the proponent. Empirical simulation results confirm that the use of the proposed negotiation strategies lead to outcomes that are consistent with the objectives of the stakeholders
Robust Monotonic Optimization Framework for Multicell MISO Systems
The performance of multiuser systems is both difficult to measure fairly and
to optimize. Most resource allocation problems are non-convex and NP-hard, even
under simplifying assumptions such as perfect channel knowledge, homogeneous
channel properties among users, and simple power constraints. We establish a
general optimization framework that systematically solves these problems to
global optimality. The proposed branch-reduce-and-bound (BRB) algorithm handles
general multicell downlink systems with single-antenna users, multiantenna
transmitters, arbitrary quadratic power constraints, and robustness to channel
uncertainty. A robust fairness-profile optimization (RFO) problem is solved at
each iteration, which is a quasi-convex problem and a novel generalization of
max-min fairness. The BRB algorithm is computationally costly, but it shows
better convergence than the previously proposed outer polyblock approximation
algorithm. Our framework is suitable for computing benchmarks in general
multicell systems with or without channel uncertainty. We illustrate this by
deriving and evaluating a zero-forcing solution to the general problem.Comment: Published in IEEE Transactions on Signal Processing, 16 pages, 9
figures, 2 table
Task Assignment with Autonomous and Controlled Agents
We analyse assignment problems in which not all agents are controlled by the central planner. The autonomous agents search for vacant tasks guided by their own preference orders defined over subsets of the available tasks. The goal of the central planner is to maximise the total value of the assignment, taking into account the behaviour of the uncontrolled agents. This setting can be found in numerous real-world situations, ranging from organisational economics to "crowdsourcing" and disaster response. We introduce the Disjunctively Constrained Knapsack Game and show that its unique Nash equilibrium reveals the optimal assignment for the controlled agents. This result allows us to find the solution of the problem using mathematical programming techniques.
Recommended from our members
Teaching operations management using a 'pseudo'-scientific approach
The purpose of this paper is to explore a theory led approach to teaching operations and supply chain management that has emerged from the analysis of seminal operations management developments and case research. This research identified common operations construct relationships encompassing variation, uncertainty, buffering mechanisms and trade-offs which are used to provide a common basis for explaining these developments, linking established theory with current professional practice. The construct relationships are further shown to comprise three distinct but coordinated strategies that provide a useful framework for case evaluatio
MORPH: A Reference Architecture for Configuration and Behaviour Self-Adaptation
An architectural approach to self-adaptive systems involves runtime change of
system configuration (i.e., the system's components, their bindings and
operational parameters) and behaviour update (i.e., component orchestration).
Thus, dynamic reconfiguration and discrete event control theory are at the
heart of architectural adaptation. Although controlling configuration and
behaviour at runtime has been discussed and applied to architectural
adaptation, architectures for self-adaptive systems often compound these two
aspects reducing the potential for adaptability. In this paper we propose a
reference architecture that allows for coordinated yet transparent and
independent adaptation of system configuration and behaviour
If you can't be with the one you love, love the one you're with: How individual habituation of agent interactions improves global utility
Simple distributed strategies that modify the behaviour of selfish individuals in a manner that enhances cooperation or global efficiency have proved difficult to identify. We consider a network of selfish agents who each optimise their individual utilities by coordinating (or anti-coordinating) with their neighbours, to maximise the pay-offs from randomly weighted pair-wise games. In general, agents will opt for the behaviour that is the best compromise (for them) of the many conflicting constraints created by their neighbours, but the attractors of the system as a whole will not maximise total utility. We then consider agents that act as 'creatures of habit' by increasing their preference to coordinate (anti-coordinate) with whichever neighbours they are coordinated (anti-coordinated) with at the present moment. These preferences change slowly while the system is repeatedly perturbed such that it settles to many different local attractors. We find that under these conditions, with each perturbation there is a progressively higher chance of the system settling to a configuration with high total utility. Eventually, only one attractor remains, and that attractor is very likely to maximise (or almost maximise) global utility. This counterintutitve result can be understood using theory from computational neuroscience; we show that this simple form of habituation is equivalent to Hebbian learning, and the improved optimisation of global utility that is observed results from wellknown generalisation capabilities of associative memory acting at the network scale. This causes the system of selfish agents, each acting individually but habitually, to collectively identify configurations that maximise total utility
- …