1,947 research outputs found
Maximizing Energy Efficiency in Multiple Access Channels by Exploiting Packet Dropping and Transmitter Buffering
Quality of service (QoS) for a network is characterized in terms of various
parameters specifying packet delay and loss tolerance requirements for the
application. The unpredictable nature of the wireless channel demands for
application of certain mechanisms to meet the QoS requirements. Traditionally,
medium access control (MAC) and network layers perform these tasks. However,
these mechanisms do not take (fading) channel conditions into account. In this
paper, we investigate the problem using cross layer techniques where
information flow and joint optimization of higher and physical layer is
permitted. We propose a scheduling scheme to optimize the energy consumption of
a multiuser multi-access system such that QoS constraints in terms of packet
loss are fulfilled while the system is able to maximize the advantages emerging
from multiuser diversity. Specifically, this work focuses on modeling and
analyzing the effects of packet buffering capabilities of the transmitter on
the system energy for a packet loss tolerant application. We discuss low
complexity schemes which show comparable performance to the proposed scheme.
The numerical evaluation reveals useful insights about the coupling effects of
different QoS parameters on the system energy consumption and validates our
analytical results.Comment: in IEEE trans. Wireless communications, 201
Opportunistic Relaying in Wireless Networks
Relay networks having source-to-destination pairs and half-duplex
relays, all operating in the same frequency band in the presence of block
fading, are analyzed. This setup has attracted significant attention and
several relaying protocols have been reported in the literature. However, most
of the proposed solutions require either centrally coordinated scheduling or
detailed channel state information (CSI) at the transmitter side. Here, an
opportunistic relaying scheme is proposed, which alleviates these limitations.
The scheme entails a two-hop communication protocol, in which sources
communicate with destinations only through half-duplex relays. The key idea is
to schedule at each hop only a subset of nodes that can benefit from
\emph{multiuser diversity}. To select the source and destination nodes for each
hop, it requires only CSI at receivers (relays for the first hop, and
destination nodes for the second hop) and an integer-value CSI feedback to the
transmitters. For the case when is large and is fixed, it is shown that
the proposed scheme achieves a system throughput of bits/s/Hz. In
contrast, the information-theoretic upper bound of bits/s/Hz
is achievable only with more demanding CSI assumptions and cooperation between
the relays. Furthermore, it is shown that, under the condition that the product
of block duration and system bandwidth scales faster than , the
achievable throughput of the proposed scheme scales as .
Notably, this is proven to be the optimal throughput scaling even if
centralized scheduling is allowed, thus proving the optimality of the proposed
scheme in the scaling law sense.Comment: 17 pages, 8 figures, To appear in IEEE Transactions on Information
Theor
Cross-Layer Optimization of Fast Video Delivery in Cache-Enabled Relaying Networks
This paper investigates the cross-layer optimization of fast video delivery
and caching for minimization of the overall video delivery time in a two-hop
relaying network. The half-duplex relay nodes are equipped with both a cache
and a buffer which facilitate joint scheduling of fetching and delivery to
exploit the channel diversity for improving the overall delivery performance.
The fast delivery control is formulated as a two-stage functional non-convex
optimization problem. By exploiting the underlying convex and quasi-convex
structures, the problem can be solved exactly and efficiently by the developed
algorithm. Simulation results show that significant caching and buffering gains
can be achieved with the proposed framework, which translates into a reduction
of the overall video delivery time. Besides, a trade-off between caching and
buffering gains is unveiled.Comment: 7 pages, 4 figures; accepted for presentation at IEEE Globecom, San
Diego, CA, Dec. 201
Joint Scheduling and ARQ for MU-MIMO Downlink in the Presence of Inter-Cell Interference
User scheduling and multiuser multi-antenna (MU-MIMO) transmission are at the
core of high rate data-oriented downlink schemes of the next-generation of
cellular systems (e.g., LTE-Advanced). Scheduling selects groups of users
according to their channels vector directions and SINR levels. However, when
scheduling is applied independently in each cell, the inter-cell interference
(ICI) power at each user receiver is not known in advance since it changes at
each new scheduling slot depending on the scheduling decisions of all
interfering base stations. In order to cope with this uncertainty, we consider
the joint operation of scheduling, MU-MIMO beamforming and Automatic Repeat
reQuest (ARQ). We develop a game-theoretic framework for this problem and build
on stochastic optimization techniques in order to find optimal scheduling and
ARQ schemes. Particularizing our framework to the case of "outage service
rates", we obtain a scheme based on adaptive variable-rate coding at the
physical layer, combined with ARQ at the Logical Link Control (ARQ-LLC). Then,
we present a novel scheme based on incremental redundancy Hybrid ARQ (HARQ)
that is able to achieve a throughput performance arbitrarily close to the
"genie-aided service rates", with no need for a genie that provides
non-causally the ICI power levels. The novel HARQ scheme is both easier to
implement and superior in performance with respect to the conventional
combination of adaptive variable-rate coding and ARQ-LLC.Comment: Submitted to IEEE Transactions on Communications, v2: small
correction
Provision of Maximum Delay Guarantee at Low Energy in a Multi-user Environment
In this work a simple scheduling scheme is proposed for wireless sensor networks in presence of a maximum tolerable delay constraint. The scheduler performs the dual task of scheduling the users experiencing high channel gains to minimize the energy consumption while at the same time, it takes into account the maximum allowed buffer length of each user to provide an upper bound on the maximum tolerable delay. The idea of a threshold depending on the buffer occupancy is proposed to schedule the users opportunistically unless the deadline for transmission is reached. A maximum delay guarantee is provided in the proposed scheme in addition to average delay guarantee at almost no additional energy cost. The results show that multilevel recursive optimization can minimize energy subject to maximum bounded delay for schedulers that empty the buffer
- …