Probabilistic packet relaying in wireless mobile ad hoc networks

Authors:
Marcin Seredynski;Tomasz Ignac;Pascal Bouvry
Affiliations:
University of Luxembourg, Interdisciplinary Centre for Security, Reliability and Trust, Luxembourg, Luxembourg;University of Luxembourg, Faculty of Sciences, Technology and Communication;University of Luxembourg, Faculty of Sciences, Technology and Communication
Venue:
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
Year:
2009

Citing 7
Cited 1

Mitigating routing misbehavior in mobile ad hoc networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Performance analysis of the CONFIDANT protocol

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks

Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
A survey of trust and reputation systems for online service provision

Decision Support Systems
Analysis of distributed packet forwarding trategies in ad hoc networks

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Self-policing mobile ad hoc networks by reputation systems

IEEE Communications Magazine
Free-riding and whitewashing in peer-to-peer systems

IEEE Journal on Selected Areas in Communications

Solving soft security problem in MANETs using an evolutionary approach

SIIS'11 Proceedings of the 2011 international conference on Security and Intelligent Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A wireless mobile ad hoc network consists of a number of devices that form a temporary network that operates without a support of any fixed infrastructure. Its distributed nature, lack of a single authority, and limited battery resources may lead participating devices to be reluctant to packet forwarding, which is a key assumption of such a network. This paper demonstrates how cooperation can be reached by means of a new trust-based probabilistic packet relaying scheme. Its most significant properties are relativity of the evaluation of trust and the use of activity as one of the trust measures. Computational experiments demonstrated that the more selfish nodes were present in the network, the more reasonable was to use strict strategies by the remaining nodes, which in turns led to a good protection of the network from free-riders.