Publication

Reputation Systems for Self-Organized Networks

Related publications (51)

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.

Analysis of a Robust Reputation System for Self-Organized Networks

Jean-Yves Le Boudec, Jochen Mundinger

Self-organized networks require some mechanism to ensure cooperation and fairness. A promising approach is the use of decentralized reputation systems. However, their vulnerability to liars has not yet been analyzed in detail. In this paper, we provide a r ...

2005

Eliminating Undesired Equilibrium Points from Incentive Compatible Reputation Mechanisms

Boi Faltings, Radu Jurca

Choosing the best out of an increasing number of options requires reliable and accurate information. As our time and resources are limited, we commonly use the experience of others in order to take decisions. Reputation mechanisms aggregate in a formal way ...

Ecole Polytechnique Fédérale de Lausanne (EPFL)2005

Rate Performance Objectives of Multi-hop Wireless Networks

Jean-Yves Le Boudec

We consider the question of what performance metric to maximize when designing adhoc wireless network protocols such as routing or MAC. We focus on maximizing rates under battery lifetime and power constraints. Commonly used metrics are total capacity (in ...

2004

Resource allocation strategies for wireless ad-hoc networks

Ali H. Sayed

In this paper, we propose resource allocation strategies for a class of wireless networks with a clustering protocol. The nodes are assumed stationary and establish connections with the master node according to a priority scheme that relates to their dista ...

2004

Rate Performance Objectives of Multihop Wireless Networks

Jean-Yves Le Boudec

We consider the question of what performance metric to maximize when designing ad hoc wireless network protocols such as routing or MAC. We focus on maximizing rates under battery-lifetime and power constraints. Commonly used metrics are total capacity (in ...

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

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

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

A Robust Reputation System for Peer-to-Peer and Mobile Ad-hoc Networks

Jean-Yves Le Boudec, Sonja Buchegger

Reputation systems can be tricked by the spread 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 make use of all the informati ...

2004