SHORT PAPER: GGRA: AGROUPED GOSSIP BASED REPUTATION AGGREGATION ALGORITHM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

GHASEMI FALAVARJANI SAFIEH; TORK LADANI BEHROUZ; GHASEMI SIMIN

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY Year:2015 | Volume:7 | Issue:1 Page(s): 0-0

Download Full-Text

View:

323

Download:

198

Cites:

Information Journal Paper

Title

SHORT PAPER: GGRA: AGROUPED GOSSIP BASED REPUTATION AGGREGATION ALGORITHM

Author(s)

GHASEMI FALAVARJANI SAFIEH | TORK LADANI BEHROUZ | GHASEMI SIMIN | Issue Writer Certificate

Keywords

CLOCK TREE CONSTRUCTION

HARDWARE

SECURITY

REGISTER PLACEMENT

Abstract

An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behaviour, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. GossipTrust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on the concept of gossip. Despite its important contribution, this algorithm has deficiencies especially with high number of nodes that leads to high execution time and low accuracy in the results. In this paper, a grouped Gossip based Reputation Aggregation (GGRA) algorithm is proposed. In GGRA, GossipTrust is executed in each group between group members and between groups instead of executing in the whole network. Due to the reduction in the number of nodes and using strongly connected graph instead of a weakly one, gossip algorithm in GGRA is executed quickly. With grouping, not only reputation aggregation is expected to be more scalable, but also because of the decrement in the number of errors of the gossiped communication, the results get more accurate. The evaluation of the proposed algorithm and its comparison with GossipTrust confirms the expected results.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

GHASEMI FALAVARJANI, SAFIEH, TORK LADANI, BEHROUZ, & GHASEMI, SIMIN. (2015). SHORT PAPER: GGRA: AGROUPED GOSSIP BASED REPUTATION AGGREGATION ALGORITHM. THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 7(1), 0-0. SID. https://sid.ir/paper/657972/en

Vancouver: Copy

GHASEMI FALAVARJANI SAFIEH, TORK LADANI BEHROUZ, GHASEMI SIMIN. SHORT PAPER: GGRA: AGROUPED GOSSIP BASED REPUTATION AGGREGATION ALGORITHM. THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY[Internet]. 2015;7(1):0-0. Available from: https://sid.ir/paper/657972/en

IEEE: Copy

SAFIEH GHASEMI FALAVARJANI, BEHROUZ TORK LADANI, and SIMIN GHASEMI, “SHORT PAPER: GGRA: AGROUPED GOSSIP BASED REPUTATION AGGREGATION ALGORITHM,” THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, vol. 7, no. 1, pp. 0–0, 2015, [Online]. Available: https://sid.ir/paper/657972/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops