11913920
Content-Based Trust Mechanism for E-commerce Systems
Previous trust mechanisms are mainly focused on reputational models based on explicit trust ratings. However, the large amount of system-provided and user-generated content published on Web is often ignored. These information is very important for providing more accurate, fine-grained and efficient trust management. In this paper, we propose a content-based trust mechanism and introduce trust reasoning functionalities which can infer a user's interests and expertise. We present a new method to calculate user similarity based on their feedbacks on reviews to reduce data sparseness of User Similarity matrix. We pinpoint several characteristics of trust which have been overlooked previously: trust is field-dependant, similarity-sensitive, personalized and etc. we differ various trust levels between pairs of users to support more accurate and efficient trust calculation. Although we choose Epinions as our targeted application, the mechanism proposed in this paper are also applicable to other e-commerce systems.
38299104
A Computational Trust Model for Semantic Web Based on Bayesian Decision Theory
Enabling trust to ensure more effective and efficient agent interaction is at the heart of the Semantic Web vision. We propose a computational trust model based on Bayesian decision theory in this paper. Our trust model combines a variety of sources of information to assist users with making correct decision in choosing the appropriate providers according to their preferences that expressed by prior information and utility function, and takes three types of costs (operational, opportunity and service charges) into account during trust evaluating. Our approach gives trust a strict probabilistic interpretation and lays solid foundation for trust evaluating on the Semantic Web.
14869838
A Social Network-Based Trust Model for the Semantic Web
Trust is very essential to secure and high quality interactions on the Semantic Web. In this paper, we introduce a trust model, which incorporates pairwise trust ratings and reliable factors of acquaintances and constructs an edge-weighted graph to calculate trust values. We interpret trust in two dimensions to better deal with it. We apply the theory in social network field to calculate trust and simulate the trust relationships between humans. We also take advantage of formulas in probability and statistics to analyze the similarities between agents. The algorithm of the trust model aims to be simple, efficient and flexible.
17285338
A reputation-chain trust model for the semantic Web
Trust plays a central role for efficient and secure interactions on the semantic Web. Nowadays, more and more research has focused on this topic. In this paper, we introduce RCSW, a reputation-chain trust model for the semantic Web. We illustrate the basic definitions and mechanisms of RCSW and present the algorithm to calculate trust ratings through the chain of the trust network. RCSW incorporates pairwise trust values and reliable factors of acquaintances and constructs an edge-weighted graph to calculate trust ratings. We also define classes of trust functions to allow users to individualize their trust calculation. Our proposed model can deal with trust management effectively and can quickly adapt to the changing environment.
46276460
ACO Based QoS Routing Algorithm for Wireless Sensor Networks
In this paper, we proposed an approach for Quality of Service (QoS) routing algorithm of Wireless Sensor Networks (WSNs) based on Ant Colony Optimization (ACO). The special characteristics of WSNs need to reduce the computational complexity and energy consumption of the QoS routing algorithm especially. We note that ACO algorithm using collective intelligence of artificial ants as intelligent agents is very appropriate to solve the combinatorial optimization problems in a fully distributed way, so in this paper we use modified ACO approach to solve Delay Constraint Maximum Energy Residual Ratio (DCMERR) QoS routing problem of WSNs. The QoS routing solution proposed in this manuscript, which is named as ACO based QoS routing algorithm (ACO-QoSR), searches for the best paths, which are satisfied with the QoS requirements with intelligent artificial ants. To overcome the problem of limited energy in WSNs, there are some modifications to enhance ACO’s convergence rate. ACO-QoSR algorithm is the tradeoff between a certain guaranteed QoS requirements and acceptable computational complexity. The simulation results verify that ACO-QoSR algorithm can reduce the selected paths’ delay and improve the selected paths’ normalized energy residual ratio at the similar levels of routing overhead.
12630564
Develop a Computational Trust Prototype for the Semantic Web
Nowadays, more and more research has focused on the trust management of the Semantic Web. Some mature technologies from many fields such as multiagent systems, social network analysis and artificial intelligence have been introduced to this field. However, some unique characteristics of the Semantic Web are more or less ignored. In this paper, we try to explore the semantic aspects of the trust management. We present DartTrust, a trust prototype for the semantic web in the application context of Traditional Chinese Medicine (TCM). We introduce RCSW - a Reputation-Chain trust model for the Semantic Web, which incorporates pairwise trust factor and reliable factor and constructs an edge-weighted graph to calculate trust ratings. We define a small trust ontology to illustrate the trust relationships. The trust ontology is described in OWL that can be understood and processed by machines. Therefore, DartTrust can provide reasoning functions and facilitate trust management with little human effort. As a demonstration of the prototype, we present its implementation on Traditional Chinese Medicine (TCM) at the end of this paper.
17429523
A Novel Trust-based Cooperative Node Selection Scheme in Wireless Sensor Networks
For communication between the cluster head node (CHN) and the distant data fusion center (DFC) with the cooperation of intra-cluster nodes in wireless sensor networks (WSNs), reliable handling of packets by the cooperative node (CN) is difficult to ensure. In this paper, we propose a novel CN selection scheme based on trust for WSNs. This scheme can choose one of high trust nodes to assist in the transmission of CHN, which aims to improve the transmission performance over cooperative communication in the presence of potential malicious nodes. First, we establish a trust model to improve the reliability of transmission by CN in WSNs, which is based on both the direct trust and the indirect trust of nodes. Then the CHN selects a node based on the proposed trust model to aid the CHN in transmission. Simulation results show that the proposed scheme can mitigate the impact of the potential malicious nodes on transmission performance and the simulation results also demonstrate the efficiency of the proposed scheme.
6059000
Preserving User Location Privacy in Mobile Data Management Infrastructures
Location-based services, such as finding the nearest gas station, require users to supply their location information. However, a user's location can be tracked without her consent or knowledge. Lowering the spatial and temporal resolution of location data sent to the server has been proposed as a solution. Although this technique is effective in protecting privacy, it may be overkill and the quality of desired services can be severely affected. In this paper, we suggest a framework where uncertainty can be controlled to provide high quality and privacy-preserving services, and investigate how such a framework can be realized in the GPS and cellular network systems. Based on this framework, we suggest a data model to augment uncertainty to location data, and propose imprecise queries that hide the location of the query issuer and yields probabilistic results. We investigate the evaluation and quality aspects for a range query. We also provide novel methods to protect our solutions against trajectory-tracing. Experiments are conducted to examine the effectiveness of our approaches.
16657537
Differentiated Domain Protection Algorithm Based on Virtual Topology Graph in Multi-Domain Optical Networks
This paper proposes a novel Differentiated Domain Protection (DDP) algorithm to address survivability in multi-domain optical networks. In order to ensure the principle of transparent management in multi-optical domains, DDP abstracts the multi-domain optical networks to Virtual Topology Graph (VTG) to solve the inter-domain routing. In order to satisfy the survivable requirements of different domains, DDP considers the differentiated protection in different domains. Compared with traditional algorithms, DDP not only has the performance trade-off ability but also has the better resource utilization ratio. Simulation results are shown to be promising.
15793976
A New Sub-path Protection Algorithm Based on Auxiliary Virtual Topology in WDM Optical Networks
This paper proposes a new survivable algorithm named sub-path protection based on auxiliary virtual topology (SPAVT) to tolerate the single-link failure in WDM optical networks. According to the protection-switching time constraint, SPAVT constructs the virtual topology. Then, it only needs to run one time of routing algorithm to find the feasible virtual route in virtual topology. Simulation results show that SPAVT has smaller blocking probability and lower time complexity than conventional algorithms.
8300404
Modeling Internet Link Delay Based on Measurement
Understanding Internet link delay is an important key of taking full advantage of Internet resources. In this paper, we find that the link delay follows Gammadistribution using Maximum Likelihood Estimation based on data measured in a large-scale network. The correlations between the link delay and the edge load, the node degree, and the betweenness are analyzed respectively. The link delay distribution parameters for different ranges of edge load are calculated. We findthat the edge load is correlated positively with the shape parameter of link delay Gamma distribution and negatively with the scale parameter.