Near-Optimal Quantization and Linear Network Coding for Relay Networks
نویسندگان
چکیده
منابع مشابه
Near Optimal Broadcast with Network Coding in Large Sensor Networks
We study efficient broadcasting for wireless sensor networks, with network coding. We address this issue for homogeneous sensor networks in the plane. Our results are based on a simple principle (IREN/IRON), which sets the same rate on most of the nodes (wireless links) of the network. With this rate selection, we give a value of the maximum achievable broadcast rate of the source: our central ...
متن کامل10 Network coding in relay - based networks
Since its inception in information theory, network coding has attracted a significant amount of research attention in recent years. Shortly after theoretical explorations in wired networks, the use of network coding in wireless networks towards improving throughput has been widely recognized. In this chapter, we present a survey of recent advances in relay-based cellular networks with network c...
متن کاملRelay Selection Based Space-Time Coding for Two-Way Wireless Relay Networks Using Digital Network Coding
In this paper, we propose a novel decode-and-forward dual-relay selection technique based on Alamouti space time coding for twoway wireless relay networks (TWRNs). The twoand the threephase TWRN protocol are used in the first and second version of the proposed technique, respectively, to exchange the information symbols of the communicating terminals. In order not to waste any power for transmi...
متن کاملNetwork Coding-Based Retransmission for Relay Aided Multisource Multicast Networks
This paper considers the reliable transmission for wireless multicast networks where multiple sources want to distribute information to a set of destinations with assistance of a relay. Basically, the reliability of a communication link is assured via automatic repeat request (ARQ) protocols. In the context of multisource multicast networks, the challenge is how to retransmit the lost or errone...
متن کاملOptimized Noisy Network Coding for Gaussian Relay Networks
In this paper, we provide an improved lower bound on the rate achieved by noisy network coding in arbitrary Gaussian relay networks, whose gap to the cutset upper bound depends on the network not only through the total number of nodes but also through the degrees of freedom of the min cut of the network. We illustrate that for many networks this refined lower bound can lead to a better approxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2012.2235906