Elsevier

Future Generation Computer Systems

Volume 55, February 2016, Pages 391-400
Future Generation Computer Systems

Cluster-group based trusted computing for mobile social networks using implicit social behavioral graph

https://doi.org/10.1016/j.future.2014.06.005Get rights and content

Highlights

  • A hierarchical trust model for MSNs based on cluster-group structure is presented.

  • We construct an implicit social behavioral graph to describe trust relationships.

  • To extract the actual communities, a novel clustering algorithm is proposed.

  • We evaluate intragroup trust values using the hierarchical trust model for MSNs.

  • Trust values are aggregated and propagated based on intragroup trust values.

Abstract

Mobile Social Networks (MSNs) facilitate connections between mobile devices, and are capable of providing an effective mobile computing environment for users to access, share, and distribute information. However, MSNs are virtual social spaces, the available information may not be trustworthy to all. Therefore, trust inference plays a critical role for establishing social links between mobile users. In MSNs, users’ transactions will more and more be complemented with group contact. Hence, future usage patterns of mobile devices will involve more group contacts. In this paper, we describe the implicit social behavioral graph, i.e., ego-i graph which is formed by users’ contacts, and present an algorithm for initiating ego-i graph. We rate these relationships to form a dynamic contact rank, which enables users to evaluate the trust values between users within the context of MSNs. We, then, calculate group-based trust values according to the level of contacts, interaction evolution, and users’ attributes. Based on group-based trust, we obtain a cluster trust by the aggregation of inter group-based trust values. Due to the unique nature of MSNs, we discuss the propagation of cluster trust values for global MSNs. Finally, we evaluate the performance of our trust model through simulations, and the results demonstrate the effectiveness of group-based behavioural relationships in MSNs’ information sharing system.

Introduction

With the emergence of new generation mobile devices, such as smartphones, laptops and PDAs, mobile social networks (MSNs) have experienced a tremendous success. MSNs are a type of newly-emerging large-scale distributed systems that integrate online social computing services and mobile devices and allow mobile social users to discover and interact with friends and further enjoy some distributed network service, such as friends recommendation and dynamic content dissemination  [1]. However, there exists a certain risk when mobile users try to interact with others anytime and anywhere  [2], [3]. Because users of such mobile social network do not have any previous interactions, it is more important to establish an acceptable level of trust relationships among participating users  [4].

A mobile social network is essentially a dynamic virtual network with trust relationships between users. Many social mobile applications such as Weixin,1 LinkedIn,2 and Facebook3 have steadily been growing and became ubiquitous on the Internet. Therefore, various kinds of information and data produced through diverse mobile applications in mobile social environment. In such novel mobile social paradigms, each mobile device such as a smart phone performs its own role and the outputs are collected into mobile social networks. This environment allows for resource sharing and distribution of computing load  [5]. Compared to traditional social networks in which only a select few produce and share data, this environment explosively increases not only the amount but also the complexity of data. Data collected with user experience is also possible, thus a method to measure trust worthiness of user data is necessary  [6]. In smart phone’s network environment, many people communicate mainly with their friends (such as family, and coworkers) through social network services. Mobile users share their roles within their MSNs via interactive behaviors, thereby increasing the overall trustworthiness of the relationship between the users being carried out. However, online social relationships always depend on physical world relationships. Hence, we can infer a level of users’ trust relationships that underpins the online community where they exist according to some attributes of the real world  [7], [8], [9], [10], [11].

There have been a number of related studies on trusted computation and inference in social networks to reduce the risk of social interactions  [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27]. These researches establish the foundation for our work. Unfortunately, one major aspect falls short in these research activities is the effect of contact and group homogeneity on inferring trust. Actually, in MSNs, we can communicate with everyone instantly everywhere all the time, and the differences between personal and remote communication patterns are diminishing. Thus, the one to one conversation scheme known from traditional remote communication will more and more be complemented with group contact, much as when socializing in the real world. Hence, future-oriented trust relationships in mobile social services have to adequately address the related issues. In particular, they should facilitate trust communication and offer support to calculate trust value.

In this paper, we propose an approach to rate the contact according to group affiliations. In our approach, a cluster is a subset of vertices of a social graph that is highly connected. In particular, we assume that the density of edges within a cluster (intra-cluster edges) is larger than the density of edges connecting vertices from inside the cluster to vertices outside of the cluster. In this work, we will refer to a cluster c as a set of contacts which belong to different communication groups. By contrast, a group g refers to a set of contacts as identified by a user and these contacts belong to the same communication group, such as family, coworkers, and classmates. Thus, a cluster includes many hierarchies, and each hierarchy is denoted as a group. Based on the findings, we provide a global social trust model building system by seamlessly integrating the one-dimensional trust relationship. We suggest a method to quantify a trusting relation based on contact rank and group homogeneity. The quantified social trust model supports inter-user trust relationship and integration. In other words, the proposed approach not only helps decide the communicating path of trustworthy users in mobile environment but also helps address security issues with increased trustworthiness of user behaviors by ranking trustworthy relationships between users.

