Secure E-Voting System Using BlockChain

  • Unique Paper ID: 165026
  • Volume: 11
  • Issue: 1
  • PageNo: 130-134
  • Abstract:
  • This Paper proposes a fault node recovery algorithm to enhance the lifetime of a wireless sensor network when some of the sensor nodes shut down. This should be identified by detecting the fault nodes using DCD algorithm. The dichotomous coordinate descent (DCD) algorithm allows linear systems of equations to be solved with high computational efficiency. It is a multiplication-free and division-free technique and, therefore, it is well suited for hardware implementation. In DCD, the concept is said to drift if quite a large number of outliers are found in the current sliding window, or if quite a large number of clusters are varied in the ratio of data points. Fault nodes are identified by detecting the fault nodes using DCD algorithm. We propose an algorithm that allows (i) every node to detect when the connectivity to a specially designated node has been lost, and (ii) one or more nodes (that are connected to the special node after the cut) to detect the occurrence of the fault node. The algorithm can result in fewer replacements of sensor nodes and more reused routing paths. In our simulation, the proposed algorithm increases the number of active nodes up to 8.7 times, reduces the rate of data loss by approximately 98.8%, and reduces the rate of energy consumption by approximately 31.1%.

Copyright & License

Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

BibTeX

@article{165026,
        author = {Sakshee Haral and Shubham Tambade and Anish Teli and Kartik Watile and Prof. Pankaj Dhakate},
        title = {Secure E-Voting System Using BlockChain},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {11},
        number = {1},
        pages = {130-134},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=165026},
        abstract = {This Paper proposes a fault node recovery algorithm to enhance the lifetime of a wireless sensor network when some of the sensor nodes shut down. This should be identified by detecting the fault nodes using DCD algorithm. The dichotomous coordinate descent (DCD) algorithm allows linear systems of equations to be solved with high computational efficiency. It is a multiplication-free and division-free technique and, therefore, it is well suited for hardware implementation. In DCD, the concept is said to drift if quite a large number of outliers are found in the current sliding window, or if quite a large number of clusters are varied in the ratio of data points. Fault nodes are identified by detecting the fault nodes using DCD algorithm.  We propose an algorithm that allows (i) every node to detect when the connectivity to a specially designated node has been lost, and (ii) one or more nodes (that are connected to the special node after the cut) to detect the occurrence of the fault node. The algorithm can result in fewer replacements of sensor nodes and more reused routing paths. In our simulation, the proposed algorithm increases the number of active nodes up to 8.7 times, reduces the rate of data loss by approximately 98.8%, and reduces the rate of energy consumption by approximately 31.1%.},
        keywords = {CCOS, CUT detection, DOS, network separation, Wireless sensor network.},
        month = {},
        }

Cite This Article

  • ISSN: 2349-6002
  • Volume: 11
  • Issue: 1
  • PageNo: 130-134

Secure E-Voting System Using BlockChain

Related Articles