大规模无线传感器网络中近似静态分簇的高效概率覆盖协议

Efficient Probabilistic Coverage Protocol for Near Static Clustering in Large Scale Wireless Sensor Networks

为在大规模无线传感器网络中获得较好的网络性能,提出一种基于近似静态分簇的高效概率覆盖协议EPCSC.该协议通过近似静态分簇节省网络资源,保持网络连通性.根据网络QoS期望值选择必需节点数目来保证网络服务质量,实行簇头轮换机制,并在簇头间构建近似Prim最小生成树来有效延长网络生命期.仿真结果表明,EPCSC协议能有效降低控制开销,显著延长网络生命期,提供满足应用期望的网络服务质量.

In order to achieve good network performance, an efficient probabilistic coverage protocol using near static clustering （EPCSC） is proposed for large-scale wireless sensor networks （LWSN）. This protocol employs a near static clustering to economize network resource and insure the network connectivity. It selects minimum number of active sensors to achieve expected quality of service （QoS）, implements cluster heads （CH） rotation mechanism, and computes transmitting path by using approximate Prim minimum spanning tree algorithm to prolong the network lifetime. Simulation results show that the EPCSC protocol can effectively reduce control overheads and prolong network lifetime, and provide desired QoS in LWSN.