期刊文献+

VANET随机部署环境下基于改进型共享最近邻密度峰聚类的快速分簇算法

Fast Clustering Algorithm Using Improved Shared-Nearest-Neighbor-based Density Peaks Clustering in Random Deployment Environment of VANET
下载PDF
导出
摘要 针对车辆高速移动场景下,网络拓扑变化过大导致网络分簇结果不稳定的问题,提出一种基于改进型共享最近邻密度峰聚类的快速成簇算法SNNCA(shared nearest neighbor clustering algorithm);通过综合考虑节点的链路生存周期和移动相似性,提出一种全新的节点连接稳定程度评估指标,并将该评估指标应用于节点共享最近邻的计算过程,以组织网络节点为划分合理的多跳簇结构;为适应网络环境的动态变化,提出一种簇维护策略,其中每个层级的簇成员承担着维护下一层级簇成员的任务,该策略能够对簇成员进行批量分离或合并,从而实现了算法的分布式快速收敛;根据随机部署场景中进行的仿真实验结果显示,相比其他较新算法,SNNCA算法降低了74%的簇数量,并且簇成员的平均存活时间增加了近1倍,表现出更好的网络稳定性和健壮性。 For the issue of unstable network clustering results due to excessive network topology changes in high-speed vehicle movement scenarios,a fast clustering algorithm for shared nearest neighbor clustering algorithm(SNNCA)based on the improved shared-nearest-neighbor-based density peak clustering is proposed.By comprehensively considering the node s link survival period and movement similarity,a novel node connection stability evaluation metric is proposed.The metric is utilized in the shared nearest neighbor calculation process of the node to organize the network nodes into reasonable multi-hop cluster structure.To adapt to the dynamic changes in the network environment,a cluster maintenance strategy is introduced,where each level of cluster members takes on the task of maintaining the next level of cluster members,and this strategy can perform the batch separation or merging of cluster members,and realize the distributed and rapid convergence of the algorithm.the simulation results of the random deployment scenario show that compared to other newer algorithms,the SNNCA algorithm reduces 74%of cluster numbers,and the average survival time of cluster members has nearly doubled,demonstrating better stability and robustness of the network.
作者 陈靖宇 徐志林 CHEN Jingyu;XU Zhilin(School of Computing,Guangdong University of Technology,Guangzhou 510006,China)
出处 《计算机测量与控制》 2023年第9期174-182,共9页 Computer Measurement &Control
关键词 车载自组织网络 快速分簇算法 共享最近邻 密度峰聚类 随机部署场景 多跳簇结构 vehicular ad hoc network(VANET) fast clustering algorithm shared nearest neighbor density peak clustering random deployment scenario multi-hop cluster
  • 相关文献

参考文献4

二级参考文献75

  • 1时锐,杨孝宗.自组网Random Direction移动模型点空间概率分布的研究[J].计算机研究与发展,2004,41(7):1166-1173. 被引量:11
  • 2康槿,陈彦辉.无线网络中的移动模型[J].电子科技,2005,18(8):62-64. 被引量:3
  • 3时锐,杨孝宗.自组网Random Waypoint移动模型节点空间概率分布的研究[J].计算机研究与发展,2005,42(12):2056-2062. 被引量:18
  • 4Bar -NoyA, Kessler L, SidiM. Mobile users : To updateor not to update[C] // Proceedings of the Joint Conference of the IEEE Computer and Communications Societies(INFOCOM). 1994.
  • 5Garcia-Luna-AcevesJJ, MadrgaEL. Amulticast routing protocol for ad-hoc networks[C]// Proceedings of the Joint Conference of the IEEE Computer and Communications Societies(INFOCOM). 1999.
  • 6Rubin I,Choi C. Impact of the location area structure on the perforrnance of signaling channels in wireless cellular networks[J]. IEEE Communications Magazine, 1997 : 108-115.
  • 7Zonoozi M,Dassanayake P. User mobility modeling and characterization of mobility pattem[J]. IEEE Journal on Selected Areas in Communications, 1997,15 (7) : 1239-1252.
  • 8Liang B, Haas Z. Predictive distance-based mobility management for PCS networks[C]// Proceedings of the Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). March 1999.
  • 9Hong X,Gerla M,Pei G, et al. A group mobility model for ad hoc wireless networks[C]//Proceedings of the ACM International Workshop on Modeling and Simulation of Wireless and Mobile Systems(MSWiM). August 1999.
  • 10Einstein A. Investigations on the Theory of the Brownian Movement[M]. Dover Publications, 1956.

共引文献39

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部