基于递归算法的最短跳数路径的RSS测距算法

多跳无线传感网络中的多类应用均需要准确的定位算法.为了降低定位成本,常采用基于接收信号强度(RSS,received signal strength)测距,为此,提出基于递归算法的最短跳数路径的RSS测距算法RFSPR(recursive function shortest path-based ranging).RFSPR算法首先利用递归函数搜索源节点与目的节点间所有具有最短跳数的路径,然后通过RSS测量这些最短路径的距离,最终将所有最短路径距离的平均值作为源节点与目的节点间距离的估计值.最后,将RFSPR算法与现存的同类算法进行了对比分析.实验结果表明RFSPR算法具有更低的测距误差.

RSS Ranging Algorithm for the Shortest Path Based on Recursive Function

In multi-hop wireless networks,location-based applications require an accurate localization algorithm.To locate sensors at a low cost,recursive function shortest path-based RSS ranging(RFSPR) algorithm is proposed.The RFSPR algorithm employs the recursive functions to find all possible paths with the minimum number of hops between a source sensor and a destination sensor.Then the distance among the shortest path is estimated by received signal strength(RSS).Finally the average value of all the shortest path distances is taken as a distance estimate.The proposed algorithm is analyzed and compared with classical algorithms.Numerous simulation results show that the RFSPR algorithm provides distance estimates with low estimation error.