First-priority relation graph-based malicious users detection in mobile social networks
Contribuinte(s) |
Qui, Meikang Xu, Shouhuai Yung, Moti Zhang, Haibo |
---|---|
Data(s) |
01/01/2015
|
Resumo |
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). |
Identificador | |
Idioma(s) |
eng |
Publicador |
Springer |
Relação |
http://dro.deakin.edu.au/eserv/DU:30082878/sheng-firstpriority-2015.pdf http://dro.deakin.edu.au/eserv/DU:30082878/sheng-firstpriority-evid-2015.pdf http://www.dx.doi.org/10.1007/978-3-319-25645-0_34 |
Direitos |
2015, Springer |
Palavras-Chave | #mobile social networks #first-priority relation graph #PMC detection model #Hamiltonian cycle decomposition #malicious users |
Tipo |
Book Chapter |