Quantifying individual communication capability in opportunistic mobile social networks

Q. Cai, Yuqing Bai, Limin Sun, J. Niu
{"title":"Quantifying individual communication capability in opportunistic mobile social networks","authors":"Q. Cai, Yuqing Bai, Limin Sun, J. Niu","doi":"10.1109/ComComAp.2014.7017160","DOIUrl":null,"url":null,"abstract":"Conventional methods with measuring information propagation in static networks mainly rely on paths or the shortest path connecting nodes, whereas in opportunistic mobile social networks the existence of a path or the shortest path between nodes cannot be assumed due to the dynamic topological partition nature of the networks. This paper extends the concept of walk to dynamic settings and combines it with the Green's function that originates from statistical physics to quantify how much information flows through each node in the networks changing over time. By means of the time-evolving graph model and the calculation of weighted combinatorial dynamic walks on the graph, a concise theoretic result is derived to account for the relative information propagation capability of each mobile node based on the historical contacts. In addition, the iteration-form result can be conveniently computed at any time point and therefore can be used for predicting the future network behavior when the time interval is appropriately chosen in specific scenarios. Extensive experiments are conducted based on four real trace datasets and the results show that, the formula derived in this paper is very effective at quantifying the information that flows through each mobile node.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Computers, Communications and IT Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ComComAp.2014.7017160","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Conventional methods with measuring information propagation in static networks mainly rely on paths or the shortest path connecting nodes, whereas in opportunistic mobile social networks the existence of a path or the shortest path between nodes cannot be assumed due to the dynamic topological partition nature of the networks. This paper extends the concept of walk to dynamic settings and combines it with the Green's function that originates from statistical physics to quantify how much information flows through each node in the networks changing over time. By means of the time-evolving graph model and the calculation of weighted combinatorial dynamic walks on the graph, a concise theoretic result is derived to account for the relative information propagation capability of each mobile node based on the historical contacts. In addition, the iteration-form result can be conveniently computed at any time point and therefore can be used for predicting the future network behavior when the time interval is appropriately chosen in specific scenarios. Extensive experiments are conducted based on four real trace datasets and the results show that, the formula derived in this paper is very effective at quantifying the information that flows through each mobile node.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
量化机会移动社交网络中的个人通信能力
静态网络中测量信息传播的传统方法主要依赖于连接节点的路径或最短路径,而在机会性移动社交网络中,由于网络的动态拓扑划分性质,无法假设节点之间存在路径或最短路径。本文将步行的概念扩展到动态环境中,并将其与源于统计物理学的格林函数相结合,以量化随时间变化的网络中每个节点的信息流。通过时间演化图模型和图上加权组合动态行走的计算,推导出一个简明的理论结果来解释基于历史接触的各移动节点的相对信息传播能力。此外,迭代形式的结果可以方便地在任何时间点计算,因此在特定场景中,只要选择适当的时间间隔,就可以用于预测未来的网络行为。基于四个实际跟踪数据集进行了大量实验,结果表明,本文推导的公式可以非常有效地量化流经每个移动节点的信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fast acquisition method of navigation receiver based on folded PMF-FFT Web service sub-chain recommendation leveraging graph searching Path prediction based on second-order Markov chain for the opportunistic networks A novel UEP resource allocation scheme for layered source transmission in COFDM systems Energy efficient scheduling with probability and task migration considerations for soft real-time systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1