By doing so, a communicating path for trustworthy users under mobile environment is suggested. With the enhanced trustworthiness, the issue of security also can be addressed. Furthermore, the implicit trust along with the application of socially corrective mechanisms inherent in social networks can also be applied to other domains. In fact, social networking platforms already provide a multitude of integrated applications that deliver particular functionality to users, and more significantly, social network credentials provide authentication in many diverse domains, for example, many sites support Facebook Connect as a trusted authentication mechanism  [28]. Our key ideas and contributions are as follows:

  • We propose a clustering algorithm to produce a finer grained hierarchy of clusters by subsequent partitioning which can extract the actual communities and be able to deal with overlapping clusters. And then, we construct implicit social behavioral graph which contains sufficient information to evaluate trust relationships.

  • Using the above implicit social behavioral graph, we present a hierarchical trusted computing model for mobile social networks based on cluster-group structures. We calculate the intragroup trust values (group-based trust values) according to the level of contacts, interaction evolution, and users’ attributes. Based on intragroup trust, we discuss the aggregation and propagation of trust values, which enable us to calculate the cluster trust and indirectly trust values for global mobile social networks (MSNs).

  • We evaluate the performance of our trust model through simulations, and the results demonstrate the effectiveness of cluster-group based behavioural relationships in MSNs’ information sharing system.

The rest of the paper is organized as follows. Some related works are addressed in Section  2. Section  3 provides some important definitions and concepts. Section  4 presents an algorithm to initialize a communication group. Sections  5 Group-based trust value, 6 Cluster trust values and discuss how to calculate the group-based trust values and the propagation and aggregation of group-based trust, respectively. We analyze some performances of our trust model by simulation in Sections  7 Performance evaluation, 8 Conclusion is the conclusion.

Section snippets

Related work

If without trust relationships between users in a mobile social environment, the reliability of the total network would drop. Hence, many works have attempted to discover relationships between communication entities with social trust models. Grandison and Sloman  [11] have surveyed several existing trust models and they have defined the trust as “the firm belief in the capability of an entity to act consistently, securely and reliably within a specified context”. Kuada et al.  [12] propose the

Definitions

Let U be the universe set of discourse, f and h are random functions with a stable tendency f:U[0,1] and h:U[0,1], respectively. For the convenience of discussion, we define the relationship model between user i and user j,R, as a tuple of f,h,J.

Definition 1

For any two users i and j in a mobile social network G, the trust relationship between them, R, indicates the trust degree and the trust value of user j for user i, and can be defined as: trijRExij,WEnij,J(i,j) where Exij is an expected trust

Constructing implicit social behavioral graph

From Fig. 2, we can find there are some densely connected subgraphs and some users belong to more than one group. The densely connected subgraphs are formed by the members of a community and can be extracted from a graph using a clustering algorithm. A community detecting algorithm, hence, is supposed to extract the actual communities thus needs to be able to deal with overlapping groups, based on CONGA algorithm  [32] which extends the widely used Newman and Girvan algorithm  [33]. We ignore

Group-based trust value

In this paper, a group-based trust value indicates a 0-Distance trust. As discussed above, our system contains multiple divisive hierarchical groups, and each group approximates the real-life communities like class mates, work colleges, family members, and so on. We first calculate the trust value within a group, and then, we combine all the group-based trust values of different groups into the cluster trust value. We consider the contact behavioral and user attributes to compute trust value.

Cluster trust values

In a distributed mobile environment, more than one trust groups of a stranger user can be considered in many cases. Therefore, we need to aggregate the normalized group-based trust values.

Assume that user j simultaneously belongs to n groups of user i in cluster ci and hence, the cluster trust values between users i and j can be aggregated by n groups according to Definition 3, i.e., g_trusti1,g_trusti2,,g_trustin. The n trust group values can be combined into one cluster trust as follows: c_

Performance evaluation

In this section, simulation experiments are conducted based on the real mobile social networking dataset to evaluate the performance of the proposed approach with the goal of validating the effectiveness of the proposed approach for inferring the trust in MSNs.

Conclusion

In this paper, we present a new approach to compute the trust value for mobile social network based on implicit social behavioral graph. In our approach, the implicit social behavioral graph of user i can be extracted from mobile social services, such as Weixin, Facebook and LinkedIn, and denoted as a cluster. Moreover, a cluster can divide into multiple groups, such as family, coworkers, and classmates. We score each group and rank the contact between users within a group. To compute the

