147,504 research outputs found
Derandomization of Online Assignment Algorithms for Dynamic Graphs
This paper analyzes different online algorithms for the problem of assigning
weights to edges in a fully-connected bipartite graph that minimizes the
overall cost while satisfying constraints. Edges in this graph may disappear
and reappear over time. Performance of these algorithms is measured using
simulations. This paper also attempts to derandomize the randomized online
algorithm for this problem
Decentralized dynamic task allocation for UAVs with limited communication range
We present the Limited-range Online Routing Problem (LORP), which involves a
team of Unmanned Aerial Vehicles (UAVs) with limited communication range that
must autonomously coordinate to service task requests. We first show a general
approach to cast this dynamic problem as a sequence of decentralized task
allocation problems. Then we present two solutions both based on modeling the
allocation task as a Markov Random Field to subsequently assess decisions by
means of the decentralized Max-Sum algorithm. Our first solution assumes
independence between requests, whereas our second solution also considers the
UAVs' workloads. A thorough empirical evaluation shows that our workload-based
solution consistently outperforms current state-of-the-art methods in a wide
range of scenarios, lowering the average service time up to 16%. In the
best-case scenario there is no gap between our decentralized solution and
centralized techniques. In the worst-case scenario we manage to reduce by 25%
the gap between current decentralized and centralized techniques. Thus, our
solution becomes the method of choice for our problem
Traffic Driven Resource Allocation in Heterogenous Wireless Networks
Most work on wireless network resource allocation use physical layer
performance such as sum rate and outage probability as the figure of merit.
These metrics may not reflect the true user QoS in future heterogenous networks
(HetNets) with many small cells, due to large traffic variations in overlapping
cells with complicated interference conditions. This paper studies the spectrum
allocation problem in HetNets using the average packet sojourn time as the
performance metric. To be specific, in a HetNet with base terminal stations
(BTS's), we determine the optimal partition of the spectrum into possible
spectrum sharing combinations. We use an interactive queueing model to
characterize the flow level performance, where the service rates are decided by
the spectrum partition. The spectrum allocation problem is formulated using a
conservative approximation, which makes the optimization problem convex. We
prove that in the optimal solution the spectrum is divided into at most
pieces. A numerical algorithm is provided to solve the spectrum allocation
problem on a slow timescale with aggregate traffic and service information.
Simulation results show that the proposed solution achieves significant gains
compared to both orthogonal and full spectrum reuse allocations with moderate
to heavy traffic.Comment: 6 pages, 5 figures IEEE GLOBECOM 2014 (accepted for publication
- …