检索结果-内蒙古大学图书馆

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第5期57卷 3132-3152页

作者： Lim, Sung Hoon Kim, Young-Han El Gamal, Abbas Chung, Sae-Young Korea Adv Inst Sci & Technol Dept Elect Engn Taejon 305701 South Korea Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA Stanford Univ Dept Elect Engn Stanford CA 94305 USA

A noisy network coding scheme for communicating messages between multiple sources and destinations over a general noisy network is presented. For multi-message multicast networks, the scheme naturally generalizes network coding over noiseless networks by Ahlswede, Cai, Li, and Yeung, and compress-forward coding for the relay channel by Cover and El Gamal to discrete memoryless and Gaussian networks. The scheme also extends the results on coding for wireless relay networks and deterministic networks by Avestimehr, Diggavi, and Tse, and coding for wireless erasure networks by Dana, Gowaikar, Palanki, Hassibi, and Effros. The scheme involves lossy compression by the relay as in the compress-forward coding scheme for the relay channel. However, unlike previous compress-forward schemes in which independent messages are sent over multiple blocks, the same message is sent multiple times using independent codebooks as in the network coding scheme for cyclic networks. Furthermore, the relays do not use Wyner-Ziv binning as in previous compress-forward schemes, and each decoder performs simultaneous decoding of the received signals from all the blocks without uniquely decoding the compression indices. A consequence of this new scheme is that achievability is proved simply and more generally without resorting to time expansion to extend results for acyclic networks to networks with cycles. The noisy network coding scheme is then extended to general multi-message networks by combining it with decoding techniques for the interference channel. For the Gaussian multicast network, noisy network coding improves the previously established gap to the cutset bound. We also demonstrate through two popular Gaussian network examples that noisy network coding can outperform conventional compress-forward, amplify-forward, and hash-forward coding schemes.

关键词： Compress-forward discrete memoryless network Gaussian network interference relay channel network coding noisy network coding relaying two-way relay channel

来源：评论

学校读者我要写书评

暂无评论

noisy network coding with Partial DF

Noisy Network Coding with Partial DF

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Lee, Si-Hyeon Chung, Sae-Young Univ Toronto Dept Elect & Comp Engn Toronto ON Canada Korea Adv Inst Sci & Technol Dept Elect Engn Daejeon South Korea

ISBN: (纸本)9781467377041

