9,442 research outputs found
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
Traffic-Driven Spectrum Allocation in Heterogeneous Networks
Next generation cellular networks will be heterogeneous with dense deployment
of small cells in order to deliver high data rate per unit area. Traffic
variations are more pronounced in a small cell, which in turn lead to more
dynamic interference to other cells. It is crucial to adapt radio resource
management to traffic conditions in such a heterogeneous network (HetNet). This
paper studies the optimization of spectrum allocation in HetNets on a
relatively slow timescale based on average traffic and channel conditions
(typically over seconds or minutes). Specifically, in a cluster with base
transceiver stations (BTSs), the optimal partition of the spectrum into
segments is determined, corresponding to all possible spectrum reuse patterns
in the downlink. Each BTS's traffic is modeled using a queue with Poisson
arrivals, the service rate of which is a linear function of the combined
bandwidth of all assigned spectrum segments. With the system average packet
sojourn time as the objective, a convex optimization problem is first
formulated, where it is shown that the optimal allocation divides the spectrum
into at most segments. A second, refined model is then proposed to address
queue interactions due to interference, where the corresponding optimal
allocation problem admits an efficient suboptimal solution. Both allocation
schemes attain the entire throughput region of a given network. Simulation
results show the two schemes perform similarly in the heavy-traffic regime, in
which case they significantly outperform both the orthogonal allocation and the
full-frequency-reuse allocation. The refined allocation shows the best
performance under all traffic conditions.Comment: 13 pages, 11 figures, accepted for publication by JSAC-HC
Lingering Issues in Distributed Scheduling
Recent advances have resulted in queue-based algorithms for medium access
control which operate in a distributed fashion, and yet achieve the optimal
throughput performance of centralized scheduling algorithms. However,
fundamental performance bounds reveal that the "cautious" activation rules
involved in establishing throughput optimality tend to produce extremely large
delays, typically growing exponentially in 1/(1-r), with r the load of the
system, in contrast to the usual linear growth.
Motivated by that issue, we explore to what extent more "aggressive" schemes
can improve the delay performance. Our main finding is that aggressive
activation rules induce a lingering effect, where individual nodes retain
possession of a shared resource for excessive lengths of time even while a
majority of other nodes idle. Using central limit theorem type arguments, we
prove that the idleness induced by the lingering effect may cause the delays to
grow with 1/(1-r) at a quadratic rate. To the best of our knowledge, these are
the first mathematical results illuminating the lingering effect and
quantifying the performance impact.
In addition extensive simulation experiments are conducted to illustrate and
validate the various analytical results
A hybrid strategy for real-time traffic signal control of urban road networks
The recently developed traffic signal control strategy known as traffic-responsive urban control (TUC) requires availability of a fixed signal plan that is sufficiently efficient under undersaturated traffic conditions. To drop this requirement, the well-known Webster procedure for fixed-signal control derivation at isolated junctions is appropriately employed for real-time operation based on measured flows. It is demonstrated via simulation experiments and field application that the following hold: 1) The developed real-time demand-based approach is a viable real-time signal control strategy for undersaturated traffic conditions. 2) It can indeed be used within TUC to drop the requirement for a prespecified fixed signal plan. 3) It may, under certain conditions, contribute to more efficient results, compared with the original TUC method
Back-pressure traffic signal control with unknown routing rates
The control of a network of signalized intersections is considered. Previous
works proposed a feedback control belonging to the family of the so-called
back-pressure controls that ensures provably maximum stability given
pre-specified routing probabilities. However, this optimal back-pressure
controller (BP*) requires routing rates and a measure of the number of vehicles
queuing at a node for each possible routing decision. It is an idealistic
assumption for our application since vehicles (going straight, turning
left/right) are all gathered in the same lane apart from the proximity of the
intersection and cameras can only give estimations of the aggregated queue
length. In this paper, we present a back-pressure traffic signal controller
(BP) that does not require routing rates, it requires only aggregated queue
lengths estimation (without direction information) and loop detectors at the
stop line for each possible direction. A theoretical result on the Lyapunov
drift in heavy load conditions under BP control is provided and tends to
indicate that BP should have good stability properties. Simulations confirm
this and show that BP stabilizes the queuing network in a significant part of
the capacity region.Comment: accepted for presentation at IFAC 2014, 6 pages. arXiv admin note:
text overlap with arXiv:1309.648
- …