Towards characterizing the capacity of the building block of MANETs

Slides:



Advertisements
Similar presentations
Hardware Impairments in Large-scale MISO Systems
Advertisements

Derives the optimal achievable rate for MISO secondary users under coexistence constraints Proposes practical strategy for cognition and cooperation in.
EE359 – Lecture 8 Outline Capacity of Fading channels Fading Known at TX and RX Optimal Rate and Power Adaptation Channel Inversion with Fixed Rate Capacity.
Cooperative Network Coding
Relaying in networks with multiple sources has new aspects: 1. Relaying messages to one destination increases interference to others 2. Relays can jointly.
AALTO UNIVERSITY School of Science and Technology Wang Wei
Bandwidth Scaling in UWB Communications Dana Porrat and David Tse University of California, Berkeley.
Node Cooperation and Cognition in Dynamic Wireless Networks
1 Throughput Scaling in Wideband Sensory Relay Networks: Cooperative Relaying, Power Allocation and Scaling Laws Junshan Zhang Dept. of Electrical Engineering.
Information Theory of Wireless Networks: A Deterministic Approach David Tse Wireless Foundations U.C. Berkeley CISS 2008 March 21, 2008 TexPoint fonts.
Gaussian Interference Channel Capacity to Within One Bit David Tse Wireless Foundations U.C. Berkeley MIT LIDS May 4, 2007 Joint work with Raul Etkin (HP)
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
When rate of interferer’s codebook small Does not place burden for destination to decode interference When rate of interferer’s codebook large Treating.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2 Layerless Dynamic Networks Lizhong Zheng, Todd Coleman.
MD-based scheme could outperform MR-based scheme while preserving the source- channel interface Rate is not sufficient as source- channel interface, ordering.
Infrastructure Mobility: A What-If Analysis Mahanth Gowda Nirupam Roy Romit Roy Choudhury.
CODED COOPERATIVE TRANSMISSION FOR WIRELESS COMMUNICATIONS Prof. Jinhong Yuan 原进宏 School of Electrical Engineering and Telecommunications University of.
Iterative Multi-user Detection for STBC DS-CDMA Systems in Rayleigh Fading Channels Derrick B. Mashwama And Emmanuel O. Bejide.
EE 6332, Spring, 2014 Wireless Communication Zhu Han Department of Electrical and Computer Engineering Class 11 Feb. 19 th, 2014.
Coded Modulation for Multiple Antennas over Fading Channels
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2 Overview: Layerless Dynamic Networks Lizhong Zheng.
1 Blind Channel Identification and Equalization in Dense Wireless Sensor Networks with Distributed Transmissions Xiaohua (Edward) Li Department of Electrical.
Superposition encoding A distorted version of is is encoded into the inner codebook Receiver 2 decodes using received signal and its side information Decoding.
Wireless Multiple Access Schemes in a Class of Frequency Selective Channels with Uncertain Channel State Information Christopher Steger February 2, 2004.
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.
Cross-Layer Schemes for Antenna Array Based Wireless Ad Hoc Networks – Design and Analysis Jayakrishnan Mundarath Jointly Advised by : Prof. Parmesh Ramanathan.
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.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrusts 0 and 1 Metrics and Upper Bounds Muriel Medard, Michelle Effros and.
Multicast Scaling Laws with Hierarchical Cooperation Chenhui Hu, Xinbing Wang, Ding Nie, Jun Zhao Shanghai Jiao Tong University, China.
EE360: Lecture 13 Outline Capacity of Cognitive Radios Announcements Progress reports due Feb. 29 at midnight Overview Achievable rates in Cognitive Radios.
1)Effect of Network Coding in Graphs Undirecting the edges is roughly as strong as allowing network coding simplicity is the main benefit 2)Effect of Network.
Channel Capacity.
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.
Xin Liu Department of Computer Science Univ. of California, Davis
EECS 290S: Network Information Flow
Digital transmission over a fading channel
Joint Source, Channel, and Network Coding in MANETs
Q-Learning for Policy Improvement in Network Routing
DIRECT SEQUENCE SPREAD SPECTRUM WITH FREQUENCY HOPPING
Layerless Dynamic Networks
ACHIEVEMENT DESCRIPTION
Tilted Matching for Feedback Channels
Amplify-and-Forward Schemes for Wireless Communications
Ivana Marić, Ron Dabora and Andrea Goldsmith
Resource Allocation in Non-fading and Fading Multiple Access Channel
Coding for Noncoherent M-ary Modulation
Howard Huang, Sivarama Venkatesan, and Harish Viswanathan
Optimal Sequence Allocation and Multi-rate CDMA Systems
Bin Zhao, Ph.D. student Matthew Valenti, Assistant Professor
Wireless Communication Co-operative Communications
Presented by Hermes Y.H. Liu
Su Yi Babak Azimi-Sadjad Shivkumar Kalyanaraman
Blind Known Interference Cancellation
Wireless Network Coding: Some Lessons Learned in ITMANET
Wireless Communication Co-operative Communications
Probability of Error with Fading
Unequal Error Protection: Application and Performance Limits
Cornel Zlibut, Undergraduate Junior Tennessee State University
EE359 – Lecture 7 Outline Announcements: Shannon Capacity
Oblivious Equilibrium for Stochastic Games with Concave Utility
Application Metrics and Network Performance
EE359 – Lecture 7 Outline Shannon Capacity
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
ACHIEVEMENT DESCRIPTION
ACHIEVEMENT DESCRIPTION
Chenhui Zheng/Communication Laboratory
Presentation transcript:

