|
Contact:
Marcus Greferath
School of Math. Sciences
University College Dublin
Belfield, Dublin 4, Ireland
Phone:
+353-1-716-2588 (UCD)
+353-85-153-0951 (mobile)
Joachim Rosenthal
Institut of Mathematics
University of Zurich
Winterthurerstrasse 190
8057 Zurich, Switzerland
Phone:
+41-44-63 55884 (office)
|
|
ITW 2010 Dublin
IEEE Information Theory Workshop
Dublin, August 30 - September 3, 2010
Cooperation and throughput in networks
Mon 30 Aug, 11.30-12.50, Room 2
Contributed session
|
|
Jinfeng Du, Ming Xiao, and Mikael Skoglund
Cooperative Strategies for Relay-Aided Multi-Cell Wireless Networks with Backhaul
|
|
Abstract:
We investigate cooperative strategies for relay-aided multi-source
multi-destination wireless networks with backhaul support. Each
source multicasts information to all destinations using a shared
relay. We study cooperative strategies based on different network
coding (NC) schemes, namely, finite field NC (FNC), linear NC (LNC),
and lattice coding. To further exploit the backhaul connection, we
also propose NC-based beam-forming (NBF). We measure the performance
in term of achievable rates over Gaussian channels and observe
significant gains over a benchmark scheme. The benefit of using
backhaul is also clearly demonstrated in most of scenarios.
Mon 30 Aug, 11.30-11.50, Room 2
|
|
|
Nima Torabkhani, Badri N. Vellambi, and Faramarz Fekri
Throughput and Latency of Acyclic Erasure Networks with Feedback in a Finite Buffer Regime
|
|
Abstract:
The exact Markov modeling analysis of erasure networks with finite
buffers is an extremely hard problem due to the large number of
states in the system. In such networks, packets are lost due to
either link erasures or blocking by the full buffers. In this paper,
we propose a novel method that iteratively estimates the performance
parameters of the network and more importantly reduces the
computational complexity compared to the exact analysis. This is the
first work that analytically studies the effect of finite memory on
the throughput and latency in general wired acyclic networks with
erasure links. As a case study, a random packet routing scheme with
ideal feedback on the links is used. The proposed framework yields a
fairly accurate estimate of the probability distribution of buffer
occupancies at the intermediate nodes using which we can not only
identify the congested and starving nodes but also obtain analytical
expressions for throughput and average delay of a packet in the
network. The theoretical framework presented here can be applied to
many wired networks, from Internet to more futuristic applications
such as networks-on-chip under various communication and network
coding scenarios.
Mon 30 Aug, 11.50-12.10, Room 2
|
|
|
Hsin-Li Chiu, Sau-Hsuan Wu, and Jin-Hao Li
Cooperative ARQs with Opportunistic Distributed Space-Time Coding: Effective Protocols and Performance Analysis
|
|
Abstract:
The paper studies effective protocols and corresponding performance
of automatic retransmission request (ARQ) via decode-and-forward
(DF) opportunistic distributed space-time coding (ODSTC). Analysis
shows that the diversity via ARQ can be drastically increased by
allowing non-active relays to overhear the DSTC signal sent by the
active relays. Nevertheless, simple schemes without overhearing may
also achieve the same diversity when the link quality between the
source-relay or the relay-destination is good, hence greatly
alleviating the need for a complex protocol with overhearing.
Moreover, using more relays opportunistically does provide a higher
coding gain if the source-relay channel quality is extremely good,
otherwise using two or three relays gives almost the same
performance as if using all of them.
Mon 30 Aug, 12.10-12.30, Room 2
|
|
|
M. Mokhtar, Y. Mohasseb, M. Nafie, and H. El Gamal
On the Deterministic Multicast Capacity of Bidirectional Relay Networks
|
|
Abstract:
In this paper, we completely characterize the deterministic
multicast capacity region of the symmetric two-pair bidirectional
half duplex relay network with private messages. Towards this end,
we first develop a new upper bound on the deterministic capacity
region, based on the notion of a one-sided genie. We then proceed to
construct novel detour schemes that achieve the upper bound by
routing the bits intended for a certain receiver through the network
rather than sending it directly. To the best of the authors'
knowledge, this scenario corresponds to one of the rare cases where
coding, across levels and time, is needed to achieve the
deterministic capacity of the network.
Mon 30 Aug, 12.30-12.50, Room 2
|
Back to previous page
Return to conference mainpage
|
|
