Linear network coding capacity region of the smart repeater with broadcast erasure channels

@article{Han2016LinearNC,
  title={Linear network coding capacity region of the smart repeater with broadcast erasure channels},
  author={Jaemin Han and Chih-Chun Wang},
  journal={2016 IEEE International Symposium on Information Theory (ISIT)},
  year={2016},
  pages={2144-2148}
}
  • Jaemin Han, Chih-Chun Wang
  • Published 4 May 2016
  • Computer Science
  • 2016 IEEE International Symposium on Information Theory (ISIT)
This work considers the smart repeater network where a single source s wants to send two independent packet streams to destinations {d1, d2} with the help of relay r. The transmission from s or r is modeled by packet erasure channels: For each time slot, a packet transmitted by s may be received, with some probabilities, by a random subset of {d1, d2, r}; and those transmitted by r will be received by a random subset of {d1, d2}. Interference is avoided by allowing at most one of {s, r} to… 
1 Citations

Figures from this paper

Capacity and Algorithms for a Cognitive Network with Primary-Secondary User Cooperation
In this work, we examine cognitive radio networks, where secondary users may act as relays for messages sent by the primary user, hence offering performance improvement of primary transmissions,

References

SHOWING 1-10 OF 35 REFERENCES
Linear network coding capacity for broadcast erasure channels with feedback, receiver coordination, and arbitrary security requirement
  • Chih-Chun Wang
  • Computer Science
    2013 IEEE International Symposium on Information Theory
  • 2013
TLDR
This work characterizes the exact LNC capacity region with arbitrary security requirement, i.e, the system designer can decide for each d<sub>i</sub>, respectively, whether the corresponding (s, d <sub> i</sub>)-flow needs to be secure or not.
Two-Flow Capacity Region of the COPE Principle for Wireless Butterfly Networks With Broadcast Erasure Channels
TLDR
This paper characterizes the full capacity region of the COPE principle for 2-flow wireless butterfly networks with broadcast packet erasure channels (PECs) and proposes a new class of linear network codes, named as the space-based linear network coding (SBLNC), that achieves the capacity outer bound.
On the capacity of 2-user 1-hop relay erasure networks — The union of feedback, scheduling, opportunistic routing, and network coding
  • W. Kuo, Chih-Chun Wang
  • Computer Science
    2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
TLDR
Numerical experiments show that for commonly encountered scenarios, the gap between the inner and the outer bounds is less than 0.2%, which demonstrates the effectiveness of the proposed bounding techniques.
On the Capacity of Wireless 1-Hop Intersession Network Coding - A Broadcast Packet Erasure Channel Approach
TLDR
This work focuses exclusively on the 2-staged INC schemes, which fully capture the throughput benefits of overheard message side information (MSI) through the use of one-time feedback but refrain from exploiting the broadcast spatial diversity gain of channel output feedback.
On the Capacity of Wireless 1-Hop Intersession Network Coding—A Broadcast Packet Erasure Channel Approach
  • Chih-Chun Wang
  • Computer Science
    IEEE Transactions on Information Theory
  • 2012
TLDR
This work focuses exclusively on the 2-staged INC schemes, which fully capture the throughput benefits of overheard message side information (MSI) through the use of one-time feedback but refrain from exploiting the broadcast spatial diversity gain of channel output feedback.
Multiuser Broadcast Erasure Channel With Feedback—Capacity and Algorithms
TLDR
A virtual-queue-based inter-session mixing coding algorithm is proposed, determine its rate region, and shows that it achieves capacity under certain conditions on channel statistics, assuming that instantaneous feedback is known to all users.
Capacity of wireless erasure networks
TLDR
The capacity under the assumption that erasure locations on all the links of the network are provided to the destinations is obtained and it turns out that the capacity region has a nice max-flow min-cut interpretation.
Multiuser broadcast erasure channel with feedback and side information, and related index coding results
TLDR
This paper considers the N-user broadcast erasure channel with public feedback and side information with an upper bound to the capacity region of this system and shows how to convert the capacityupper bound to transmission completion rate (broadcast rate) lower bound.
General capacity region for the fully-connected 3-node packet erasure network
TLDR
Technical contributions of this work include a new converse for many-to-many network communications and a new capacity-approaching simple linear network coding scheme.
Linear network coding capacity region of 2-receiver MIMO broadcast packet erasure channels with feedback
  • Chih-Chun Wang, D. Love
  • Computer Science
    2012 IEEE International Symposium on Information Theory Proceedings
  • 2012
TLDR
A new linear-space-based approach is proposed, which unifies the problems of finding a capacity outer bound and devising the achievability scheme into a single linear programming (LP) problem and uses an LP solver to exhaustively search for the LNC scheme(s) with the best possible throughput.
...
...