{"id":7189,"date":"2019-04-04T09:39:31","date_gmt":"2019-04-04T07:39:31","guid":{"rendered":"https:\/\/wp_listic_old.lamp2020.local\/?p=7189"},"modified":"2020-06-10T17:45:44","modified_gmt":"2020-06-10T15:45:44","slug":"seminaire-iryna-andriyanova-vendredi-5-avril-2019-a221-14h00","status":"publish","type":"post","link":"https:\/\/www.univ-smb.fr\/listic\/archive-actualites\/seminaire-iryna-andriyanova-vendredi-5-avril-2019-a221-14h00\/","title":{"rendered":"5 avril 2019 : s\u00e9minaire d&rsquo;Iryna Andriyanova, \u00e0 14h en A221"},"content":{"rendered":"<p>S\u00e9minaire Iryna Andriyanova, directrice du d\u00e9partement info de l\u2019ENSEA de Cergy-Pontoise<\/p>\n<div>\n<div class=\"\" style=\"color: #000000;font-family: arial, helvetica, sans-serif;font-size: 16px;font-style: normal;font-weight: 400;letter-spacing: normal;text-align: start;text-indent: 0px;text-transform: none;background-color: #fdfcfa\">\n<p><span class=\"\" style=\"color: #333333\"><b class=\"\">Distributed storage in mobile wireless networks with Device-to-Device communication: coded caching, placement and repair.<\/b><br class=\"\" \/>In this talk we will focus on distributed storage (DS)\u00a0 for a wireless network where mobile devices arrive and depart according to a Poisson random process. Content is stored in a number of mobile devices, using an erasure correcting code. When requesting a piece of content, a user retrieves the content from the mobile devices using device-to-device communication or, if not possible, from the base station (BS), at the expense of a higher communication cost.<br class=\"\" \/><br class=\"\" \/>Two following aspects will be considered within the aforementioned model:<br class=\"\" \/><br class=\"\" \/><\/span><\/p>\n<ol class=\"\" type=\"1\">\n<li class=\"\">The\u00a0repair problem in a single-cell scenario\u00a0in which the repair process is scheduled periodically with some interval\u00a0<i class=\"\">t<\/i>. We derive analytical expressions for the overall communication cost in the network as a function of the repair interval\u00a0<i class=\"\">t<\/i>\u00a0and show that DS can reduce the overall communication cost with respect to the case where content is only downloaded from the BS, provided that repairs are performed frequently enough.<\/li>\n<li class=\"\">The\u00a0coded caching and placement problem in a multiple-cell scenario\u00a0when the devices move from one cell to another without leaving the geographical area covered by the cells (i..e., no repair is needed). We derive a good approximation of the distribution of caching devices within the communication range of mobile devices at any given time and then we optimize the maximum distance separable (MDS) codes to minimize the network load under a cache size constraint and show that using optimized MDS codes results in significantly lower network load compared to when caching the most popular files. Finally, we give a numerical evidence that caching coded symbols of each file on all mobile devices, i.e., maximal spreading, is optimal.<\/li>\n<\/ol>\n<p><span class=\"\"><br class=\"\" \/>This is a joint work with J. Pedersen, A. Graell i Amat and F. Brannstrom from the Chalmers University of Technology, Sweden.<\/span><\/p>\n<\/div>\n<div class=\"\" style=\"color: #000000;font-family: arial, helvetica, sans-serif;font-size: 16px;font-style: normal;font-weight: 400;letter-spacing: normal;text-align: start;text-indent: 0px;text-transform: none;background-color: #fdfcfa\"><span class=\"\">\u00a0<\/span><\/div>\n<div class=\"\" style=\"color: #000000;font-family: arial, helvetica, sans-serif;font-size: 16px;font-style: normal;font-weight: 400;letter-spacing: normal;text-align: start;text-indent: 0px;text-transform: none;background-color: #fdfcfa\"><span class=\"\">Resume:\u00a0<\/span><\/div>\n<p><span class=\"\" style=\"font-family: arial, helvetica, sans-serif;font-size: 16px;font-style: normal;font-weight: 400;letter-spacing: normal;text-align: start;text-indent: 0px;text-transform: none;background-color: #fdfcfa;color: #333333\"><br class=\"\" \/>Iryna Andriyanova\u00a0(S\u201903\u2013M\u201907) received the M.Sc. degree in Electrical Engineering from the National Polytechnic University of Odessa, Ukraine, in 2002, and the M.Sc. and Ph.D. degrees in communication systems from Telecom ParisTech, Paris, France, in 2003 and 2006, respectively. From 2003 to 2006, she was a Research Engineer with Orange Laboratories, Rennes, France. From 2007 to 2008, she was a Post-Doctoral Research Assistant with the Federal Polytechnic School of Lausanne, Switzerland. In 2009, she joined the ETIS UMR8051 Laboratory, University of Paris-Seine, ENSEA, University of Cergy-Pontoise, CNRS, Cergy-Pontoise, France, where she is currently an Associate Professor and Director of the Department of Computer Sciences. Her research interests include coding theory and techniques, distributed storage, and wireless networks.<\/span><\/p>\n<\/div>\n<div><\/div>\n","protected":false},"excerpt":{"rendered":"<p>S\u00e9minaire Iryna Andriyanova, directrice du d\u00e9partement info de l\u2019ENSEA de Cergy-Pontoise Distributed storage in mobile wireless networks with Device-to-Device communication: coded caching, placement and repair.In this talk we will focus on distributed storage (DS)\u00a0 for [&hellip;]<\/p>\n","protected":false},"author":129,"featured_media":2524,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"_relevanssi_hide_post":"","_relevanssi_hide_content":"","_relevanssi_pin_for_all":"","_relevanssi_pin_keywords":"","_relevanssi_unpin_keywords":"","_relevanssi_related_keywords":"","_relevanssi_related_include_ids":"","_relevanssi_related_exclude_ids":"","_relevanssi_related_no_append":"","_relevanssi_related_not_related":"","_relevanssi_related_posts":"","_relevanssi_noindex_reason":"","_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_hide_featured_image":false,"_jetpack_featured_image_duplicate_dismissed":0,"_jetpack_feature_clip_id":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_post_was_ever_published":false},"categories":[19],"tags":[],"class_list":["post-7189","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-archive-actualites"],"acf":[],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"https:\/\/www.univ-smb.fr\/listic\/wp-content\/uploads\/sites\/66\/2017\/11\/newsseminaire.jpg","_links":{"self":[{"href":"https:\/\/www.univ-smb.fr\/listic\/wp-json\/wp\/v2\/posts\/7189","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.univ-smb.fr\/listic\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.univ-smb.fr\/listic\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.univ-smb.fr\/listic\/wp-json\/wp\/v2\/users\/129"}],"replies":[{"embeddable":true,"href":"https:\/\/www.univ-smb.fr\/listic\/wp-json\/wp\/v2\/comments?post=7189"}],"version-history":[{"count":3,"href":"https:\/\/www.univ-smb.fr\/listic\/wp-json\/wp\/v2\/posts\/7189\/revisions"}],"predecessor-version":[{"id":10693,"href":"https:\/\/www.univ-smb.fr\/listic\/wp-json\/wp\/v2\/posts\/7189\/revisions\/10693"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.univ-smb.fr\/listic\/wp-json\/wp\/v2\/media\/2524"}],"wp:attachment":[{"href":"https:\/\/www.univ-smb.fr\/listic\/wp-json\/wp\/v2\/media?parent=7189"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.univ-smb.fr\/listic\/wp-json\/wp\/v2\/categories?post=7189"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.univ-smb.fr\/listic\/wp-json\/wp\/v2\/tags?post=7189"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}