Publication

Reputation in Self-Organized Communication Systems and Beyond (Invited Paper)

Publications associées (36)

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

Self-Policing Mobile Ad-Hoc Networks by Reputation

Jean-Yves Le Boudec, Sonja Buchegger

Node misbehavior due to selfish or malicious reasons or faulty nodes can significantly degrade the performance of mobile ad-hoc networks. To cope with misbehavior in such self-organized networks, nodes need to be able to automatically adapt their strategy ...

2005

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

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

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

On Network Correlated Data Gathering

Martin Vetterli, Razvan Cristescu

We consider the problem of correlated data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. Two c ...

2004

Efficient decentralized communications in sensor networks

Razvan Cristescu

This thesis is concerned with problems in decentralized communication in large networks. Namely, we address the problems of joint rate allocation and transmission of data sources measured at nodes, and of controlling the multiple access of sources to a sha ...

EPFL2004

A lower bound to the scaling behavior of sensor networks

Martin Vetterli, Michael Christoph Gastpar

For a class of sensor networks, the task is to monitor an underlying physical phenomenon over space and time through a noisy observation process. The sensors can communicate back to a data collector over a noisy channel. The key parameters in such a se ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2004

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

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