{"title":"量化机会移动社交网络中的个人通信能力","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":"{\"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}","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}
Quantifying individual communication capability in opportunistic mobile social networks
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.