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.

Reputation system for User Generated wireless podcasting

Jean-Yves Le Boudec

The user-generated podcasting service over mobile opportunistic networks can facilitate the user generated content dissemination while humans are on the move. However, in such a distributed and dynamic network environment, the design of efficient content f ...

2008

Secure incentives to cooperate for wireless networks

The operating principle of certain wireless networks makes essential the cooperation between the mobile nodes. However, if each node is an autonomous selfish entity, cooperation is not guaranteed and therefore we need to use incentive techniques. In this t ...

EPFL2007

On broadcast and agreement in mobile ad hoc networks

Yoav Sasson

This thesis studies communication and agreement protocols in wireless ad hoc networks from both theoretical and practical perspectives. The last decade has given rise to the rapid growth of wireless telecommunications such as cellular mobile phone networks ...

EPFL2007

Securing Wireless Mesh Networks

Jean-Pierre Hubaux, Naouel Ben Salem

Using wireless mesh networks to offer Internet connectivity is becoming a popular choice for wireless Internet service providers as it allows fast, easy, and inexpensive network deployment. However, security in WMNs is still in its infancy as very little a ...

2006

Secure Ad Hoc Networking

Panagiotis Papadimitratos

The ad hoc networking technology can enable novel civilian and military applications. However, ad hoc networking protocols are vulnerable to a wide range of attacks. The design of defense mechanisms is a challenging problem, especially in comparison to sec ...

2006

The Complex Facets of Reputation and Trust

Karl Aberer, Wojciech Galuba, Zoran Despotovic

Trust and reputation systems have proven to be essential to enforcing cooperative behavior in peer-to-peer networks. We briefly describe the current approaches to building reputation systems: social networks formation, probabilistic estimation and game the ...

Springer2006

Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars

Jean-Yves Le Boudec, Jochen Mundinger

The application of decentralized reputation systems is a promising approach to ensure cooperation and fairness, as well as to address random failures and malicious attacks in Mobile Ad-Hoc Networks. However, they are potentially vulnerable to liars. With o ...

2006

Distributed Reputation Systems for Internet-based Peer-to-Peer Systems and Mobile Ad-Hoc Networks

Jean-Yves Le Boudec, Jochen Mundinger, Sonja Buchegger

Reputation systems are widely and successfully used in centralized scenarios. Will they work equally well, however, in decentralized scenarios such as Internet-based peer-to-peer systems and mobile ad hoc networks? ...

2005

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 Reputation System for Mobile Ad-Hoc Networks with Liars

Jean-Yves Le Boudec, Jochen Mundinger

Using decentralized reputation systems is a promising approach to ensuring cooperation and fairness in Mobile Ad-Hoc Networks. However, they are vulnerable to liars and robustness has not been analyzed in detail. With our work, we provide a first step to t ...

2005