University of Cambridge > > Computer Laboratory Systems Research Group Seminar > Content search and availability estimation in mobile opportunistic networks

Content search and availability estimation in mobile opportunistic networks

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

  • UserSuzan Bayhan (University of Helsinki)
  • ClockTuesday 24 November 2015, 13:15-14:00
  • HouseFW11 Computer Lab.

If you have a question about this talk, please contact Eiko Yoneki.

This talk has been canceled/deleted

Mobile devices host increasing volume of data which could be shared with the nearby nodes in a multi-hop fashion. However, retrieving the content in this resource-restricted setting is challenging due to the lack of a content index, as well as, desire for keeping the search cost low. Compared to the extensive work on opportunistic networks, predominance of video and other content calls for new content-centric approaches and revisiting opportunistic networks with this new perspective. In this talk, we overview the key factors affecting the search performance, provide insights on optimal search schemes by the help of elementary models, and show the effect of the search scope, i.e., hop count, on the search performance by analyzing human contact traces. Lastly, as the optimal strategy depends (among other things) on the content availability, we introduce several schemes for content availability estimation and discuss their performance.

Bio: Suzan Bayhan is a post-doctoral researcher at the University of Helsinki, Finland. Her research interests include mobile opportunistic networks, cognitive radio, and information-centric networks. She holds a Ph.D. in Computer Engineering from Bogazici University, Turkey in 2012. She received EMEA Google Anita Borg Memorial Scholarship in 2009.

This talk is part of the Computer Laboratory Systems Research Group Seminar 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