Architecture and algorithms for a distributed reputation system
iTrust'03 Proceedings of the 1st international conference on Trust management
Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Tailored trustworthiness estimations in Peer-to-Peer networks
International Journal of Internet Technology and Secured Transactions
An unsupervised learning paradigm for peer-to-peer labeling and naming of locations and contexts
LoCA'06 Proceedings of the Second international conference on Location- and Context-Awareness
| Hi-index | 0.00 |
New networks based on short-range radio are emerging where mobile devices interact in a spontaneous and short-lived fashion. Such pervasive networks involve devices approaching and finding each other, interacting to exchange some information or use some shared service, before disconnecting and leaving radio range. As such, they involve lots of potentially risky interactions with strangers. Due to the lack of any infrastructure in these networks, using a distributed recommendation system to improve security is an attractive option. This paper describes a simulation of a simple distributed recommendation system running in such a network. These networks can be modeled as social networks and the simulation builds on an existing algorithm that has been shown to model social networks accurately. The results of the simulation suggest that with a relatively small overhead, the trust information can move effectively in such networks and the system can deliver a substantial decrease in the level of risk these spontaneous interactions involve.