Abstract: In order to meet the requirement of the specified coverage and minimize the number of nodes in three-dimensional Wireless Sensor Network, a neighbor classification-based node scheduling algorithm has been proposed. The paper firstly sorts neighboring nodes by to the different distance and analyzes the constraint relation between the coverage rate of neighboring nodes and the number k of active nodes in each sort. Then the algorithm judges the redundant status of nodes by the constraint relationship and rests the redundant nodes by back-off scheme. The theories?analysis and simulation results show that the scheme can effectively check and rest the redundant nodes based on meeting the specified coverage and prolong the lifetime of the networks.

Key words: Wireless Sensor Network（WSN）, three-dimensional coverage, node-scheduling, classification of neighboring nodes

摘要： 在三维无线传感器网络中为了满足指定的覆盖率要求，同时使活动节点数最少，提出了一种基于邻节点分类的调度算法。将邻居节点按距离分类，分析了每类邻居节点的网络覆盖率与活动节点数[k]之间的约束关系，根据此约束关系判断节点是否冗余，并通过回退机制休眠冗余节点。理论分析和仿真结果表明，该算法能在满足指定覆盖率的条件下有效判别和休眠冗余节点，从而延长网络的寿命。

关键词: 无线传感器网络, 三维覆盖, 节点调度, 邻居节点分类