移动机会网络的自适应用户匿名

CHANTS '12 Pub Date : 2012-08-22 DOI:10.1145/2348616.2348635
M. Radenkovic, I. Vaghi
{"title":"移动机会网络的自适应用户匿名","authors":"M. Radenkovic, I. Vaghi","doi":"10.1145/2348616.2348635","DOIUrl":null,"url":null,"abstract":"Current mobile opportunistic networks often use social routing protocols to transfer messages among users and to the services. In the face of changing underlying topology, mobility patterns and density of users and their queries, fixed algorithms for user anonymisation cannot provide sufficient level of user anonymity, and adaptive mechanisms for achieving user anonymity are needed. This paper describes a novel flexible and adaptive approach, AdaptAnon that is suitable for dynamic and heterogeneous mobile opportunistic networks. Our approach is multidimensional and combines multiple heuristics based on user profiles, analysis of user connectivity and history of anonymisation in order to predict and decide on the best set of nodes that can help anonymise the sending node. In our demonstration, we show that AdaptAnon achieves high quality of anonymisation in terms of both the number of nodes and the diversity of nodes in the anonymisation layer for varying query intensity and over live San Francisco cab mobility traces while neither decreasing success ratios nor increasing latency. We also compare AdaptAnon to other state of the art single dimensional anonymisation approaches and do real time visualization of performance parameters.","PeriodicalId":211112,"journal":{"name":"CHANTS '12","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Adaptive user anonymity for mobile opportunistic networks\",\"authors\":\"M. Radenkovic, I. Vaghi\",\"doi\":\"10.1145/2348616.2348635\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Current mobile opportunistic networks often use social routing protocols to transfer messages among users and to the services. In the face of changing underlying topology, mobility patterns and density of users and their queries, fixed algorithms for user anonymisation cannot provide sufficient level of user anonymity, and adaptive mechanisms for achieving user anonymity are needed. This paper describes a novel flexible and adaptive approach, AdaptAnon that is suitable for dynamic and heterogeneous mobile opportunistic networks. Our approach is multidimensional and combines multiple heuristics based on user profiles, analysis of user connectivity and history of anonymisation in order to predict and decide on the best set of nodes that can help anonymise the sending node. In our demonstration, we show that AdaptAnon achieves high quality of anonymisation in terms of both the number of nodes and the diversity of nodes in the anonymisation layer for varying query intensity and over live San Francisco cab mobility traces while neither decreasing success ratios nor increasing latency. We also compare AdaptAnon to other state of the art single dimensional anonymisation approaches and do real time visualization of performance parameters.\",\"PeriodicalId\":211112,\"journal\":{\"name\":\"CHANTS '12\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CHANTS '12\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2348616.2348635\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CHANTS '12","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2348616.2348635","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

当前的移动机会网络通常使用社交路由协议在用户之间和服务之间传输消息。面对底层拓扑结构、移动模式和用户及其查询密度的变化,固定的用户匿名算法无法提供足够的用户匿名水平,需要自适应机制来实现用户匿名。本文介绍了一种适用于动态和异构移动机会网络的灵活自适应的新方法——AdaptAnon。我们的方法是多维的,结合了基于用户配置文件、用户连接分析和匿名历史的多种启发式方法,以预测和决定可以帮助匿名发送节点的最佳节点集。在我们的演示中,我们展示了AdaptAnon在匿名层的节点数量和节点多样性方面实现了高质量的匿名,用于不同的查询强度和实时旧金山出租车移动跟踪,同时既没有降低成功率,也没有增加延迟。我们还将AdaptAnon与其他最先进的单维匿名方法进行了比较,并对性能参数进行了实时可视化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Adaptive user anonymity for mobile opportunistic networks
Current mobile opportunistic networks often use social routing protocols to transfer messages among users and to the services. In the face of changing underlying topology, mobility patterns and density of users and their queries, fixed algorithms for user anonymisation cannot provide sufficient level of user anonymity, and adaptive mechanisms for achieving user anonymity are needed. This paper describes a novel flexible and adaptive approach, AdaptAnon that is suitable for dynamic and heterogeneous mobile opportunistic networks. Our approach is multidimensional and combines multiple heuristics based on user profiles, analysis of user connectivity and history of anonymisation in order to predict and decide on the best set of nodes that can help anonymise the sending node. In our demonstration, we show that AdaptAnon achieves high quality of anonymisation in terms of both the number of nodes and the diversity of nodes in the anonymisation layer for varying query intensity and over live San Francisco cab mobility traces while neither decreasing success ratios nor increasing latency. We also compare AdaptAnon to other state of the art single dimensional anonymisation approaches and do real time visualization of performance parameters.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信