HOME JOURNALS CONTACT

Information Technology Journal

Year: 2014 | Volume: 13 | Issue: 4 | Page No.: 676-682
DOI: 10.3923/itj.2014.676.682
Energy-efficient Cluster Head Selection for Life Time Enhancement of Wireless Sensor Networks
M. Senthil, V. Rajamani and G.R. Kanagachidambaresan

Abstract: Wireless Sensor Network (WSN) are basically battery powered and they are basically power starving in nature. Aim of this study is to find an Energy efficient Cluster Head, which enhances the lifetime of the WSN. The energy dissipation is based on the position with respect to the sink and residual energy of the corresponding node. The energy dissipation due to transceiver operation is high when considered to sensing and processing operation. Energy dissipated due to transceiving operation is proposed in Radio Energy model. Taking this to account the energy dissipated by the node due to transceiving operation is reduced. Unequal clustering approach is done and Cluster Head (CH) is selected from the cluster that is near towards the sink so as to increase the lifetime of the sensor network. The proposed EECHS algorithm is compared with LEACH and ALEACH algorithms for its performance comparison. Experimental results show the EECHS has an increased lifetime and overhead when compared to other protocols. This EECHS suits its application on Industrial monitoring, Farming and militant application.

Fulltext PDF Fulltext HTML

How to cite this article
M. Senthil, V. Rajamani and G.R. Kanagachidambaresan, 2014. Energy-efficient Cluster Head Selection for Life Time Enhancement of Wireless Sensor Networks. Information Technology Journal, 13: 676-682.

Keywords: smart environments, WSN-wireless sensor network and unequal clustering

INTRODUCTION

Tiny sensing nodes which senses the physical parameters such as temperature, pressure, etc., forms to contribute a Wireless Sensor Network (WSN). Wireless Sensor nodes are battery enabled which is power starving in nature. Many researchers work in this area for enabling a energy efficient routing and to enhance the lifetime of WSN. Energy efficient routing has its application in Industrial monitoring, agricultural, militant applications and many other fields (Chong and Kumar, 2003). WSN is left unattended and it serves autonomously in many anti third environment. The Sensor Network works on two basic architecture namely, Layered and Clustered Architecture. The Layered Architecture works for the small networks which serve it purposes in underground or underwater sensor networks. The Clustered Architecture has the large scalable strength that can deal with large amount of sensor nodes deployed in the Region of Interest (ROI) which is the sensing area. The Clustered Architecture segregates the group of nodes into one cluster leaded by a CH based on some factors like distance, hop count and energy of the nodes in the corresponding cluster. The Clustered Architecture is initialized up with the setup phase followed by the steady phase (data communication to BASE STATION) (Abbasi and Younis, 2007). Any node inside the network can reach the Base station atmost in two hops.

Fig. 1: Wireless sensor networks scenario

Selection of CH in the network is autonomous which is done by hierarchical algorithms such as LEACH, LEACH-C and ALEACH.

Figure 1 represents the basic clustering architecture of the WSN. Group of nodes forms a cluster based on some criteria such as location, energy etc. Clustered architecture is followed when the area of sensing is so large as illustrated in Fig. 1.

