Publication

Coping With Misbehavior in Mobile Ad-hoc Networks

Publications associées (52)

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

On the Throughput of Ad-Hoc Networks using Connectivity Graphs

Christina Fragouli

In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair ...

2004

Analysis of a Robust Reputation System for Self-Organized Networks

Jean-Yves Le Boudec

Self-organized networks require some mechanism to ensure cooperation and fairness in the face of individual utility maximizing users and potential malicious attacks. Otherwise, network performance can be seriously deteriorated. One promising approach are d ...

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

Possibilities for Managing Trust in P2P Networks

Karl Aberer, Zoran Despotovic

Reputation systems offer a viable solution to the old problem of encouraging trustworthy behavior in online communities. Their key presumptions are that the participants of an online community engage in repeated interactions and that the information about ...

2004

Fuelling WiFi deployment: A reputation-based solution

Jean-Pierre Hubaux, Naouel Ben Salem

The rapid growth of WiFi over the past two years reveals the willingness of the Wireless Internet Service Providers (WISPs) to develop this technology and the interest of the users in this new service. However, the lack of unified roaming slows down the de ...

2004

Coping with False Accusations in Misbehavior Reputation Systems for Mobile Ad-hoc Networks

Jean-Yves Le Boudec, Sonja Buchegger

Some misbehavior detection and reputation systems in mobile ad-hoc networks rely on the dissemination of information of observed behavior, which makes them vulnerable to false accusations. This vulnerability could be removed by forbidding the dissemination ...

2003

A Robust Reputation System for Mobile Ad-hoc Networks

Jean-Yves Le Boudec, Sonja Buchegger

Reputation systems in mobile ad-hoc networks can be tricked by the spreading of false reputation ratings, be it false accusations or false praise. Simple solutions such as exclusively relying on one`s own direct observations have drawbacks, as they do not ...

2003

A Robust Reputation System for Mobile Ad-hoc Networks

Jean-Yves Le Boudec, Sonja Buchegger

Reputation systems in mobile ad-hoc networks can be tricked by the spreading of false reputation ratings, be it false accusations or false praise. Simple solutions such as exclusively relying on one's own direct observations have drawbacks, as they do not ...

2003

The Effect of Rumor Spreading in Reputation Systems for Mobile Ad-hoc Networks

Jean-Yves Le Boudec, Sonja Buchegger

Mobile ad-hoc networks rely on the cooperation of nodes for routing and forwarding. For individual nodes there are however several advantages resulting from noncooperation, the most obvious being power saving. Nodes that act selfishly or even maliciously p ...

2003

Scalable routing protocols with applications to mobility

Ljubica Blazevic

In this thesis we study two routing problems related to mobility. The first problem concerns scalable multicast routing when there is a large number of multicast groups with a small number of receivers. Existing dense and sparse mode routing protocols have ...

EPFL2002