基于矩形分区覆盖的节点确定部署策略

Determined Node Deployment Strategy Based on Rectangular Partition Coverage

针对井下无线传感器网络k(k=2)重覆盖问题,提出一种基于矩形分区覆盖的节点确定部署策略。采用矩形分区覆盖部署方式,在只给出网络规模和节点感应半径的条件下,求出网络所需最少节点个数和节点间距。理论分析和仿真实验表明,该策略不仅能够满足井下无线传感器网络的覆盖度要求,而且比等腰三角形分区覆盖部署和线形部署节省约7%的节点数目,网络平均路由跳数约为等腰三角形部署和线形部署的1/2。

In order to address the k-coverage issues of wireless sensor networks in coal mine laneway, a determined deployment strategy is proposed based on rectangular partition coverage. It solves k-coverage problems by deploy nodes on both sides of laneway according to the rectangular arrangement. The isosceles triangle partition coverage and linear coverage are discussed too. The theoretical analysis and simulation results show that the proposed strategy can satisfy the coverage requirements of wireless sensor networks in mine laneway and save about 7% node numbers than isosceles triangle partion coverage deployment strategy and linear deployment strategy, and the average hops of information relay based on rectangular partition coverage is only 1/2 of isosceles triangle deployment and linear deployment.