Publications related to lnformation and Network Dynamics Laboratory 1

Routing in large-scale buses ad hoc networks

A Disruption-Tolerant Network (DTN) attempts to route packets between nodes that are temporarily connected. Difficulty in such networks is that nodes have no information about the network status and contact opportunities. The situation is different in publ ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings

Matthias Grossglauser, Suhas Diggavi, Dominique Florian Tschopp, Jörg Widmer

Routing packets is a central function of multi-hop wireless networks. Traditionally, there have been two paradigms for routing, either based on the geographical coordinates of the nodes (geographic routing), or based on the connectivity graph (topology-bas ...

2007

Variations of coloring problems related to scheduling and discrete tomography

Bernard Ries

The graph coloring problem is one of the most famous problems in graph theory and has a large range of applications. It consists in coloring the vertices of an undirected graph with a given number of colors such that two adjacent vertices get different col ...

EPFL2007

Hierarchical Routing over Dynamic Wireless Networks

Matthias Grossglauser, Suhas Diggavi, Dominique Florian Tschopp

Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of consuming throughput available for data transmission, which is a precious res ...

2007

Least-Cost Opportunistic Routing

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

In opportunistic routing, each node maintains a group of candidate next-hops to reach a particular destination, and transmits packets to any node in this group. The choice of candidate next-hops at each node is a key question that is central to the perform ...

2007

Hierarchical Routing in Dynamic $\alpha$-Doubling Networks

Matthias Grossglauser, Suhas Diggavi, Dominique Florian Tschopp

In this paper we formulate the problem of routing over dynamic networks with finite doubling dimension. This is motivated by communication in mobile wireless networks, where the communication graph topology changes over time, but has some geometric propert ...

2007

Bicolored matchings in some classes of graphs

Dominique de Werra, Bernard Ries

We consider the problem of finding in a graph a set

R

of edges to be colored in red so that there are maximum matchings having some prescribed numbers of red edges. For regular bipartite graphs with

n

nodes on each side, we give sufficient conditions f ...

2007

Least-Cost Opportunistic Routing

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

In opportunistic routing, each node maintains a group of candidate relays to reach a particular destination, and transmits packets to any node in this group. If a single candidate relay receives the packet, it becomes the effective relay to forward the pac ...

2007

Robust Geo-Routing on Embeddings of Dynamic Wireless Networks

Matthias Grossglauser, Suhas Diggavi, Dominique Florian Tschopp, Jörg Widmer

Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This is of particular interest when either absolute coordinates for geographic routing ...

2007

Chain-Based Anonymous Routing for Wireless Ad Hoc Networks

Reza Shokri

Wireless ad hoc networks are so vulnerable to passive attacks and eavesdropping adversaries due to their shared medium which makes network traffic easy to capture and analyze. Therefore, security and privacy protections are of extreme importance for protoc ...

IEEE2007

lnformation and Network Dynamics Laboratory 1

Graph Chatbot

Chat with Graph Search

Routing in large-scale buses ad hoc networks

Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings

Variations of coloring problems related to scheduling and discrete tomography

Hierarchical Routing over Dynamic Wireless Networks

Least-Cost Opportunistic Routing

Hierarchical Routing in Dynamic $\alpha$-Doubling Networks

Bicolored matchings in some classes of graphs

Least-Cost Opportunistic Routing

Robust Geo-Routing on Embeddings of Dynamic Wireless Networks

Chain-Based Anonymous Routing for Wireless Ad Hoc Networks

Variations of coloring problems related to scheduling and discrete tomography

Hierarchical Routing in Dynamic $\alpha$-Doubling Networks

Bicolored matchings in some classes of graphs

Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings

Routing in large-scale buses ad hoc networks

Hierarchical Routing over Dynamic Wireless Networks

Least-Cost Opportunistic Routing

Least-Cost Opportunistic Routing

Chain-Based Anonymous Routing for Wireless Ad Hoc Networks

Robust Geo-Routing on Embeddings of Dynamic Wireless Networks