Recherche

Afficher tous les résultats pour

Accueil

Personne

Matthias Grossglauser

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (58)

Nowhere to Hide: Navigating around Privacy in Online Social Networks

Jean-Pierre Hubaux, Matthias Grossglauser, Mathias Jacques Jean-Marc Humbert, Théophile Studer

In this paper, we introduce a navigation privacy attack, where an external adversary attempts to find a target user by exploiting publicly visible attributes of intermediate users. If such an attack is successful, it implies that a user cannot hide simply ...

2013

A Bayesian Method for Matching Two Similar Graphs without Seeds

Matthias Grossglauser, Pedram Pedarsani

Approximate graph matching (AGM) refers to the problem of mapping the vertices of two structurally similar graphs, which has applications in social networks, computer vision, chemistry, and biology. Given its computational cost, AGM has mostly been limited ...

2013

Valuable Detours: Least-Cost Anypath Routing

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

In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. This observation was previously exploited by opportunistic routing protocols by using single-path routing metrics to assign to each no ...

2011

On the Privacy of Anonymized Networks

Matthias Grossglauser, Pedram Pedarsani

The proliferation of online social networks, and the concomitant accumulation of user data, give rise to hotly debated issues of privacy, security, and control. One specific challenge is the sharing or public release of anonymized data without accidentally ...

2011

On Clustering Phenomenon in Mobile Partitioned Networks

Matthias Grossglauser, Natasa Sarafijanovic-Djukic

According to different kinds of connectivity, we can distinguish three types of mobile ad-hoc networks: dense, sparse and clustered networks. This paper is about modeling mobility in clustered networks, where nodes are concentrated into clusters of dense c ...

ACM2008

Trajectory sampling with unreliable reporting

Matthias Grossglauser

We define and evaluate methods to perform robust network monitoring using trajectory sampling in the presence of report loss. The first challenge is to reconstruct an unambiguous set of packet trajectories from the reports on sampled packets received at a ...

2008

Densification Arising from Sampling Fixed Graphs

Matthias Grossglauser, Pedram Pedarsani

During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer networks. A recently observed feature is known as network densification, which ...

ACM2008

Hierarchical Routing over Dynamic Wireless Networks

Dominique Florian Tschopp, Matthias Grossglauser, Suhas Diggavi

2008

Routing in mobile wireless networks

Dominique Florian Tschopp, Matthias Grossglauser, Suhas Diggavi

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

Balanced relay allocation on heterogeneous unstructured overlays

Patrick Thiran, Xuan Hung Nguyen, Matthias Grossglauser

Due to the increased usage of NAT boxes and firewalls, it has become harder for applications to establish direct connections seamlessly among two end-hosts. A recently, adopted proposal to mitigate this problem is to use relay nodes, end-hosts that act as ...

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

TraNS: Realistic Joint Traffic and Network Simulator for VANETs

Jean-Pierre Hubaux, Matthias Grossglauser, Maxime Raya, Ada Lezama Lugo, Panagiotis Papadimitratos

Realistic simulation is a necessary tool for the proper evaluation of newly developed protocols for Vehicular Ad Hoc Networks (VANETs). Several recent efforts focus on achieving this goal. Yet, to this date, none of the proposed solutions fulfill all the r ...

2008

Robust Geo-Routing on Embeddings of Dynamic Wireless Networks

Dominique Florian Tschopp, Matthias Grossglauser, Suhas Diggavi, 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

Locating Mobile Nodes with EASE: Learning Efficient Routes from Encounter Histories Alone

Martin Vetterli, Matthias Grossglauser

Routing in large-scale mobile ad hoc networks is challenging because all the nodes are potentially moving. Geographic routing can partially alleviate this problem, as nodes can make local routing decisions based solely on the destinations' geographic coord ...

2006

Constrained Tracking on a Road Network

Matthias Grossglauser

Many applications of wireless ad hoc sensor and actuator networks (WSANs) rely on the knowledge of node locations. These are challenging to obtain when nodes are mobile and are not equipped with any expensive positioning hardware. In this paper, we are int ...

Springer Berlin / Heidelberg2006

On information transmission over a finite buffer channel

Matthias Grossglauser, Suhas Diggavi

2006

Island Hopping: Efficient Mobility-Assisted Forwarding in Partitioned Networks

Matthias Grossglauser, Natasa Sarafijanovic-Djukic

Mobile wireless ad hoc and sensor networks can be permanently partitioned in many interesting scenarios. This implies that instantaneous end-to-end routes do not exist. Nevertheless, when nodes are mobile, it is possible to forward messages to their destin ...

2006

MobiRoute: Routing towards a Mobile Sink for Improving Lifetime in Sensor Networks

Jean-Pierre Hubaux, Jacques Panchard, Jun Luo, Matthias Grossglauser

Improving network lifetime is an important issue involved in every aspect of the design and deployment of wireless sensor networks. There is a recent research trend of studying the application of a mobile sink to transport (rather than let the sensor nodes ...

2006

One-dimensional mobility increases capacity ofwireless adhoc networks

Matthias Grossglauser, Suhas Diggavi

2005

Page 3 sur 3