Close category search window
 

A service-oriented dynamic trust vector model for ad hoc networks

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
$31 $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

5 Author(s)
Li Yu ; Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Fei Xiong ; Wei Cheng ; Wei Wang
more authors

In service oriented architecture, Quality of Service (QoS) is an important index for an interaction or a cooperation in network. Whereas, considering the particular properties of service, more attention needs to be paid to the transmission environment and the requirement of service. In this paper, we introduce a trust vector to evaluate the network, including secondhand information and propose a fast-decreasing, slow-increasing trust management system, which incarnates a punishment to malicious behaviors. Also, a routing approach based on trust vector to select the most appropriate routing for services is proposed. And a simulation is given in the end, which shows a better performance of trust vector model.

Published in:
Communications and Networking in China (CHINACOM), 2011 6th International ICST Conference on

Date of Conference: 17-19 Aug. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.