Cluster based routing technique is most popular routing technique in Wireless Sensor Networks (WSNs). Due to varying need of WSN applications efficient energy utilization in routing protocols is still a potential area of research. In this research work we introduced a new energy efficient cluster based routing technique. In this technique we tried to overcome the problem of coverage hole and energy hole. In our technique we controlled these problems by introducing density controlled uniform distribution of nodes and fixing optimum number of Cluster Heads (CHs) in each round. Finally we verified our technique by experimental results of MAT-LAB simulations. Index Terms-energy, efficient, routing, WSN, static, clustering, hole. Lots of research has been done to control energy utilization in the network layer of WSN. Clustering technique got great attention in resolving energy utilization issue. In clustering technique, data is first gathered and then forwarded to Base Station (BS). A uniform distribution of nodes and optimum number of CHs in each round helps to control load distribution in clustering technique which, ultimately utilizes energy efficiently. As a second step controlling the number of clusters formed during network operation enhances the network stability and lifetime. A network is said to be stable if difference between first node died time and last node died time is minimum [1] . Optimum number of CHs not only control load distribution but also uses energy efficiently. One of the problem in clustering technique is the creation of energy holes. In random distribution of nodes CHs which are overloaded cause the creation of energy holes. In multihop data forwarding technique, nodes near the BS consume large energy. These area of nodes are also called hotspots [1] . Energy depletes quickly in the hotspot areas of network. W.R. Hienzelman, A.P. Chandrakasan and H. Balakrishnan proposed LEACH [2]; one of the first clustering routing protocol for WSNs. According to LEACH algorithm, selection of CH for current round is probabilistic. Therefore, in this approach, of CH selection CHs formed are not uniformly distributed, which may cause existence of disconnected nodes. LEACH-Centralized (LEACH-C) is an extension of LEACH which is proposed by Balakrishnan, Chandrakasan and Heinzelman [3] . The plus point of this algorithm is that, BS makes sure that node with less energy does not become CH. However in large scale network, nodes far away from BS are unable to send their status to BS. Multihop-LEACH protocol is proposed by Nauman Israr and Irfan Awan [4] . Multihop-LEACH has mainly two modes of operations, i.e., multihop inter-cluster operation and multihop-intra cluster operation. In the leading operation nodes sense the environment and send their data to CH, this data is received by BS through a chain of CHs, while the lagging operation is performed in time out period. However, in both modes of operations CH is selected randomly. This agreement does not guaranty full area coverage of the entire network which, it is monitoring. W. Jun, et al. [5] proposed LEACH-Selective Cluster (LEACH-SC). CH selection in LEACH-SC is like LEACH. The algorithm changes the theme of cluster formation in such a way that node finds CH closest to the mid point between itself and BS, then joins that cluster. However, number of CHs fluctuate as rounds proceed. Localization problem is discussed in [6] and [7] . Authors divided the network area in to sub areas. The localization technique helps to improve the coverage hole problem. In this research work we introduce a new clustering technique of routing layer communication. In Density controlled Divide-and-Rule (DDR), nodes are distributed uniformly in the network and randomly distributed in different segments of network; to control the density. In this way coverage hole problem can be avoided. Secondly in DDR, clusters formed are static and number of clusters remain fix during network operation. The number of clusters formed are near to optimum number. This helps in efficient energy utilization and uniform load distribution. Rest of the paper is organised as under.
Authors in REF proposed Density Controlled Divide-and-Rule LEACH.
Density Controlled Divide-and-Rule Scheme for Energy Efficient Routing in Wireless Sensor Networks
2013 26th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)
2013 26th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)
Computer Science