The lifetime of the whole WSN is dominated by sensor node distance between the source and sink. The wireless sensor node, senses the data, transmits the data, receive the data and transceives the data to the sink. The distance between each node and the layout of the network is understood by the GPS sensors enabled in individual motes in the network (Haque et al., 2009). The network architecture of these tiny nodes is based on Layering and Clustering approach. Clustering methodology is the key way to enhance the lifetime of the WSN (Akyildiz et al., 2002). Past literature survey on lifetime enhancement of WSN provides an enhanced lifetime based on energy consumption and remaining energy of the battery. Low Energy Adaptive Cluster Hierarchy (LEACH) is the basic methodology for a clustering based approach which reduces the power consumption of WSN (Yang and Zhang, 2009; Xin et al., 2008; Wang et al., 2011). The CHs are the important members in the sensor network which dissipates more power in transceiving the data to the sink. The election of the CH is the important key factor in order to enhance the lifetime of the network as given by Aimin Wang (Lindsey and Raghavendra, 2002), other improved clustering approach such as PEGASIS (Kim and Chung, 2006), LEACH mobile (Chamam and Pierre, 2010), Energy Efficient Cluster Formation protocol (EECF) (Torkestani and Meybodi, 2011), Localized Learning Automata-based Clustering Algorithm LLCA (Dhulipala et al., 2012) proposed a power efficient routing algorithm, which lags in considering the CH selection based on the distance between the sink and CH. Most of the energy consumed in the wireless sensor node is because of transceiving the data from source to sink (Ali et al., 2008). Researchers have improved LEACH in many ways which lags in considering selection of optimal CH based on the distance. Ali et al. (2008) proposed an algorithm Advanced LEACH which improved the CH selection and enhanced lifetime of the WSN but, the network is not aware of the position of individual node and CH selection based on the distance is not considered (Al-Fares et al., 2009; Handy et al., 2002; Gou and Yoo, 2010; Liu and Li, 2009; Ehsan and Hamdaoui, 2012; Chipara et al., 2006; Kandris et al., 2009; Sutar and Bodhe, 2010; Bajaber and Awan, 2009; Watfa et al., 2009).

In taking the factors like cluster size and form, criteria of CH selection, and distance into account, clustering approach is done in this study. This study presents an improved algorithm of dividing the cluster based on the position of sink in the network. This improved protocol is called EECHS algorithm which proves to be energy efficient in nature.

MATERIALS AND METHODS

LEACH: In LEACH protocol, every node n generates a random number in the interval [0,1] at the beginning of each round, if the number is less the threshold Pi(t) calculated from equation given below:

(1)

K is the number of CHs, N is the number of nodes in the network, r current number of rounds, the Ci(t) = 0 if node already been a CH and 1 otherwise. The ordinary nodes in the clusters send the data to the CH and CH contributes the data to the sink in a single hop. The CH after dissipating the energy below a certain level next CH is being selected for its contribution as CH for the corresponding cluster. Equation 1 shows the election probability of the CH which means that all the nodes can themselves have the chance to get elected as a CH no matter what far the distance they have with the sink. If the elected node is far away from the sink, node dissipates more energy in transceiving the data with the sink thereby it dies soon and makes the next election to the network. If the probability of nodes nearby the sink is high it ensures the energy dissipation of the node to be low and in making a enhanced lifetime of the network.

ALEACH: Similar to LEACH, ALEACH introduces the current state probability for the original threshold given as equation below. The node with more residual energy has higher probability to be a CH. Obviously the threshold generated by equation 1 is not regarding the distance where distance is the main factor to be considered:

(2)

Radio energy model: The transmission of data is based on the radio model given below. The radio model is given by:

(3)

Receiver’s energy consumption is:

Erx(l) = ERx-elec(l) = lEelec
(4)

wherem Eelec is the energy dissipated per bit to run the transmitter or the receiver circuit εfsd2 (pJ/bit-m2), εmpd4 (pJ/bit-m-2): Energy dissipated per bit to run the transmit amplifier based on the distance between the transmitter and receiver.

Equation 3, 4 signifies the energy dissipated by the node in sending the data from one node to another. The energy consumed by node in sending the data and receiving the data is given in Eq. 3, 4. The energy dissipation of sending and receiving the data with respect to distance is given in Eq. 3. The energy of the sensor nodes is represented in Joules.

Proposed work: Most of the energy dissipated by the node is through the radio model of the node. The energy dissipated by the sensor node is proportional to the distance between the source and the sink of the node as per Eq. 3. By taking distance, as the consideration in this study the probability of the CH selection is made based on the distance with the sink and the CH. In this proposal the clusters are separated in semi cluster which is near to sink when compared to the other half. The cluster is evaluated with the help of Voronoi diagram. The corresponding position of the first node and the last node in the cluster is found and the cluster is divided as per the positions of the two nodes. The CH dissipates more amount of power when compared to other nodes since it transceives the data from ordinary nodes to the destination.

