14,367 research outputs found
Multiuser Switched Diversity Scheduling Schemes
Multiuser switched-diversity scheduling schemes were recently proposed in
order to overcome the heavy feedback requirements of conventional opportunistic
scheduling schemes by applying a threshold-based, distributed, and ordered
scheduling mechanism. The main idea behind these schemes is that slight
reduction in the prospected multiuser diversity gains is an acceptable
trade-off for great savings in terms of required channel-state-information
feedback messages. In this work, we characterize the achievable rate region of
multiuser switched diversity systems and compare it with the rate region of
full feedback multiuser diversity systems. We propose also a novel proportional
fair multiuser switched-based scheduling scheme and we demonstrate that it can
be optimized using a practical and distributed method to obtain the feedback
thresholds. We finally demonstrate by numerical examples that
switched-diversity scheduling schemes operate within 0.3 bits/sec/Hz from the
ultimate network capacity of full feedback systems in Rayleigh fading
conditions.Comment: Accepted at IEEE Transactions on Communications, to appear 2012,
funded by NPRP grant 08-577-2-241 from QNR
Throughput Scaling of Wireless Networks With Random Connections
This work studies the throughput scaling laws of ad hoc wireless networks in
the limit of a large number of nodes. A random connections model is assumed in
which the channel connections between the nodes are drawn independently from a
common distribution. Transmitting nodes are subject to an on-off strategy, and
receiving nodes employ conventional single-user decoding. The following results
are proven:
1) For a class of connection models with finite mean and variance, the
throughput scaling is upper-bounded by for single-hop schemes, and
for two-hop (and multihop) schemes.
2) The throughput scaling is achievable for a specific
connection model by a two-hop opportunistic relaying scheme, which employs
full, but only local channel state information (CSI) at the receivers, and
partial CSI at the transmitters.
3) By relaxing the constraints of finite mean and variance of the connection
model, linear throughput scaling is achievable with Pareto-type
fading models.Comment: 13 pages, 4 figures, To appear in IEEE Transactions on Information
Theor
- …