Keeping Desired QoS by a Partial Coverage Algorithm for Cluster-Based Wireless Sensor Networks

Abstract

Many studies were done on design algorithms to completely cover an area. We can call the issue as a complete coverage problem. Although there were many researches about proposing a partial coverage issue; almost all of the studies only focus on lengthening the lifespan of wireless sensor networks (WSNs) but ignore the truth that a wireless sensor network will inevitably lose its coverage because of exhausted energy during the operating time. Lifespan refers to wireless sensor network offering its service to meet the required coverage ratio. In this work, we propose a topology control algorithm for cluster-based wireless sensor networks to keep predefined Quality of Service (QoS) of coverage as long as the sensor nodes can stand. The algorithm forms a multi-hop cluster network with a required connectivity by using a novel cluster head competition scheme and proper transmission of power settings. It can organize sensor nodes into clusters actively to achieve required coverage ratio as long as possible. The algorithm is suitable for practical applications of large-scale or high-density wireless sensor networks due to its distributed processing and scalable cluster topology