Energy-Aware Routing Hole Detection Algorithm in the Hierarchical Wireless Sensor Network

To minimize the communication overhead with the help of optimal path selection in Wireless Sensor Network (WSN) routing protocols is the challenging issue. Hierarchical routing optimizes energy utilization by distributing the workload among different clusters. But many-to-one multi-hop hierarchical routing will result in the excessive expenditure of energy near the sink and leads to early energy exhaustion of the nodes. Due to this the routing hole problem can be caused around the base station. Data routed along the hole boundary nodes will lead to premature exhaustion of energy. This will maximize the size of the hole in the network. Detection of holes saves the additional energy consumption around the hole and minimize the hole size. In this paper a novel energy efficient routing hole detection (EEHD) algorithm is presented, on the detection of routing hole, the periodic re-clustering is performed to avoid the long detour path. Extensive simulations are done in MATLAB, the results reveal that EEHD has better performance than other conventional routing hole detection techniques, such as BCP and BDCIS.

@article{Sama2019,
  title     = {Energy-Aware Routing Hole Detection Algorithm in the Hierarchical Wireless Sensor Network},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {10},
  number    = {3},
  year      = {2019},
  publisher = {The Science and Information Organization},
  author    = {Najm Us Sama and Kartinah Bt Zen and Atiq Ur Rahman and Aziz Ud Din},
  doi       = {10.14569/IJACSA.2019.0100332},
  url       = {https://doi.org/10.14569/IJACSA.2019.0100332}
}