Concept

Link-state routing protocol

Related publications (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Space lower bounds for low-stretch greedy embeddings

Christos Kalaitzis

Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...

Elsevier Science Bv2016

Age of Information: The Gamma Awakening

Elie Najm, Rajai Nasser

Status update systems is an emerging field of study that is gaining interest in the information theory community. We consider a scenario where a monitor is interested in being up to date with respect to the status of some system which is not directly acces ...

2016

On the Complexity of Scheduling in Half-Duplex Diamond Networks

Christina Fragouli, Ayfer Özgür Aydin, Siddhartha Brahma

We consider an n-relay Gaussian diamond network where a source communicates to a destination with the help of n half-duplex relays. Achieving rates close to the capacity of this network requires to employ all the n relays under an optimal transmit/receive ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Hierarchical Routing Over Dynamic Wireless Networks

Matthias Grossglauser, Suhas Diggavi, Dominique Florian Tschopp

The topology of a mobile wireless network changes over time. Maintaining routes between all nodes requires the continuous transmission of control information, which consumes precious power and bandwidth resources. Many routing protocols have been developed ...

Wiley-Blackwell2015

A Study on Buffer Distribution for RRAM-based FPGA Routing Structures

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Xifan Tang, Somayyeh Rahimian Omam

Compared to Application-Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) provide reconfigurablity at the cost of lower performance and higher power consumption. Exploiting a large number of programmable switche ...

IEEE2015

Wireless Network Simplification: The Gaussian N-Relay Diamond Network

Christina Fragouli

We consider the Gaussian N-relay diamond network, where a source wants to communicate to destination node through a layer of N-relay nodes. We investigate the following question: what fraction of the capacity can we maintain using only k out of the N avail ...

Institute of Electrical and Electronics Engineers2014

Measuring and Controlling Energy Consumption of Sensor networks

Bin Lu

A wireless sensor network (WSN) is built of two types of nodes: regular sensor nodes and base stations. The regular sensor nodes monitor physical or environmental conditions, such as temperature, sound, pressure, etc. and cooperatively pass their data thro ...

2014

Stable Routing And Unique-Max Coloring On Trees

Laura Sanità, Rico Zenklusen

Some of the routing protocols used in telecommunication networks route traffic on a shortest path tree according to configurable integral link weights. One crucial issue for network operators is finding a weight function that ensures a stable routing: when ...

Siam Publications2013

Speed-Aware Routing for UAV Ad-Hoc Networks

Bixio Rimoldi, Stefano Rosati, Karol Jacek Kruzelecki, Louis François Traynard

In this paper we examine mobile ad-hoc networks (MANET) composed by unmanned aerial vehicles (UAVs). Due to the high-mobility of the nodes, these networks are very dynamic and the existing routing protocols partly fail to provide a reliable communication.W ...

2013

UC and EUC Weak Bit-Commitments Using Seal-Once Tamper-Evidence

Serge Vaudenay

Based on tamper-evident devices, i.e., a type of distinguishable, sealed envelopes, we put forward weak bit-commitment protocols which are UC-secure. These commitments are weak in that it is legitimate that a party could cheat. Unlike in several similar li ...

2013