A Social Aware Routing Protocol with Multi-social Features in Opportunistic Mobile Social Networks

被引:1
作者
Yang, Yibo [1 ]
Zhao, Honglin [1 ]
机构
[1] Harbin Inst Technol, Commun Res Ctr, Sch Elect & Informat Engn, Harbin, Heilongjiang, Peoples R China
来源
COMMUNICATIONS, SIGNAL PROCESSING, AND SYSTEMS | 2019年 / 463卷
关键词
Opportunistic Mobile Social Networks; Geo-information; Social aware; Interest; Routing; COMMUNITY;
D O I
10.1007/978-981-10-6571-2_43
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
With the widespread popularity and usage of ICT around the world, the ubiquity of data collection and transmission change our daily life and the society. Opportunistic Mobile Social Networks (OMSNs), formed by people moving around with mobile devices, enhance spontaneous communication among users that opportunistically encounter each other can be exploited to improve the performance of data forwarding. Existing protocols take advantage of spatial contact frequency and social characteristics to enhance transmission performance. However, they have not exploited enough of the relations and the effects between geographical information, social features and user interests. In this paper, we first evaluate these three characteristics of users and design a routing protocol call Geo-Social-Interest (GSI) protocol to select optimal relay nodes. We adopt Improved Optimal Routing (IOR) strategy to enhanced dynamic social features to more capture node's social behavior to efficiently improve the routing protocol. We compare the performance of GSI to Epidemic and SimBet routing protocols using real INFOCOM06 data sets. The experiment results demonstrate that GSI overcomes the other protocols with highest data delivery ratio and low communication overhead.
引用
收藏
页码:353 / 360
页数:8
相关论文
共 13 条
[1]   Efficient Multicast Algorithms in Opportunistic Mobile Social Networks using Community and Social Features [J].
Chen, Xiao ;
Shang, Charles ;
Wong, Britney ;
Li, Wenzhong ;
Oh, Suho .
COMPUTER NETWORKS, 2016, 111 :71-81
[2]  
Daly E, 2007, MOBIHOC'07: PROCEEDINGS OF THE EIGHTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, P32
[3]   Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs [J].
Daly, Elizabeth M. ;
Haahr, Mads .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2009, 8 (05) :606-621
[4]  
Gao Z., 2015, INT J MOD PHYS C, V26, P1
[5]  
Keranen Ari, 2009, P 2 INT C SIM TOOLS, P1, DOI 10.4108/ICST.SIMUTOOLS2009.5674
[6]   GrAnt: Inferring best forwarders from complex networks' dynamics through a greedy Ant Colony Optimization [J].
Kochem Vendramin, Ana Cristina ;
Munaretto, Anelise ;
Delgado, Myriam Regattieri ;
Viana, Aline Carneiro .
COMPUTER NETWORKS, 2012, 56 (03) :997-1015
[7]   Geo-Social Distance-Based Data Dissemination for Socially Aware Networking [J].
Li, Jie ;
Ning, Zhaolong ;
Jedari, Behrouz ;
Xia, Feng ;
Lee, Ivan ;
Tolba, Amr .
IEEE ACCESS, 2016, 4 :1444-1453
[8]   Birds of a feather: Homophily in social networks [J].
McPherson, M ;
Smith-Lovin, L ;
Cook, JM .
ANNUAL REVIEW OF SOCIOLOGY, 2001, 27 :415-444
[9]   Detecting community structure in networks [J].
Newman, MEJ .
EUROPEAN PHYSICAL JOURNAL B, 2004, 38 (02) :321-330
[10]  
Scott James., 2009, CRAWDAD trace cambridge/haggle/imote/infocom2006 (v. 2009-05-29)