Unité

Laboratoire de la dynamique de l'information et des réseaux 1

Laboratoire

Publications associées (11)

Dynamic Routing for Flying Ad Hoc Networks

Dario Floreano, Bixio Rimoldi, Grégoire Hilaire Marie Heitz, Stefano Rosati

This paper reports experimental results on self-organizing wireless networks carried by small flying robots. Flying ad hoc networks (FANETs) composed of small unmanned aerial vehicles (UAVs) are flexible, inexpensive and fast to deploy. This makes them a v ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Hierarchical Routing Over Dynamic Wireless Networks

Suhas Diggavi, Matthias Grossglauser

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

Implementation of a Wireless Mesh Network of Ultra Light MAVs with Dynamic Routing

Dario Floreano, Bixio Rimoldi, Jean-Christophe Zufferey, Alberto Jimenez Pacheco, Denia Bouhired

This paper describes the implementation and characterisation of a mobile ad-hoc network (MANET) of ultra-light intelligent flying robots. The flying nature of the network makes it suitable to collect or disseminate content in urban areas or challenging ter ...

2012

Signaling and Reciprocity : Robust Decentralized Information Flows in Social, Communication, and Computer Networks

Wojciech Galuba

Complex networks exist for a number of purposes. The neural, metabolic and food networks ensure our survival, while the social, economic, transportation and communication networks allow us to prosper. Independently of the purposes and particularities of th ...

EPFL2011

Neighbor discovery with reception status feedback to transmitters

Ramin Khalili

Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighbors. In this paper we study the problem of neighbor discovery in a static and s ...

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

Routing and search on large scale networks

In this thesis, we address two seemingly unrelated problems, namely routing in large wireless ad hoc networks and comparison based search in image databases. However, the underlying problem is in essence similar and we can use the same strategy to attack t ...

EPFL2010

Efficient Broadcasting Using Network Coding

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless net- ...

2008

Secure incentives to cooperate for wireless networks

Naouel Ben Salem

The operating principle of certain wireless networks makes essential the cooperation between the mobile nodes. However, if each node is an autonomous selfish entity, cooperation is not guaranteed and therefore we need to use incentive techniques. In this t ...

EPFL2007

Mobility in wireless networks: friend or foe : network design and control in the age of mobile computing

Jun Luo

Wireless networking technologies allow computing devices to move while keeping them online, but the device mobility poses considerable technical challenges. Network designers, on the one hand, consider mobility to be harmful because it leads to dynamic and ...

EPFL2006

A cross-layer design of wireless ad-hoc networks

Bozidar Radunovic

We consider a cross-layer design of wireless ad-hoc networks. Traditional networking approaches optimize separately each of the three layers: physical layer, medium access and routing. This may lead to largely suboptimal network designs. In this work, we p ...

EPFL2005

A Location Based Routing Method for Mobile Ad Hoc Networks

Jean-Yves Le Boudec, Silvia Giordano Cremonese, Ljubica Blazevic

Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad-hoc networks. However, location based routing is difficult when there are holes in the network topology and nodes are mobile or frequently dis ...

2005

Graph Chat

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.