Trust-based security routing mechanism in mobile social networks

Malicious and selfish behaviors represent a serious security threat against routing in mobile social networks (MSN). Due to MSN’s unique network characteristics, such as sociability, mobility and diversity, it is a challenge to design a misbehavior detection scheme in MSN. To improve the security in...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Neural computing & applications Ročník 32; číslo 10; s. 5609 - 5620
Hlavní autoři: Yang, Shuang, Wang, Xingwei, Zhang, Shuang, Yi, Bo, Huang, Min
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Springer London 01.05.2020
Springer Nature B.V
Témata:
Advances in Parallel and Distributed Computing for Neural Computing
Algorithms
Artificial Intelligence
Computational Biology/Bioinformatics
Computational Science and Engineering
Computer Science
Computer simulation
Data Mining and Knowledge Discovery
Image Processing and Computer Vision
Probability and Statistics in Computer Science
Security
Social networks
Trustworthiness
Wireless networks
Network security
Mobile social network
Routing mechanism
Trust value
ISSN:0941-0643, 1433-3058
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Malicious and selfish behaviors represent a serious security threat against routing in mobile social networks (MSN). Due to MSN’s unique network characteristics, such as sociability, mobility and diversity, it is a challenge to design a misbehavior detection scheme in MSN. To improve the security in MSN routing, a trust-based security routing mechanism is presented in this paper, i.e., a malicious behavior detection mechanism with identity verification scheme. The main idea is to introduce the behavior trust and the identity trust to guide the routing. Firstly, we judge a node’s behavior based on both comprehensive trust and social relationship strength. And then, we forward messages according to the different measurement within and outside the friend groups. We also propose a distributed key management scheme which can issue, verify or revoke certificates based on the evaluation of the social relationship strength. We further improve the efficiency of the proposed mechanism by verifying the identity trust of the node. The simulation results indicate that the proposed routing mechanism can lower the impact of malicious behavior of nodes effectively and it has greater security performance than some classical routing algorithms do.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0941-0643
1433-3058
DOI:10.1007/s00521-019-04167-z