|
|
- 2016
采用传递概率与社会网络分析的 延迟容忍网络路由
|
Abstract:
结合了传递概率与社会网络分析的路由设计,可以充分利用网络中节点的运动特性增强端到端的消息传输质量。通过对节点进行相遇历史信息分析和社会关系分析,提出了基于传递概率与社会网络分析的延迟容忍网络路由(RPRSA)。相遇历史信息分析是通过节点在相遇时进行独立概率计算和彼此概率信息交换,使得节点可以预测它在短期内的移动特性;社会关系分析是通过节点在长期内的移动所形成的关系亲疏程度,使得节点可以预测它的长期运动规律。仿真结果表明,该路由算法能够很好地利用节点的运动特性,保证弱社会关系节点和孤立节点有更好的消息传输质量,更好地提高节点端到端的消息传输质量。
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
| [1] | ［7］FREEMAN L C. A set of measures of centrality based on betweenness ［J］. Sociometry, 1977, 40(1): 35？？41. |
| [2] | ［4］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. |
| [3] | ［5］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. |
| [4] | BAI Rujiang, LENG Fuhai. Knowledge innovational evolution analysis based on k？？clique community network ［J］. Library and Information Service, 2013, 57(17): 86？？94. |
| [5] | ［9］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. |
| [6] | ［10］EVERETT M G, BORGATTI S P. Analyzing clique overlap ［J］. Connections, 1998, 21(1): 49？？61. |
| [7] | ［11］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. |
| [8] | ［1］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. |
| [9] | ［2］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. |
| [10] | ［6］EVERETT M, BORGATTI S P. Ego network betweenness ［J］. Social Networks, 2005, 27(1): 31？？38. |
| [11] | ［8］白如江, 冷伏海. k？？clique 社区知识创新演化方法研究 ［J］. 图书情报工作, 2013, 57(17): 86？？94. |
| [12] | ［3］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. |
| [13] | ［12］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. |
| [14] | ［13］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. |
| [15] | ［14］EAGLE N, PENTLAND A. Reality mining: sensing complex social systems ［J］. Personal and Ubiquitous Computing, 2006, 10(4): 255？？268. |
