Probabilistic packet relaying in wireless mobile ad hoc networks

9Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Seredynski, M., Ignac, T., & Bouvry, P. (2010). Probabilistic packet relaying in wireless mobile ad hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6067 LNCS, pp. 31–40). https://doi.org/10.1007/978-3-642-14390-8_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free