SOCIAL POPULARITY BASED ROUTING IN DELAY TOLERANT NETWORKS

被引:21
作者
Song, Youmei [1 ]
Li, Jianbo [1 ]
Li, Chenglong [1 ]
Wang, Fushu [1 ]
机构
[1] Qingdao Univ, Inst Comp Sci & Technol, Qingdao, Peoples R China
基金
中国国家自然科学基金;
关键词
Delay Tolerant Networks; routing algorithm; social group; cohesion; popularity;
D O I
10.21307/ijssis-2017-935
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Due to node's mobility, Delay Tolerant Networks (DTNs) feature the nonexistence of end-toend path between source and destination, frequent topology partitions and extremely high delivery latency, thus posing great challenges to successful message transmission. To improve routing performance and provide high quality communication service, nodes' social characteristics are exploited to routing design recently. Hence, a social popularity based routing algorithm is proposed, named SPBR which takes the inter-contact time and multi-hop neighbor information into consideration. In this paper, we first introduce a method to detect the quality of relation between pair of nodes accurately. Used the reliable relationships, social popularity is proposed to evaluate the social power of node in the network. SPBR makes the routing decisions based on the popularity, leading message closer to destinations with low hops of routing and network resources. Extensive simulations are conducted and the results show that the proposed algorithm significantly improves routing performances compared to Epidemic, Prophet and First Contact (FC), especially SPBR is lower by about 55.1% in overhead ratio and higher by about 22.2% in delivery rate than Epidemic when there are 40 nodes in the networks.
引用
收藏
页码:1687 / 1709
页数:23
相关论文
共 21 条
[1]  
Ott J., Delay tolerance and the future internet, Proceedings of the 11th International Symposium on Wireless Personal Multimedia Communications, 26, pp. 30-37, (2008)
[2]  
Vastardis N., Yang K., Mobile social networks: architecture, social properties, and key research challenges, IEEE Communications Surveys & Tutorials, 15, 3, pp. 1355-1371, (2013)
[3]  
Liu J.Y., Wu L., Gong H.G., Utility based data gathering in mobile sensor network, International Journal on Smart Sensing and Intelligent Systems, 6, 3, pp. 953-972, (2013)
[4]  
Xu J., Feng X., Wang R.C., Adaptive spray routing for opportunistic networks, International Journal on Smart Sensing and Intelligent Systems, 6, 1, pp. 95-119, (2013)
[5]  
Soares T., Vasco N.G.J., Rodrigues F., Et al., GeoSpray: a geographic routing protocol for vehicular delay-tolerant networks, Information Fusion, 15, pp. 102-113, (2014)
[6]  
Peraira P.R., Casaca A., Rodrigues J.J.P.C., Et al., From delay-tolerant networks to vehicular delay-tolerant networks, IEEE Communications Surveys & Tutorials, 14, 4, pp. 1166-1182, (2012)
[7]  
Guo Z., Wang B., Cui J.H., Generic prediction assisted single-copy routing in underwater delay tolerant sensor networks, Ad Hoc Networks, 11, 3, pp. 1136-1149, (2013)
[8]  
Vastardis N., Yang K., Mobile social networks: architecture, social properties, and key research challenges, IEE Communications Surveys & Tutorials,, 15, 3, pp. 1355-1371, (2013)
[9]  
Li Y., Qiu L., Jin D., Et al., Contact duration aware evaluation for content dissemination delay in mobile social network, Wireless Communications and Mobile Computing, 15, 3, pp. 527-537, (2015)
[10]  
Gao L.X., Li M., Zhou W.L., Et al., Multidimensional routing protocol in human-associated delay-tolerant networks, IEEE Transactions on Mobile Computing, 12, 11, pp. 2132-2144, (2013)