In this paper, we propose a noisy network coding integrated with partial decode-and-forward relaying for single-source multicast discrete memoryless networks (DMN's). Our coding scheme generalizes the partial-decode-compressand- forward scheme (Theorem 7) by Cover and El Gamal. This is the first time the theorem is generalized for DMN's such that each relay performs both partial decode-and-forward and compress-and-forward simultaneously. Our coding scheme simultaneously generalizes both noisy network coding by Lim, Kim, El Gamal, and Chung and distributed decode-and-forward by Lim, Kim, and Kim. It is not trivial to combine the two schemes because of inherent incompatibility in their encoding and decoding strategies. We solve this problem by sending the same long message over multiple blocks at the source and at the same time by letting the source find the auxiliary covering indices that carry information about the message simultaneously over all blocks.

关键词： noisy network coding distributed decode-and-forward unified coding theorem

来源：评论

学校读者我要写书评

暂无评论

Achievable Secrecy Rates for Relay-Eavesdropper Channel Based on the Application of noisy network coding

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2018年第7期13卷 1736-1751页

作者： Xu, Peng Ding, Zhiguo Dai, Xuchu Chongqing Univ Posts & Telecommun Key Lab Mobile Commun Technol Chongqing 400065 Peoples R China Univ Lancaster Sch Comp & Commun Lancaster LA1 4WA England Univ Sci & Technol China Sch Informat Sci & Technol Chinese Acad Sci Key Lab Wireless Opt Commun Hefei 230026 Anhui Peoples R China

In this paper, we consider the design of a new secure transmission scheme for a four-node relay-eavesdropper channel, where user cooperation is used to facilitate secure communications. The key idea of the proposed achievable scheme is to apply the compression relaying concept of noisy network coding (NNC) to the secrecy communication scenario. But different from the original non-secrecy NNC, the compression rate at the relay is adaptively chosen according to the eavesdropping channel. Particularly, helping interference information is injected into the compression codebook at the relay by simply enlarging the compression rate, which is to effectively suppress the eavesdropping channel. Closed-form expressions of the secrecy rates achieved by the proposed NNC-based secure scheme are characterized for both the discrete memoryless and Gaussian relay-eavesdropper channels, where the optimal compression rate and the optimal transmit power at the relay are also determined. The proposed secure scheme can be viewed as a general framework, which naturally combines the NNC compression relaying scheme with the interference-assisted scheme. Analytical and numerical results demonstrate that the proposed secure scheme offers constant performance gains over typical existing cooperative secure schemes.

关键词： Information theoretic secrecy interference noisy network coding relay-eavesdropper channel

来源：评论

学校读者我要写书评

暂无评论

Opportunistic noisy network coding for Fading Relay networks Without CSIT

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2015年第11期14卷 6097-6110页

作者： Jeon, Sang-Woon Lim, Sung Hoon Jung, Bang Chul Andong Natl Univ Dept Informat & Commun Engn Andong 760749 South Korea Ecole Polytech Fed Lausanne Sch Comp & Commun Sci CH-1015 Lausanne Switzerland Chungnam Natl Univ Dept Elect Engn Taejon 305764 South Korea

The parallel relay network is studied, in which a single source node sends a message to a single destination node with the help of N parallel relays. Channel coefficients are assumed to vary over time and channel state information (CSI) is causally available only at the receiver side (CSIR). Opportunistic noisy network coding is proposed for intelligently exploiting CSIR at each relay in a distributed manner by operating the noisy network coding scheme with adaptive compression. More specifically, each relay opportunistically vector-quantizes the collection of received symbols that is received with channel gains larger than a certain threshold. It then forwards the digital compression information to the destination node using independently generated Gaussian codes. For independent and identically distributed (i.i.d.) Rayleigh fading, the proposed scheme is shown to achieve the ergodic capacity in the large number of relays regime. Furthermore, the proposed scheme is extensively compared with several alternative schemes, the decode-forward scheme, the adaptive amplify-forward scheme, and the non-adaptive noisy network coding scheme over geometric models. We show that the new proposed scheme provides significant gain over these schemes in various cases.

关键词： Adaptive compression approximate capacity compress-forward fast fading noisy network coding parallel relay network

来源：评论

学校读者我要写书评

暂无评论

Short Message noisy network coding With Sliding-Window Decoding for Half-Duplex Multihop Relay networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2016年第10期15卷 6676-6689页

作者： Hong, Song-Nam Maric, Ivana Hui, Dennis Ajou Univ Dept Elect & Comp Engn Suwon 16499 South Korea Ericsson Res San Jose CA 95134 USA

In this paper, we present a cooperative relaying strategy for half-duplex multihop relay networks. This scheme consists of three parts: 1) relay selection to yield a layered relay network;2) group successive relaying that establishes a relay schedule to efficiently exploit half-duplex relays;and 3) a cooperative relaying scheme named short message noisy network coding with sliding-window decoding (SNNC-SW) that outperforms other state-of-the-art information theoretical schemes with lower decoding complexity and delay. We derive an achievable rate region of the proposed SNNC-SW scheme and attain a closed-form rate expression in the asymptotic case for several network models of interests. We then focus on the first part of our relaying strategy regarding efficient relay selection. We develop interference-harnessing routing that exploits the fact that in SNNC-SW, interference is treated as a useful signal. We show that, due to the efficient treatment of interference, this scheme can outperform routing schemes that deploy store-and-forward, a solution previously proposed for practical wireless multihop networks. Finally, we develop a low-complexity successive decoder of our scheme (implemented by a conventional MIMO decoder), which is a solution that can readily be implemented in practice. It is shown that also this practical scheme provides a significant gain over routing (based on store-andforward) and the performance gap increases as the network becomes denser.

