期刊文献+
共找到382篇文章
< 1 2 20 >
每页显示 20 50 100
A Localization Algorithm Using a Mobile Anchor Node Based on Region Determination in Underwater Wireless Sensor Networks 被引量:8
1
作者 XU Tingting WANG Jingjing +2 位作者 SHI Wei WANG Jianfeng CHEN Zhe 《Journal of Ocean University of China》 SCIE CAS CSCD 2019年第2期394-402,共9页
At present, most underwater positioning algorithms improve the positioning accuracy by increasing the number of anchor nodes which resulting in the increasing energy consumption. To solve this problem, the paper propo... At present, most underwater positioning algorithms improve the positioning accuracy by increasing the number of anchor nodes which resulting in the increasing energy consumption. To solve this problem, the paper proposes a localization algorithm assisted by mobile anchor node and based on region determination(LMRD), which not only improves the positioning accuracy of nodes positioning but also reduces the energy consumption. This algorithm is divided into two stages: region determination stage and location positioning stage. In the region determination stage, the target region is divided into several sub-regions by the region division strategy with the smallest overlap rate which can reduce the number of virtual anchor nodes and lock the target node to a sub-region, and then through the planning of mobile nodes to optimize the travel path, reduce the moving distance, and reduce system energy consumption. In the location positioning stage, the target node location can be calculated using the HILBERT path planning and trilateration. The simulation results show that the proposed algorithm can improve the positioning accuracy when the energy consumption is reduced. 展开更多
关键词 UWSN MOBILE ANCHOR nodes energy CONSUMPTION REGION determination localization algorithm
在线阅读 下载PDF
An Optimal Node Localization in WSN Based on Siege Whale Optimization Algorithm
2
作者 Thi-Kien Dao Trong-The Nguyen 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第3期2201-2237,共37页
Localization or positioning scheme in Wireless sensor networks (WSNs) is one of the most challenging andfundamental operations in various monitoring or tracking applications because the network deploys a large areaand... Localization or positioning scheme in Wireless sensor networks (WSNs) is one of the most challenging andfundamental operations in various monitoring or tracking applications because the network deploys a large areaand allocates the acquired location information to unknown devices. The metaheuristic approach is one of themost advantageous ways to deal with this challenging issue and overcome the disadvantages of the traditionalmethods that often suffer from computational time problems and small network deployment scale. This studyproposes an enhanced whale optimization algorithm that is an advanced metaheuristic algorithm based on thesiege mechanism (SWOA) for node localization inWSN. The objective function is modeled while communicatingon localized nodes, considering variables like delay, path loss, energy, and received signal strength. The localizationapproach also assigns the discovered location data to unidentified devices with the modeled objective functionby applying the SWOA algorithm. The experimental analysis is carried out to demonstrate the efficiency of thedesigned localization scheme in terms of various metrics, e.g., localization errors rate, converges rate, and executedtime. Compared experimental-result shows that theSWOA offers the applicability of the developed model forWSNto perform the localization scheme with excellent quality. Significantly, the error and convergence values achievedby the SWOA are less location error, faster in convergence and executed time than the others compared to at least areduced 1.5% to 4.7% error rate, and quicker by at least 4%and 2% in convergence and executed time, respectivelyfor the experimental scenarios. 展开更多
关键词 node localization whale optimization algorithm wireless sensor networks siege whale optimization algorithm OPTIMIZATION
在线阅读 下载PDF
Improved Algorithm for Distributed Localization in Wireless Sensor Networks 被引量:3
3
作者 钟幼平 匡兴红 黄佩伟 《Journal of Shanghai Jiaotong university(Science)》 EI 2010年第1期64-69,共6页
Many sensor network applications require location awareness,but it is often too expensive to equip a global positioning system(GPS) receiver for each network node.Hence,localization schemes for sensor networks typical... Many sensor network applications require location awareness,but it is often too expensive to equip a global positioning system(GPS) receiver for each network node.Hence,localization schemes for sensor networks typically use a small number of seed nodes that know their locations and protocols whereby other nodes estimate their locations from the messages they receive.For the inherent shortcomings of general particle filter(the sequential Monte Carlo method) this paper introduces particle swarm optimization and weighted centroid algorithm to optimize it.Based on improvement a distributed localization algorithm named WC-IPF(weighted centroid algorithm improved particle filter) has been proposed for localization.In this localization scheme the initial estimate position can be acquired by weighted centroid algorithm.Then the accurate position can be gotten via improved particle filter recursively.The extend simulation results show that the proposed algorithm is efficient for most condition. 展开更多
关键词 wireless sensor network node localization particle filter particle swarm optimization weighted centroid algorithm
原文传递
AModified Search and Rescue Optimization Based Node Localization Technique inWSN 被引量:1
4
作者 Suma Sira Jacob K.Muthumayil +4 位作者 M.Kavitha Lijo Jacob Varghese M.Ilayaraja Irina V.Pustokhina Denis A.Pustokhin 《Computers, Materials & Continua》 SCIE EI 2022年第1期1229-1245,共17页
Wireless sensor network(WSN)is an emerging technology which find useful in several application areas such as healthcare,environmentalmonitoring,border surveillance,etc.Several issues that exist in the designing of WSN... Wireless sensor network(WSN)is an emerging technology which find useful in several application areas such as healthcare,environmentalmonitoring,border surveillance,etc.Several issues that exist in the designing of WSN are node localization,coverage,energy efficiency,security,and so on.In spite of the issues,node localization is considered an important issue,which intends to calculate the coordinate points of unknown nodes with the assistance of anchors.The efficiency of the WSN can be considerably influenced by the node localization accuracy.Therefore,this paper presents a modified search and rescue optimization based node localization technique(MSRONLT)forWSN.The major aim of theMSRO-NLT technique is to determine the positioning of the unknown nodes in theWSN.Since the traditional search and rescue optimization(SRO)algorithm suffers from the local optima problemwith an increase in number of iterations,MSRO algorithm is developed by the incorporation of chaotic maps to improvise the diversity of the technique.The application of the concept of chaotic map to the characteristics of the traditional SRO algorithm helps to achieve better exploration ability of the MSRO algorithm.In order to validate the effective node localization performance of the MSRO-NLT algorithm,a set of simulations were performed to highlight the supremacy of the presented model.A detailed comparative results analysis showcased the betterment of the MSRO-NLT technique over the other compared methods in terms of different measures. 展开更多
关键词 node localization WSN chaotic map search and rescue optimization algorithm localization error
在线阅读 下载PDF
Real-time localization estimator of mobile node in wireless sensor networks based on extended Kalman filter
5
作者 田金鹏 郑国莘 《Journal of Shanghai University(English Edition)》 CAS 2011年第2期128-131,共4页
Localization of the sensor nodes is a key supporting technology in wireless sensor networks (WSNs). In this paper, a real-time localization estimator of mobile node in WSNs based on extended Kalman filter (KF) is ... Localization of the sensor nodes is a key supporting technology in wireless sensor networks (WSNs). In this paper, a real-time localization estimator of mobile node in WSNs based on extended Kalman filter (KF) is proposed. Mobile node movement model is analyzed and online sequential iterative method is used to compute location result. The detailed steps of mobile sensor node self-localization adopting extended Kalman filter (EKF) is designed. The simulation results show that the accuracy of the localization estimator scheme designed is better than those of maximum likelihood estimation (MLE) and traditional KF algorithm. 展开更多
关键词 wireless sensor networks (WSNs) node location localization algorithm Kalman filter (KF)
在线阅读 下载PDF
RSSI-Based 3D Wireless Sensor Node Localization Using Hybrid T Cell Immune and Lotus Optimization
6
作者 Weiwei Hu Kiran Sree Pokkuluri +3 位作者 Rajesh Arunachalam Bander A.Jabr Yasser A.Ali Preethi Palanisamy 《Computers, Materials & Continua》 SCIE EI 2024年第12期4833-4851,共19页
Wireless Sensor Network(WSNs)consists of a group of nodes that analyze the information from surrounding regions.The sensor nodes are responsible for accumulating and exchanging information.Generally,node local-ization... Wireless Sensor Network(WSNs)consists of a group of nodes that analyze the information from surrounding regions.The sensor nodes are responsible for accumulating and exchanging information.Generally,node local-ization is the process of identifying the target node’s location.In this research work,a Received Signal Strength Indicator(RSSI)-based optimal node localization approach is proposed to solve the complexities in the conventional node localization models.Initially,the RSSI value is identified using the Deep Neural Network(DNN).The RSSI is conceded as the range-based method and it does not require special hardware for the node localization process,also it consumes a very minimal amount of cost for localizing the nodes in 3D WSN.The position of the anchor nodes is fixed for detecting the location of the target.Further,the optimal position of the target node is identified using Hybrid T cell Immune with Lotus Effect Optimization algorithm(HTCI-LEO).During the node localization process,the average localization error is minimized,which is the objective of the optimal node localization.In the regular and irregular surfaces,this hybrid algorithm effectively performs the localization process.The suggested hybrid algorithm converges very fast in the three-dimensional(3D)environment.The accuracy of the proposed node localization process is 94.25%. 展开更多
关键词 Sensor node localization received signal strength indicator 3D wireless sensor network deep neural network average localization error and hybrid T cell immune with lotus effect optimization algorithm
在线阅读 下载PDF
A Review and Analysis of Localization Techniques in Underwater Wireless Sensor Networks 被引量:1
7
作者 Seema Rani Anju +6 位作者 Anupma Sangwan Krishna Kumar Kashif Nisar Tariq Rahim Soomro Ag.Asri Ag.Ibrahim Manoj Gupta Laxmi Chandand Sadiq Ali Khan 《Computers, Materials & Continua》 SCIE EI 2023年第6期5697-5715,共19页
In recent years,there has been a rapid growth in Underwater Wireless Sensor Networks(UWSNs).The focus of research in this area is now on solving the problems associated with large-scale UWSN.One of the major issues in... In recent years,there has been a rapid growth in Underwater Wireless Sensor Networks(UWSNs).The focus of research in this area is now on solving the problems associated with large-scale UWSN.One of the major issues in such a network is the localization of underwater nodes.Localization is required for tracking objects and detecting the target.It is also considered tagging of data where sensed contents are not found of any use without localization.This is useless for application until the position of sensed content is confirmed.This article’s major goal is to review and analyze underwater node localization to solve the localization issues in UWSN.The present paper describes various existing localization schemes and broadly categorizes these schemes as Centralized and Distributed localization schemes underwater.Also,a detailed subdivision of these localization schemes is given.Further,these localization schemes are compared from different perspectives.The detailed analysis of these schemes in terms of certain performance metrics has been discussed in this paper.At the end,the paper addresses several future directions for potential research in improving localization problems of UWSN. 展开更多
关键词 Underwater wireless sensor networks localization schemes node localization ranging algorithms estimation based prediction based
在线阅读 下载PDF
RSS-Distance Rationalization Procedure for Localization in an Indoor Environment 被引量:2
8
作者 Adeniran Ademuwagun 《Wireless Sensor Network》 2019年第2期13-33,共21页
The computational capabilities of off-the-shelf wireless sensors networks presents a limitation when more complex forms of localization algorithms are employed for location estimation purposes, particularly in an indo... The computational capabilities of off-the-shelf wireless sensors networks presents a limitation when more complex forms of localization algorithms are employed for location estimation purposes, particularly in an indoor environment. Range-free algorithms rely on Received Signal Strength (RSS) from sensors that are location aware (anchor nodes) as the major means of distance estimation. This paper presents a non-site specific algorithm for better estimating RSS relationship with distance. By employing a unique form of rationalization of raw RSS with respect to distance using the proposed algorithm, it is possible to enhance the reliability of RSS when employed in indoor Localization Algorithms. Consequently, this paper presents an innovative RSS-Distance rationalization algorithm for localization of objects in an indoor environment. The paper compared the proposed algorithm with Simple Moving Average (SMA) algorithm due to the wide applicability and ease of manipulation of SMA. The analysis of the proposed algorithm and SMA shows that the proposed algorithm better modifies RSS for more accurate position estimation in an indoor environment. 展开更多
关键词 ANCHOR nodes RECEIVED Signal Strength (RSS) localization algorithm Simple Moving Average (SMA)
暂未订购
基于移动节点预测的水声传感器网络定位算法
9
作者 候倍倍 谢于晨 邱岚 《传感器与微系统》 北大核心 2026年第1期155-160,共6页
针对水声传感器网络(UASN)中节点移动性低、定位精度差等问题,提出了一种基于移动节点预测的UASN定位算法。首先,根据UASN和潮汐特点构建了UASN运动模型;其次,提出了一种基于到达时间(TOA)的测距策略,以降低通信成本和能量消耗,并使用... 针对水声传感器网络(UASN)中节点移动性低、定位精度差等问题,提出了一种基于移动节点预测的UASN定位算法。首先,根据UASN和潮汐特点构建了UASN运动模型;其次,提出了一种基于到达时间(TOA)的测距策略,以降低通信成本和能量消耗,并使用灰狼优化(GWO)算法寻找定位精度较低的二级节点的最优位置。最后,对所提算法进行了仿真分析。仿真结果表明:所提算法不仅有效地降低了网络能耗,而且提高了网络位置覆盖率和节点定位精度。 展开更多
关键词 水声传感器网络 节点定位 灰狼优化算法 定位精度
在线阅读 下载PDF
基于局部拓扑信息的车联网驱动节点辨识
10
作者 孔芝 杨超 王立夫 《控制工程》 北大核心 2026年第1期92-101,共10页
车联网是实现智慧交通、确保道路交通安全运行的重要手段。对关键车辆加以控制,可以实现整个车联网的完全可控。为了实现车联网的完全可控,首先建立车联网模型,将车辆抽象为节点,根据两车辆之间的距离与通信半径的关系建立可以传递信息... 车联网是实现智慧交通、确保道路交通安全运行的重要手段。对关键车辆加以控制,可以实现整个车联网的完全可控。为了实现车联网的完全可控,首先建立车联网模型,将车辆抽象为节点,根据两车辆之间的距离与通信半径的关系建立可以传递信息的边,并运用复杂网络的可控性理论分析车联网的可控性;然后,提出局部博弈匹配算法,基于局部拓扑信息辨识车联网的驱动节点;最后,以鄂尔多斯市的鄂托克西街的某一路段为例,对所提方法进行实验验证。实验结果表明,局部博弈匹配算法在不同情况下均能有效辨识驱动节点,并在运行时间和存储空间方面优于最大匹配算法。 展开更多
关键词 复杂网络 车联网 可控性 驱动节点 局部博弈匹配算法
原文传递
基于改进BKA算法优化的WSN定位算法
11
作者 彭铎 王永龙 +1 位作者 张彩银 张明虎 《电子测量与仪器学报》 北大核心 2025年第9期65-74,共10页
针对无线传感器网络非测距节点定位算法中,由于多跳距离和平均跳距估计方法存在仅进行简单计算而缺乏有效误差修正的缺陷,造成计算误差累积,进而导致定位精度较低的问题,提出了一种改进黑翅鸢算法-三维距离向量跳(IBKA-3DDV-Hop)定位算... 针对无线传感器网络非测距节点定位算法中,由于多跳距离和平均跳距估计方法存在仅进行简单计算而缺乏有效误差修正的缺陷,造成计算误差累积,进而导致定位精度较低的问题,提出了一种改进黑翅鸢算法-三维距离向量跳(IBKA-3DDV-Hop)定位算法。首先,为减少跳数量化误差,利用多通信半径细化节点间跳数,然后引入跳距修正因子对跳距进行误差补偿。其次,在改进黑翅鸢算法中利用最优拉丁超立方机制(OLHS)优化种群初始化,克服种群随机初始化的盲目性,并通过精英反向学习策略生成反向种群,进一步优化初始种群质量。最后在BKA的迁徙行为中融入Levy飞行策略增强算法寻优和全局搜索能力,避免算法陷入局部最优。仿真结果表明,相比传统3DDV-Hop算法、多通信半径算法、GOOSE-3DDDV-Hop算法以及WOA-3DDDV-Hop算法,所提出的IBKA-3DDV-Hop定位算法的归一化定位误差平均降低了22%、17%、11%与6%左右,有效提高了非测距节点定位算法的定位精度。 展开更多
关键词 非测距节点定位 黑翅鸢算法 最优拉丁超立方 精英反向学习 Levy飞行
原文传递
基于改进混合A^(*)算法在动态环境中的快速路径规划
12
作者 谭光兴 黄磊昌 李明泽 《现代电子技术》 北大核心 2025年第19期136-142,共7页
为了提高阿克曼底盘无人车的路径规划效率以及在路径跟踪过程中的局部路径规划和避障能力,并降低路径重规划的时间,文中提出一种基于改进混合A^(*)算法的路径规划方法。首先,通过障碍物K-D树得到当前位置特定范围内的障碍物距离和密度状... 为了提高阿克曼底盘无人车的路径规划效率以及在路径跟踪过程中的局部路径规划和避障能力,并降低路径重规划的时间,文中提出一种基于改进混合A^(*)算法的路径规划方法。首先,通过障碍物K-D树得到当前位置特定范围内的障碍物距离和密度状态,根据该状态计算混合A^(*)算法的动态扩展步长和转向角度离散值,提高节点扩展的效率;其次,通过反向路径规划,实现前次搜索节点数据的复用,将数据处理后作为局部路径规划的初始数据,减少节点扩展数量;最后,使用贝塞尔曲线对路径进行平滑处理。仿真实验结果表明:改进后的算法在全局路径规划和局部路径规划中有效减少了扩展节点数和运行时间,无人车能够实现在动态环境中快速进行局部路径规划和避障。 展开更多
关键词 动态节点扩展 反向路径规划 扩展列表复用 局部路径规划 动态避障 改进混合A^(*)算法
在线阅读 下载PDF
传感器十字形锚节点布局的异步TDOA定位算法
13
作者 张昊 《佳木斯大学学报(自然科学版)》 2025年第12期68-71,共4页
无线传感器网络的研究和应用里,定位有着不可忽视的重要性。采用十字传感器网络模型,在十字位置处放置锚节点,把传感器节点设为接收节点,使用异步定位算法(TDOA)算法。此算法去除了定位中需要的时间同步的需求,简化了系统,采用单次泰勒... 无线传感器网络的研究和应用里,定位有着不可忽视的重要性。采用十字传感器网络模型,在十字位置处放置锚节点,把传感器节点设为接收节点,使用异步定位算法(TDOA)算法。此算法去除了定位中需要的时间同步的需求,简化了系统,采用单次泰勒级数迭代优化的方式提高定位精度。仿真实验结果表明,算法定位均方根误差在大多数情况下与CRB理论下限值非常接近,表明定位结果是有效可靠的。 展开更多
关键词 传感器 跳距定位 CRB评估 TDOA算法 锚节点
在线阅读 下载PDF
无线传感网络入侵干扰节点定位方法的优化设计 被引量:1
14
作者 贾仁祥 单鸿涛 《传感技术学报》 北大核心 2025年第8期1511-1518,共8页
为了维护无线传感网络的运行稳定性,设计一种无线传感网络入侵干扰定位优化方法。通过粒子群算法的方式,完成对无线传感网络入侵样本的取样,不再标记所有节点,实现对无线传感网络入侵对象的简洁标记。放弃入侵前阈值定义入侵等级的传统... 为了维护无线传感网络的运行稳定性,设计一种无线传感网络入侵干扰定位优化方法。通过粒子群算法的方式,完成对无线传感网络入侵样本的取样,不再标记所有节点,实现对无线传感网络入侵对象的简洁标记。放弃入侵前阈值定义入侵等级的传统思路,查询关键节点对象,并针对其定义攻击性判定Hash函数,联合相关攻击项,判定已标记对象入侵攻击等级。在无线传感网络中实施入侵信息的拟合处理,根据无线传感网络划分条件,定位入侵攻击项,完成无线传感网络入侵干扰节点定位。仿真结果表明,所提技术定位偏差在0.5~0.1之间,字段检测长度与真实长度的数值比保持在99%以上,检测时间低于30 s。符合检测无线传感网络攻击性信息的实际应用需求。 展开更多
关键词 无线传感网络 入侵干扰节点定位 粒子群算法 边界坐标 HASH函数 信息拟合 优化设计
在线阅读 下载PDF
混合光无线传感网络入侵节点智能定位方法 被引量:1
15
作者 张云龙 张新朝 《激光杂志》 北大核心 2025年第6期165-169,共5页
混合光无线传感网络作为新兴技术,在诸多领域展现出了广阔的应用前景。然而,也随之带来网络的安全性问题,特别是入侵节点的存在对网络的稳定运行构成了严重威胁,为此本研究提出了混合光无线传感网络入侵节点智能定位方法。实施混合光无... 混合光无线传感网络作为新兴技术,在诸多领域展现出了广阔的应用前景。然而,也随之带来网络的安全性问题,特别是入侵节点的存在对网络的稳定运行构成了严重威胁,为此本研究提出了混合光无线传感网络入侵节点智能定位方法。实施混合光无线传感网络的数据降维处理,设计基于堆叠集成学习的综合入侵检测模型,使用降维后的训练数据集实施多个一级基础模型的训练,采用逻辑回归模型作为第二层元学习器,将第一层基础模型的输出结果作为第二层的输入数据,实现混合光无线传感网络的入侵检测。将检测到的入侵节点作为目标结构,构建TOA定位的目标函数,利用具有自适应重定向与反向学习的差分进化算法对目标节点坐标求解。测试结果表明,设计方法在多种场景下均能够实现较为准确地入侵节点定位,定位误差较低。 展开更多
关键词 混合光无线传感网络 入侵检测 堆叠集成学习 入侵节点定位 差分进化算法
原文传递
一种应用引力搜索算法改进的DV-Hop模型
16
作者 石琴琴 丛新龙 +1 位作者 傅阳阳 张建平 《电讯技术》 北大核心 2025年第8期1306-1314,共9页
针对无线传感器网络节点定位模型DV-Hop(Distance Vector Hop)的各向异性网络应用适应性问题,提出了一种基于引力搜索算法优化的改进DV-Hop模型。首先,用平均跳距衡量信标间路径的曲折度并据此排序,有序提取未知节点,检索出对应的定位... 针对无线传感器网络节点定位模型DV-Hop(Distance Vector Hop)的各向异性网络应用适应性问题,提出了一种基于引力搜索算法优化的改进DV-Hop模型。首先,用平均跳距衡量信标间路径的曲折度并据此排序,有序提取未知节点,检索出对应的定位信标组合并完成距离估计,以此获得在当前网络拓扑条件下最优的定位计算条件;进而,将未知节点定位问题建模为非线性方程组求解问题,组合使用Min-Max算法和引力搜索算法,初始化种群并完成迭代求解。实验结果表明,与原DV-Hop模型和相关文献提出的3种典型改进模型DBO-DV-Hop、IMSSA-DV-Hop和OANS-DV-Hop相比,所提的改进模型可分别降低约52.1%、13.5%、18.8%和13.1%的平均定位误差,且对网络拓扑变化具有较强的鲁棒性,从而为保证DV-Hop模型在实际应用中的定位精度提供了一种可行方案。 展开更多
关键词 无线传感器网络 DV-HOP 节点定位 平均跳距 引力搜索算法
在线阅读 下载PDF
无线传感器网络节点定位问题 被引量:29
17
作者 尚志军 曾鹏 于海斌 《计算机科学》 CSCD 北大核心 2004年第10期35-38,共4页
无线传感器网络(WSN)是由大量靠无线多跳方式通信的智能传感器节点构成的网络,围绕WSN出现了许多新的研究内容,节点定位是其中一个很重要的方面。本文给出了WSN节点定位的概念,分析了面临的挑战,从测距技术和定位算法角度介绍了当前的... 无线传感器网络(WSN)是由大量靠无线多跳方式通信的智能传感器节点构成的网络,围绕WSN出现了许多新的研究内容,节点定位是其中一个很重要的方面。本文给出了WSN节点定位的概念,分析了面临的挑战,从测距技术和定位算法角度介绍了当前的研究进展,指明了需要进一步研究解决的问题。 展开更多
关键词 无线传感器网络 智能传感器 节点 多跳 定位算法 通信 角度 测距技术
在线阅读 下载PDF
无线传感器网络分布式节点定位算法研究 被引量:25
18
作者 王建刚 王福豹 +1 位作者 段渭军 李晶 《计算机应用》 CSCD 北大核心 2005年第11期2468-2471,共4页
深入分析比较了在无线传感器网络领域中有代表性的4种分布式定位算法,着重关注了算法的能量消耗问题。节点的能量消耗主要由计算和通讯开销组成,对于算法的计算复杂度和通讯开销,做出了定量的分析。在此基础上,对未来的研究与算法的改... 深入分析比较了在无线传感器网络领域中有代表性的4种分布式定位算法,着重关注了算法的能量消耗问题。节点的能量消耗主要由计算和通讯开销组成,对于算法的计算复杂度和通讯开销,做出了定量的分析。在此基础上,对未来的研究与算法的改进提出了建议。 展开更多
关键词 定位算法 节点定位 无线传感器网络
在线阅读 下载PDF
基于遗传算法的WSN节点定位技术 被引量:23
19
作者 章磊 段莉莉 +1 位作者 钱紫鹃 黄光明 《计算机工程》 CAS CSCD 北大核心 2010年第10期85-87,共3页
提出一种基于遗传算法的无线传感器网络节点自定位技术,在算法的第1阶段利用采样方法对节点初始位置进行初步估计,在第2阶段采用遗传算法对节点初始位置进行求精。仿真实验结果表明,该算法在锚节点比例较低的情况下仍然能够对未知节点... 提出一种基于遗传算法的无线传感器网络节点自定位技术,在算法的第1阶段利用采样方法对节点初始位置进行初步估计,在第2阶段采用遗传算法对节点初始位置进行求精。仿真实验结果表明,该算法在锚节点比例较低的情况下仍然能够对未知节点进行准确定位,且定位精度更高。 展开更多
关键词 无线传感器网络 遗传算法 节点定位 初步定位 定位求精
在线阅读 下载PDF
基于RSSI的无线传感器网络加权质心定位算法 被引量:207
20
作者 陈维克 李文锋 +1 位作者 首珩 袁兵 《武汉理工大学学报(交通科学与工程版)》 2006年第2期265-268,共4页
节点定位是无线传感器网络中的关键技术之一.文中通过对无线电传播路径损耗模型的分析,提出了加权质心定位算法,用信标节点对未知节点的不同影响力来确定加权因子,以提高定位精度.并且在理论分析的基础上,提出了优选信标节点进行节点定... 节点定位是无线传感器网络中的关键技术之一.文中通过对无线电传播路径损耗模型的分析,提出了加权质心定位算法,用信标节点对未知节点的不同影响力来确定加权因子,以提高定位精度.并且在理论分析的基础上,提出了优选信标节点进行节点定位计算的规则,以此进一步提高节点定位精度.加权质心定位算法计算简单,定位过程中节点间无通信开销.节点定位精度较常用的极大似然估计算法高,具有较普遍的应用意义. 展开更多
关键词 无线传感器网络 定位 质心算法 信标节点 极大似然估计
在线阅读 下载PDF
上一页 1 2 20 下一页 到第
使用帮助 返回顶部