| 移动社会网络中基于活动的消息机会转发 |
| |
| 引用本文： | 张胜,王瑜,包晓玲,姚明辉,黄毅,时招军. 移动社会网络中基于活动的消息机会转发[J]. 软件学报, 2017, 28(S1): 71-84 |
| |
| 作者姓名： | 张胜 王瑜 包晓玲 姚明辉 黄毅 时招军 |
| |
| 作者单位： | 南昌航空大学 信息工程学院, 江西 南昌 330063,南昌航空大学 信息工程学院, 江西 南昌 330063,南昌航空大学 外国语学院, 江西 南昌 330063,南昌航空大学 信息工程学院, 江西 南昌 330063,南昌航空大学 信息工程学院, 江西 南昌 330063,南昌航空大学 信息工程学院, 江西 南昌 330063 |
| |
| 基金项目： | 国家自然科学基金（61162002，61661037）；江西省自然科学基金（20151BAB207038）；南昌航空大学研究生创新专项基金（YC2016012） |
| |
| 摘 要： | 针对移动社会网络中节点移动形成的成簇特性和节点参与活动表现的周期特点，提出了一种基于活动的消息机会转发算法（activity-based message opportunistic forwarding，简称AMOF）.算法思想是：当消息携带节点与目的节点存在相同活动时，选择消息交付概率高的中继节点转发消息；当消息携带节点与目的节点不存在相同活动时，选择消息间接交付概率高的链路来转发消息.仿真结果表明，与经典路由算法（如Epidemic，PRoPHET，CMOT和CMTS）比较，所提出的路由算法不仅能够提高消息的传输成功率，还能有效地降低传输时延和网络负载.
|
| 关 键 词： | 移动社会网络 消息转发 时空特性 活动 交付概率 |
| 收稿时间： | 2017-05-15 |
Activity-Based Message Opportunistic Forwarding in Mobile Social Networks |
| |
| ZHANG Sheng,WANG Yu,BAO Xiao-Ling,YAO Ming-Hui,HUANG Yi and SHI Zhao-Jun. Activity-Based Message Opportunistic Forwarding in Mobile Social Networks[J]. Journal of Software, 2017, 28(S1): 71-84 |
| |
| Authors: | ZHANG Sheng WANG Yu BAO Xiao-Ling YAO Ming-Hui HUANG Yi SHI Zhao-Jun |
| |
| Affiliation: | School of Information Engineering, Nanchang Hangkong University, Nanchang 330063, China,School of Information Engineering, Nanchang Hangkong University, Nanchang 330063, China,School of Foreign Language, Nanchang Hangkong University, Nanchang 330063, China,School of Information Engineering, Nanchang Hangkong University, Nanchang 330063, China,School of Information Engineering, Nanchang Hangkong University, Nanchang 330063, China and School of Information Engineering, Nanchang Hangkong University, Nanchang 330063, China |
| |
| Abstract: | In mobile social networks, nodes are clustered by their interests and hobbies, and take part in some activities periodically. This paper puts forward an activity-based message opportunistic forwarding algorithm (AMOF) for the network characteristics. The main idea is that the biggest delivery probability node is selected and message is transferred to it, if the source node and destination node are both present in the same activities. While they are not in the same activities, the best link of the indirect delivery probability is found, and message will be transferred to it. Simulation results show that the proposed routing algorithm can not only improve the success of message delivery, but also reduce the network delay and overhead, compared with classical routing algorithms, such as Epidemic, PRoPHET, CMOT and CMTS. |
| |
| Keywords: | mobile social network message forwarding time-space characteristics activity delivery probability |
|
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
|
