By Topic

A Secure Network Admission and Routing Model Based on Trust Theory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chi Guo ; Comput. Sch., Wuhan Univ., Wuhan ; Lei Zhao ; Lina Wang ; Zhejun Fang

This paper presents a trust-based model for secure network admission and trustworthy routing. Firstly, a dynamic routing trust model based on trust relationship and routing behaviors is brought forward. The model not only supports trust network connection, but also gives a comprehensive assessment to the network security and efficiency affected by router access according to routers' interactive behaviors. Secondly, the trust degree between any two routers can be notified to all by a dependable flooding algorithm. Finally, a new routing strategy called by "minimal trust routing entropy" is proposed, which is good at avoiding nodes with low trust while taking into account the routing efficiency. This model can be used for the next-generation connection-oriented Internet which is controllable and trustworthy.

Published in:

Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for

Date of Conference:

18-21 Nov. 2008