共查询到18条相似文献,搜索用时 500 毫秒
1.
基于非度量多维标度的无线传感器网络节点定位算法 总被引:2,自引:3,他引:2
把统计学中的多维标度技术应用到无线传感器网络节点定位是一种新的思路.提出了NMDSRSSI(nonmetric multidimensional scaling and received signal strength indication)定位算法,它利用非度量多维标度技术直接根据无线信号强度值来进行节点的定位,省去了以往利用无线信号强度的定位算法中先把强度转换为距离再进行定位所带来的计算误差和计算量.无线信号强度受实际环境影响存在反射、多径传播等问题,理论和实验分析表明算法对此具有较好的适应性.仿真与真实传感器节点的实验结果显示算法取得了较好的定位效果. 相似文献
2.
3.
传感器网络中基于多维标度定位算法的改进 总被引:1,自引:0,他引:1
针对基于经典多维标度的MDS-MAP算法在定位精度方面的不足,为提高传感器定位精度,提出一种基于Euclidean算法的改进型多维标度定位算法(Euclidean-based MDS-MAP(P,C))。算法与经典多维标度算法的区别在于,Euclidean算法能够算出每个节点与其两跳邻居节点间的欧氏距离,然后用这个欧氏距离来进行多维标度,显然能提高精度。仿真实验表明基于Euclidean算法的改进型多维标度算法与经典多维标度算法相比具有很低的定位误差以及很高的定位精度。 相似文献
4.
与有源标签相比,无源RFID标签成本较小,本文选取后者作为待定位标签。但是由于无源RFID标签之间无法通信,目前大多数传统的RFID定位算法一次只能定位一个标签而无法实现多标签同时定位。针对这一问题,提出了基于非度量多维标度(NMDS)的室内RFID多标签协同定位算法。利用到达相位差(PDOA)法拟合在多径存在环境下的测距误差,将待定位标签之间的距离差欧氏距离与非度量多维标度算法结合,计算出待定位标签的位置坐标。仿真结果表明,提出的算法可以通过一次非度量多维标度计算得到所有待定位标签的坐标,同时定位精度高于经典多维标度定位算法和传统三边定位算法。 相似文献
5.
为解决室内定位环境复杂、传播信号易受干扰,导致室内定位算法定位误差较大的问题,提出一种基于向量相似性的多维标度定位算法。将向量相似性特征和相关性修正模型融入多维标度算法框架,引入cosine指标表征信号向量间的相似度,为节点相关性提供度量标准,提出一种基于向量样本熵的相关性修正模型进一步优化节点间的相似性矩阵。仿真结果表明,该算法可以有效获得目标节点的位置信息,提高节点的定位精度,降低复杂室内环境对无线传感器信号的影响。 相似文献
6.
一种基于非度量多维标度的移动定位算法 总被引:2,自引:0,他引:2
稀疏无线传感器网络由于缺乏足够的距离和连通性信息,导致大多数定位算法无法有效工作.提出了一种非度量多维标度移动节点辅助定位算法--NMDS-LRA(M).该算法对移动节点运动轨迹抽样,添加拓扑约束关 系,然后利用奇异值分解计算节点相异性矩阵的逼近阵,从而有效解决了移动辅助定位问题,并且避免了以往移动定位算法中虚拟节点间距离误差较大对定位精度的影响.仿真分析表明,与以往算法相比,提出的算法有更好的定位精度,而且在较低网络连通度和不规则网络分布的条件下表现出更好的可靠性. 相似文献
7.
8.
研究稀疏无线传感网络下异常节点的准确定位问题。在信息较少的空旷区域,无线传感网络的传感节点分布较为稀松,为方便计算,多采用多跳距离代替节点间的真实距离,导致距离计算存在较大误差,在传统的基于分布式加权距离定位算法建立的网络分布模型中,节点定位准确度低,导致节点定位误差较大。为了解决上述问题,提出了一种粒子群优化的多维标度节点定位算法。采用多维标度算法求得各未知节点的初始坐标,利用粒子群优化算法对其目标代价函数进行优化求得未知节点的真实距离坐标,准确定位节点。实验结果表明:改进算法在定位精度上有明显的提高。 相似文献
9.
10.
基于多维标度(Multidimensional Scaling,MDS)的定位算法,利用移动站与多个基站两两节点间距离的相关性对移动站进行定位,其高稳健性近年来已被证实。但是其性能有限,即使在测量噪声很小的情况下MDS算法也无法达到克拉美罗下界(CRLB)。本文提出了一种新颖的基于TOA(time of arrival)定位方法的复数MDS方法。不同于经典多维标度算法,这种算法并不需要对标度生成矩阵进行奇异值分解,而是对本文定义的一个复数距离矩阵进行奇异值分解获得更多信息从而得到更好的性能。本文对该算法进行了计算机仿真,并与另外几种定位方法做出比较。 相似文献
11.
Techniques for multidimensional scaling visualize objects as points in a low-dimensional metric map. As a result, the visualizations
are subject to the fundamental limitations of metric spaces. These limitations prevent multidimensional scaling from faithfully
representing non-metric similarity data such as word associations or event co-occurrences. In particular, multidimensional
scaling cannot faithfully represent intransitive pairwise similarities in a visualization, and it cannot faithfully visualize
“central” objects. In this paper, we present an extension of a recently proposed multidimensional scaling technique called
t-SNE. The extension aims to address the problems of traditional multidimensional scaling techniques when these techniques
are used to visualize non-metric similarities. The new technique, called multiple maps t-SNE, alleviates these problems by
constructing a collection of maps that reveal complementary structure in the similarity data. We apply multiple maps t-SNE
to a large data set of word association data and to a data set of NIPS co-authorships, demonstrating its ability to successfully
visualize non-metric similarities. 相似文献
12.
无线传感器网络中基于多维定标的定位算法通常采用最短路径代替距离矩阵中的未知项,会导致较大的定位误差。针对这一问题,提出一种基于距离矩阵重构的无线传感器网络多维定标定位算法DR-MDS。算法利用节点间的公共邻居信息对距离矩阵线性重构,计算距离矩阵中的未知项,然后对重构的距离矩阵运用双中心化并进行特征分解,从而求得网络坐标。由于算法能够更为准确的获得网络节点之间的空间相对关系,并充分利用其空间相关性计算节点相对坐标,可获得较好的定位效果。仿真结果表明,本文提出的DR-MDS算法与MDS-MAP、ISOMAP相比定位精度更高,误差范围更小。 相似文献
13.
In this paper, a new non-linear mapping method suitable for dimension and cluster analysis is proposed. In order to obtain a flexible and powerful method, the non-metric multidimensional scaling of Kruskal type is extended by introducing the concept of k-nearest neighbor. Some simulation results supporting the efficiency of our new method are given along with a detailed discussion. 相似文献
14.
15.
Local and global mappings of topology representing networks 总被引:1,自引:0,他引:1
As data analysis tasks often have to deal with complex data structures, the nonlinear dimensionality reduction methods play an important role in exploratory data analysis. In the literature a number of nonlinear dimensionality reduction techniques have been proposed (e.g. Sammon mapping, Locally Linear Embedding). These techniques attempt to preserve either the local or the global geometry of the original data, and they perform metric or non-metric dimensionality reduction. Nevertheless, it is difficult to apply most of them to large data sets. There is a need for new algorithms that are able to combine vector quantisation and mapping methods in order to visualise the data structure in a low-dimensional vector space. In this paper we define a new class of algorithms to quantify and disclose the data structure, that are based on the topology representing networks and apply different mapping methods to the low-dimensional visualisation. Not only existing methods are combined for that purpose but also a novel group of mapping methods (Topology Representing Network Map) are introduced as a part of this class. Topology Representing Network Maps utilise the main benefits of the topology representing networks and of the multidimensional scaling methods to disclose the real structure of the data set under study. To determine the main properties of the topology representing network based mapping methods, a detailed analysis of classical benchmark examples (Wine and Optical Recognition of Handwritten Digits data set) is presented. 相似文献
16.
RankVisu: Mapping from the neighborhood network 总被引:1,自引:0,他引:1
Most multidimensional scaling methods focus on the preservation of dissimilarities to map high dimensional items in a low-dimensional space. However, the mapping function usually does not consider the preservation of small dissimilarities as important, since the cost is small with respect to the preservation of large dissimilarities. As a consequence, an item's neighborhoods may be sacrificed for the benefit of the overall mapping. We have subsequently designed a mapping method devoted to the preservation of neighborhood ranks rather than their dissimilarities: RankVisu. A mapping of data is obtained in which neighborhood ranks are as close as possible according to the original space.A comparison with both metric and non-metric MDS highlights the pros (in particular, cluster enhancement) and cons of RankVisu. 相似文献
17.