Security and trust management in opportunistic networks: a survey

被引:48
作者
Wu, Yue [1 ]
Zhao, Yimeng [2 ]
Riguidel, Michel [2 ]
Wang, Guanghao [1 ]
Yi, Ping [1 ]
机构
[1] Shanghai Jiao Tong Univ, Natl Engn Lab Informat Content Anal, Shanghai 200240, Peoples R China
[2] Telecom Paristech, Dept Network & Comp Sci, F-75013 Paris, France
基金
美国国家科学基金会;
关键词
opportunistic networks; security; authentication; privacy; trust management; incentive mechanism; HOC; COOPERATION;
D O I
10.1002/sec.1116
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As a new networking paradigm, opportunistic networking communications have great vision in animal migration tracking, mobile social networking, network communications in remote areas and intelligent transportation, and so on. Opportunistic networks are one of the evolutionary mobile ad hoc networks, whose communication links often suffer from frequent disruption and long communication delays. Therefore, many opportunistic forwarding protocols present major security issues, and the design of opportunistic networks faces serious challenges such as how to effectively protect data confidentiality and integrity and how to ensure routing security, privacy, cooperation, and trust management. In this paper, we first systematically describe the security threats and requirements in opportunistic networks; then propose a general security architecture of opportunistic networks; and then make an in-depth analysis on authentication and access control, secure routing, privacy protection, trust management, and incentive cooperation mechanisms; and at the same time, we present a comparison of various security and trust solutions for opportunistic networks. Finally, we conclude and give future research directions. Copyright (c) 2014 John Wiley & Sons, Ltd.
引用
收藏
页码:1812 / 1827
页数:16
相关论文
共 77 条
[1]  
[Anonymous], P IEEE INT S WORLD W
[2]  
[Anonymous], 2012, P 7 ACM INT WORKSH C
[3]  
[Anonymous], MATH THEORY EVIDENCE
[4]  
[Anonymous], CS 200006 DUK U
[5]  
[Anonymous], P 2 INT WORKSH MOB O
[6]  
[Anonymous], 6527 RFC
[7]  
[Anonymous], COMPUTER COMMUNICATI
[8]  
[Anonymous], MOBIOPP 12
[9]  
[Anonymous], 2008, P 2 ANN IEEE SYST C
[10]  
[Anonymous], 2012, P 7 ACM INT WORKSH C