共查询到19条相似文献,搜索用时 234 毫秒
1.
5G NSA网络架构模式下,4G锚点站点的配置尤为重要,直接影响着5G网络的覆盖和性能,本文从单锚点配置和双锚点配置的角度来对比分析两种组网策略的特点,并基于现网实际应用进行结果对比分析,总结出不同锚点配置的应用场景,以提升5G网络覆盖性能和用户感知体验。 相似文献
2.
运营商逐步开始部署5G网络,受限于产业链发展、投资成本考虑等因素,网络建设初期为了进行局部区域5G网络的快速建设,运营商往往会采用NSA网络架构。在总结前期5G试点部署经验的基础上,从NSA网络部署初期面临的覆盖问题出发,对终端在5G不同覆盖场景下锚点选择策略进行了分析,提出了相应的NSA网络锚点选择策略和优化方案,为后续5G NSA组网建设提供指导意见,以提高5G业务体验。 相似文献
3.
目标检测是计算机视觉领域的研究热点和基础任务,其中基于锚点(Anchor)的目标检测已在众多领域得到广泛应用。当前锚点选取方法主要面临两个问题:基于特定数据集的先验取值尺寸固定、面对不同场景泛化能力弱。计算锚框的无监督K-means算法,受初始值影响较大,对目标尺寸较单一的数据集聚类产生的锚点差异较小,无法充分体现网络多尺度输出的特点。针对上述问题,本文提出一种基于多尺度的目标检测锚点构造方法(multi-scale-anchor, MSA),将聚类产生的锚点根据数据集本身的特性进行尺度的缩放和拉伸,优化的锚点即保留原数据集的特点也体现了模型多尺度的优势。另外,本方法应用在训练的预处理阶段,不增加模型推理时间。最后,选取单阶段主流算法YOLO(You Only Look Once),在多个不同场景的红外或工业场景数据集上进行丰富的实验。结果表明,多尺度锚点优化方法 MSA能显著提高小样本场景的检测精度。 相似文献
4.
高光谱图像聚类问题一直是图像处理领域的研究热点。谱聚类算法是最流行的聚类算法之一,但其计算复杂度较大,难以处理大规模的高光谱图像数据。由于二叉树能够较快地选取锚点,因此基于二叉树锚点图,充分利用高光谱图像的光谱和空间特性,可保证聚类性能并降低计算复杂度。然而,该聚类算法一般采用有核的聚类方法,因此不可避免地引入了参数调节。在二叉树锚点选取的基础上,提出了一种基于二叉树锚点的高光谱快速聚类算法,该算法创新性地将二叉树锚点选取和无核聚类方法应用于高光谱图像中。首先,利用二叉树从高光谱数据中选取一些具有代表性的锚点;紧接着构造基于锚点的无核相似图,有效避免了通过人为调节热核参数来构造相似图;然后进行谱聚类分析获得聚类结果;最后,将该算法应用到高光谱图像聚类中。该算法不仅提高了聚类速度,还减少了原有热核参数调节。实验结果表明,与传统的聚类算法相比,所提算法能够在较短的时间内获得更佳的聚类精度。 相似文献
5.
锚点站是NSA组网模式下5G网络的重要组成部分,且锚点问题对5G性能影响较大,需要在5G网络规划与优化的初期予以充分考虑。文章介绍了网优岗位对锚点站的规划策略、配置开通要求、以及性能优化策略;将锚点站优化的整个工作细分成三个阶段九个工作细项,旨在为5G网络优化工作提供参考。 相似文献
6.
NSA架构下,UE终端需要通过LTE基站作为锚点才能实现5G业务。所以,提升5G驻留比指标,关键是要让支持5G的终端优先并稳定驻留在锚点小区。用户要能在5G网络下“占得上、驻留稳、体验优”,仅仅只是能够优先驻留5G小区是不够的,小区负荷情况也是用户能否“体验优”的关键因素。本文通过对5G终端和非5G终端分别在锚点小区和非锚点小区下的特点进行分析,指出在各种情况下该如何设置参数方能确保5G终端能更快更稳定地驻留5G小区。同时本文对在未来5G终端越来越多的情况下,该如何从锚点小区进行终端精准分流的问题进行了详细和深入的剖析,最终提出了一套既能保证5G终端稳定驻留5G小区,同时也能确保在锚点小区负荷升高时能自动精确分流的参数设置策略。 相似文献
7.
8.
9.
10.
NSA组网下LTE锚点的信令事件会影响5G基站的性能,在对5G网络优化时也需对锚点进行优化,以提升5G网络性能。针对以上问题,分析影响5G性能的LTE锚点信令进行原理,并进行量化,给出LTE锚点优化关键解决方案。评估结果表明,LTE锚点的合理配置对NR网络性能至关重要。方案在现网实施后5G网络性能明显提升,日常NSA网络优化中可以借鉴。 相似文献
11.
为使随机部署的三维无线传感器网络中锚节点的分布更加合理,提高未知节点定位精度,针对锚节点部署进行优化。通过构建弹簧系统模型,将锚节点抽象为通过弹簧相连接的点,使部分锚节点在合力作用下进行伸缩运动,达到提高网络性能的目的。当锚节点部署优化完成后,应用近似三角形内点测试( APIT)和DV-HOP( Distance Vector-hop)算法测试优化前后的节点定位精度。仿真结果表明,三维空间下的锚节点经过弹簧系统模型的部署优化后,锚节点网络覆盖率和定位覆盖率均得到了提高,网络平均连通度有所提升,且定位精度显著提高。 相似文献
12.
In order to better solve the contradiction between precision of localization and the number of anchor nodes in wireless sensor network,a mobile anchor node localization technology based on connectivity was proposed.First,the coverage characteristic of the network nodes was analyzed,and a critical value was found between the mobile step and the anchor node communication radius,mobile anchor nodes' coverage characteristic would change when near this critical value.Second,a mobile anchor node followed a planning path to form a positioning area seamless coverage was used.Finally,when there was no need for high-precision technology,node position would been estimated according with the connectivity of the network and the receiving information of the node.The simulation results show that the proposed algorithm can realize coarse-grained localization,and paths perform complete localization. 相似文献
13.
针对Bounding Box算法定位误差大、覆盖率低的缺点,提出了一种采用虚拟锚节点策略的改进定位算法。首先未知节点利用其通信范围内的锚节点进行定位;其次,已定位的节点根据升级策略有选择性的升级为虚拟锚节点;最后,无法定位的节点利用虚拟锚节点实现定位。另外,在离散网络模型的基础上,通过建立双半径网络节点模型从而进一步约束了未知节点的位置。理论分析及仿真结果均表明,该算法在显著提高定位覆盖率的同时,有效地提高了定位精度。 相似文献
14.
This paper deals with the problem of sensor node localization in the presence of uncertainty in anchor node location. Aqueous environments are prone to adverse effects of underwater currents. This adversity causes non‐negligible mobility to the anchor nodes deployed under water. Localization in the presence of uncertainty in the anchor node location is quite challenging. Also, the authors consider the ray‐bending property of underwater medium due to depth dependent sound speed, to furnish the accurate position estimate of the target node. Standard ray equations are used to model the path followed by acoustic rays in water. Maximum likelihood estimation is proposed to estimate the location of target node with uncertainty in anchor node positions and is compared with the scheme with exact knowledge of anchor node positions, and the results are reported. Monte Carlo simulation is used to assess the performance of the proposed method. Also, the Cramer‐Rao lower bound with uncertainty in anchor nodes is derived and described. Simulation results of the proposed algorithm outperform the existing algorithm with known anchor location by up to 49.4%, and hence, accuracy is improved in the proposed method. 相似文献
15.
With location-based services worldwide used,private location data appealed easily in query process which caused serious security problems.So the introduction of SpaceTwist incremental nearest neighbor query algorithm,proposes protection of privacy method combined with improved SpaceTwist location optimization algorithm.The anchor point authentication server added to distributed system structure,user generate a k anonymous area according to their privacy preference and actual environment,using optimization algorithm to generate the anchor point.Forwarding users use the incremental nearest neighbor query throught the anchor point and accurate.Experiments in road network environment with different data sets show that the privacy protection works well in the algorithm,and own high work efficiency. 相似文献
16.
Guangjie Han Chenyu Zhang Tongqing Liu Lei Shu 《Wireless Communications and Mobile Computing》2016,16(6):682-702
Localization is an essential and major issue for underwater acoustic sensor networks (UASNs). Almost all the applications in UASNs are closely related to the locations of sensors. In this paper, we propose a multi‐anchor nodes collaborative localization (MANCL) algorithm, a three‐dimensional (3D) localization scheme using anchor nodes and upgrade anchor nodes within two hops for UASNs. The MANCL algorithm divides the whole localization process into four sub‐processes: unknown node localization process, iterative location estimation process, improved 3D Euclidean distance estimation process, and 3D DV‐hop distance estimation process based on two‐hop anchor nodes. In the third sub‐process, we propose a communication mechanism and a vote mechanism to determine the temporary coordinates of unknown nodes. In the fourth sub‐process, we use two‐hop anchor nodes to help localize unknown nodes. We also evaluate and compare the proposed algorithm with a large‐scale localization algorithm through simulations. Results show that the proposed MANCL algorithm can perform better with regard to localization ratio, average localization error, and energy consumption in UASNs. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
17.
18.
Guangjie Han Huihui Xu Jinfang Jiang Lei Shu Takahiro Hara Shojiro Nishio 《Wireless Communications and Mobile Computing》2013,13(14):1324-1336
In wireless sensor networks (WSNs), many applications require sensor nodes to obtain their locations. Now, the main idea in most existing localization algorithms has been that a mobile anchor node (e.g., global positioning system‐equipped nodes) broadcasts its coordinates to help other unknown nodes to localize themselves while moving according to a specified trajectory. This method not only reduces the cost of WSNs but also gets high localization accuracy. In this case, a basic problem is that the path planning of the mobile anchor node should move along the trajectory to minimize the localization error and to localize the unknown nodes. In this paper, we propose a Localization algorithm with a Mobile Anchor node based on Trilateration (LMAT) in WSNs. LMAT algorithm uses a mobile anchor node to move according to trilateration trajectory in deployment area and broadcasts its current position periodically. Simulation results show that the performance of our LMAT algorithm is better than that of other similar algorithms. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献