检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南交通大学信息编码与传输重点实验室,成都610031
出 处:《传感技术学报》2012年第8期1116-1120,共5页Chinese Journal of Sensors and Actuators
基 金:国家自然科学基金项目(61071107)
摘 要:基于最大分散度的概念,本文提出了一种新的高斯噪声下基于半定规划的WSN定位算法——MSDSDP算法。该算法将定位问题建模成一个将最大化网络分散度作为目标函数,由节点测量距离和噪声标准差确定的不等式作为约束条件的最优化问题,并将该最优化问题松弛为半定规划模型进行求解。分析及实验结果表明,该算法能有效地克服fullSDP节点估计位置向锚节点凸包中心汇聚的问题,在计算复杂度相同的情况下明显提高定位精度。将MSDSDP算法的结果作为初始点进行梯度搜索,能进一步提高定位精度。Based on the concept of Scatteredness Degree,a new semi-definite programming algorithm for the WSN node localization in Gaussian noise environment named as MSDSDP is proposed.In MSDSDP,the localization problem is modeled as an optimization problem which takes the maximum scatteredness degree of the network as the objective function,the inequalities determined by the measured distances of nodes and the standard variance of the noise as the constraints.Then,the optimization problem can be relaxed to a semi-definite programming model to solve.Analysis and simulation results show that MSDSDP can effectively solve the problem of fullSDP that the estimated position of the nodes tends to crowd toward the center of the anchor hull,resulting in obvious improvement to the location accuracy with the same computational complexity.Using the results of MSDSDP as the initial point of gradient search method,the location accuracy will be further improved.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222