Publication

The Driving Philosophers

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.

Low-complexity Algorithms for Energy Efficient Broadcasting in Wireless Networks

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

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 netwo ...

2008

Extending Paxos/LastVoting with an Adequate Communication Layer for Wireless Ad Hoc Networks

André Schiper, Fatemeh Borran

Most papers addressing consensus in wireless ad hoc networks adopt system models similar to those developed for wired networks. These models are focused towards node failures while ignoring link failures, and thus are poorly suited for wireless ad hoc netw ...

IEEE2008

On broadcast and agreement in mobile ad hoc networks

Yoav Sasson

This thesis studies communication and agreement protocols in wireless ad hoc networks from both theoretical and practical perspectives. The last decade has given rise to the rapid growth of wireless telecommunications such as cellular mobile phone networks ...

EPFL2007

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

Mobility in wireless networks: friend or foe

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

Managing Heterogeneous Wireless Environments via Hotspot Servers

Giovanni De Micheli

Wireless communication today supports heterogeneous wireless devices with a number of different wireless network interfaces (WNICs). A large fraction of communication is infrastructure based, so the wireless access points and hotspot servers have become mo ...

2005

Information-Theoretic Upper Bounds on the Capacity of Large Extended Ad Hoc Wireless Networks

Emre Telatar, Olivier Lévêque

We derive an information-theoretic upper bound on the rate per communication pair in a large ad hoc wireless network. We show that under minimal conditions on the attenuation due to the environment and for networks with a constant density of users, this ra ...

2005

Joint rate and power control algorithms for wireless networks

Ali H. Sayed

There is a fundamental tradeoff between power consumption, data transmission rates, and congestion levels in a wireless network. These three elements influence the performance of rate and power control strategies, and they need to be coordinated judiciousl ...

IEEE2005

The Driving Philosophers

Rachid Guerraoui, Bastian Pochon

We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a round-about (set of shared resources organized along a logical ring). The crux ...

2004