In LEACH protocol the probability of selection of CH is as per Eq. 1:

(5)

The above equation describes the probability of being a CH in LEACH protocol. The CH probability selection is not based on the distance with the sink. In case of agricultural and industrial monitoring system the sink is far away from the cluster and distance plays a main role in CH Selection.

Thereby:

(6)

Where:
k→No. of CHs
r→No. of rounds
N→No. nodes in the network:

Where:
dis→distance between the corresponding node to the sink
djs→distance between the last node of the corresponding cluster to the sink

Figure 2 represents the Probability of choosing the Cluster Head within a cluster. Sensor node represented inside the circle in Figure 2 belongs to same cluster. Node with red top is having a highest probability of being a cluster head since it very near to the sink.

Mathematical Proof: Energy spent by clustered head is:

(7)

Where:
ENrec→energy dissipated during receiving data
k→No. of nodes in the corresponding cluster
r→No. of rounds in simulation
dij→total No. data from cluster nodes to CH

From radio model Eq. 4, the energy dissipated by CH in receiving the data is given by the equation above, which depends on the distance between the ordinary node and the CH:

(8)

Where:
ENtrans→energy dissipated during transmitting data to BASE STATION
dij*→total No. of data sent on each node during its role as CHS

The energy dissipated by the CH during the transmission of data to the sink is given by the above equation.

On substituting Eq. 7, 8 the total energy dissipated is the factor of distance and is given by:

(9)

The CH transceives the data packet from the ordinary nodes to the Base Station which is at a long distance from the cluster.

Fig. 2: Shows the proposed work cluster head selection

Fig. 3: Clustered architecture of the energy efficient cluster head selection

On minimizing the distance between the CH and Base Station the energy dissipation is made minimum.

Figure 3 illustrates the proposed work and probability of selection of cluster head with respect the Eq. 6. A group of clusters forms together monitors single event and sends the signal to the sink as shown in Fig. 3.

EECHS is based on LEACH protocol. It uses the location of the sensor using the GPS sensor devices and nominally selects the CH that is not been a CH in the previous phase.

In the steady state phase of EECHS each ordinary node is allocated time to send data to the CH and each node sends the packet at the corresponding slot. The ordinary nodes use the radio model equation given in Eq. 4 to dissipate the energy during transmission and reception of packet. The Base station calculates the distance between Cluster Heads and its own and selects the CH and sends the confirmation to all nodes alive in the network.

Preliminaries:

All the sensors are deployed in the ROI (Region Of Interest)
All nodes are energy starving and initially with same energy
The nodes are simpler or CHs
The nodes are immobile
Sink node is connected with permanent power source

Table 1 represents the simulation parameters taken to support the proposed work. Table 1 discusses the Network size, Number of nodes, Base station Location, Eelec, Efs, Initial Energy, Probability of becoming of CH, Data message size and Header bytes.

Table 1: Simulation results and network parameters simulation results and network parameters

RESULTS AND DISCUSSION

To support the proposed work it is evaluated using MATLAB to compare with LEACH, ALEACH. A set of 200 nodes were randomly distributed in the ROI, and the data message size was fixed to be 2000 bytes with 50 bytes of packet header. The base station is located in 750, 250 outside the network since it is mainly framed for industrial and agricultural activity. The study evaluated the energy dissipation by using the radio model given from the Eq. 3, 4. The probability of being a CH is selected from Eq. 5.

A 500x500 area is taken as the simulation area. Figure 4 represents the sensor nodes are randomly distributed in the Region of Interest. The Base Station of the network is located in (750, 250) for better results as shown in above Fig. 4.

