Constrained Network Routing Protocols

Routing protocol is a key component in the network protocol suite. It specifies how routers communicate with each other to explore routes between two nodes, so that they can exchange information between each other.

Lots of routing protocols exist already for wired network, such as OSPF (Open Shortest Path First) and BGP (Border Gateway Protocol). They are built based on the assumption that the links are relatively stable and the routers have enough resources (CPU up to several GHz, memory up to several GB) to process topology information of the network.

However, when the network is extending to “everything” in our life, rather than powerful smart phones and laptops, we have to build network with much more resource constrained devices: for example, electrical meters that only have several MHz of processing power and  10 KB of memory. Furthermore, the links connecting those devices are normally fragile and with low data rate, which makes routing even more challenging.

This topic aims at developing and studying routing protocols for such constrained networks, which includes:

  • Designing protocols for more scalable sensor networks
  • Proposing new methods to improve Quality of Service of networks
  • Developing prototypes of routing protocols
  • Performance analyses and evaluation of routing protocols.

This topic can accommodate:

  • Student projects (“PSC”, “Projet 3A”, etc.)
  • Undergraduate development & engineering internships (apply).
  • Graduate research internships (apply).
    (e.g., “Stage de Recherche 3A” for Polytechnique students)
  • End-of-study internships (apply).
    (e.g., “Stage 4A” for Polytechnique students)
  • Graduate engineering internships (apply).
  • Pre-PhD internships (apply).
  • Postdoctoral fellowships.