DocumentCode
2523784
Title
Depth-Expurgation Based Dynamic Trust Evaluation Algorithm for Ad Hoc Networks
Author
Jia, Zhiping ; Qin, Zhiwei ; Xu, Xinshun ; Zhang, Ruihua
Author_Institution
Sch. of Comput. Sci. & Technol., Shandong Univ., Shandong
fYear
2008
fDate
29-31 July 2008
Firstpage
399
Lastpage
404
Abstract
Due to the wireless nature of ad hoc networks, two nodes out of mutual communication range need intermediate nodes cooperative to implement applications, such as resources discovery and packets forwarding. Trust evaluation between two peers directly affects the security and performance of networks. In this paper, a novel trust evaluation model is proposed for ad hoc networks. In this model, based on the theories of directed acyclic graph and the notion of social control, several rules are introduced to weight recommendation paths. A trust evaluation algorithm (DEA) is also proposed. During trust evaluation process, the depth of directed graph for an ad hoc network decreases step by step. Simulations show that the proposed algorithm can improve the accuracy of evaluation and effectively mitigate malicious nodes´ denigration attacks.
Keywords
ad hoc networks; directed graphs; telecommunication security; ad hoc networks; depth-expurgation based dynamic trust evaluation algorithm; directed acyclic graph; malicious node denigration attacks; mutual communication range; network security; packets forwarding; resources discovery; social control; weight recommendation paths; Ad hoc networks; Communication system security; Embedded software; Entropy; Heuristic algorithms; Information security; Network topology; Peer to peer computing; Software algorithms; Sun;
fLanguage
English
Publisher
ieee
Conference_Titel
Embedded Software and Systems, 2008. ICESS '08. International Conference on
Conference_Location
Sichuan
Print_ISBN
978-0-7695-3287-5
Type
conf
DOI
10.1109/ICESS.2008.22
Filename
4595588
Link To Document