Publication

Mobility in wireless networks: friend or foe

Publications associées (220)

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

SOWER: Self-Organizing Wireless Network for Messaging

Jean-Pierre Hubaux, Mark Felegyhazi, Srdan Capkun

Short Message Service (SMS) has become extremely popular in many countries, and represents a multi-billion dollars market. Yet many consumers consider that the price cellular network operators charge for it is too high. In this paper, we explain that there ...

2004

Autonomous Gossiping: A self-organizing epidemic algorithm for selective information dissemination in mobile ad-hoc networks

Karl Aberer, Anwitaman Datta

We introduce autonomous gossiping (A/G), a new genre epidemic algorithm for selective dissemination of information in contrast to previous usage of epidemic algorithms which flood the whole network. A/G is a paradigm which suits well in a mobile ad-hoc net ...

2004

Poster: Contention-based distance-vector routing for mobile ad-hoc networks

Jörg Widmer

Position-based routing protocols forward packets in a greedy manner from source to destination without having to maintain routes through the network. Contention-based routing strategies improve upon position-based routing in that they do not even require t ...

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

Coping with misbehavior in mobile ad-hoc networks

Sonja Buchegger

In this work, we address the question of how to enable a system to operate despite the presence of misbehavior. Specifically, in a mobile ad-hoc network, how can we keep the network functional for normal nodes when other nodes do not route and forward corr ...

EPFL2004

Coping With Misbehavior in Mobile Ad-hoc Networks

Sonja Buchegger

CRC Press2004

PILOT: ProbabilistIc Lightweight grOup communication sysTem for Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

Providing reliable group communication is an ever recurring issue in distributed settings. In mobile ad hoc networks, this issue becomes more significant since all nodes act as peers, while the issue gets even more challenging due to highly dynamic and unp ...

2004

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

Denial of Service Resilience in Ad Hoc Networks

Jean-Pierre Hubaux, Imad Aad

Significant progress has been made towards making ad hoc networks secure and DoS resilient. However, little attention has been focused on quantifying DoS resilience: Do ad hoc networks have sufficiently redundant paths and counter-DoS mechanisms to make Do ...

2004

Self-Policing Mobile Ad-hoc Networks

Jean-Yves Le Boudec, Sonja Buchegger

Misbehavior in mobile ad-hoc networks occurs for several reasons. Selfish nodes misbehave to save power or to improve their access to service relative to others. Malicious intentions result in misbehavior as exemplified by denial of service attacks. Faulty ...

CRC Press2004