An Efficient approach to control coverage overlapping and energy-aware protocol in Wireless Sensor Networks

Abstract

Wireless Sensor Network is one kind of wireless network includes a large number of circulating, self-directed, minute, low powered devices named sensor nodes. These networks certainly cover a huge number of spatially distributed, little, battery-operated, embedded devices that are networked to caringly collect, process, and transfer data to the operators, and it has controlled the capabilities of computing & processing. Nodes are the tiny computers, which work jointly to form the networks. To achieve better coverage and prolong network lifetime, networks typically adopt clustering protocols with hierarchical inter-cluster topology for network management and data acquisition in WSNs. However, typical solutions require cluster re-configuration due to early death of cluster heads (CHs) and cause energy inefficiency. This paper proposes a coverage- and energy-aware protocol with intra- and inter-cluster methods called CEMST that considers the sensor node density and coverage overlapping. In addition, to adapt network dynamics while improving energy efficiency, self-stabilizing algorithm and Bor?vka algorithm are applied to construct the minimum spanning trees (MST) for intra- and inter-cluster routes, respectively.