基于分簇的水下传感器网络覆盖保持路由算法

Cluster-Based Coverage-Preserving Routing Algorithm for Underwater Sensor Networks

在基于分簇架构的水下传感器网络(Underwater Sensor Networks,UWSNs)中,当簇首以单跳或多跳的通信方式将数据传输至Sink节点时,由于簇首转发大量数据而负载过重,会过早耗尽能量而死亡,这将导致提前出现对监测区域的覆盖盲区.以改善覆盖效果为目标的LEACH-Coverage-U算法由于选举簇首的分簇方法具有随机性,也无法很好解决该问题.本文提出了一种水下传感器网络单跳覆盖保持路由算法(Single-hop Coverage-Preserving Routing Algorithm,SCPR),首先定义了覆盖冗余度(Coverage Redundancy,CR),然后根据该度量来选举簇首,最终以单跳方式直接将数据传送至Sink节点.为减少簇首能耗并获得更高的网络覆盖率,本文还提出一种多跳覆盖保持路由算法(Multi-hop Coverage-Preserving Routing Algorithm,MCPR),簇首之间通信时优先考虑父节点中CR较高的簇首作为其下一跳路由,以多跳路由将数据传送至Sink节点.仿真结果表明,与LEACH-Coverage-U算法相比,SCPR。

In Underwater Sensor Networks （UWSNs） based on clustered architecture ,cluster heads forward large number of data packets when they send data to the Sink using a single-hop or multi-hop mechanism .This mechanism can overload cluster heads ,which soon become depleted of energy ,causing coverage holes quickly .The LEACH-Coverage-U algorithm attempts to solve this problem ,but because the cluster heads are randomly elected ,this algorithm cannot solve this problem very well .In this paper , we propose a single-hop coverage-preserving routing algorithm （SCPR ） for UWSNs .This algorithm first defines a metric of cover-age redundancy （CR ） ,and elects the cluster heads according to this metric .A cluster head sends the aggregated data directly to the Sink .To reduce energy consumption and achieve higher network coverage ratio ,we also propose a multi-hop coverage-preserving routing algorithm （MCPR ） ,where each cluster head prefers to select the node that has higher CR in the parent nodes as its next hop node .Finally ,the aggregated data are sent to the Sink using multi-hop routing .Simulation results show that ,compared to the LEACH-Coverage-U algorithm ,both the SCPR and MCPR algorithms solve the problem that the cluster heads are randomly elected , improve the network coverage ratio ,reduce network energy consumption and extend network lifetime .