|
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
Coding and capacity of networks
Thu 02 Sep, 16.20-17.40, Room 2
Contributed session
|
|
Hongyi Yao, Theodoros K. Dikaliotis, Sidharth Jaggi, and Tracey Ho
Multi-source operator channels: Efficient capacity-achieving codes
|
|
Abstract:
The network communication scenario where one or more receivers
request all the information transmitted by different sources is
considered. We introduce the first polynomial-time (in
network size) network codes that achieve any point inside the
rate-region for the problem of multiple-source multicast in the
presence of malicious errors, for any fixed number of sources. Our
codes are fully distributed and different sources require no
knowledge of the data transmitted by their peers. Our codes are
"end-to-end", that is, all nodes apart from the sources and the
receivers are oblivious to the adversaries present in the network
and simply implement random linear network coding.
Thu 02 Sep, 16.20-16.40, Room 2
|
|
|
Duc To and Jinho Choi
Reduced-State Decoding in Two-Way Relay Networks With Physical-Layer Network Coding
|
|
Abstract:
We consider the information exchange between two source nodes with
the help of a relay node in a two-way relay network (TWRN). Based
on physical-layer network coding (PNC), at the relay node, Viterbi
or BCJR algorithms based on a full-state trellis can be used for
decoding. Since the relay node only needs to decode XORed message
rather than two individual messages in PNC, we show that the
decoding can be performed using a reduced-state trellis which
results in a lower complexity. It is proved that if the source
nodes use identical encoders, based on the reduced-state trellis,
the diversity order is kept unchanged, which is then confirmed by
simulation results.
Thu 02 Sep, 16.40-17.00, Room 2
|
|
|
Sang-Woon Jeon, Sae-Young Chung, and Syed A. Jafar
Approximate Capacity of a Class of Multi-source Gaussian Relay Networks
|
|
Abstract:
We study a K-user Gaussian relay network in which each
source-destination (S-D) pair communicates through Kr relays
without direct link. We observe that it is possible to exploit the
time-varying nature of wireless channels (fading) to fully mitigate
the interference. The proposed block Markov encoding and relaying
scheme exploits such channel variations and works for a wide class
of channel distributions including Rayleigh fading. Our scheme
gives the degrees of freedom (DoF) region that coincides with the
cut-set bound, thus completely characterizing the optimal DoF
region. Specifically, the DoF region is the set of all
(d1,...,dK) such that di ≤ 1 for all i and
∑i=1K di ≤ Kr, where di is the DoF of the i-th
S-D pair.
Thu 02 Sep, 17.00-17.20, Room 2
|
|
|
Soheil Mohajer and Suhas N. Diggavi
Gaussian diamond network with adversarial jammer
|
|
Abstract:
In this paper we consider communication from a source to a
destination over a wireless network with the help of a set of
authenticated relays. We focus on a special "diamond" network,
where there is no direct link between the source and the
destination; however the relay nodes help to establish such a
communication. There is a single adversarial node which injects
signals to disrupt this communication. Like the source, it can only
influence the destination through the relays. We develop an
approximate characterization of the reliable transmission rate in
the presence of such an adversary. This is done by developing an
outer bound, and demonstrating an achievable strategy that is within
a constant number of bits of the outer bound, regardless of the
channel values. A deterministic version of the same problem is
solved exactly, yielding insights which are used in the approximate
characterization.
Thu 02 Sep, 17.20-17.40, Room 2
|
Back to previous page
Return to conference mainpage
|
|
