188 research outputs found
Regenerative and Adaptive schemes Based on Network Coding for Wireless Relay Network
Recent technological advances in wireless communications offer new
opportunities and challenges for relay network.To enhance system performance,
Demodulate-Network Coding (Dm-NC) scheme has been examined at relay node; it
works directly to De-map the received signals and after that forward the
mixture to the destination. Simulation analysis has been proven that the
performance of Dm-NC has superiority over analog-NC. In addition, the
Quantize-Decode-NC scheme (QDF-NC) has been introduced. The presented
simulation results clearly provide that the QDF-NC perform better than
analog-NC. The toggle between analogNC and QDF-NC is simulated in order to
investigate delay and power consumption reduction at relay node.Comment: 11 pages, 8 figures, International Journal of Computer Networks &
Communications (IJCNC), Vol.4, No.3, May 201
Wireless Network Information Flow: A Deterministic Approach
In a wireless network with a single source and a single destination and an
arbitrary number of relay nodes, what is the maximum rate of information flow
achievable? We make progress on this long standing problem through a two-step
approach. First we propose a deterministic channel model which captures the key
wireless properties of signal strength, broadcast and superposition. We obtain
an exact characterization of the capacity of a network with nodes connected by
such deterministic channels. This result is a natural generalization of the
celebrated max-flow min-cut theorem for wired networks. Second, we use the
insights obtained from the deterministic analysis to design a new
quantize-map-and-forward scheme for Gaussian networks. In this scheme, each
relay quantizes the received signal at the noise level and maps it to a random
Gaussian codeword for forwarding, and the final destination decodes the
source's message based on the received signal. We show that, in contrast to
existing schemes, this scheme can achieve the cut-set upper bound to within a
gap which is independent of the channel parameters. In the case of the relay
channel with a single relay as well as the two-relay Gaussian diamond network,
the gap is 1 bit/s/Hz. Moreover, the scheme is universal in the sense that the
relays need no knowledge of the values of the channel parameters to
(approximately) achieve the rate supportable by the network. We also present
extensions of the results to multicast networks, half-duplex networks and
ergodic networks.Comment: To appear in IEEE transactions on Information Theory, Vol 57, No 4,
April 201
PRACTICAL QUANTIZE-AND-FORWARD SCHEMES FOR THE FREQUENCY RELAY CHANNEL
International audienceWe consider static and quasi-static relay channels in which the source-destination and relay-destination signals are assumed to be orthogonal and thus have to be recombined at the destination. We propose cheap relaying schemes that are optimized from the knowledge of the signal-to-noise ratios (SNRs) of the source-relay and relay-destination channels at the relay. For this purpose the scheme under investigation is assumed to be scalar and have to minimize the mean square error between the source signal and its reconstructed version at the destination. We propose a quantize-and-forward (QF) scheme, which is a generalization of techniques based on joint source-channel coding. To further improve the receiver performance when the source-relay SNR is relatively poor we propose a Maximum Likelihood detector (MLD) designed for the QF protocol
- …