关键词： Multihop relay networks half-duplex relays cooperative relaying schemes noisy network coding

来源：评论

学校读者我要写书评

暂无评论

Mixed noisy network coding and Cooperative Unicasting in Wireless networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第1期61卷 189-222页

作者： Behboodi, Arash Piantanida, Pablo Tech Univ Berlin Telecommun Network Grp D-10587 Berlin Germany Supelec Dept Telecommun F-91190 Gif Sur Yvette France

The problem of communicating a single message to a destination in presence of multiple relay nodes, referred to as cooperative unicast network, is considered. First, we introduce mixed noisy network coding (MNNC) scheme which generalizes noisy network coding where relays are allowed to decode-and-forward (DF) messages while all of them (without exception) transmit noisy descriptions of their observations. These descriptions are exploited at the destination and DF relays aim to decode the transmitted messages while creating full cooperation among the nodes. Moreover, the destination and DF relays can independently select the set of descriptions to be decoded or treated as interference. This concept is further extended to multihopping scenarios, referred to as layered MNNC, where DF relays are organized into disjoint groups representing one hop in the network. For cooperative unicast additive white Gaussian noise (AWGN) networks, we show that-provided DF relays are properly chosen-MNNC improves over all previously established constant gaps to the cut-set bound. Second, we consider the composite cooperative unicast network where the channel parameters are randomly drawn before communication starts and remain fixed during the transmission. Each draw is assumed to be unknown at the source and fully known at the destination but only partly known at the relays. We introduce through MNNC scheme the concept of selective coding strategy (SCS) that enables relays to decide dynamically whether, in addition to communicate noisy descriptions, is possible to decode and forward messages. It is demonstrated through slow-fading AWGN relay networks that SCS clearly outperforms conventional coding schemes.

关键词： Cooperative unicasting wireless networking decode-and-forward compute-and-forward quantize-map-and-forward noisy network coding constant gap composite channel outage capacity

来源：评论

学校读者我要写书评

暂无评论

Joint noisy network coding and Decode-Forward Relaying for Non-Orthogonal Multiple Access

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2019年第1期18卷 296-309页

作者： Chattha, Jawwad Nasar Uppal, Momin Lahore Univ Management Sci Dept Elect Engn Lahore 54792 Pakistan Univ Management & Technol Dept Elect Engn Lahore 54782 Pakistan

We consider a non-orthogonal multiple access channel in which multiple users communicate with a base-station through a dedicated relay. For this setup, we propose a novel joint-noisy network-coded (J-NNC)-decode-and-forward (DF) cooperation scheme that employs NNC relaying with opportunistic DF. The proposed scheme utilizes the DF cooperation when messages from all users are successfully decoded at the relay and the NNC when the relay is unable to decode any one of the users. In the scenario when the relay decodes only a subset of users, the proposed scheme utilizes joint DF and NNC encoding. We derive the information theoretic conditions required for successful message recovery and show that the J-NNC-DF has a strictly better outage performance than the conventional DF-only, NNC-only, or DF-or-NNC schemes. For the two-user case, we derive closed-form expressions for the outage performance under Rayleigh fading while assuming access only to the local channel state information at the relay. For these expressions, let us choose the NNC quantization parameter so as to attain optimum outage performance. The simulation results validate the theoretical findings and show that the J-NNC-DF achieves a performance gain of 0.75, 1.7, and 2.1 dB compared with the DF-or-NNC, DF-only and NNC-only strategies, respectively.

关键词： Non-orthogonal multiple access relaying decode-and-forward noisy network coding

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Advanced Relaying Protocols in Large Wireless networks

引用

IEEE ACCESS 2019年 7卷 22214-22226页

作者： Altieri, Andres Piantanida, Pablo Univ Buenos Aires Dept Elect C1063ACV Buenos Aires DF Argentina CSC CONICET C1425FQD Buenos Aires DF Argentina Univ Paris Sud Cent Supelec French Natl Ctr Sci Res F-91190 Gif Sur Yvette France Univ Montreal Montreal Inst Learning Algorithms Montreal PQ H2S 3H1 Canada