Figure 5 shows the graph which represents the number of rounds vs total number of nodes in which the EECHS is energy active for more rounds than ALEACH and EECHS. The EECHS protocol services for about 1851 rounds when compared to the other two protocols. EECHS effectively performs with the reduced energy consumption for industrial and agricultural applications. The threshold of the nodes becomes less on increasing in number of rounds, in order to avoid the energy whole problem the probability of node after being a CH is made zero until its next opportunity comes. So, that the nodes in the left side part actively participates in survival of network at the end stage. The total number of CH selection is made evenly throughout the simulation by this approach.

Figure 6 describes the total number of packets delivered to the Base Station located at (750, 250). EECHS proves to send more packets to the Base Station in an energy efficient manner. The total packets sent for every hundred rounds is graphed. EECHS on compared with previous algorithms give an enhanced lifetime and enhanced overhead.

Voronoi diagram divides the ROI into number of clusters; also it represents the CH and nodes closer to the corresponding CH.

Fig. 4: Sensor node deployment in ROI (Region of Interest)

Fig. 5: No. of rounds (vs) Total No. of nodes

Figure 7 shows the Voronoi representation of the ROI, in which the nodes are discussed as clusters. The sensor nodes are being distributed as clusters, in which the node which is near to the Base Station is given more priority to be the CH in the Voronoi diagram. CH in most of the cluster is selected from the right half due to location of sink in the right side of the ROI.

Figure 8 illustrates the total number of packets sent by all cluster throughout the simulation, EECHS gives a high throughput when compared to other two protocols.

Fig. 6: Total packets sent to base station (vs) Number of rounds

Fig. 7: Voronoi diagram of the proposed algorithm

Fig. 8: Overhead comparison

CONCLUSION

The proposed EECHS efficiently works in reducing the energy consumption of the WSN by optimally selecting the CH with respect to the location of the sink. Radio model mainly contributes in dissipation of the energy of the sensor nodes, which is proportional to the distance between the source and sink. By optimally selecting the CH taking distance as the main factor the energy dissipation is reduced. The simulation results shows the effectiveness of the proposed algorithm on comparison with LEACH and ALEACH protocols. This protocol serves it purpose in agriculture monitoring, industrial monitoring and civil construction application where the sink is located out the cluster in WSN. EECHS presents a increased lifetime of 1.28 times the LEACH survivability.

