Message Delivery Techniques using Group Intimacy Information among Nodes in Opportunistic Networks
暂无分享,去创建一个
In opportunistic networks, each message is delivered to the destination by repeating, storing, carrying, and forwarding the message. Recently, with the vitalization of social networks, a large number of existing articles have shown performance improvement when delivering the message and considering its social relational networks. However, these works only deliver messages when they find nodes, assuming that every node cooperates with each other unconditionally. Moreover, they only consider the number of short-term contacts and local social relations, but have not considered each node's average relation with the destination node. In this paper, we propose novel message sending techniques for opportunistic networks using nodes' social network characteristics. In this scheme, each message is delivered to the destination node with fewer copies by delivering it mostly through nodes that have high intimacy with the destination node. We are showing that our proposed scheme presents a 20% performance increase compared to existing schemes.
[1] Ying Zhu,et al. A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects , 2013, IEEE Communications Surveys & Tutorials.
[2] Sergey Brin,et al. The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.
[3] Yong-hwan Kim,et al. Local Information-based Betweenness Centrality to Identify Important Nodes in Social Networks , 2013 .