Social-Based Trust in Mobile Opportunistic Networks

被引:0
作者
Mtibaa, Abderrahmen [1 ]
Harras, Khaled A. [1 ]
机构
[1] Carnegie Mellon Univ, Sch Comp Sci, Pittsburgh, PA 15213 USA
来源
2011 20TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS (ICCCN) | 2011年
关键词
Social Opportunistic Forwarding; DTN; Trust; mobility traces;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The fundamental challenge in opportunistic networking, regardless of the application, is enabling node cooperation in order to forward a message. While node cooperation is considered as a fundamental property in such networks, ensuring such a property between two devices in mobile opportunistic networks remains largely unexplored. In this paper, we investigate the potential impact of the lack of trust on node cooperation. We adopt a real-trace driven approach to study and analyze the trade-off between trust and success delivery rates in opportunistic networks. We first explore leveraging social information to establish trustworthy communication for mobile opportunistic networks. We then propose six trust based filters that use three social-based estimators of trust including common interests, common friends, and the distance in the social graph, coupled with two major techniques of trust establishment including Relay-to-Relay, and Source-to-Relay. We finally show that our trust filters yield a fair trade-off between trust and success rate by achieving more than 35% success rate compared to an untrusted environment where 10% of the nodes refuse to cooperate in the absence of trust.
引用
收藏
页数:6
相关论文
共 17 条
  • [1] Abadi M, 2003, LECT NOTES COMPUT SC, V2896, P72
  • [2] [Anonymous], 2004, 2 WORKSH EC PEER TO
  • [3] [Anonymous], P 1 INT WORKSH ADV I
  • [4] [Anonymous], 2007, P 2007 2 INT C COMM
  • [5] [Anonymous], 2010 P IEEE INFOCOM
  • [6] BURGESS J, 2006, P IEEE INF
  • [7] CHAINTREAU A., 2007, P ACM CONEXT
  • [8] Crowcroft J., 2003, P WORKSH MOD OPT MOB
  • [9] Daly E, 2007, MOBIHOC'07: PROCEEDINGS OF THE EIGHTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, P32
  • [10] Kempe D., 2000, P ACM STOC