Energy Efficient Wireless Communication using Genetic Algorithm Guided Faster Light Weight Digital Signature Algorithm (GADSA)

08/11/2012
by   Arindam Sarkar, et al.
0

In this paper GA based light weight faster version of Digital Signature Algorithm (GADSA) in wireless communication has been proposed. Various genetic operators like crossover and mutation are used to optimizing amount of modular multiplication. Roulette Wheel selection mechanism helps to select best chromosome which in turn helps in faster computation and minimizes the time requirements for DSA. Minimization of number of modular multiplication itself a NP-hard problem that means there is no polynomial time deterministic algorithm for this purpose. This paper deals with this problem using GA based optimization algorithm for minimization of the modular multiplication. Proposed GADSA initiates with an initial population comprises of set of valid and complete set of individuals. Some operators are used to generate feasible valid offspring from the existing one. Among several exponents the best solution reached by GADSA is compared with some of the existing techniques. Extensive simulations shows competitive results for the proposed GADSA.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/22/2018

Improving TSP Solutions Using GA with a New Hybrid Mutation Based on Knowledge and Randomness

Genetic algorithm (GA) is an efficient tool for solving optimization pro...
research
09/15/2022

A Genetic Quantum Annealing Algorithm

A genetic algorithm (GA) is a search-based optimization technique based ...
research
09/10/2014

An improved genetic algorithm with a local optimization strategy and an extra mutation level for solving traveling salesman problem

The Traveling salesman problem (TSP) is proved to be NP-complete in most...
research
06/15/2019

Genetic Algorithm Based Resource Minimization in Network Code Based Peer-to-Peer Network

Block scheduling is difficult to implement in P2P network since there is...
research
08/17/2013

Graph Colouring Problem Based on Discrete Imperialist Competitive Algorithm

In graph theory, Graph Colouring Problem (GCP) is an assignment of colou...
research
11/29/2021

High-Speed Light Focusing through Scattering Medium by Cooperatively Accelerated Genetic Algorithm

We develop an accelerated Genetic Algorithm (GA) system constructed by t...
research
11/20/2020

An Intelligent System for Spam Detection and Identification of the most Relevant Features based on Evolutionary Random Weight Networks

With the incremental use of e-mails as an essential and popular communic...

Please sign up or login with your details

Forgot password? Click here to reset