Secure Routing Based on Social Similarity in Opportunistic Networks
Authors:
- 3 September 2015
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 15 (1) , 594-605
Abstract
The lack of pre-existing infrastructure or dynamic topology makes it impossible to establish end-to-end connections in opportunistic networks (OppNets). Instead, a store-and-forward strategy can be employed. However, such loosely knit 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 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 behave well again. Simulation evaluation demonstrates that TRSS is very effective in detecting selfish or even malicious nodes and achieving better performance.Keywords
Funding Information
- National Natural Science Foundation of China (61173179, 61103146, 61202441)
- Program for New Century Excellent Talents in University (NCET-13-0083)
- Fundamental Research Funds for the Central Universities (DUT13JS10, DUT14YQ212)
This publication has 40 references indexed in Scilit:
- A Secure Social-Aware Incentive Scheme for Delay Tolerant Networks2013
- ConSub: Incentive-Based Content Subscribing in Selfish Opportunistic Mobile NetworksIEEE Journal on Selected Areas in Communications, 2013
- An investigation on the unwillingness of nodes to participate in mobile delay tolerant network routingInternational Journal of Information Management, 2013
- A routing protocol for socially selfish delay tolerant networksAd Hoc Networks, 2012
- IRONMAN: Using Social Networks to Add Incentives and Reputation to Opportunistic Networks2011
- Incentive-aware data dissemination in delay-tolerant mobile networks2011
- RELICS: In-network realization of incentives to combat selfishness in DTNs2010
- Bargain-based Stimulation Mechanism for Selfish Mobile Nodes in Participatory Sensing Network2009
- Barter trade improves message delivery in opportunistic networksAd Hoc Networks, 2009
- Enhanced Reputation Mechanism for Mobile Ad Hoc Networks2004