Abstract:

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.

Key words: wireless sensor networks, near static clustering, probabilistic coverage, Prim tree