First-Priority Relation Graph-Based Malicious Users Detection in Mobile Social Networks

Mobile social networks (MSNs) consist of many mobile users (individuals) with social characteristics, that provide a variety of data delivery services involving the social relationship among mobile individuals. Because mobile users move around based on their common interests and contact with each other more frequently if they have more social features in common in MSNs. In this paper, we first propose the first-priority relation graph, say FPRG, of MSNs. However, some users in MSNs may be malicious. Malicious users can break the data delivery through terminating the data delivery or tampering with the data. Therefore, malicious users will be detected in the process of looking for the data delivery routing to obtain efficient and reliable data delivery routing along the first-priority relation graph. Secondly, we propose one hamiltonian cycle decomposition of FPRG-based adaptive detection algorithm based on in MSNs under the PMC detection model (the system-level detection model).

[1]  Jie Wu,et al.  Hypercube-Based Multipath Social Feature Routing in Human Contact Networks , 2014, IEEE Transactions on Computers.

[2]  Shuming Zhou,et al.  Conditional diagnosability and strong diagnosability of shuffle-cubes under the comparison model , 2015, Int. J. Comput. Math..

[3]  Li Xu,et al.  The Social Feature-Based Priority Relation Graph of Mobile Social Networks , 2014, 2014 IEEE 17th International Conference on Computational Science and Engineering.

[4]  Andrzej Pelc,et al.  Better Adaptive Diagnosis of Hypercubes , 2000, IEEE Trans. Computers.

[5]  Li Xu,et al.  The Extra Connectivity and Conditional Diagnosability of Alternating Group Networks , 2015, IEEE Transactions on Parallel and Distributed Systems.

[6]  M. Newman,et al.  Why social networks are different from other types of networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Jie Wu,et al.  Community-Aware Opportunistic Routing in Mobile Social Networks , 2014, IEEE Transactions on Computers.

[8]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[9]  Jie Wu,et al.  Analysis of a Hypercube-Based Social Feature Multipath Routing in Delay Tolerant Networks , 2013, IEEE Transactions on Parallel and Distributed Systems.

[10]  Jie Wu,et al.  Social feature-based multi-path routing in delay tolerant networks , 2012, 2012 Proceedings IEEE INFOCOM.

[11]  Marco Conti,et al.  ContentPlace: social-aware data dissemination in opportunistic networks , 2008, MSWiM '08.

[12]  Li Xu,et al.  Conditional diagnosability of arrangement graphs under the PMC model , 2014, Theor. Comput. Sci..

[13]  Wanlei Zhou,et al.  Multidimensional Routing Protocol in Human-Associated Delay-Tolerant Networks , 2013, IEEE Transactions on Mobile Computing.

[14]  Cecilia Mascolo,et al.  CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks , 2009, IEEE Transactions on Mobile Computing.

[15]  M E J Newman,et al.  Identity and Search in Social Networks , 2002, Science.

[16]  Dusit Niyato,et al.  Applications, Architectures, and Protocol Design Issues for Mobile Social Networks: A Survey , 2011, Proceedings of the IEEE.

[17]  Boleslaw K. Szymanski,et al.  Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[18]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[19]  GERNOT METZE,et al.  On the Connection Assignment Problem of Diagnosable Systems , 1967, IEEE Trans. Electron. Comput..