An Information-theoretic Model for Knowledge Sharing in Opportunistic Social Networks

被引:2
作者
ElSherief, Mai [1 ]
ElBatt, Tamer [2 ,3 ]
Zahran, Ahmed [2 ,3 ]
Helmy, Ahmed [4 ]
机构
[1] Univ Calif Santa Barbara, Dept Comp Sci, Santa Barbara, CA 93106 USA
[2] Nile Univ, WINC, Giza, Egypt
[3] Cairo Univ, Fac Engn, Giza, Egypt
[4] Univ Florida, Dept Comp & Informat Sci & Engn, Gainesville, FL USA
来源
2015 IEEE INTERNATIONAL CONFERENCE ON SMART CITY/SOCIALCOM/SUSTAINCOM (SMARTCITY) | 2015年
关键词
Modeling; information theory; opportunistic social networks; fundamental limits; numerical results;
D O I
10.1109/SmartCity.2015.111
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we establish fundamental limits on the performance of knowledge sharing in opportunistic social networks. In particular, we introduce a novel information-theoretic model to characterize the performance limits of knowledge sharing policies. Towards this objective, we first introduce the notions of knowledge gain and its upper bound, knowledge gain limit, per user. Second, we characterize these quantities for a number of network topologies and sharing policies. This work constitutes a first step towards defining and characterizing the performance limits and tradeoffs associated with knowledge sharing in opportunistic social networks. Finally, we present numerical results characterizing the cumulative knowledge gain over time and its upper bound, using publicly available smartphone data. The results confirm the key role of the proposed model to motivate future research in this ripe area of research as well as new knowledge sharing policies.
引用
收藏
页码:446 / 451
页数:6
相关论文
共 17 条
[1]   GRAPH THEORY AND SOCIAL NETWORKS - TECHNICAL COMMENT ON CONNECTEDNESS AND CONNECTIVITY [J].
BARNES, JA .
SOCIOLOGY-THE JOURNAL OF THE BRITISH SOCIOLOGICAL ASSOCIATION, 1969, 3 :215-232
[2]   The phase transition in inhomogeneous random graphs [J].
Bollobas, Bela ;
Janson, Svante ;
Riordan, Oliver .
RANDOM STRUCTURES & ALGORITHMS, 2007, 31 (01) :3-122
[3]  
Cover TM., 2006, ELEMENTS INFORM THEO, V2nd edn
[4]  
Diot C., 2012, ACM MOBIHOC
[5]   Inferring friendship network structure by using mobile phone data [J].
Eagle, Nathan ;
Pentland, Alex ;
Lazer, David .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2009, 106 (36) :15274-15278
[6]  
ElBatt T., 2009, IEEE T WIRELESS COMM, V8
[7]  
ElSherief M., 2014, P 2 SCI WORKSH CONJ
[8]  
ERDOS P, 1960, B INT STATIST INST, V38, P343
[9]   CENTRALITY IN SOCIAL NETWORKS CONCEPTUAL CLARIFICATION [J].
FREEMAN, LC .
SOCIAL NETWORKS, 1979, 1 (03) :215-239
[10]  
Jackson M.O., 2010, SOCIAL EC NETWORKS