Efficient Resource Consumption by Dynamic Clustering and Optimized Routes in Wireless Sensor Networks

The energy issue is an important parameter in the wireless sensor networks and should be managed in the different applications. We propose a new routing algorithm that it is energy efficient and uses different approaches as dynamic clustering, spanning tree, self-configurable routing and controls energy consuming by data-driven and power management schemas. It has two main phases. The first is consisting of the steady cluster, cluster head election and creation-spanning tree in each cluster and the second phase is data transmission. The proposed protocol is compared with four other protocols in network lifetime, network balance, and average packet delay and packet delivery. Simulation results show the proposed protocol performance in the network lifetime is about 6 per cent higher than Improved-LEACH, 21.5 per cent higher than EESR and 5.8 per cent higher than DHCO. Its improvement in packet delivery parameter is about 3.5 per cent higher than Improved-LEACH, 6.5 per cent higher than EESR and 3 per cent higher than DHCO. In addition, the performance or in packet delay is about 17 per cent higher than EESR and 6 per cent higher than DHCO but Improved-LEACH protocol has a good performance than our protocol about 4 per cent.

@article{Kiani2018,
  title     = {Efficient Resource Consumption by Dynamic Clustering and Optimized Routes in Wireless Sensor Networks},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {9},
  number    = {8},
  year      = {2018},
  publisher = {The Science and Information Organization},
  author    = {Farzad Kiani},
  doi       = {10.14569/IJACSA.2018.090828},
  url       = {https://doi.org/10.14569/IJACSA.2018.090828}
}