arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.4326cs.NI
收藏

PROTECT:移动社会中使用相遇的基于邻近度的信任顾问

PROTECT: Proximity-based Trust-advisor using Encounters for Mobile Societies

Udayan Kumar, Gautam Thakur, Ahmed Helmy

摘要:

网络用户之间的许多交互依赖于信任,鉴于当今互联网的安全漏洞,信任变得尤为重要。无线移动网络中的动态性进一步加剧了这些问题。在本文中,我们解决的问题,在移动网络中的信任咨询和建立,应用到ad hoc网络,包括DTNs。我们以新颖的方式利用移动社会中的相遇,注意到移动性提供了建立基于邻近、位置和相似性的信任的机会。引入了四个新的信任顾问过滤器-包括遭遇频率,持续时间,行为向量和行为矩阵-并在从一所主要大学收集的大量真实世界痕迹上进行评估。两组统计分析进行,第一次检查的基本遇到的关系,在移动社会,第二次评估DTN路由在移动对等网络中使用的信任和自私的模型。我们发现,对于所分析的跟踪,信任过滤器在随时间增长方面是稳定的(3个过滤器在9周内有接近90%的用户重叠),并且不同过滤器产生的结果明显不同。在我们对信任和自私模型的分析中,我们的信任过滤器在很大程度上消除了自私对网络不可达性的影响。从而改善了具有自私节点的网络中的连通性。我们希望我们最初的有希望的结果打开大门,进一步研究基于邻近的信任。

英文摘要:

Many interactions between network users rely on trust, which is becoming particularly important given the security breaches in the Internet today. These problems are further exacerbated by the dynamics in wireless mobile networks. In this paper we address the issue of trust advisory and establishment in mobile networks, with application to ad hoc networks, including DTNs. We utilize encounters in mobile societies in novel ways, noticing that mobility provides opportunities to build proximity, location and similarity based trust. Four new trust advisor filters are introduced - including encounter frequency, duration, behavior vectors and behavior matrices - and evaluated over an extensive set of real-world traces collected from a major university. Two sets of statistical analyses are performed; the first examines the underlying encounter relationships in mobile societies, and the second evaluates DTN routing in mobile peer-to-peer networks using trust and selfishness models. We find that for the analyzed trace, trust filters are stable in terms of growth with time (3 filters have close to 90% overlap of users over a period of 9 weeks) and the results produced by different filters are noticeably different. In our analysis for trust and selfishness model, our trust filters largely undo the effect of selfishness on the unreachability in a network. Thus improving the connectivity in a network with selfish nodes. We hope that our initial promising results open the door for further research on proximity-based trust.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