Social Aspects for Opportunistic Communication

Radu-Ioan Ciobanu, C. Dobre, V. Cristea, D. Al-Jumeily
{"title":"Social Aspects for Opportunistic Communication","authors":"Radu-Ioan Ciobanu, C. Dobre, V. Cristea, D. Al-Jumeily","doi":"10.1109/ISPDC.2012.41","DOIUrl":null,"url":null,"abstract":"As wireless and 3G networks become more crowded, users with mobile devices experience difficulties in accessing the network. Opportunistic networks, created between mobile phones using local peer-to-peer connections, have the potential to solve such problems by dispersing some of the traffic to neighbouring smart phones. Recently various opportunistic routing and dissemination algorithms were proposed and evaluated in various scenarios emulating real-world phenomena as close as possible. Such algorithms generally rely on mobility patterns of users and the context of communication. In this we investigate the addition of social data to improve the performance of communication algorithms and data transmission schema. When the routing decision is influenced by the chance of a particular user being able to successfully carry the data to the next hop, we believe that opportunistic communication algorithms could greatly benefit not only from learning the behaviour of users, but also their history of contacts coupled with the online social familiarity patterns between them. We believe users tend to be in contact more with familiar sets of users, with whom they share common interests. We investigate our approach using two real-world traces collected in two different environments. We first investigate our hypothesis using mobility data collected in an indoor academic environment. We then evaluate our assumptions in an outdoor urban scenario. We present an analysis of our findings, highlighting key social and mobility behaviour factors that can influence such opportunistic solutions. Most importantly, we show that by adding knowledge such as social links between participants in an opportunistic network routing and dissemination algorithms can be greatly improved.","PeriodicalId":287900,"journal":{"name":"2012 11th International Symposium on Parallel and Distributed Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 11th International Symposium on Parallel and Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPDC.2012.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

Abstract

As wireless and 3G networks become more crowded, users with mobile devices experience difficulties in accessing the network. Opportunistic networks, created between mobile phones using local peer-to-peer connections, have the potential to solve such problems by dispersing some of the traffic to neighbouring smart phones. Recently various opportunistic routing and dissemination algorithms were proposed and evaluated in various scenarios emulating real-world phenomena as close as possible. Such algorithms generally rely on mobility patterns of users and the context of communication. In this we investigate the addition of social data to improve the performance of communication algorithms and data transmission schema. When the routing decision is influenced by the chance of a particular user being able to successfully carry the data to the next hop, we believe that opportunistic communication algorithms could greatly benefit not only from learning the behaviour of users, but also their history of contacts coupled with the online social familiarity patterns between them. We believe users tend to be in contact more with familiar sets of users, with whom they share common interests. We investigate our approach using two real-world traces collected in two different environments. We first investigate our hypothesis using mobility data collected in an indoor academic environment. We then evaluate our assumptions in an outdoor urban scenario. We present an analysis of our findings, highlighting key social and mobility behaviour factors that can influence such opportunistic solutions. Most importantly, we show that by adding knowledge such as social links between participants in an opportunistic network routing and dissemination algorithms can be greatly improved.
机会主义交流的社会方面
随着无线和3G网络变得越来越拥挤,拥有移动设备的用户在访问网络时遇到了困难。在使用本地点对点连接的移动电话之间创建的机会网络,有可能通过将一些流量分散到邻近的智能电话来解决这些问题。最近提出了各种机会路由和传播算法,并在尽可能接近现实世界现象的各种场景中进行了评估。这种算法通常依赖于用户的移动模式和通信环境。在本文中,我们研究了社会数据的添加,以提高通信算法和数据传输模式的性能。当路由决策受到特定用户能够成功地将数据传输到下一跳的机会的影响时,我们认为机会通信算法不仅可以从学习用户的行为中获益,还可以从他们的联系历史以及他们之间的在线社交熟悉模式中获益。我们相信用户更倾向于与熟悉的用户群接触,因为他们有共同的兴趣。我们使用在两个不同环境中收集的两个真实世界轨迹来研究我们的方法。我们首先使用在室内学术环境中收集的流动性数据来调查我们的假设。然后,我们在室外城市场景中评估我们的假设。我们对我们的研究结果进行了分析,强调了可能影响这种机会主义解决方案的关键社会和流动性行为因素。最重要的是,我们表明,在机会主义网络中,通过增加参与者之间的社会联系等知识,路由和传播算法可以大大改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信