Jinhua Jiang, Ivana Marić, Andrea Goldsmith, and Shuguang Cui Summary

Slides:



Advertisements
Similar presentations
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 11 Information.
Advertisements

Derives the optimal achievable rate for MISO secondary users under coexistence constraints Proposes practical strategy for cognition and cooperation in.
Bandwidth-Efficient, Energy-Constrained Short Range Wireless Communications.
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
IE 419/519 Wireless Networks Lecture Notes #6 Spread Spectrum.
Relaying in networks with multiple sources has new aspects: 1. Relaying messages to one destination increases interference to others 2. Relays can jointly.
EE360: Lecture 13 Outline Cognitive Radios and their Capacity Announcements March 5 lecture moved to March 7, 12-1:15pm, Packard 364 Poster session scheduling.
Achilleas Anastasopoulos (joint work with Lihua Weng and Sandeep Pradhan) April A Framework for Heterogeneous Quality-of-Service Guarantees in.
June 4, 2015 On the Capacity of a Class of Cognitive Radios Sriram Sridharan in collaboration with Dr. Sriram Vishwanath Wireless Networking and Communications.
Node Cooperation and Cognition in Dynamic Wireless Networks
Three Lessons Learned Never discard information prematurely Compression can be separated from channel transmission with no loss of optimality Gaussian.
Lihua Weng Dept. of EECS, Univ. of Michigan Error Exponent Regions for Multi-User Channels.
Information Theory of Wireless Networks: A Deterministic Approach David Tse Wireless Foundations U.C. Berkeley CISS 2008 March 21, 2008 TexPoint fonts.
Introduction to Cognitive radios Part two HY 539 Presented by: George Fortetsanakis.
EE360: Lecture 6 Outline MAC Channel Capacity in AWGN
ECE 776 Information Theory Capacity of Fading Channels with Channel Side Information Andrea J. Goldsmith and Pravin P. Varaiya, Professor Name: Dr. Osvaldo.
Lattices for Distributed Source Coding - Reconstruction of a Linear function of Jointly Gaussian Sources -D. Krithivasan and S. Sandeep Pradhan - University.
A Graph-based Framework for Transmission of Correlated Sources over Multiuser Channels Suhan Choi May 2006.
Sep 08, 2005CS477: Analog and Digital Communications1 Example Systems, Signals Analog and Digital Communications Autumn
Linear Codes for Distributed Source Coding: Reconstruction of a Function of the Sources -D. Krithivasan and S. Sandeep Pradhan -University of Michigan,
EE360: Lecture 13 Outline Cognitive Radios and their Capacity Announcements Progress reports due today, HW 2 posted March 5 lecture moved to March 7, 12-1:15pm,
Coding Schemes for Multiple-Relay Channels 1 Ph.D. Defense Department of Electrical and Computer Engineering University of Waterloo Xiugang Wu December.
When rate of interferer’s codebook small Does not place burden for destination to decode interference When rate of interferer’s codebook large Treating.
RELIABLE MULTIMEDIA TRANSMISSION OVER COGNITIVE RADIO NETWORKS USING FOUNTAIN CODES Proceedings of the IEEE | Vol. 96, No. 1, January 2008 Harikeshwar.
Zukang Shen, Jeffrey Andrews, and Brian Evans
ECE559VV – Fall07 Course Project Presented by Guanfeng Liang Distributed Power Control and Spectrum Sharing in Wireless Networks.
MD-based scheme could outperform MR-based scheme while preserving the source- channel interface Rate is not sufficient as source- channel interface, ordering.
Three-layer scheme dominates previous double-layer schemes Distortion-diversity tradeoff provides useful comparison in different operating regions Layered.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
PRICE-BASED SPECTRUM MANAGEMENT IN COGNITIVE RADIO NETWORKS Fan Wang, Marwan Krunz, and Shuguang Cui Department of Electrical & Computer Engineering, University.
1 Codage avec Information Adjacante (DPC : Dirty paper coding) et certaines de ses applications : Tatouage (Watermarking) MIMO broadcast channels Gholam-Reza.
Communication Over Unknown Channels: A Personal Perspective of Over a Decade Research* Meir Feder Dept. of Electrical Engineering-Systems Tel-Aviv University.
Cooperative Communication in Sensor Networks: Relay Channels with Correlated Sources Brian Smith and Sriram Vishwanath University of Texas at Austin October.
Superposition encoding A distorted version of is is encoded into the inner codebook Receiver 2 decodes using received signal and its side information Decoding.
Transmission over composite channels with combined source-channel outage: Reza Mirghaderi and Andrea Goldsmith Work Summary STATUS QUO A subset Vo (with.
EE360: Lecture 9 Outline Announcements Cooperation in Ad Hoc Networks
Interference in MANETs: Friend or Foe? Andrea Goldsmith
MAIN RESULT: Depending on path loss and the scaling of area relative to number of nodes, a novel hybrid scheme is required to achieve capacity, where multihop.
We aim to exploit cognition to maximize network performance What is the side information at a cognitive node? What is the best encoding scheme given this.
The High, the Low and the Ugly Muriel Médard. Collaborators Nadia Fawaz, Andrea Goldsmith, Minji Kim, Ivana Maric 2.
Jayanth Nayak, Ertem Tuncel, Member, IEEE, and Deniz Gündüz, Member, IEEE.
Jayanth Nayak, Ertem Tuncel, Member, IEEE, and Deniz Gündüz, Member, IEEE.
The Finite-state channel was introduced as early as 1953 [McMillan'53]. Memory captured by channel state at end of previous symbol's transmission: - S.
Scheduling Considerations for Multi-User MIMO
March 18, 2005 Network Coding in Interference Networks Brian Smith and Sriram Vishwanath University of Texas at Austin March 18 th, 2005 Conference on.
EE360: Lecture 13 Outline Capacity of Cognitive Radios Announcements Progress reports due Feb. 29 at midnight Overview Achievable rates in Cognitive Radios.
The Capacity of Interference Channels with Partial Transmitter Cooperation Ivana Marić Roy D. Yates Gerhard Kramer Stanford WINLAB, Rutgers Bell Labs Ivana.
PROJECT DOMAIN : NETWORK SECURITY Project Members : M.Ananda Vadivelan & E.Kalaivanan Department of Computer Science.
Bridging the Gap: A Deterministic Model for Wireless Links David Tse Wireless Foundations U.C. Berkeley NSF Wireless Networks Workshop Aug 27, 2007 TexPoint.
Introduction to Cognitive radios Part two
EECS 290S: Network Information Flow
Joint Source, Channel, and Network Coding in MANETs
Advanced Wireless Networks
Layerless Dynamic Networks
Ivana Marić, Ron Dabora and Andrea Goldsmith
Howard Huang, Sivarama Venkatesan, and Harish Viswanathan
Independent Encoding for the Broadcast Channel
Layered Decoding and Secrecy Over Degraded Broadcast Channel
Figure 2.1 Illustration of a simple binary counting application.
EEE 264-2:Capacity Increase Techniques and Calculations
Copyright © Cengage Learning. All rights reserved.
An AWGN Multiaccess Channel*
Spectrum Sharing in Cognitive Radio Networks
Metrics for Characterizing QoS in Multi-Channel, Multi-Radio,Multi-Rate Wireless Meshes Ranjan Pal.
Cornel Zlibut, Undergraduate Junior Tennessee State University
Information Theoretical Analysis of Digital Watermarking
Network Coding Rates and Edge-Cut Bounds
Compute-and-Forward Can Buy Secrecy Cheap
ACHIEVEMENT DESCRIPTION
Lihua Weng Dept. of EECS, Univ. of Michigan
Presentation transcript:

Achievable Rate Regions for the Broadcast Channel With Cognitive Relays Jinhua Jiang, Ivana Marić, Andrea Goldsmith, and Shuguang Cui Summary Motivations Channel Model (BCCR) Two Simple network models involving CRs have been separately studied in the literature Cognitive radio channel (also called the interference channel with one cognitive transmitter) [Maric et al. 06’, etc.] Most of the existing works on CRC view the channel as a variant of the interference channel Most existing coding strategies are constrained by an encoding order: 1) primary user massage first, 2) then the cognitive user message with the Gel’fand-Pinsker coding scheme Interference channel with a cognitive relay [sahin & Erkip 07’; Sridharan et al. 08’] Only the Gaussian case has been studied The generality of the channel model is largely ignored The channel model in fact includes the CRC as a special case Relay 1 Relay 2 Base Station User 1 User 2 Cognitive Relay Primary User Cognitive User Questions: Is cognitive radio channel a variant of interference channel or broadcast channel? Or does the capacity region of the cognitive radio channel (if found) imply the capacity region of the interference channel? Base on the observations, a unified approach is employed to study the two channels, which bridges the two channels with the same coding scheme, but breaks the constraints on the encoding sequence especially for the CRC! Messages: Encoding: Decoding: New Coding scheme New Achievable Rate Regions A Gaussian Example Thm. 1: For a fix joint PDF in (1), any non-negative rate pair (R12+R11,R21+R22) is achievable for the BCCR with R12, R11, R21, and R22 satisfying Thm. 2: For a fix joint PDF in (2), any non-negative rate pair (R12+R11,R21+R22) is achievable for the BCCR with R12, R11, R21, and R22 satisfying Rate splitting: Joint PDF of the RVs for codebook generation: (1) Encoding Decoding Set V2 , U1 and U2 as constants in (2): Evaluate Set V2 as a constant in (2): Dirty paper coding is applied twice in a unique order: encode W2 against V1, and then encode W1 against W2, which is impossible with any other existing coding schemes for the CRC or the BCCR The obtained rate region is the capacity region for the channel when the interference link from X1 to Y2 is removed Thm. 3: Any non-negative rate pair (R12+R11,R21+R22) is achievable for the CRC with R12, R11, R21, and R22 satisfying Future work: 1) to determine whether the above region is the capacity region for the example setting; 2) also for the general Gaussian setting. This new rate region is shown to include the best existing rate region for the BCCR in [Sridharan et al. 08’] A further improved rate region with simplified description is obtained using successive superposition encoding with a modified joint PDF Gel’fand-Pinsker Binning Marton Binning