基于网络分区和路径能耗的深井无线传感器网络多簇首路由算法

Study on multiple cluster head routing algorithm of wireless sensor network in deep mine based on network partition and path energy consumption

为解决深部矿井无线传感器网络因节点能量受限导致网络生存时间短及由多跳传输引起的"热区"问题,提出1种以分区结构和能量多路径为基础的带状无线传感器网络多簇首路由算法(NPPEC)。算法采用跳数泛洪方式建立带状网络分区结构,将节点分布密度加入主簇首竞选机制中,通过主簇首和副簇首的分工配合,使簇首能量更均衡地消耗;依据路径能耗、节点当前能量及位置计算路径选择概率,并通过控制跳数改善数据传输的实时性。经仿真比较,NPPEC算法网络生存时间约为LEACH算法的1. 807 2倍、HEED-EELD算法的1. 198 4倍,同时也有效改善了网络"热区"问题,为深部矿井无线传感器网络的构建提供1种更有效的解决方案。

In order to solve the problems of short network lifetime due to limited node energy and “hot area” caused by multiple hop transmission of the wireless sensor network in deep mine, a multiple cluster head routing algorithm of the zonal wireless sensor network based on the partition structure and energy multiple path (NPPEC) was proposed. The algorithm adopted the way of hop-count flooding to establish the zonal network partition structure, and the node distribution density was added into the election mechanism of primary cluster head, so the energy of cluster head was consumed more evenly through the cooperation with division of labor between the primary cluster head and the secondary cluster head. The path selection probability was calculated according to the path energy consumption and the current energy and position of node, and the real-time performance of data transmission was improved by controlling the hop-count. Through the simulation comparison, the network lifetime of the NPPEC algorithm was about 1.807 2 times that of LEACH algorithm and 1.198 4 times that of HEED-EELD algorithm, meanwhile, it also effectively improved the network “hot area” problem. It provides a more effective solution for the construction of wireless sensor network in deep mine.