Best paper award

The paper Optimal placement of drones for fast sensor energy replenishment using wireless power transfer [1] won the best paper award at Wireless Days 2019

Congratulation to the authors!

See also: Wireless Days 2019, news on Inria web site

  • C. Caillouet, T. Razafindralambo, and D. Zorbas, “Optimal placement of drones for fast sensor energy replenishment using wireless power transfer,” in WD 2019 – Wireless Days 2019, Manchester, United Kingdom, 2019. doi:10.1109/WD.2019.8734203
    [BibTeX] [Download PDF]
    TITLE = {{Optimal placement of drones for fast sensor energy replenishment using wireless power transfer}},
    AUTHOR = {Caillouet, Christelle and Razafindralambo, Tahiry and Zorbas, Dimitrios},
    URL = {},
    NOTE = {Best Paper Award},
    BOOKTITLE = {{WD 2019 - Wireless Days 2019}},
    ADDRESS = {Manchester, United Kingdom},
    YEAR = {2019},
    MONTH = Apr,
    DOI = {10.1109/WD.2019.8734203},
    PDF = {},
    HAL_ID = {hal-02043123},
    HAL_VERSION = {v1},

Wilkes Award 2017

The paper Energy Efficient Content Distribution [1] won the Wilkes Award 2017 (The Wilkes Award is given once a year to the authors of the best paper published in the volume of The Computer Journal from the previous year)

Congratulation to the authors!

  • J. Araujo, F. Giroire, J. Moulierac, Y. Liu, and R. Modrzejewski, “Energy Efficient Content Distribution,” The Computer Journal, vol. 59, iss. 2, pp. 192-207, 2016. doi:10.1093/comjnl/bxv095
    [BibTeX] [Download PDF]
    TITLE = {{Energy Efficient Content Distribution}},
    AUTHOR = {Araujo, J and Giroire, Fr{\'e}d{\'e}ric and Moulierac, J and Liu, Yi and Modrzejewski, R},
    URL = {},
    JOURNAL = {{The Computer Journal}},
    PUBLISHER = {{Oxford University Press (UK)}},
    VOLUME = {59},
    NUMBER = {2},
    PAGES = {192-207},
    YEAR = {2016},
    MONTH = Feb,
    DOI = {10.1093/comjnl/bxv095},
    KEYWORDS = {Energy Efficiency ; Integer Linear Programming ; Content Deliv-ery Network ; In-network Caching ; Future Internet},
    PDF = {},
    HAL_ID = {hal-01238051},
    HAL_VERSION = {v1},

Best student paper award

Fatima Zahra Moataz

Fatima Zahra Moataz received the best student paper award of the conference ALGOTEL 2015 for her paper entitled “On Spectrum Assignment in Elastic Optical Tree-Networks“.

  • Title: “On Spectrum Assignment in Elastic Optical Tree-Networks
  • Author: Fatima Zahra Moataz
  • Event: ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, June 2015, Beaune, France.
  • Abstract: To face the explosion of the Internet traffic, a new generation of optical networks is being developed; the Elastic optical Networks (EONs). The aim with EONs is to use the optical spectrum efficiently and flexibly. The benefit of the flexibility is accompanied by more difficulty in the resource allocation problems. In this report, we study the problem of Spectrum Allocation in Elastic Optical Tree-Networks. In trees, even though the routing is fixed, the spectrum allocation is NP-hard. We survey the complexity and approximability results that have been established for the SA in trees and prove new results for stars and binary trees.

  • Keywords: Interval coloring; Optical networks; Routing and Spectrum Assignment; Approximation algorithms.

DRMSim: A Routing-Model Simulator for Large-Scale Networks

DRMSim architecture

by: Aurélien Lancin (COATI) and Dimitri Papadimitriou (Alcatel-Lucent Bell labs)
In ERCIM news 94, pp 31-32, July 2013

The expansion of Internet topology, which comprises thousands of Autonomous Systems (AS), has resulted in a number of important research challenges. The Border Gateway Protocol (BGP), which is used to make core routing decisions on the Internet, starts to show its limitations in terms of the number of routing table entries it can store locally, update in a timely fashion and dynamically exchange. Because it is impractical to deploy newly designed routing protocols on the Internet a large-scale, simulation is an unavoidable step to validate their properties. However, the increasing routing information processing (CPU) and storage (memory) introduces similar challenges for the simulation of state-full routing. For this purpose, we introduce DRMSim a Dynamic Routing Model simulator of routing models on large-scale networks. (read more)