首页> 外文OA文献 >MSSN: An Attribute-Aware Transmission Algorithm Exploiting Node Similarity for Opportunistic Social Networks
【2h】

MSSN: An Attribute-Aware Transmission Algorithm Exploiting Node Similarity for Opportunistic Social Networks

机译:MSSN:用于机会社交网络的节点相似性的属性感知传输算法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Recently, with the development of big data and 5G networks, the number of intelligent mobile devices has increased dramatically, therefore the data that needs to be transmitted and processed in the networks has grown exponentially. It is difficult for the end-to-end communication mechanism proposed by traditional routing algorithms to implement the massive data transmission between mobile devices. Consequently, opportunistic social networks propose that the effective data transmission process could be implemented by selecting appropriate relay nodes. At present, most existing routing algorithms find suitable next-hop nodes by comparing the similarity degree between nodes. However, when evaluating the similarity between two mobile nodes, these routing algorithms either consider the mobility similarity between nodes, or only consider the social similarity between nodes. To improve the data dissemination environment, this paper proposes an effective data transmission strategy (MSSN) utilizing mobile and social similarities in opportunistic social networks. In our proposed strategy, we first calculate the mobile similarity between neighbor nodes and destination, set a mobile similarity threshold, and compute the social similarity between the nodes whose mobile similarity is greater than the threshold. The nodes with high mobile similarity degree to the destination node are the reliable relay nodes. After simulation experiments and comparison with other existing opportunistic social networks algorithms, the results show that the delivery ratio in the proposed algorithm is 0.80 on average, the average end-to-end delay is 23.1% lower than the FCNS algorithm (A fuzzy routing-forwarding algorithm exploiting comprehensive node similarity in opportunistic social networks), and the overhead on average is 14.9% lower than the Effective Information Transmission Based on Socialization Nodes (EIMST) algorithm.
机译:最近,随着大数据和5G网络的发展,智能移动设备的数量急剧增加,因此在网络中需要传输和处理的数据已经指数增长。传统路由算法提出的端到端通信机制难以实现移动设备之间的大规模数据传输。因此,机会主义的社交网络建议通过选择适当的中继节点来实现有效的数据传输过程。目前,大多数现有路由算法通过比较节点之间的相似度来找到合适的下跳节点。但是,在评估两个移动节点之间的相似性时,这些路由算法考虑节点之间的移动性相似,或者仅考虑节点之间的社交相似性。为了改善数据传播环境,本文提出了利用机会主义社交网络中的移动和社会相似性的有效数据传输策略(MSSN)。在我们提出的策略中,我们首先计算邻居节点和目的地之间的移动相似性,设置移动相似度阈值,并计算移动相似度大于阈值的节点之间的社交相似性。具有高移动相似度到目标节点的节点是可靠的继电器节点。在仿真实验和与其他现有的机会社交网络算法的比较之后,结果表明,所提出的算法中的输送比率平均为0.80,平均端到端延迟比FCNS算法低23.1%(模糊路由 - 在机会主义社交网络中利用综合节点相似性的转发算法),平均的开销比基于社交节点(EIMST)算法的有效信息传输低14.9%。

著录项

  • 作者

    Mei Guo; Min Xiao;

  • 作者单位
  • 年度 2019
  • 总页数
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号