Based on the analysis of the task sizes and the load, this paper discussps the granularity ofrelation spliting in the spliting phase taking acount of task load being less than average load,andprobes into the relations...Based on the analysis of the task sizes and the load, this paper discussps the granularity ofrelation spliting in the spliting phase taking acount of task load being less than average load,andprobes into the relationship between the granularity and load balancing. The minimum number ofbuckets is determined on the basis of relation spliting granularity,and the maximum number ofproduct tuples of each node is induced under the prerequisite for ensuring load balance in paralleljoin.展开更多
针对移动群体感知中感知数据能够如何更高效传输的问题,提出了一种移动群体感知中基于社会关系的路由算法RASR(routing algorithm based on social relations)。该算法根据个体间的接触概率利用G-N算法将整个网络划分为聚集性较强的社团...针对移动群体感知中感知数据能够如何更高效传输的问题,提出了一种移动群体感知中基于社会关系的路由算法RASR(routing algorithm based on social relations)。该算法根据个体间的接触概率利用G-N算法将整个网络划分为聚集性较强的社团,然后采用中介中心性和相似性两个特性度量个体的社会性,最后在数据传输的过程中,当前个体在相遇个体中选择与目标个体接触概率或者相对社会性效用较大的个体充当中继个体并复制当前数据,直至传输至目标个体。实验结果表明:RASR算法在保证传输成功率、减少平均传输延时的同时减少了数据副本量,从而降低了路由开销。因此,使用RASR算法能够有效地进行感知数据的传输。展开更多
文摘Based on the analysis of the task sizes and the load, this paper discussps the granularity ofrelation spliting in the spliting phase taking acount of task load being less than average load,andprobes into the relationship between the granularity and load balancing. The minimum number ofbuckets is determined on the basis of relation spliting granularity,and the maximum number ofproduct tuples of each node is induced under the prerequisite for ensuring load balance in paralleljoin.
文摘针对移动群体感知中感知数据能够如何更高效传输的问题,提出了一种移动群体感知中基于社会关系的路由算法RASR(routing algorithm based on social relations)。该算法根据个体间的接触概率利用G-N算法将整个网络划分为聚集性较强的社团,然后采用中介中心性和相似性两个特性度量个体的社会性,最后在数据传输的过程中,当前个体在相遇个体中选择与目标个体接触概率或者相对社会性效用较大的个体充当中继个体并复制当前数据,直至传输至目标个体。实验结果表明:RASR算法在保证传输成功率、减少平均传输延时的同时减少了数据副本量,从而降低了路由开销。因此,使用RASR算法能够有效地进行感知数据的传输。
