节点文献

具有自修复能力的水下无线传感器网络定位算法的研究

Research on Localization Algorithm in Underwater Wireless Sensor Networks with Self-healing

【作者】 张敏

【导师】 乔学工;

【作者基本信息】 太原理工大学 , 电子科学与技术, 2016, 硕士

【摘要】 作为水下监测的理想媒介,水下无线传感器网络继承了无线传感器网络的低成本、灵活性、容错性、鲁棒性等优点,将其应用延伸到了水下环境中。传感器节点采集到的信息需要结合其位置坐标才有意义,这是水下无线传感器网络各种应用实现的必要前提,所以节点定位作为一个关键技术引起了广泛的关注。由于水声信号传输时延长、信道带宽窄、传播损耗大和多径效应等特点,结合水下节点具有移动性且很难得到其移动规律的特点,使得大量基于陆地无线传感器网络定位算法的研究成果不能直接应用到水下环境中。在目前国内外水下无线传感器网络定位算法研究基础上,本文提出了一种具有自修复能力的水下无线传感器网络定位算法(SLA)。该算法部署节点时不区分锚节点与普通节点,而是通过K节点覆盖算法来选举出一部分节点为锚节点,使得网络中的普通节点最大限度的被4个锚节点所覆盖。然后锚节点通过水面浮标定位自身,普通节点获取了不在同一平面的至少4个锚节点的位置信息后通过四边测量法估算自身坐标。本文算法还具有自修复能力,通过找出其他节点替代低能量或失效的锚节点来定位所覆盖的普通节点,避免重复进行选举锚节点这一过程,降低了因锚节点能量耗尽或失效而造成的定位误差。为了检验算法的性能,采用MATLAB软件对本文SLA算法和大规模定位法(LSL)进行了仿真对比分析,结果表明本文提出的具有自修复能力的水下无线传感器网络定位算法可以提高节点定位精度和定位覆盖率,并且适用于流速缓慢的水下环境中。

【Abstract】 As the marine environment ideal media, underwater wireless sensor network inherits the characteristics of the wireless sensor network, which has low-cost, flexibility, fault tolerance, and robustness, etc. It extends the applications of wireless sensor network to underwater environment. The information collected by nodes in underwater wireless sensor network will make sense in case the locations of corresponding nodes can be obtained, this is the premise to achieve the underwater wireless sensor network application. Hence node localization is viewed as a key technology that has been widely studied.Underwater acoustic channel has many characteristics, for example, big propagation delay, less bandwidth, serious path loss, and multi-path effects, etc,in addition, the nodes in network are more likely to be able to move, and it is difficult to obtain its moving rules. These characteristics make a lot of research achievement of wireless sensor network based on land cannot not perfectly suitable for underwater.Based on the research at home and abroad of localization algorithm in underwater wireless sensor networks, this paper has presented a localizationalgorithm in underwater wireless sensor networks with self-healing(SLA). When deploying nodes, there is no difference between every node in this algorithm, we find the anchor nodes through k-node coverage algorithm to make maximum common sensor nodes covered by four anchor nodes. Anchor nodes are capable of communicating with surface buoys and localizing themselves, then common nodes obtain at least four anchors nodes’ location information to localize themselves through quadrilateration, these four anchors nodes are not in the same plane. This algorithm also can find substitutes for a low-energy or sudden-crash anchor node to localize the ordinary nodes covered by this anchor node, this is done in order to avoid repeating the step: find the anchor nodes, and reduce the location error cause by the anchor nodes since they are being exhausted or sudden crash.Through using the MATLAB tool to simulate the SLA localization algorithm and comparing the localization algorithm for large-scale underwater sensor networks(LSL). The simulation results show that the SLA algorithm can improve the positioning accuracy and localization coverage comparing with LSL algorithm, and the SLA algorithm is suitable for the slow flow velocity of underwater environment.

  • 【分类号】TN929.3;TP212.9
  • 【被引频次】1
  • 【下载频次】182
  • 攻读期成果
节点文献中: 

本文链接的文献网络图示:

本文的引文网络