邻近信息约束下的随机异构无线传感器网络节点调度算法

Neighbor Information Constrained Node Scheduling in Stochastic Heterogeneous Wireless Sensor Networks

针对高密度部署的随机异构传感器网络内部存在的覆盖冗余问题,该文提出一种随机异构无线传感器网络的节点调度算法(NSSH)。在网络原型拓扑的支撑下构建Delaunary三角剖分,规划出节点进行本地化调度的局部工作子集。通过折中与邻近节点的空外接圆半径,完成对感知半径的独立配置;引入几何线、面概念,利用重叠面积和有效约束圆弧完成对灰、黑色节点的分类识别,使得节点仅依赖本地及邻居信息进行半径调整和冗余休眠。仿真结果表明,NSSH能以低复杂度的代价,近似追平贪婪算法的去冗余性能,并表现出了对网络规模、异构跨度和参数配置的低敏感性。

Considering coverage redundancy problem existed in random heterogeneous sensor networks with high density deployment,a Node Scheduling algorithm for Stochastic Heterogeneous wireless sensor networks(NSSH)is proposed.The Delaunary triangulation is constructed based on the network prototype topology to work out a local subset of nodes for localization scheduling.Independent configuration of the perceived radius is achieved by discounting the radius of the circumcircle with the adjacent node.The concept of geometric line and plane is introduced,and the overlapping area and the effective constrained arcs are used to classify and identify the grey and black nodes.So the node only relies on local and neighbor information for radius adjustment and redundant node sleep.The simulation results show that NSSH can approximately match the dropping redundancy of greedy algorithm at the cost of low complexity,and exhibit low sensitivity to network size,heterogeneous span and parameter configuration.