Publication

Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks

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.

Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks

Jean-Pierre Hubaux, Mark Felegyhazi, Levente Buttyan

In self-organizing ad hoc networks, all the networking functions rely on the contribution of the participants. As a basic example, nodes have to forward packets for each other in order to enable multi-hop communication. In recent years, incentive mechanism ...

2006

Anypath routing

Henri Julien Dubois-Ferrière

In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. A well-known instance is with unreliable wireless links, where the probability that at least one node out ofnreceives a packet increas ...

EPFL2006

Node Cooperation in Hybrid Ad hoc Networks

Jean-Pierre Hubaux, Naouel Ben Salem, Levente Buttyan

A hybrid ad hoc network is a structure-based network that is extended using multi-hop communications. Indeed, in this kind of network, the existence of a communication link between the mobile station and the base station is not required: A mobile station t ...

2006

Impacts of Channel Variability on Link-Level Throughput in Wireless Networks

Patrick Thiran, Emre Telatar

We study analytically and experimentally the throughput of the packetized time-varying discrete erasure channel with feedback, which closely captures the behavior of many practical physical layers. We observe that the channel variability at different time ...

2006

Network coding for efficient communication in extreme networks

Jean-Yves Le Boudec, Jörg Widmer

Some forms of ad-hoc networks need to operate in extremely performance- challenged environments where end-to-end connectivity is rare. Such environments can be found for example in very sparse mobile networks where nodes ”meet” only occasionally and are ab ...

2005

Base Stations in Mobile Ad-Hoc Networks

Thomas Lochmatter

Multi-hop ad-hoc networks consist of nodes which cooperate by forwarding packets for each other to allow communication beyond the power range of each node. In pure ad-hoc networks, no additional infrastructure is required to allow the nodes to communicate. ...

2004

Joint Synchronization, Routing and Energy Saving in Multi-hop Hybrid Networks

Jean-Pierre Hubaux, Dan Jurca

Multi-hop hybrid networks can help providing both high bandwidth and broad coverage for wireless data networks. We focus on CSMA/CA-based networks and take IEEE 802.11 as a concrete example. We show that the three fundamental operations of synchronization, ...

2004

Scalable position-based multicast for mobile ad-hoc networks

Jörg Widmer

In this paper we present Scalable Position-Based Multicast (SPBM), a multicast routing protocol for ad-hoc networks. SPBM uses the geographic position of nodes to provide a highly scalable group membership scheme and to forward data packets with a very low ...

2004

Joint Synchronization, Routing and Energy Saving in CSMA/CA Multi-Hop Hybrid Networks

Jean-Pierre Hubaux, Dan Jurca

2004

Last Encounter Routing under Random Waypoint Mobility

Matthias Grossglauser, Natasa Sarafijanovic-Djukic

Last Encounter Routing (LER) algorithms for mobile ad hoc networks rely only on encounter histories at every node to route packets, and therefore do not need control traffic to track topology changes due to node mobility. LER exploits the fact that past in ...

2004