与位置无关的节点调度算法比较分析

Comparison and analysis of node scheduling algorithms on position-independent in WSNs

无线传感器网络中,通过对节点的合理调度,可以实现节点能耗均衡、延长网络生命周期的目的.分析与位置无关的节点调度算法发现,随机独立休眠算法(RIS)不需要调度时间同步,未考虑节点死亡对工作概率值p的影响,适应性差;基于部署特征的轻量级节点调度算法(LDAS),考虑覆盖率的影响,但需要频繁交换邻居节点信息;基于测距的睡眠调度算法(RBSS),通过测距寻找正六边形覆盖模型,具有较高的覆盖度,需要时间同步,未考虑能量均衡.从初始节点数、工作节点数和网络覆盖率3方面仿真验证说明其性能,为选择节点调度算法以及后续改进提供指导.

In wireless sensor networks, by reasonable scheduling of nodes, energy consumption balance and prolonging the network life cycle are achieved. The position-independent node scheduling algorithms is analyzed, and it is found that a random independent sleep algorithm(RIS) does not require scheduled time synchronization, and does not consider the influences of a node death on its running probability p and has poor adaptability. A lightweight node scheduling algorithm(LDAS) based on the deployment features considers the impact of coverage, and then it needs to exchange the information of neighbor nodes frequently. A range based sleep scheduling algorithm(RBSS) looks for regular hexagon coverage model by measuring distance with high coverage. The RBSS needs time synchronization and does not consider nodes energy balance. By simulation, the performance of the algorithms is compared from the number of the initial nodes and working nodes, and network coverage, which provides guidance for selection of valid node scheduling algorithms and subsequent improvement.