Title
Using Network Coding to Achieve the Capacity of Deterministic Relay Networks with Relay Messages.
Abstract
In this paper, we derive the capacity of the deterministic relay networks with relay messages. We consider a network that consists of five nodes, four of which can only communicate via the fifth one. However, the fifth node is not merely a relay as it may exchange private messages with the other network nodes. First, we develop an upper bound on the capacity region based on the notion of a single-sided genie. In the course of the achievability proof, we also derive the deterministic capacity of a four-user relay network (without private messages at the relay). The capacity achieving schemes use a combination of two network coding techniques: the simple ordering scheme and detour scheme. In the simple ordering scheme, we order the transmitted bits at each user such that the bi-directional messages will be received at the same channel level at the relay, while the basic idea behind the detour scheme is that some parts of the message follow an indirect paths to their respective destinations. This paper, therefore, serves to show that user cooperation and network coding can enhance throughput, even when the users are not directly connected to each other. Finally, we make a conjecture about the capacity region of the general K-node relay network with relay messages. Copyright (c) 2016 John Wiley & Sons, Ltd.
Year
DOI
Venue
2014
10.1002/wcm.2691
WIRELESS COMMUNICATIONS & MOBILE COMPUTING
Keywords
Field
DocType
network coding,deterministic relay networks,capacity of relay networks,bi-directional relay networks
Linear network coding,Relay channel,Upper and lower bounds,Computer network,Node (networking),Communication channel,Throughput,Relay,Mathematics,Link Access Procedure for Frame Relay
Journal
Volume
Issue
ISSN
16.0
15.0
1530-8669
Citations 
PageRank 
References 
0
0.34
12
Authors
4
Name
Order
Citations
PageRank
Ahmed A. Zewail1367.60
Yahya Mohasseb2639.48
Mohamed Nafie325342.26
Hesham El Gamal43049220.37