University of Cambridge > > Isaac Newton Institute Seminar Series > Stochastic models and algorithms for cooperative information delivery

Stochastic models and algorithms for cooperative information delivery

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

This talk has been canceled/deleted

Recent advances in information and communication theory suggest novel architectures where end-to-end information delivery is facilitated through cooperation at various stages during the information transport process. We consider a stochastic dynamic model of information transport in an architecture where various information streams are mixed in an intermediate relay node before delivery. The objective is to increase the efficiency of the system through judicious exploitation of transmission overhearing, inherent in radio broadcast. Other user overheard information is used as a key to extract own information in future transmissions. Algorithms for selecting mixing combinations to increase transport efficiency are considered. They rely on complete information about the state of overheard information. When state information is not readily available but is gradually revealed through feedback, the mixing algorithm should account both for efficient state probing as well as for effective information recovery. System capacity characterization and efficient algorithms are obtained for the limited state information as well.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity