基于覆盖与连通的WSN节点调度算法

Node scheduling algorithm based on coverage and connectivity in Wireless Sensor Networks

在维护区域覆盖和网络连通性的前提下,提出了一种基于最小跳数的分布式节点调度算法(MBNS)。距网关最小跳数相等的节点形成以网关为中心的最小跳数环,将网络划分为环状层次拓扑结构;每个节点根据其上行和下行节点维护了一条到网关节点的最短跳数路径,解决数据路由的同时有效降低了数据发送延迟。理论分析和仿真实验表明,MBNS能有效减少工作节点个数,降低数据发送延迟和延长网络寿命等。

This paper presents a Minimal-hop-to-sink Based Node-Scheduling algorithm（MBNS） under the constraints of field coverage and network connectivity. Sensors of the same hop to the sink form a Minimal-Hop-Ring（MHR） while all sensors construct a ring-leveled topology. Besides,each node maintains a sbertest path to the sink by knowing its upstream and downstream nodes, which solves data routing problem as well as decreases the data send delay greatly. The analytical and experimental results prove MBNS can minimize the active nodes, decrease data send delay and prolong network life greatly.