Enhanced Reputation Mechanism for Mobile Ad Hoc Networks

Liu, Jinshan; Issarny, Valérie

doi:10.1007/978-3-540-24747-0_5

Cited by 140 publications

(108 citation statements)

References 16 publications

Supporting

Mentioning

105

Contrasting

Unclassified

Order By: Relevance

“…The black color correspond to a mass equal to 0 representing fake nodes. The malicious node 3 will try to convince other nodes that the fake nodes (7,8,9) are true nodes. The fake nodes have the same opinion as the malicious node.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Distributed Data Fusion for Detecting Sybil Attacks in VANETs

Zoghby

Cherfaoui

Ducourthial

et al. 2012

Advances in Intelligent and Soft Computing

View full text Add to dashboard Cite

show abstract

Section: Resultsmentioning

confidence: 99%

“…Different research papers have been dedicated to find a solution to these problems. Many recent works deal with reputation mechanisms ( [20], [1], [9]) and trust evaluation ( [16], [17]) to manage the confidence in the source of information. Others were interested in data aggregation without taking into account the source [2] [3][10] [13].…”

Section: Introductionmentioning

confidence: 99%

Distributed Data Fusion for Detecting Sybil Attacks in VANETs

Zoghby

Cherfaoui

Ducourthial

et al. 2012

Advances in Intelligent and Soft Computing

View full text Add to dashboard Cite

show abstract

“…We first explain the concept of reputation before discussing the reputationbased strategies: "Reputation of an agent is a perception regarding its behavior norms, which is held by other agents, based on experiences and observation of its past actions" [35]. In the scope of investigating selfish behavior, the reputation value of a node indicates other nodes' perception about the cooperation of the node.…”

Section: Reputation-based Strategiesmentioning

confidence: 99%

An investigation on the unwillingness of nodes to participate in mobile delay tolerant network routing

Miao¹,

Hasan²,

Mokhtar³

et al. 2013

International Journal of Information Management

View full text Add to dashboard Cite

Message routing in mobile delay tolerant networks inherently relies on the cooperation between nodes. In most existing routing protocols, the participation of nodes in the routing process is taken as granted. However, in reality, nodes can be unwilling to participate. We first show in this paper the impact of the unwillingness of nodes to participate in existing routing protocols through a set of experiments. Results show that in the presence of even a small proportion of nodes that do not forward messages, performance is heavily degraded. We then analyze two major reasons of the unwillingness of nodes to participate, i.e., their rational behavior (also called selfishness) and their wariness of disclosing private mobility information.Our main contribution in this paper is to survey the existing related research works that overcome these two issues. We provide a classification of the existing approaches for protocols that deal with selfish behavior. We then conduct experiments to compare the performance of these strategies for preventing different types of selfish behavior. For protocols that preserve the privacy of users, we classify the existing approaches and provide an analytical comparison of their security guarantees.

show abstract

“…An entity can change its behavior over time, making old experiences become irrelevant for the actual reputation evaluation [9,15]. This calls for discount of past, which gives more weight to recent experiences than old ones.…”

Section: Reputation Evolutionmentioning

confidence: 99%

An incentive compatible reputation mechanism for ubiquitous computing environments

n¹,

Issarny

2007

Int. J. Inf. Secur.

Self Cite

View full text Add to dashboard Cite

The vision of ubiquitous computing is becoming a reality thanks to the advent of portable devices and the advances in wireless networking technologies. It aims to facilitate user tasks through seamless utilization of services available in the surrounding environments. In such distributed environments featuring openness, interactions, especially service provision and consumption, between entities that are unknown or barely known to each other, are commonplace. Trust management through reputation mechanism to facilitate such interactions is recognized as an important element of ubiquitous computing. It is, however, faced by the problems of how to stimulate reputation information sharing and honest recommendation elicitation. We present in this paper an incentive compatible reputation mechanism to facilitate the trustworthiness evaluation in ubiquitous computing environments. It is based on probability theory and supports reputation evolution and propagation. Our reputation mechanism not only shows robustness against lies, but also stimulates honest and active recommendations. The latter is realized by ensuring that active and honest recommenders, compared to inactive or dishonest ones, can elicit the most honest (helpful) recommendations and thus suffer the least number of wrong trust decisions, as validated by simulation based evaluation.

show abstract

Enhanced Reputation Mechanism for Mobile Ad Hoc Networks

Cited by 140 publications

References 16 publications

Distributed Data Fusion for Detecting Sybil Attacks in VANETs

Distributed Data Fusion for Detecting Sybil Attacks in VANETs

An investigation on the unwillingness of nodes to participate in mobile delay tolerant network routing

An incentive compatible reputation mechanism for ubiquitous computing environments

Contact Info

Product

Resources

About