REFERENCES

  • Abbasi, A.A. and M. Younis, 2007. A survey on clustering algorithms for wireless sensor networks. Comput. Commun., 30: 2826-2841.
    CrossRef    Direct Link    


  • Akyildiz, I.F., W. Su, Y. Sankarasubramaniam and E. Cayirci, 2002. Wireless sensor networks: A survey. Comput. Networks, 38: 393-422.
    CrossRef    Direct Link    


  • Al-Fares, M.S., Z. Sun and H. Cruickshank, 2009. A hierarchical routing protocol for survivability in Wireless Sensor Network (WSN). Proceedings of the International Multi Conference of Engineers and Computer Scientists, Volume 1, March 18-20, 2009, Hong Kong, pp: 1406-1410.


  • Bajaber, F. and I. Awan, 2009. Centralized dynamic clustering for wireless sensor network. Proceedings of the International Conference on Advanced Information Networking and Applications Workshops, May 26-29, 2009, Bradford, UK., pp: 193-198.


  • Chamam, A. and S. Pierre, 2010. A distributed energy-efficient clustering protocol for wireless sensor networks. Comput. Electr. Eng., 36: 303-312.
    CrossRef    


  • Chong, C.Y. and S.P. Kumar, 2003. Sensor networks: Evolution, opportunities and challenges. Proc. IEEE, 91: 1247-1256.
    CrossRef    Direct Link    


  • Kandris, D., P. Tsioumas, A. Tzes, G. Nikolakopoulos and D.D. Vergados, 2009. Power conservation through energy efficient routing in wireless sensor networks. Sensors, 9: 7320-7342.
    CrossRef    


  • Gou, H. and Y. Yoo, 2010. An energy balancing LEACH algorithm for wireless sensor networks. Proceedings of the 7th International Conference on Information Technology: New Generations, April 12-14, 2010, Las Vegas, NV., USA., pp: 822-827.


  • Handy, M.J., M. Haase and D. Timmermann, 2002. Low energy adaptive clustering hierarchy with deterministic cluster-head selection. Proceedings of the 4th International Workshop on Mobile and Wireless Communications Network, September 9-11, 2002, Stockholm, Sweden, pp: 368-372.


  • Haque, M.E., N. Matsumoto and N. Yoshida, 2009. Context-aware cluster-based hierarchical protocol for Wireless Sensor Networks. Int. J. Ad Hoc Ubiquitous Comput., 4: 379-386.
    CrossRef    


  • Kim, D.S. and Y.J. Chung, 2006. Self-organization routing protocol supporting mobile nodes for wireless sensor network. Proceedings of the 1st International Multi-Symposiums on Computer and Computational Sciences, Volume 2, June 20-24, 2006, Hangzhou, China, pp: 622-626.


  • Lindsey, S. and C.S. Raghavendra, 2002. PEGASIS: Power-efficient gathering in sensor information systems. Proceedings of the IEEE Aerospace Conference, March 9-16, 2002, Los Angeles, CA., USA., pp: 1125-1130.


  • Liu, T. and F. Li, 2009. Power-efficient clustering routing protocol based on applications in wireless sensor network. Proceedings of the 5th International Conference on Wireless Communications Networking and Mobile Computing, September 24-26, 2009, Beijing, China, pp: 1-6.


  • Watfa, M.K., O. Mirza and J. Kawtharani, 2009. BARC: A battery aware reliable clustering algorithm for sensor networks. J. Network Comput. Appl., 32: 1183-1193.
    CrossRef    


  • Ehsan, S. and B. Hamdaoui, 2012. A survey on energy-efficient routing techniques with QoS assurances for wireless multimedia sensor networks. IEEE Commun. Surv. Tutorials, 14: 265-278.
    CrossRef    Direct Link    


  • Ali, M.S., T. Dey and R. Biswas, 2008. Aleach: Advanced leach routing protocol for wireless microsensor networks. Proceedings of the International Conference on Electrical and Computer Engineering, December 20-22, 2008, Dhaka, pp: 909-914.


  • Sutar, U.S. and S.K. Bodhe, 2010. Energy efficient topology control algorithm for multi-hop ad-hoc wireless sensor network. Proceedings of the 3rd IEEE International Conference on Computer Science and Information Technology, Volume 3, July 9-11, 2010, Chengdu, China, pp: 418-421.


  • Torkestani, J.A. and M.R. Meybodi, 2011. LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks. Comput. Electr. Eng., 37: 461-474.
    CrossRef    


  • Chipara, O., Z. He, G. Xing, Q. Chen and X. Wang et al., 2006. Real-time power-aware routing in sensor networks. Proceedings of the 14th IEEE International Workshop on Quality of Service, June 19-21, 2006, New Haven, CT., USA., pp: 83-92.


  • Dhulipala, V.R.S., G.R. Kanagachidambaresan and R.M. Chandrasekaran, 2012. Lack of power avoidance: A fault classification based fault tolerant framework solution for lifetime enhancement and reliable communication in wireless sensor networks. Inform. Technol. J., 11: 719-724.
    CrossRef    


  • Wang, W., B. Wang, Z. Liu, L. Guo and W. Xiong, 2011. A cluster-based and tree-based power efficient data collection and aggregation protocol for wireless sensor networks. Inform. Technol. J., 10: 557-564.
    CrossRef    Direct Link    


  • Xin, G., W.H. Yang and B. DeGang, 2008. EEHCA: An energy-efficient hierarchical clustering algorithm for wireless sensor networks. Inform. Technol. J., 7: 245-252.
    CrossRef    Direct Link    


  • Yang, J. and D. Zhang, 2009. An energy-balancing unequal clustering protocol for wireless sensor networks. Inform. Technol. J., 8: 57-63.
    CrossRef    Direct Link    

  • © Science Alert. All Rights Reserved