Secure Routing Based on Social Similarity in Opportunistic Networks

Lin Yao, Yanmao Man, Zhong Huang, Jing Deng, Xin Wang
2016 IEEE Transactions on Wireless Communications  
The lack of pre-existing infrastructure or dynamic topology makes it impossible to establish end-to-end connections in Opportunistic Networks (OppNets). Instead, a storeand-forward strategy can be employed. However, such looselyknit routing paths depend heavily on the cooperation among participating nodes. Selfish or malicious behaviors of nodes impact greatly on the network performance. In this paper, we design and validate a dynamic trust management model for secure routing optimization. We
more » ... optimization. We propose the concept of incorporating social trust into the routing decision process and design a Trust Routing based on Social Similarity (TRSS) scheme. TRSS is based on the observation that nodes move around and contact each other according to their common interests or social similarities. A node sharing more social features in social history record with the destination is more likely to travel close to the latter in the near future and should be chosen as the next-hop forwarder. Furthermore, social trust can be established based on an observed node's trustworthiness and its encounter history. Based on direct and recommended trust, those untrustworthy nodes will be detected and purged from the trusted list. Since only trusted nodes' packets will be forwarded, the selfish nodes have the incentives to well-behave again. Simulation evaluation demonstrates that TRSS is very effective in detecting selfish or even malicious nodes and achieving better performance.
doi:10.1109/twc.2015.2476466 fatcat:4232slv4svea5hwydvphr436xq