欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对已有的集中式定位算法定位精度低，而分布式定位算法计算复杂度高、通信量大的问题，提出了一种适用于无线传感器网络的计算复杂度低的节点分簇定位算法。首先，提出满足最大连通度的多边界节点分簇算法，采用此算法把网络划分为若干个簇，各簇分别进行簇内节点定位；其次，各簇进行融合，最终实现全网节点的定位。仿真结果表明，这种分簇定位算法比分布式定位算法计算复杂度低、通信量小、定位精度相当或略差，比集中式定位算法计算复杂度低、通信量小、定位精度高。采用该算法可以降低传感器网络节点定位过程中的能耗，提高计算效率，延长网络寿命。
英文摘要：
The paper proposes a novel low complexity localization algorithm for wireless sensor network node localization due to the low localization accuracy of the existing centralized localization method and the high computing complexity and the large communication quantity of the present distributed localization method. According to this method, the nodes of a network are firstly divided into some clusters in a clustering method based on max-connectivity and multi-border nodes, and the nodes in every cluster are localized; then all the clusters merge into a localized cluster, finally the nodes are all localized. The simulation results show that the order of complexity and the cost＇of communication of the cluster-based method are lower than those of the centralized method and the distributed method, the error of the cluster-based method is similar to or a little bigger than that of the distributed, and is less than that of the centralized localization method. With the cluster-based method, the energy consumption of node localization will be reduced, the computation officiency can be improved, and the lifetime of the network can be prolonged.
同期刊论文项目
同项目期刊论文
期刊信息
位置：