ENERGY EFFICIENT DYNAMIC ADAPTIVE RECLUSTERING PROTOCOL FOR HETEROGENEOUS WIRELESS SENSOR NETWORKS

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way since the energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor network. In this paper, we introduce an adaptive clustering protocol for wireless sensor networks, which is called Adaptive Decentralized Re-Clustering Heterogeneous Protocol (ADRHP) for Wireless Sensor Networks. In ADRHP, the cluster heads and next heads are elected based on residual energy of each node and the average energy of each cluster. Clustering has been well received as an effective way to reduce the energy consumption of a wireless sensor network. Clustering is defined as the process of choosing a set of wireless sensor nodes to be cluster heads for a given wireless sensor network. Therefore, data traffic generated at each sensor node can be sent via cluster heads to the base station. The selection of cluster heads and next heads are weighted by the remaining energy of sensor nodes and the average energy of each cluster. ADRHP is an adaptive clustering protocol; cluster heads rotate over time to balance the energy dissipation of sensor nodes. The simulation results show that ADRHP achieves longer lifetime and more data message transmissions than current artificial neural network (ANN) based clustering protocol such as Residual Energy Based Clustering Self organizing map (R-EBCS) in wireless sensor networks.

[1]  R. Shalini,et al.  in Wireless Sensor Networks , 2015 .

[2]  Jie Wu,et al.  An Energy Efficient Clustering Scheme in Wireless Sensor Networks , 2007, Ad Hoc Sens. Wirel. Networks.

[3]  Rajendra Patrikar,et al.  Improving Life Time of Wireless Sensor Networks Using Neural N etwork Based Classification Techniques With Cooperative Routing , 2008 .

[4]  Puneet Azad.  Energy Efficient Clustering Algorithms for Wireless Sensor Networks , 2015 .

[5]  Mario Di Francesco,et al.  Energy conservation in wireless sensor networks: A survey , 2009, Ad Hoc Networks.

[6]  Martin Nilsson,et al.  Investigating the energy consumption of a wireless network interface in an ad hoc networking environment , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  JAMAL N. AL-KARAKI,et al.  Routing techniques in wireless sensor networks: a survey , 2004, IEEE Wireless Communications.

[8]  Nauman Aslam,et al.  A multi-criterion optimization technique for energy efficient cluster formation in wireless sensor networks , 2011, Inf. Fusion.

[9]  Morteza Barari,et al.  Energy Based Clustering Self Organizing Map Protocol For Wireless Sensor Networks , 2015 .

[10]  H. Shahbazi,et al.  Minimum power intelligent routing in wireless sensors networks using self organizing neural networks , 2008, 2008 International Symposium on Telecommunications.

[11]  Dilip Kumar,et al.  Performance analysis of energy efficient clustering protocols for maximising lifetime of wireless sensor networks , 2013, IET Wirel. Sens. Syst..

[12]  Irfan-Ullah Awan,et al.  Adaptive decentralized re-clustering protocol for wireless sensor networks , 2011, J. Comput. Syst. Sci..

[13]  Dali Wei,et al.  Energy Efficient Clustering Algorithms for Wireless Sensor Networks , 2008, ICC Workshops - 2008 IEEE International Conference on Communications Workshops.

[14]  Esa Alhoniemi,et al.  Clustering of the self-organizing map , 2000, IEEE Trans. Neural Networks Learn. Syst..

[15]  Mustapha Lebbah,et al.  Clustering of Self-Organizing Map , 2008, ESANN.

[16]  Sung-Ho Kim,et al.  Study on the Applicability of Self-Organizing Maps to Sensor Network , 2007 .

[17]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.