First-priority relation graph-based malicious users detection in mobile social networks
Xu, Li, Lin, Limei and Wen, Sheng 2015, First-priority relation graph-based malicious users detection in mobile social networks. In Qui, Meikang, Xu, Shouhuai, Yung, Moti and Zhang, Haibo (ed), Network and system security : 9th international conference, NSS 2015, New York, NY, USA, November 3-5, 2015 proceedings, Springer, Berlin, Germany, pp.459-466, doi: 10.1007/978-3-319-25645-0_34.
Attached Files
Name
Description
MIMEType
Size
Downloads
Title
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).
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.