Name
Abstract | ||
|---|---|---|
The shifting of computation and storage towards distributed, embedded and mobile systems encompasses several advantages, as the increasing in performance, scalability, and reduction of costs. A significant drawback though is the potential lack in security and trust, due to a huge number of different, dispersed devices. In such a context, trust-based networks allow to rank nodes (e. g. devices) so that only the best are chosen to store and manipulate users personal data. However, the study of rank assessment and how a node can improve its value may become a hard task, expecially for large networks. Therefore, in this work we propose a heuristic based on statistical considerations that allows a node to achieve a good rank via a proper selection of trust links with other nodes, preserving both the effectiveness and the efficiency. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-319-01571-2_9 | Studies in Computational Intelligence |
Field | DocType | Volume |
Drawback,Heuristic,Large networks,Computer science,Theoretical computer science,Computation,Scalability | Conference | 511 |
ISSN | Citations | PageRank |
1860-949X | 2 | 0.40 |
References | Authors | |
13 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vincenza Carchiolo | 1 | 261 | 51.62 |
| Alessandro Longheu | 2 | 142 | 29.98 |
| Michele Malgeri | 3 | 219 | 42.79 |
| Giuseppe Mangioni | 4 | 199 | 37.16 |