CAJ | 학술논문

对目前应用较为广泛的DV-Hop定位算法进行了分析，针对其在跳段估计及位置计算中的不足，提出了一种基于细菌觅食算法（BFA）和跳段校正的定位算法BFA-HC。该算法首先根据接收信号强度指示（RSSI）阈值优化节点间的跳数，在此基础上基于最小均方误差准则计算锚节点的平均每跳距离，当未知节点获得3个或以上锚节点的距离后应用细菌觅食算法进行位置估计。仿真结果显示，BFA-HC 算法在不同网络规模、不同网络连通度及不同锚节点比例条件下均可以显著提高传感器网络节点的定位精度。
대목전응용교위엄범적DV-Hop정위산법진행료분석，침대기재도단고계급위치계산중적불족，제출료일충기우세균멱식산법（BFA）화도단교정적정위산법BFA-HC。해산법수선근거접수신호강도지시（RSSI）역치우화절점간적도수，재차기출상기우최소균방오차준칙계산묘절점적평균매도거리，당미지절점획득3개혹이상묘절점적거리후응용세균멱식산법진행위치고계。방진결과현시，BFA-HC 산법재불동망락규모、불동망락련통도급불동묘절점비례조건하균가이현저제고전감기망락절점적정위정도。
The widely used DV-Hop localization algorithm is analyzed. In view of the insufficient in the hop estimation and position calculation, BFA-HC (Bacterial Foraging Algorithm and Hop Correction) localization algorithm is proposed. The number of hops between adjacent nodes is corrected according to the threshold values of received signal strength indicator, then its average hop dis-tance of each anchor node is calculated based on the minimum mean square error criterion. Finally, the position of unknown node is calculated by bacterial foraging algorithm when it obtains Euclidean distance to three or more anchor nodes. Simulation results show that BFA-HP algorithm can greatly improve the location accuracy of the sensor network nodes under the conditions of different network sizes, different network connectivity and different proportion of anchor nodes.