Socially-Aware Multi-phase Opportunistic Routing for Distributed Mobile Social Networks

被引:0
作者
Nikolaos Vastardis
Kun Yang
Supeng Leng
机构
[1] University of Essex,School of Computer Science and Electronics Engineering
[2] University of Electronic Science and Technology of China,School of Communication and Information Engineering
来源
Wireless Personal Communications | 2014年 / 79卷
关键词
Mobile social networks; Social ties; Multi-phase ; Opportunistic routing; Social network discovery; OMNeT++;
D O I
暂无
中图分类号
学科分类号
摘要
The work presented in this paper focuses on opportunistic routing in distributed Mobile Social Networks (MSNs). It proposes a novel routing protocol called Socially-Aware Multi-Phase Opportunistic (SAMPhO), where the routing procedure for each message is carried out in multiple phases. From the various socially aware metrics considered, ego-betweenness and tie strength are selected to be utilized according to the conditions of the social environment. Previous research on the area suggests that different metrics are useful in different conditions. However, only recently steps towards this direction are taken. To evaluate the proposed hypothesis, a simulated delay tolerant MSN was introduced in the OMNeT++ environment using a framework, developed as part of this work. It is called Socially-Aware Opportunistic Routing System (SAORS) and its modular design facilitates further research in opportunistic networks. The routing mechanism is divided in three independent stages, with SAORS focusing on providing the necessary functionality for the first one. The simulation results drawn clearly demonstrate the scalability and improved performance of SAMPhO, especially in highly social scenarios. It is shown to be both more efficient and effective than previous algorithms, in terms of bandwidth and memory utilization, and delivery rates respectively. However, it relies greatly on the accuracy of the social tie detection, since the copy generation is very limited.
引用
收藏
页码:1343 / 1368
页数:25
相关论文
共 2 条
[1]  
Newman MEJ(2004)Finding and evaluating community structure in networks Physical Review E 69 026113-undefined
[2]  
Girvan M(undefined)undefined undefined undefined undefined-undefined