Trustworthy-based efficient data broadcast model for P2P interaction in resource-constrained wireless environments

  • Authors:

  • Agustinus Borgy Waluyo;David Taniar;Wenny Rahayu;Ailixier Aikebaier;Makoto Takizawa;Bala Srinivasan

  • Affiliations:

  • Clayton School of Information Technology, Monash University, Australia;Clayton School of Information Technology, Monash University, Australia;Department of Computer Science and Computer Engineering, La Trobe University, Australia;Department of Computers and Information Science, Seikei University, Japan;Department of Computers and Information Science, Seikei University, Japan;Clayton School of Information Technology, Monash University, Australia

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a decentralised system like P2P where each individual peers are considerably autonomous, the notion of mutual trust between peers is critical. In addition, when the environment is subject to inherent resource constraints, any efficiency efforts are essentially needed. In light of these two issues, we propose a novel trustworthy-based efficient broadcast scheme in a resource-constrained P2P environment. The trustworthiness is associated with the peer@?s reputation. A peer holds a personalised view of reputation towards other peers in four categories namely SpEed, Correctness, qUality, and Risk-freE (SeCuRE). The value of each category constitutes a fraction of the reliability of individual peer. Another factor that contributes to the reliability of a peer is the peer@?s credibility concerning trustworthiness in providing recommendation about other peers. Our trust management scheme is applied in conjunction with our trust model in order to detect malicious and collaborative-based malicious peers. Knowledge of trustworthiness among peers is used in our proposed broadcast model named trustworthy-based estafet multi-point relays (TEMPR). This model is designed to minimise the communication overhead between peers while considering the trustworthiness of the peers such that only trustworthy peer may relay messages to other peers. With our approach, each peer is able to disseminate messages in the most efficient and reliable manner.