Henri Dubois-Ferrière

Learn More
We propose FResher Encounter SearcH (FRESH), a simple algorithm for efficient route discovery in mobile ad hoc networks. Nodes keep a record of their most recent encounter times with all other nodes. Instead of searching for the destination, the source node searches for any intermediate node that encountered the destination more recently than did the source(More)
We introduce the TinyNode platform for wireless sensor networks. Supporting both research and industrial deployments, the platform offers communication ranges that exceed current platforms by a factor of 3 to 5, while consuming similar energy. It comes with a rich, practical set of hardware extensions and full TinyOS support. We describe the design choices(More)
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 node a group of candidate relays for a particular destination. This paper addresses the least-cost(More)
A driving scenario for sensor networks is environmental monitoring : nodes gather data and send it back to a sink (i. e. , a basestation with an internet connection or persistent storage) via a multi-hop tree topology. In order to form the data-gathering tree , and in order to configure the sensor nodes , the sink periodically disseminates messages into the(More)
In this paper, we present a new routing paradigm that generalizes opportunistic routing for wireless multihop networks. In multirate anypath routing, each node uses both a set of next-hops and a selected transmission rate to reach a destination. Using this rate, a packet is broadcast to the nodes in the set, and one of them forwards the packet on to the(More)
We introduce Space-Time Routing (STR) , a new approach to routing in mobile ad hoc networks. In STR , the age of routing state is considered jointly with the distance to the destination. We give a general description of STR , which can accommodate various temporal (age) and spatial (distance) metrics. Our formulation of STR describes a family of routing(More)
(NCCR-MICS). His main research interests are on distributed information management, P2P computing and semantic interoperability. He has been with u-blox AG, Zu-rich and spent time as a visiting researcher at the Berkeley Wireless Research Center. He is currently working as a senior researcher with Lothar Thiele at the Computer Engineering and Networks Lab(More)
  • 1