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

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