Evaluation of Energy Efficient Algorithms and Definition of Critical Nodes for the Reliability of the Wireless Sensor Network

  • M. Malini, Dr. U. Durai

Abstract

The node that disrupts the network connection in wireless sensors networks is a critical node (cut vertex or joint point). It is therefore important to discover and handle critical nodes with prudence. This article contains two distributed methods located to determine the node statuses (noncritical or critical).  They suggested first the approach that identifies most of the critical and non-critical two-hop local subgraph dominator knots with linked domain information (CDS), which computational limits cost of O(Feel2) and a little complex to O(Clog2n), where <fix> is the least node degree. Test simulation andtests results demonstrate which is the method identifies to 93% of important nodes and accomplishes 91 percent of a low-energy determination state. The second suggested technique, based on search of the states of all nodes at first, using therestricted first-depth find algorithm, without crossing all the networks. Comprehensive test-bed testing and simulation results show that this algorithm encounters all key nodes which consume less energy than all previous algorithms with a CDS.

Published
2021-10-27
How to Cite
M. Malini, Dr. U. Durai. (2021). Evaluation of Energy Efficient Algorithms and Definition of Critical Nodes for the Reliability of the Wireless Sensor Network . Design Engineering, 8455–8460. Retrieved from http://thedesignengineering.com/index.php/DE/article/view/5887
Section
Articles