Acknowledgments

This research was supported in part by NSFC grant 61272151, ISTCP grant 2013DFB10070, the China Hunan Provincial Science and Technology Department Program under Grant Number 2012GK4106, the Ministry of Education Fund for Doctoral Disciplines in Higher Education under grant 20110162110043, the Shanghai Jiaotong University   211/985 Project No. WF220103001, the Scientific Research Fund of Hunan Provincial Education Department under Grant 14C0286 and the Specialized Research Fund for Doctoral

Shuhong Chen received her Master’s degree in Computer Science from Central South University, PR China, in 2004. She has been a Ph.D. candidate at Central South University since September 2009. Her research interests include trust evaluation models and algorithms in mobile social networks and mobile cloud computing, performance analysis, computer networks.

References (39)

  • W. Jiang et al.

    Generating trusted graphs for trust evaluation in online social networks

    Future Gener. Comput. Syst.

    (2014)
  • S. Shekarpour et al.

    Modeling and evaluation of trust with an extension in semantic web

    Web Semant. Sci. Serv. Agents World Wide Web

    (2010)
  • F. Hao et al.

    MobiFuzzyTrust: an efficient fuzzy trust inference mechanism in mobile social networks

    IEEE Trans. Parallel Distrib. Syst.

    (2013)
  • D. Damopoulos et al.

    User privacy and modern mobile services: are they on the same path?

    Pers. Ubiquitous Comput.

    (2013)
  • M. La Polla et al.

    A survey on security for mobile devices

    IEEE Commun. Surv. Tutor.

    (2013)
  • J. Li et al.

    Mobitrust: trust management system in mobile social computing

  • J.H. Christensen, Using RESTful web-services and cloud computing to create next generation mobile applications, in:...
  • H. Takabi

    Security and privacy challenges in cloud computing environments

    IEEE Secur. Privacy

    (2010)
  • G. Heurta-Canepa, D. Lee, A virtual cloud computing provider for mobile devices, in: Proceedings of the 1st ACM...
  • C. Costa et al.

    Trust and control interrelations

    Group Organ. Manag.

    (2007)
  • M. Lund et al.

    Evolution in relation to risk and trust management

    Computer

    (2010)
  • D. Gambetta

    Can we trust trust?

  • T. Grandison et al.

    A survey of trust in Internet applications

    IEEE Commun. Surv. Tutor.

    (2000)
  • E. Kuada, H. Olesen, A social network approach to provisioning and management of cloud computing services for...
  • J. Golbeck et al.

    Film Trust: Movie Recommendations Using Trust in Web-Based Social Network

    (2006)
  • S. Kim, S. Han, The method of inferring trust in Web-based social network using fuzzy logic, in: Proc. of the...
  • R. Kikin-Gil

    Affective is effective: how information appliances can mediate relationships within communities and increase one’s social effectiveness

    Pers. Ubiquitous Comput.

    (2006)
  • S. Counts

    Group-based mobile messaging in support of the social side of leisure

    Comput. Support. Coop. Work

    (2007)
  • X. Chen, B. Proulx, X. Gong, J. Zhang, Social trust and social reciprocity based cooperative D2D communications, in:...
  • Cited by (0)

    Shuhong Chen received her Master’s degree in Computer Science from Central South University, PR China, in 2004. She has been a Ph.D. candidate at Central South University since September 2009. Her research interests include trust evaluation models and algorithms in mobile social networks and mobile cloud computing, performance analysis, computer networks.

    Guojun Wang received the B.Sc. degree in Geophysics, the M.Sc. degree in Computer Science, and the Ph.D. degree in Computer Science, from Central South University (CSU), China. He is currently the Chairman and Professor of the Department of Computer Science at CSU, and the Director of Trusted Computing Institute at CSU. He had been an Adjunct Professor at Temple University, USA; a Visiting Scholar at Florida Atlantic University, USA; a Visiting Researcher at the University of Aizu, Japan; and a Research Fellow at The Hong Kong Poly technic University. His research interests include trusted computing, pervasive computing, mobile computing, and software engineering. He is a distinguished member of CCF, and a member of IEEE, ACM, and IEICE.

    Weijia Jia is currently a full Professor in the Department of Computer Science and the Director of Future Networking Center, ShenZhen Research Institute of City University of HongKong (CityU). His research interests include next generation wireless communication, protocols and heterogeneous networks; distributed systems, multicast and anycast QoS routing protocols. In these fields, he has a number of publications in prestige international journals (IEEE Transactions, e.g., ToN, TPDS, TC, TMC, etc.), books/chapters and refereed international conference proceedings (e.g. ACMCCS, WiSec, MobiHoc, SenSys, ICDCS, INFOCOM, etc.).

    View full text