防边界收缩的无线传感器网络节点轻量级调度算法

Nodes Lightweight Scheduling Algorithm of Preventing Boundary Contraction in Wireless Sensor Network

针对高密度部署的无线传感器网络边界节点邻居数量低于内部节点而导致休眠概率不均等进而边界收缩的问题,提出了一种轻量级调度算法.根据邻居表中节点的数量以及邻居节点的工作邻居数量判定节点是否处于网络边界,对于边界节点和内部节点采用不同的调度策略,并分别计算得出处于网络边界的节点被n个邻居完全覆盖的概率和边界节点被n个邻居覆盖的面积分数的范围.仿真结果表明,该算法能够有效缓解边界收缩问题,延长网络生命周期.

The number of boundary nodes neighbors is less than that of the internal nodes in high- density deployment wireless sensor network, which will lead to unequal probability of sleep and the problem of boundary contraction. To solve the problems, a nodes lightweight scheduling algorithm was proposed to prevent boundary contraction. The number of nodes in neighbor table and the number of neighbor nodes＇ working neighbors were used to determine whether the node was in the network boundary. For those boundary and internal nodes, different scheduling strategies were used. The probability of nodes covered completely by n neighbors in the network boundary and the range of area fraction of the boundary node covered by n neighbors were calculated, respectively. The simulation results showed that the boundary contraction can be effectively alleviated and the network life cycle can be extended by using the proposed algorithm.