The holes problem in wireless sensor netwoks by using the available energy fairly

Authors

  • Zohreh Mousavinasab Omidieh Branch, Islamic Azad University, Omidieh, Iran
  • Zahra Saadati Omidieh Branch, Islamic Azad University, Omidieh, Iran

DOI:

https://doi.org/10.24297/ijct.v15i5.1641

Keywords:

Wireless Sensor Network, Clustering, Energy distribution, Minimum Spanning Tree.

Abstract

We consider the holes problem in wireless sensor netwoks by using the available energy fairly. The holes problem occurs when the available energy of some sensors are exhausted while others have significant energy. In this circumstance, ehile the total available energy of the network is high, the network  is no longer working. Such a problem mainly  happen due to unbalanced energy consumpsion in clustering and communication protocols. In this paper, we deal with this problem and propose an data aggregation algorithm based on the well-known clustering algorithm LEACH and tree construction mechanisms. In proposed method we consider the available energy of each sensor node as a weigthing parameter in clustering phase and tree-construction phase. Experimental results show the ability of the proposed method to increase the life time of the network and to distribute the energy uniformly along the network.

Downloads

Download data is not yet available.

Author Biographies

Zohreh Mousavinasab, Omidieh Branch, Islamic Azad University, Omidieh, Iran

Department of Computer

Zahra Saadati, Omidieh Branch, Islamic Azad University, Omidieh, Iran

Department of Computer

Downloads

Published

2016-03-23

How to Cite

Mousavinasab, Z., & Saadati, Z. (2016). The holes problem in wireless sensor netwoks by using the available energy fairly. INTERNATIONAL JOURNAL OF COMPUTERS &Amp; TECHNOLOGY, 15(5), 6732–6737. https://doi.org/10.24297/ijct.v15i5.1641

Issue

Section

Research Articles