Daniele Quercia
ABSTRACT
The Coalition Peering Domain (CPD) is a recent innovation within the field of mesh networking. It facilitates the management of community-area networks in a distributed and scalable form, allowing devices to pool their network resources (particularly egress links) to the common good. However, as in P2P systems, this form of cooperative sharing architecture raises significant concerns about the effect of free-riders: nodes that utilise the bandwidth of others without providing an adequate return to the community. To address this problem, we propose STRUDEL, a distributed framework that tackles the problem of free-riders and consists of: (i) a mechanism for the detection of malicious peers; (ii) a formal Bayesian trust model, to assess peers' trustworthiness; (iii) a forwarding mechanism based on the maximisation of trust-informed utility.
- A. Abdul-Rahman and S. Hailes. Using Recommendations for Managing Trust in Distributed Systems. In Proc. of IEEE Malaysia International Conference on Communication, Kuala Lumpur, Malaysia, November 1997.Google Scholar
- A. Abdul-Rahman and S. Hailes. Supporting Trust in Virtual Communities. In Proc. of the 33rd IEEE Hawaii International Conference on System Sciences, volume 6, page 6007, Washington DC, USA, 2000. Google ScholarDigital Library
- T. Aura. Cryptographically Generated Addresses (CGA). In Proc. of the 6th LNCS International Conference on Information Security, pages 29--43, Bristol, UK, 2003.Google ScholarCross Ref
- S. Buchegger and J.-Y. L. Boudec. A robust reputation system for p2p and mobile ad-hoc networks. In Proc. of the 2nd Workshop on the Economics of Peer-to-Peer Systems, Cambridge, MA, USA, June 2004.Google Scholar
- M. Carbone, M. Nielsen, and V. Sassone. A Formal Model for Trust in Dynamic Networks. In Proc. of the 1st IEEE International Conference on Software Engineering and Formal Methods, pages 54--63, Brisbane, Australia, September 2003.Google ScholarCross Ref
- N. Dimmock. How much is 'enough'? Risk in Trust-based Access Control. In Proc. of the 12th IEEE International Workshop on Enabling Technologies, page 281, Washington, DC, USA, June 2003. Google ScholarDigital Library
- N. Easen. Welcome to the Wi-Fi revolution. In http://edition.cnn.com/, September 2003.Google Scholar
- G. Hardin. The tragedy of the commons. Science, 162:1243--1248, December 1968.Google ScholarCross Ref
- M. Lad, S. Bhatti, S. Hailes, and P. Kirstein. Enabling Coalition-Based Community Networking. In Proc. of the London Communications Symposium, London, UK, September 2005.Google Scholar
- M. Lad, S. Bhatti, P. Kirstein, and S. Hailes. Challenges, Opportunities and Incentives for Coalition-Based Community Networking. In Technical Research Note Number RN/05/08. University College London, London, UK, June 2005.Google Scholar
- S. Marsh. Formalising Trust as a Computational Concept. Ph.D. Thesis. Department of Mathematics and Computer Science, University of Stirling, 1994.Google Scholar
- L. Mui, M. Mohtsahemi, C. Ang, P. Szolovits, and A. Halberstadt. Ratings in Distributed Systems: A Bayesian Approach. In Proc. of the 11th Workshop on Information Technologies and Systems, New Orleans, Louisiana, USA, December 2001.Google Scholar
- D. Quercia and S. Hailes. Risk Aware Decision Framework for Trusted Mobile Interactions. In Proc. of the 1st IEEE/CreateNet International Workshop on The Value of Security through Collaboration, Athens, Greece, September 2005.Google Scholar
- P.-W. Yau and C. J. Mitchell. 2HARP: A secure routing protocol to detect failed and selfish nodes in mobile ad hoc networks. In Proc. of the 5th World Wireless Congress, pages 1--6, San Franciso, USA, 2004.Google Scholar
- D. Zhu and M. W. Mutka. Promoting Cooperation Among Strangers to Access Internet Services from an Ad Hoc Network. In Proc. of the 12nd IEEE International Conference on Pervasive Computing and Communications, pages 229--240, Orlando, FL, USA, March 2004. Google ScholarDigital Library
Index Terms
- STRUDEL: supporting trust in the dynamic establishment of peering coalitions
Recommendations
Mesh-based P2P live video streaming with streamcomplete
This paper introduces STREAMCOMPLETE, a new architecture and prototype system for mesh-based P2P live video streaming; it realizes a new concept of overlay network's management as well as merges the best practices of tree- and mesh-based approaches. ...
Strong pseudonymous communication for peer-to-peer reputation systems
SAC '05: Proceedings of the 2005 ACM symposium on Applied computingIn this paper we present a novel approach to enable untraceable communication between pseudonyms. Our work provides strong sender and recipient anonymity by eliminating the need to know of each other's address.We use a variation of Chaum mixes to ...
SOMA: self-organised mesh authentication
EuroPKI'10: Proceedings of the 7th European conference on Public key infrastructures, services and applicationsCommunity mesh networks have emerged rapidly in every metropolis around the world, however many of the security methods applied are counter-intuitive and usually disrupt the autonomous characteristics of the mesh nodes. In SOMA we present a structured ...
Comments