Towards characterizing the capacity of the building block of MANETs Non-Coherent Multipath Fading Relay Networks in the Wideband Regime – Fawaz, Medard IMPACT NEXT-PHASE GOALS ACHIEVEMENT DESCRIPTION STATUS QUO NEW INSIGHTS MAIN ACHIEVEMENT: HOW IT WORKS: Source: Low-duty cycle peaky FSK signaling Relay: Decode, Frequency Binning and Forward Destination: decodes relayed signal, then source signal using relayed information ASSUMPTIONS AND LIMITATIONS: Wideband regime Relay decodes fully Achievable rate in non-coherent multipath fading relay channel coincides with generalized block-Markov lower bound of AWGN-FD channel -> LB coincides with cut-set upper-bound for -> Capacity Non-coherent peaky frequency binning scheme Min-cut on hypergraph model Capacity of general relay channel unknown • Bounds on general relay channel • Bounds on AWGN relay channel Wideband regime: not interference-limited, but energy-limited point-to-point: Hypergraph Model: min-cut on hypergraph What technical challenge is being undertaken on behalf of the project This work aims at characterizing the capacity of the multipath fading relay channel in the Low SNR/wideband regime, known to be energy-limited but not interference-limited. 2. Why is it hard and what are the open problems The capacity of the general relay channel is still an open problem, although it is a 3-node network and the smallest building block of a MANET. In the low SNR regime, when the band grows large, the relay capabilities are limited by its finite power: the relay cannot make its observation fully available to the destination. Thus, obtaining virtual MIMO gains in the wideband regime is not an obvious possibility. 3. How has this problem been addressed in the past Wideband regime: the capacity of the point-to-point AWGN channel, and the point-to-point multipath fading channel is known to be equal to the received SNR. The power should not be spread, on the contrary, the capacity is achieved by peaky signaling. Relay channels: Upper and lower bounds were given for the general relay channel, and in particular the AWGN channel. A plethora of cooperative strategies have provided achievable rates for relaying networks in the high SNR regime. However, the capacity of the multipath fading relay channel in the low SNR/wideband regime is unknown, and no comparison was established with the bounds on the capacity of the wideband AWGN, as in the point-to-point case. 4. What new intellectual tools are being brought to bear on the problem A hypergraph model is proposed. Peaky signaling schemes known to be optimal in the wideband point-to-point fading channel are combined with frequency binning, in order to achieve the hypergraph min-cut. 5. What is the main intermediate achievement Providing a lower bound on the capacity of the non-coherent multipath fading channel in the wideband regime, and comparing it with the cut-set upper-bound and known lower bounds for the AWGN channel. 6. How and when does this achievement align with the project roadmap (end-of-phase or end-of-project goal) This work aligns with Phase 3 progress criteria: Revolutionize upper bounding techniques through new and different approaches that go beyond the classical MIN-CUT bounds and Fano's inequality that have dominated capacity bounds for the last several decades. Determine the optimal channel/network "coding" that achieves these capacity upper bounds when possible, and characterize for which classes of networks gaps still exist between achievability and upper bounds, and why. 7. What are the even long-term objectives and consequences? The hypergraph model may help giving bounds on the capacity of larger relaying networks in the wideband regime. The power limitation on the relay capabilities when the band grows large raises the question of whether virtual MIMO gains are actually achievable in the wideband regime of the relay channel. 8. Which thrusts and SOW tasks does this contribution fit under and why? This work is part of thrust 1: New Paradigms for Upper Bounds. Extension to larger networks: multiple relays, layers... Open question: closing the gap to Cut-set UB? Virtual MIMO gain in the wideband regime? Towards characterizing the capacity of the building block of MANETs