| An adaptive computational trust model for mobile ad hoc networks |
| Full text |
Pdf
(371 KB)
|
| Source
|
International Conference On Communications And Mobile Computing
archive
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
table of contents
Leipzig, Germany
SESSION: Mobile ad hoc networks (Wireless LANs and Wireless PANs symp.)
table of contents
Pages 191-195
Year of Publication: 2009
ISBN:978-1-60558-569-7
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 32, Downloads (12 Months): 76, Citation Count: 0
|
|
|
ABSTRACT
While the notion of reputation is proposed to enhance an entity's trustworthiness and improve the security of a network, the problems of trust and reputation themselves, such as fair evaluation, peer assistance, efficient computation, become an important challenge in such systems. This paper addresses the issues of adaptive trust calculation and efficient reputation evaluation in wireless and mobile networks via a distributed approach. We first present the trust relationship between two mutual trustworthy nodes and then an adaptive computational trust prototype is formulated to effectively prevent malicious nodes from entering the trusted community. Through the analysis of our model's security properties, our system is proved to show how it is able to offer security protections to a dynamic but agile environment and at the same time prevent improper behavior within a community.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
K. S. Barber , J. Ahn , S. Budalakoti , D. DeAngelis , K. K. Fullam , C. L. D. Jones , X. Sui, Agent trust evaluation and team formation in heterogeneous organizations, Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, May 14-18, 2007, Honolulu, Hawaii
[doi> 10.1145/1329125.1329442]
|
| |
3
|
|
| |
4
|
|
 |
5
|
Azzedine Boukerche , Yonglin Ren, A security management scheme using a novel computational reputation model for wireless and mobile ad hoc networks, Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks, October 27-28, 2008, Vancouver, British Columbia, Canada
[doi> 10.1145/1454609.1454628]
|
| |
6
|
|
 |
7
|
|
| |
8
|
Gong, L., Needham, R., and Yahalom, R. "Reasoning about Belief in Cryptographic Protocols", Proc. of Symposium on Research in Security and Privacy, pp. 234--248, 1990.
|
 |
9
|
Susan Grajek , Patrick Lynch , Laurie Cagnetta, Why to market IT services and how to do it, Proceedings of the 30th annual ACM SIGUCCS conference on User services, p.251-253, November 20-23, 2002, Providence, Rhode Island, USA
[doi> 10.1145/588646.588711]
|
| |
10
|
Guo, Y., and Wang, Y. "Establishing Trust Relationship in Mobile Ad-Hoc Network", Proceedings of International Conference on Wireless Communications, Networking and Mobile Computing, pp. 1562--1564, 2007.
|
| |
11
|
Ileri, O., Mau S.-C., and Mandayam, N. B. "Pricing for enabling forwarding in self-configuring ad hoc networks", IEEE Journal on Selected Areas in Communications, Vol. 23, pp. 151--162, 2005.
|
 |
12
|
|
| |
13
|
Arindam Mitra , Ranganath Udupa , Muthucumaru Maheswaran, A secured hierarchical trust management framework for public computing utilities, Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research, p.185-199, October 17-20, 2005, Toranto, Ontario, Canada
|
| |
14
|
Momani, M., Challa, S., and Alhmouz, R. "Can we trust trusted nodes in wireless sensor networks?", Proceedings of International Conference on Computer and Communication Engineering, pp. 1227--1232, 2008.
|
| |
15
|
Papadimitratos, P., and Haas, Z. J. "Secure routing for mobile ad hoc networks", Proceedings of SCS Communication Networks and Distributed Systems Modeling and Simulation Conference, 2002.
|
| |
16
|
|
| |
17
|
|
| |
18
|
|
|