a Novel Energy Efficient, Distributed, Clustering based Network Coverage Method for Enormous WSN

Abstract

Routing is one of the most important issues in wireless sensor networks. In order to transfer packets in the network effectively, a sound path between nodes should exist to reduce data transmission costs. A proper coverage algorithm is very critical to establish a suitable routing algorithm. Small set of nodes in a network is an important consideration for a coverage algorithm. This paper proposes a problem entitled 201C;inter and intra cluster dominating set based routing201D;. Clusters are made in large networks with numerous nodes to perform coverage in both inter and intra cluster levels. Cluster head as the manager of the cluster divides the cluster area into some cells and selects a node for each cell to work as the router of corresponding cell. Regardless to cluster head, the pivot nodes are also in charge of routing in the network. As the result of this algorithm, all the cluster heads and pivot nodes together make a group called dominating set which covers all over the entire region. This is designed to achieve full coverage and also its nodes establish routing backbone of the network. This is carried out in such a manner that every one of the network nodes has direct access to one of the selected pivots. The presented coverage algorithm is based on the platform of our last work in clustering (FEED). Using this technique reduces existing load of cluster head as well especially in huge networks and considerably decreases energy consumption of the regular nodes.