|
Descripción
|
|
|---|---|
| This work proposes a model to manage votes in a distributed network. Each node votes for one of the alternatives. The vote is shared with the neighbors, and the process repeats until it converges and all the nodes have the final result. If all nodes behave properly, all nodes know the final result for the voting. Nevertheless, cheating nodes may exist that manipulates the votes. The proposal includes a mechanism to detects when one or several nodes cheat during the diffusion process and to correct the obtained values. | |
|
Internacional
|
Si |
|
Nombre congreso
|
The 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2018) [http://asonam.cpsc.ucalgary.ca/2018/] |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
Barcelona (Spain) |
|
Revisores
|
Si |
|
ISBN o ISSN
|
978-1-5386-6051-5 |
|
DOI
|
10.1109/ASONAM.2018.8508703 |
|
Fecha inicio congreso
|
28/08/2018 |
|
Fecha fin congreso
|
31/08/2018 |
|
Desde la página
|
759 |
|
Hasta la página
|
762 |
|
Título de las actas
|
2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) [https://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8488381] |