移动群体感知中基于社会关系的路由算法  

Mobile group awareness routing algorithm based on social relations

作　　者：张魏斌[1] 曾锋[1] 伍泽全 谭紫逸 Zhang Weibin;Zeng Feng;Wu Zequan;Tan Ziyi(School of Software, Central South University, Changsha 410015 , China)

机构地区：[1]中南大学软件学院,长沙410075

出　　处：《计算机应用研究》2016年第10期3128-3131,3142,共5页Application Research of Computers

基　　金：国家自然科学基金资助项目(61103202);高等学校博士学科点专项科研基金资助课题(20110162120046);中南大学教师研究基金资助项目(2014JSJJ019);中南大学硕士生自主探索创新资助项目(2016zzts386;2016zzts389)

摘　　要：针对移动群体感知中感知数据能够如何更高效传输的问题,提出了一种移动群体感知中基于社会关系的路由算法RASR(routing algorithm based on social relations)。该算法根据个体间的接触概率利用G-N算法将整个网络划分为聚集性较强的社团,然后采用中介中心性和相似性两个特性度量个体的社会性,最后在数据传输的过程中,当前个体在相遇个体中选择与目标个体接触概率或者相对社会性效用较大的个体充当中继个体并复制当前数据,直至传输至目标个体。实验结果表明:RASR算法在保证传输成功率、减少平均传输延时的同时减少了数据副本量,从而降低了路由开销。因此,使用RASR算法能够有效地进行感知数据的传输。In the problem of how to transmit the data in the perception of mobile group effectively , this paper proposed a mobile group perception routing algorithm based on social rela tions RASR ( routing algorithm based on social relations ). The a lgo rithm was based on the probability of contact between in dividuals GN algo rithm utilizing the whole netw ork was d ivid e d in toclusters o f strong association, then used m ediation centers and s im ila rity to measure two characteristics of individual social. F ina lly d u rin g data transfer, the current individual selection o f the target in d iv id u a l or re la tive p ro b a b ility o f contact w ith the socia l u tility o f large in d iv id u a l to act as in dividual relay and copy the data currently in the en counter in dividuals until the transmission was to target individuals . The results show th a t: RASR algorithm s ensure transm ission success ra te , re ducing the averagetransm ission delay while reducing the amount of data copies , thereby re ducing the ro u tin g overhead. T h e re fo re , using RASR algorithm can transmit perception data effective ly.

关 键 词：移动群体感知 社会关系社团划分 接触概率 社会效用路由算法 

分 类 号：TB393.04[一般工业技术—材料科学与工程]