文章基本信息

标题：A Routing Mechanism Based on Social Networks and Betweenness Centrality in Delay-Tolerant Networks
本地全文：下载
作者：Zhang Huijuan ; Liu Kai
期刊名称：International Journal of Computer Science & Information Technology (IJCSIT)
印刷版ISSN：0975-4660
电子版ISSN：0975-3826
出版年度：2015
卷号：7
期号：6
页码：107
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：With the growing popularity of mobile smart devices, the existing networks are unable to meet therequirement of many complex scenarios; current network architectures and protocols do not work well withthe network with high latency and frequent disconnections. To improve the performance of these networkssome scholars opened up a new research field, delay-tolerant networks, in which one of the importantresearch subjects is the forwarding and routing mechanism of data packets. This paper presents a routingscheme based on social networks owing to the fact that nodes in computer networks and social networkshave high behavioural similarity. To further improve efficiency this paper also suggests a mechanism,which is the improved version of an existing betweenness centrality based routing algorithm [1]. Theexperiments showed that the proposed scheme has better performance than the existing friendship routingalgorithms
关键词：Delay-Tolerant Network; Social Network; Routing Mechanism.