This paper studies the performance of some state-of-the-art cooperative full-duplex relaying protocols in the context of a large wireless network modeled using stochastic geometry tools. We investigate the outage behavior for different cooperative schemes, namely decode-and-forward, noisy-network coding, and mixed noisy-network coding, considering fading, path loss, and interference from other sources and relays. Due to the high complexity of the network topology and the protocols considered, a closed-form analysis is not possible, so our study is performed through extensive but careful numerical simulations, sweeping a large number of relevant parameters. Several scenarios of particular interest are investigated. In this way, insightful conclusions are drawn regarding the network regimes in which relay-assisted cooperation is most beneficial and the potential gains that could be achieved through it.

关键词： Cooperative communications decode-and-forward compress-and-forward noisy network coding full duplex outage probability Poisson point process stochastic geometry

来源：评论

学校读者我要写书评

暂无评论

On the Capacity of Cloud Radio Access networks With Oblivious Relaying

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2019年第7期65卷 4575-4596页

作者： Aguerri, Inaki Estella Zaidi, Abdellatif Caire, Giuseppe Shamai (Shitz), Shlomo Huawei Technol Math & Algorithm Sci Lab Paris Res Ctr F-92100 Boulogne France Univ Paris Est Lab Informat Gaspard Monge Paris France Tech Univ Berlin Dept Telecommun Syst D-10587 Berlin Germany Technion Israel Inst Technol Viterbi Elect Engn Dept IL-32000 Haifa Israel

We study the transmission over a network in which users send information to a remote destination through relay nodes that are connected to the destination via finite-capacity error-free links, i.e., a cloud radio access network. The relays are constrained to operate without knowledge of the users' codebooks, i.e., they perform oblivious processing. The destination, or central processor, however, is informed about the users' codebooks. We establish a single-letter characterization of the capacity region of this model for a class of discrete memoryless channels in which the outputs at the relay nodes are independent given the users' inputs. We show that both relaying a-la Cover-El Gamal, i.e., compress-and-forward with joint decompression and decoding, and "noisy network coding" are optimal. The proof of the converse part establishes, and utilizes, connections with the Chief Executive Officer source coding problem under logarithmic loss distortion measure. Extensions to general discrete memoryless channels are also investigated. In this case, we establish the inner and outer bounds on the capacity region. For memoryless Gaussian channels within the studied class of channels, we characterize the capacity region when the users are constrained to time-share among Gaussian codebooks. Furthermore, we also discuss the suboptimality of separate decompression and decoding and the role of time sharing.

关键词： Cloud radio access network multiple-access relay channel oblivious relay processing fronthaul compression noisy network coding

来源：评论

学校读者我要写书评

暂无评论

Capacity Approximations for Gaussian Relay networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第9期61卷 4721-4734页

作者： Kolte, Ritesh Ozgur, Ayfer El Gamal, Abbas Stanford Univ Dept Elect Engn Stanford CA 94305 USA

Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward-based strategies can achieve the capacity of this network within an additive gap. Here, the relays quantize their received signals at the noise level and map them to random Gaussian codebooks. The resultant gap to capacity is independent of the SNRs of the channels in the network and the topology, but is linear in the total number of nodes. In this paper, we provide an improved lower bound on the rate achieved by the compress-and-forward-based strategies (noisy network coding in particular) in arbitrary Gaussian relay networks, whose gap to capacity 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 approximation of the capacity. In particular, we demonstrate that it leads to a logarithmic rather than linear capacity gap in the total number of nodes for certain classes of layered networks. The improvement comes from quantizing the received signals of the relays at a resolution decreasing with the total number of nodes in the network. This suggests that the rule-of-thumb in the literature of quantizing the received signals at the noise level can be highly suboptimal.

关键词： Relay networks gap to capacity noisy network coding network topology quantization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：