Home /  Mathematics of Relaying and Cooperation in Communication Networks

Workshop

Mathematics of Relaying and Cooperation in Communication Networks April 10, 2006 - April 12, 2006
Registration Deadline: April 01, 2006 over 18 years ago
To apply for Funding you must register by: January 10, 2006 almost 19 years ago
Parent Program: --
Organizers Michael Gastpar, Gerhard Kramer, J. Nicholas Laneman
Speaker(s)

Show List of Speakers

Description
Workshop Schedule Information theory bridges mathematics and communication systems analysis. The point-to-point communication problem is fairly well understood today: researchers have developed a refined set of tools for designing and optimizing codes and protocols. In stark contrast, the analysis of communication networks is still a wide open problem because of the complex nature of the interactions permitted by multi-terminal systems. Our lack of understanding is reflected by the fact that most state-of-the-art communication networks are planned using point-to-point principles, and network considerations enter only at a later stage of design. Designing resource-efficient wireless networks requires a fundamental understanding of the mathematics underlying multi-terminal communication systems. One of the simplest such systems is a “three-body problem,” with a source, a destination, and a relay whose purpose is to assist the communication from the source to the destination. This seemingly simple communication problem has long resisted solution, but new insight has been gained recently. This workshop aims at bringing together researchers from engineering, computer science, and mathematics to discuss recent advances and promising directions for future research. In particular, the workshop will emphasize: physical-layer models performance metrics sensor networks code design resource allocation converse bounds historical perspectives multi-terminal information theory relaying via network coding While leading researchers in each of these areas are being invited to participate in the workshop, submissions of contributed posters of original work in each of these areas are also being solicited. Posters will be reviewed on the basis of an extended abstract (not exceeding 3 pages), submitted in PDF format to gastpar@eecs.berkeley.edu. The deadline for submission is February 1, 2006, with notification of decisions by March 1, 2006. Download a PDF file of the workshop announcement. Sponsored by:
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Funding & Logistics Show All Collapse

Show Funding

To apply for funding, you must register by the funding application deadline displayed above.

Students, recent PhDs, women, and members of underrepresented minorities are particularly encouraged to apply. Funding awards are typically made 6 weeks before the workshop begins. Requests received after the funding deadline are considered only if additional funds become available.

Show Lodging

For information about recommended hotels for visits of under 30 days, visit Short-Term Housing. Questions? Contact coord@slmath.org.

Show Directions to Venue

Show Visa/Immigration

Schedule, Notes/Handouts & Videos
Show Schedule, Notes/Handouts & Videos
Show All Collapse
Apr 10, 2006
Monday
09:10 AM - 10:00 AM
  Introduction Of The Relay Channel
Edward van der Meulen
10:30 AM - 11:00 AM
  Diversity-Multiplexing Tradeoff for Cooperative Systems: Characterization and Impact on Joint Source-Channel Coding
Elza Erkip
11:00 AM - 11:30 AM
  Cognition, Collaboration and Competition in Space and Time: From Theory To Implementation
Vahid Tarokh (Duke University)
02:30 PM - 03:00 PM
  Network Layer View of Cooperation
Anthony Ephremides
Apr 11, 2006
Tuesday
09:10 AM - 10:00 AM
  Capacity Theorems for the Relay Channel
Abbas El Gamal
10:30 AM - 11:00 AM
  Cooperation, Multihopping and Relaying in Underwater Networks
Urbashi Mitra
11:00 AM - 11:30 AM
  Discrete Memoryless Multiple Access Channels with Correlated Sources and Feedback
Sriram Vishwanath
11:00 AM - 11:30 AM
  Cooperation in the Low Power Regime: Capacity and Coding
Anders Host-Madsen
11:30 AM - 12:00 PM
  Throughput Scaling in Wideband Sensory Relay Networks: Cooperative Relaying, Power Allocation and Scaling Laws
Junshan Zhang
11:30 AM - 12:00 PM
  A Multi-Source Multi-Relay Scheme
Liang-liang Xie
01:30 PM - 03:00 PM
  Industry Panel
Bertrand Hochwald, Roger Peterson, Sundeep Rangan, Sumeet Sandhu
03:00 PM - 03:30 PM
  Throughput Optimal Control of Cooperative Relay Networks
Edmund Yeh
03:30 PM - 04:00 PM
  "Crystallization" in Large Fading Networks
Helmut Boelcskei
04:00 PM - 04:30 PM
  Optimal Cooperative Communication in the Low SNR Regime
David Tse
04:00 PM - 04:30 PM
  Cooperation and Competition
Randall Berry
04:30 PM - 05:00 PM
  Results for Two Random Network Models
Babak Hassibi
04:30 PM - 05:00 PM
  Resource Allocation for Fading Orthogonal Relay Channels
Venu Veeravalli
Apr 12, 2006
Wednesday
09:10 AM - 10:00 AM
  The Multiple-Access Channel with Cribbing Encoders Revisited
Frans Willems
10:30 AM - 11:00 AM
  Multiple Access Channels with Bi-Directional Links
Ashutosh Sabharwal
11:30 AM - 12:00 PM
  Capacity and Cooperation in Wireless Networks
Andrea Goldsmith
02:00 PM - 02:30 PM
  Backward Decoding Strategies for the Relay Channel
Mehul Motani
02:30 PM - 03:00 PM
  Codes for Half Duplex Relay Channels
Behnaam Aazhang
03:00 PM - 03:30 PM
  Wireless Relay Networks
Massimo Franceschetti
04:00 PM - 04:30 PM
  Capacity Results for Finite-Field Relay Networks
Piyush Gupta
04:30 PM - 05:00 PM
  On the Capacity of Wireless Channels with Selfish Users
Hesham El Gamal