采用传递概率与社会网络分析的延迟容忍网络路由

杨沫; 由磊; 李冰; 赵建军

doi:10.7652/xjtuxb201612021

您当前的位置：

首页 >

文章列表页 >

采用传递概率与社会网络分析的延迟容忍网络路由

更新时间：2025-07-09

- 采用传递概率与社会网络分析的延迟容忍网络路由
- A Delay-Tolerant Network Routing Based on Probability of Relay and Social Network Analysis
- 西安交通大学学报 2016年50卷第12期页码：136-141
- 作者机构：
  
  天津大学电子信息工程学院,天津,300072
- 作者简介：
- 基金信息：
  
  : 2016-08-01。作者简介: 杨沫(1990—),男,硕士生;由磊(通信作者),男,讲师。基金项目: 国家自然科学基金资助项目(61202380);天津市自然科学基金资助项目(12JCQNJC00300)
- DOI：10.7652/xjtuxb201612021
  中图分类号： TP393
- 网络首发：2016-12-10，
  
  纸质出版：2016
- 稿件说明：
移动端阅览
杨沫, 由磊, 李冰, 等. 采用传递概率与社会网络分析的延迟容忍网络路由[J]. 西安交通大学学报, 2016,50(12):136-141.

A Delay-Tolerant Network Routing Based on Probability of Relay and Social Network Analysis[J]. 2016, 50(12): 136-141.
杨沫, 由磊, 李冰, 等. 采用传递概率与社会网络分析的延迟容忍网络路由[J]. 西安交通大学学报, 2016,50(12):136-141. DOI： 10.7652/xjtuxb201612021.

A Delay-Tolerant Network Routing Based on Probability of Relay and Social Network Analysis[J]. 2016, 50(12): 136-141. DOI： 10.7652/xjtuxb201612021.

摘要

结合了传递概率与社会网络分析的路由设计

可以充分利用网络中节点的运动特性增强端到端的消息传输质量。通过对节点进行相遇历史信息分析和社会关系分析

提出了基于传递概率与社会网络分析的延迟容忍网络路由(RPRSA)。相遇历史信息分析是通过节点在相遇时进行独立概率计算和彼此概率信息交换

使得节点可以预测它在短期内的移动特性; 社会关系分析是通过节点在长期内的移动所形成的关系亲疏程度

使得节点可以预测它的长期运动规律。仿真结果表明

该路由算法能够很好地利用节点的运动特性

保证弱社会关系节点和孤立节点有更好的消息传输质量

更好地提高节点端到端的消息传输质量。

Abstract

Routing designs that combine with relay probability and social network analysis can fully utilize movement characteristic of nodes and enhance quality of message transmission from end to end. A delay-tolerant network routing based on probability of relay and social network analysis(RPRSA)is proposed based on the analyses of historical information of nodes encounters and social relationship. The analysis of historical information is to forecast short-run movement characteristic by independent probability computation and probability information exchange with each other when nodes encounter

and the analysis of social relation is to forecast long-run movement law by the degree of intimacy among nodes formed in long-run movements. Simulation results show that the proposed routing makes full use of movement features among nodes

guarantees the quality of messages transmission among the nodes with weak social relation and the isolate nodes

and enhances the quality of messages transmission from end to end.

关键词

Keywords

references

FALL K. A delay-tolerant network architecture for challenged internets [C]∥Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York, USA: ACM, 2003: 27-34.

DALY E M, HAAHR M. Social network analysis for routing in disconnected delay-tolerant MANETs [C]∥Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing. New York, USA: ACM, 2007: 32-40.

BETTSTETTER C. Mobility modeling in wireless networks: categorization, smooth movement, and border effects [J]. ACM Sigmobile Mobile Computing and Communications Review, 2001, 5(3): 55-66.

HUI P, CROWCROFT J, YONEKI E. Bubble Rap: social-based forwarding in delay-tolerant networks [J]. IEEE Transactions on Mobile Computing, 2011, 10(11): 1576-1589.

JONES E P C, LI L, SCHMIDTKE J K, et al. Practical routing in delay-tolerant networks [J]. IEEE Transactions on Mobile Computing, 2007, 6(8): 943-959.

EVERETT M, BORGATTI S P. Ego network betweenness [J]. Social Networks, 2005, 27(1): 31-38.

FREEMAN L C. A set of measures of centrality based on betweenness [J]. Sociometry, 1977, 40(1): 35-41.

白如江, 冷伏海. k-clique 社区知识创新演化方法研究 [J]. 图书情报工作, 2013, 57(17): 86-94.

BAI Rujiang, LENG Fuhai. Knowledge innovational evolution analysis based on k-clique community network [J]. Library and Information Service, 2013, 57(17): 86-94.

HUI P, YONEKI E, CHAN S Y, et al. Distributed community detection in delay tolerant networks [C]∥Proceedings of the Second ACM/IEEE International Workshop on Mobility in the Evolving Internet Architecture. New York, USA: ACM, 2007: 7.

EVERETT M G, BORGATTI S P. Analyzing clique overlap [J]. Connections, 1998, 21(1): 49-61.

HUI P, CROWCROFT J. How small labels create big improvements [C]∥Proceedings of the 2007 IEEE International Conference on Pervasive Computing and Communications Workshop. Piscataway, NJ, USA: IEEE, 2007: 65-70.

LINDGREN A, DORIA A, SCHELEN O. Probabilistic routing in intermittently connected networks [J]. ACM Sigmobile Mobile Computing and Communications Review, 2003, 7(3): 19-20.

POTTENGER W M, YANG T. Detecting emerging concepts in textual data mining [C]∥Proceedings of the 2002 Society for Industrial and Applied Mathematics. New York, USA: ACM, 2002: 89-105.

EAGLE N, PENTLAND A. Reality mining: sensing complex social systems [J]. Personal and Ubiquitous Computing, 2006, 10(4): 255-268.

赵皓,高智勇,高建民,等.一种采用相空间重构的多源数据融合方法.2016,50(8):84-89.[doi:10.7652/xjtuxb201608 014]

赵博选,高建民,陈琨.求解多目标柔性作业车间调度问题的两阶段混合Pareto蚁群算法.2016,50(7):145-151.[doi:10.7652/xjtuxb201607022]

刘岳镭,冯祖仁,任晓栋.具有恶化效应的双代理单机最优调度算法.2016,50(6):9-14.[doi:10.7652/xjtuxb201606002]

刘强,董小社,朱正东,等.一种短作业环境下的延迟调度算法.2015,49(2):1-5.[doi:10.7652/xjtuxb201502001]

崔颖安,李雪,夏辉,等.面向社交媒体嵌入关系数据感知方法的研究.2015,49(2):31-36.[doi:10.7652/xjtuxb201502 006]

陈家旭,唐亚哲,胡成臣,等.延迟容忍网络中基于地点偏好的社会感知多播路由协议设计.2014,48(6):13-18.[doi:10.7652/xjtuxb201406003]

赵晓明,周颢,何军,等.视频点播系统中视频分片协同存储方案研究.2014,48(4):26-30.[doi:10.7652/xjtuxb201404 005]

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

超临界水异常区域热力学特性研究

隧道内燃料电池汽车氢气泄漏扩散特性及影响因素

采用机器学习的大规模并行程序I/O性能建模与预测方法

采用试验设计方法的第三代CO2气体箔轴承箔片几何参数敏感性分析

扇贝仿生密封腔室内超临界二氧化碳泄漏流湍动能耗散机理研究