A personalized trustworthy service selection method is proposed to fully express the features of trust, emphasize the importance of user preference and improve the trustworthiness of service selection. The trustworthi...A personalized trustworthy service selection method is proposed to fully express the features of trust, emphasize the importance of user preference and improve the trustworthiness of service selection. The trustworthiness of web service is defined as customized multi-dimensional trust metrics and the user preference is embodied in the weight of each trust metric. A service selection method combining AHP (analytic hierarchy process) and PROMETHEE (preference ranking organization method for enrichment evaluations) is proposed. AHP is used to determine the weights of trust metrics according to users' preferences. Hierarchy and pairwise comparison matrices are constructed. The weights of trust metrics are derived from the highest eigenvalue and eigenvector of the matrix. to obtain the final rank of candidate services. The preference functions are defined according to the inherent characteristics of the trust metrics and net outranking flows are calculated. Experimental results show that the proposed method can effectively express users' personalized preferences for trust metrics, and the trustworthiness of service ranking and selection is efficiently improved.展开更多
When dealing with the ratings from users,traditional collaborative filtering algorithms do not consider the credibility of rating data,which affects the accuracy of similarity.To address this issue,the paper proposes ...When dealing with the ratings from users,traditional collaborative filtering algorithms do not consider the credibility of rating data,which affects the accuracy of similarity.To address this issue,the paper proposes an improved algorithm based on classification and user trust.It firstly classifies all the ratings by the categories of items.And then,for each category,it evaluates the trustworthy degree of each user on the category and imposes the degree on the ratings of the user.Finally,the algorithm explores the similarities between users,finds the nearest neighbors,and makes recommendations within each category.Simulations show that the improved algorithm outperforms the traditional collaborative filtering algorithms and enhances the accuracy of recommendation.展开更多
Cloud computing has emerged as a new style of computing in distributed environment. An efficient and dependable Workflow Scheduling is crucial for achieving high performance and incorporating with enterprise systems. ...Cloud computing has emerged as a new style of computing in distributed environment. An efficient and dependable Workflow Scheduling is crucial for achieving high performance and incorporating with enterprise systems. As an effective security services aggregation methodology, Trust Work-flow Technology (TWT) has been used to construct composite services. However, in cloud environment, the existing closed network services are maintained and functioned by third-party organizations or enterprises. Therefore service-oriented trust strategies must be considered in workflow scheduling. TWFS related algorithms consist of trust policies and strategies to overcome the threats of the application with heuristic workflow scheduling. As a significance of this work, trust based Meta heuristic workflow scheduling (TMWS) is proposed. The TMWS algorithm will improve the efficiency and reliability of the operation in the cloud system and the results show that the TMWS approach is effective and feasible.展开更多
The working of a Mobile Ad hoc NETwork(MANET)relies on the supportive cooperation among the network nodes.But due to its intrinsic features,a misbehaving node can easily lead to a routing disorder.This paper presents ...The working of a Mobile Ad hoc NETwork(MANET)relies on the supportive cooperation among the network nodes.But due to its intrinsic features,a misbehaving node can easily lead to a routing disorder.This paper presents two trust-based routing schemes,namely Trust-based Self-Detection Routing(TSDR)and Trust-based Cooperative Routing(TCOR)designed with an Ad hoc On-demand Distance Vector(AODV)protocol.The proposed work covers a wide range of security challenges,including malicious node identification and prevention,accurate trust quantification,secure trust data sharing,and trusted route maintenance.This brings a prominent solution for mitigating misbehaving nodes and establishing efficient communication in MANET.It is empirically validated based on a performance comparison with the current Evolutionary Self-Cooperative Trust(ESCT)scheme,Generalized Trust Model(GTM),and the conventional AODV protocol.The extensive simulations are conducted against three different varying network scenarios.The results affirm the improved values of eight popular performance metrics overcoming the existing routing schemes.Among the two proposed works,TCOR is more suitable for highly scalable networks;TSDR suits,however,the MANET application better with its small size.This work thus makes a significant contribution to the research community,in contrast to many previous works focusing solely on specific security aspects,and results in a trade-off in the expected values of evaluation parameters and asserts their efficiency.展开更多
基金The National Natural Science Foundation of China(No.60973149)the Open Funds of State Key Laboratory of Computer Science of the Chinese Academy of Sciences(No.SYSKF1110)+1 种基金the Doctoral Fund of Ministry of Education of China(No.20100092110022)the College Industrialization Project of Jiangsu Province(No.JHB2011-3)
文摘A personalized trustworthy service selection method is proposed to fully express the features of trust, emphasize the importance of user preference and improve the trustworthiness of service selection. The trustworthiness of web service is defined as customized multi-dimensional trust metrics and the user preference is embodied in the weight of each trust metric. A service selection method combining AHP (analytic hierarchy process) and PROMETHEE (preference ranking organization method for enrichment evaluations) is proposed. AHP is used to determine the weights of trust metrics according to users' preferences. Hierarchy and pairwise comparison matrices are constructed. The weights of trust metrics are derived from the highest eigenvalue and eigenvector of the matrix. to obtain the final rank of candidate services. The preference functions are defined according to the inherent characteristics of the trust metrics and net outranking flows are calculated. Experimental results show that the proposed method can effectively express users' personalized preferences for trust metrics, and the trustworthiness of service ranking and selection is efficiently improved.
基金supported by Phase 4,Software Engineering(Software Service Engineering)under Grant No.XXKZD1301
文摘When dealing with the ratings from users,traditional collaborative filtering algorithms do not consider the credibility of rating data,which affects the accuracy of similarity.To address this issue,the paper proposes an improved algorithm based on classification and user trust.It firstly classifies all the ratings by the categories of items.And then,for each category,it evaluates the trustworthy degree of each user on the category and imposes the degree on the ratings of the user.Finally,the algorithm explores the similarities between users,finds the nearest neighbors,and makes recommendations within each category.Simulations show that the improved algorithm outperforms the traditional collaborative filtering algorithms and enhances the accuracy of recommendation.
文摘Cloud computing has emerged as a new style of computing in distributed environment. An efficient and dependable Workflow Scheduling is crucial for achieving high performance and incorporating with enterprise systems. As an effective security services aggregation methodology, Trust Work-flow Technology (TWT) has been used to construct composite services. However, in cloud environment, the existing closed network services are maintained and functioned by third-party organizations or enterprises. Therefore service-oriented trust strategies must be considered in workflow scheduling. TWFS related algorithms consist of trust policies and strategies to overcome the threats of the application with heuristic workflow scheduling. As a significance of this work, trust based Meta heuristic workflow scheduling (TMWS) is proposed. The TMWS algorithm will improve the efficiency and reliability of the operation in the cloud system and the results show that the TMWS approach is effective and feasible.
文摘The working of a Mobile Ad hoc NETwork(MANET)relies on the supportive cooperation among the network nodes.But due to its intrinsic features,a misbehaving node can easily lead to a routing disorder.This paper presents two trust-based routing schemes,namely Trust-based Self-Detection Routing(TSDR)and Trust-based Cooperative Routing(TCOR)designed with an Ad hoc On-demand Distance Vector(AODV)protocol.The proposed work covers a wide range of security challenges,including malicious node identification and prevention,accurate trust quantification,secure trust data sharing,and trusted route maintenance.This brings a prominent solution for mitigating misbehaving nodes and establishing efficient communication in MANET.It is empirically validated based on a performance comparison with the current Evolutionary Self-Cooperative Trust(ESCT)scheme,Generalized Trust Model(GTM),and the conventional AODV protocol.The extensive simulations are conducted against three different varying network scenarios.The results affirm the improved values of eight popular performance metrics overcoming the existing routing schemes.Among the two proposed works,TCOR is more suitable for highly scalable networks;TSDR suits,however,the MANET application better with its small size.This work thus makes a significant contribution to the research community,in contrast to many previous works focusing solely on specific security aspects,and results in a trade-off in the expected values of evaluation parameters and asserts their efficiency.