The article presents a simple algorithm to construct minimum spanning tree and
to find shortest path between pair of vertices in a graph. Our illustration includes the proof
of termination. The complexity analysis and simulation results have also been included.
Modern-day computer security relies heavily on cryptography as a means to protect the data that we have
become increasingly reliant on. The main research in computer security domain is how to enhance the
speed of RSA algorithm. The computing capability of Graphic Processing Unit as a co-processor of the
CPU can leverage massive-parallelism. This paper presents a novel algorithm for calculating modulo
value that can process large power of numbers which otherwise are not supported by built-in data types.
First the traditional algorithm is studied. Secondly, the parallelized RSA algorithm is designed using
CUDA framework. Thirdly, the designed algorithm is realized for small prime numbers and large prime
number . As a result the main fundamental problem of RSA algorithm such as speed and use of poor or
small prime numbers that has led to significant security holes, despite the RSA algorithm's mathematical
soundness can be alleviated by this algorithm.
Inventive Cubic Symmetric Encryption System for Multimediacsandit
Cryptography is a security technique that must be applied in both communication sides to protect
the data during its transmission through the network from all kinds of attack. On the sender
side, the original data will be changed into different symbols or shapes by using a known key;
this is called encryption. On the other communication side, the decryption process will be done
and the data will be returned to its former shape by using the agreed key. The importance of
cryptography is to fulfil the communication security requirements. Real time applications (RTA)
are vulnerable for the moment because of their big size. However, some of the current algorithms
are not really appropriate for use with these kinds of information. In this paper, a novel
symmetric block cipher cryptography algorithm has been illustrated and discussed. The system
uses an 8x8x8 cube, and each cell contains a pair of binary inputs. The cube can provide a huge
number of combinations that can produce a very strong algorithm and a long key size. Due to
the lightweight and fast technique used in this idea, it is expected to be extremely rapid compared
to the majority of current algorithms, such as DES and AES.
Elgamal signature for content distribution with network codingijwmn
Network coding is a slightly new forwarding technique which receives various applications in traditional
computer networks, wireless sensor networks and peer-to-peer systems. However, network coding is
inherently vulnerable to pollution attacks by malicious nodes in the network. If any fake node in the
network spreads polluted packets, the pollution of packets will spread quickly since the output of (even an)
honest node is corrupted if at least one of the incoming packets is corrupted. There have been adapted a
few ordinary signature schemes to network coding that allows nodes to check the validity of a packet
without decoding. In this paper, we propose a scheme uses ElGamal signature in network coding. Our
scheme makes use of the linearity property of the packets in a coded system, and allows nodes to check the
integrity of the packets received easily.
New approach in symmetric block cipher security using a new cubical techniqueijcsit
Cryptography is a security technique that must be applied in both communication sides to protect the data during its transmission through the network from all kinds of attack. On the sender side, the original data will be changed into different symbols or shapes by using a known key; this is
called encryption. On the other communication side, the decryption process will be done and the data will be returned to its former shape by using the agreed key. The importance of cryptography is to fulfil the communication security requirements. Real time applications (RTA) are vulnerable for the moment because of their big size. However, some of the current algorithms are not really
appropriate for use with these kinds of information. In this paper, a novel symmetric block cipher cryptography algorithm has been illustrated and discussed. The system uses an 8x8x8 cube, and each cell contains a pair of binary inputs. The cube can provide a huge number of combinations that can produce a very strong algorithm and a long key size. Due to the lightweight and fast technique used in this idea, it is expected to be extremely rapid compared to the majority of current algorithms, such as DES and AES.
Symmetric Key based Encryption and Decryption using Lissajous Curve EquationsYayah Zakaria
Sender and receiver both uses two large similar prime numbers and uses parametric equations for swapping values of kx and by product of kx and ky is the common secret key. Generated secret key is used for encryption and decryption using ASCII key matrix of order 16X16. Applying playfair rules for encryption and decryption. Playfair is a digraph substitution cipher. Playfair makes use of pairs of letters for encryption and decryption. This
application makes use of all ASCII characters which makes brute force attack impossible.
Modern-day computer security relies heavily on cryptography as a means to protect the data that we have
become increasingly reliant on. The main research in computer security domain is how to enhance the
speed of RSA algorithm. The computing capability of Graphic Processing Unit as a co-processor of the
CPU can leverage massive-parallelism. This paper presents a novel algorithm for calculating modulo
value that can process large power of numbers which otherwise are not supported by built-in data types.
First the traditional algorithm is studied. Secondly, the parallelized RSA algorithm is designed using
CUDA framework. Thirdly, the designed algorithm is realized for small prime numbers and large prime
number . As a result the main fundamental problem of RSA algorithm such as speed and use of poor or
small prime numbers that has led to significant security holes, despite the RSA algorithm's mathematical
soundness can be alleviated by this algorithm.
Inventive Cubic Symmetric Encryption System for Multimediacsandit
Cryptography is a security technique that must be applied in both communication sides to protect
the data during its transmission through the network from all kinds of attack. On the sender
side, the original data will be changed into different symbols or shapes by using a known key;
this is called encryption. On the other communication side, the decryption process will be done
and the data will be returned to its former shape by using the agreed key. The importance of
cryptography is to fulfil the communication security requirements. Real time applications (RTA)
are vulnerable for the moment because of their big size. However, some of the current algorithms
are not really appropriate for use with these kinds of information. In this paper, a novel
symmetric block cipher cryptography algorithm has been illustrated and discussed. The system
uses an 8x8x8 cube, and each cell contains a pair of binary inputs. The cube can provide a huge
number of combinations that can produce a very strong algorithm and a long key size. Due to
the lightweight and fast technique used in this idea, it is expected to be extremely rapid compared
to the majority of current algorithms, such as DES and AES.
Elgamal signature for content distribution with network codingijwmn
Network coding is a slightly new forwarding technique which receives various applications in traditional
computer networks, wireless sensor networks and peer-to-peer systems. However, network coding is
inherently vulnerable to pollution attacks by malicious nodes in the network. If any fake node in the
network spreads polluted packets, the pollution of packets will spread quickly since the output of (even an)
honest node is corrupted if at least one of the incoming packets is corrupted. There have been adapted a
few ordinary signature schemes to network coding that allows nodes to check the validity of a packet
without decoding. In this paper, we propose a scheme uses ElGamal signature in network coding. Our
scheme makes use of the linearity property of the packets in a coded system, and allows nodes to check the
integrity of the packets received easily.
New approach in symmetric block cipher security using a new cubical techniqueijcsit
Cryptography is a security technique that must be applied in both communication sides to protect the data during its transmission through the network from all kinds of attack. On the sender side, the original data will be changed into different symbols or shapes by using a known key; this is
called encryption. On the other communication side, the decryption process will be done and the data will be returned to its former shape by using the agreed key. The importance of cryptography is to fulfil the communication security requirements. Real time applications (RTA) are vulnerable for the moment because of their big size. However, some of the current algorithms are not really
appropriate for use with these kinds of information. In this paper, a novel symmetric block cipher cryptography algorithm has been illustrated and discussed. The system uses an 8x8x8 cube, and each cell contains a pair of binary inputs. The cube can provide a huge number of combinations that can produce a very strong algorithm and a long key size. Due to the lightweight and fast technique used in this idea, it is expected to be extremely rapid compared to the majority of current algorithms, such as DES and AES.
Symmetric Key based Encryption and Decryption using Lissajous Curve EquationsYayah Zakaria
Sender and receiver both uses two large similar prime numbers and uses parametric equations for swapping values of kx and by product of kx and ky is the common secret key. Generated secret key is used for encryption and decryption using ASCII key matrix of order 16X16. Applying playfair rules for encryption and decryption. Playfair is a digraph substitution cipher. Playfair makes use of pairs of letters for encryption and decryption. This
application makes use of all ASCII characters which makes brute force attack impossible.
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMScsandit
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellites and cell phones. In order to transmit data in such systems we
need to cluster them in packages. To achieve a faster transmission we are allowed to preempt the
transmission of any packet in order to resume at a later time. Such preemptions though come with a delay
in order to setup for the next transmission. In this paper we propose an algorithm which yields improved
transmission scheduling. This algorithm we call MGA. We have proven an approximation ratio for MGA
and ran experiments to establish that it works even better in practice. In order to conclude that MGA will
be a very helpful tool in constructing an improved schedule for packet routing using preemtion with a setup
cost, we compare its results to two other efficient algorithms designed by researchers in the past.
In this work a method for video streaming authentication based on butterfly graphs is presanted. As well as other methods variables such as the sender delay, receiver delay, computation overhead, communication overhead, robustness against packet loss, should be considered. The aim of this work is improvement of communication overhead as an important parameter, in networks which packet loss ratio is random and burst. For this purpose we develop butterfly graph to increase authentication probability.
Load balancing in public cloud combining the concepts of data mining and netw...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Nearest Prime Cipher for Data Confidentiality and IntegrityEswar Publications
Communication is the process of transmitting information from source to destination. The information exchanged between sender and receiver through the proper channel. The information should not be stolen by unauthorized parties like hackers while sending or receiving via channel. To avoid this stealing of the information cryptography techniques are used. The key is playing prominent role in cryptography. This paper proposes a novel method for key generation by using nearest primes. Further 2’s complement and logical operations are
used in encryption and decryption process. The final cipher text is generated by representing the intermediate cipher in matrix form and then read by column wise.
Abstract
In the infancy of Cryptography Mono-alphabetic Substitution Ciphers were considered good enough to baffle any potential attackers but with the advancements in technology & the upsurge of computing power those methods have become trivial. Even the very complex methods of encryption are vulnerable to the brute force attacks of contemporary computers and with Quantum computing on the horizon even the current state of the art cryptosystems are at risk. Lots of research is being done and every possible field is being explored in order to create that elusive unbreakable cipher. Among other subjects, Geometry is also being applied and various ciphers based on the properties of different geometrical figures have been developed. This paper ventures to investigate the recent research applying the concept of geometry to boost the caliber of pre-existing cryptosystems enhance the understanding of the subject.
Keywords: Cryptography, Geometry, Encryption, Decryption, ECC, Circle, Chakra, Ellipse, Hyperbola, HCCS
An Enhanced Message Digest Hash Algorithm for Information Securitypaperpublications3
Abstract: Information is an important commodity in the world of Electronic communication. To achieve a secure communication between communicating parties, the protection of authenticity and integrity of information is necessary. Cryptographic hash functions play a central role in cryptology. A cryptographic hash function takes an input of arbitrary large size and returns a small fixed size hash value. It satisfies three major cryptographic properties: preimage resistance, second preimage resistance and collision resistance. Due to its cryptographic properties hash function has become an important cryptographic tool which is used to protect information authenticity and integrity. This thesis presents a review of cryptographic hash functions. The thesis includes various applications of hash functions. It gives special emphasis on dedicated hash functions MD5.
Recent breakthroughs in cryptanalysis of standard hash functions like SHA-1 and MD5 raise the need for alternatives. In the past few years, there have been significant research advances in the analysis of hash functions and it was shown that none of the hash algorithm is secure enough for critical purposes whether it is MD5 or SHA-1. Nowadays scientists have found weaknesses in a number of hash functions, including MD5, SHA and RIPEMD. So the purpose of this thesis is combination of some function to reinforce these functions and also increasing hash code of message digest of length up to 160 that makes stronger algorithm against collision and brute force attacks.
CORRELATION OF EIGENVECTOR CENTRALITY TO OTHER CENTRALITY MEASURES: RANDOM, S...csandit
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality
measures, including degree centrality, betweenness centrality, clustering coefficient centrality,
closeness centrality, and farness centrality, of various types of network (random network, smallworld
network, and real-world network). For each network, we compute those six centrality
measures, from which the correlation coefficient is determined. Our analysis suggests that the
degree centrality and the eigenvector centrality are highly correlated, regardless of the type of
network. Furthermore, the eigenvector centrality also highly correlates to betweenness on
random and real-world networks. However, it is inconsistent on small-world network, probably
owing to its power-law distribution. Finally, it is also revealed that eigenvector centrality is
distinct from clustering coefficient centrality, closeness centrality and farness centrality in all
tested occasions. The findings in this paper could lead us to further correlation analysis on
multiple centrality measures in the near future
CASCADE BLOCK CIPHER USING BRAIDING/ENTANGLEMENT OF SPIN MATRICES AND BIT ROT...IJNSA Journal
Secure communication of the sensitive information in disguised form to the genuine recipient so that an
intended recipient alone can remove the disguise and recover the original message is the essence of
Cryptography. Encrypting the message two or more times with different encryption techniques and with
different keys increases the security levels than the single encryption. A cascade cipher is stronger than the
first component. This paper presents multiple encryption schemes using different encryption techniques
Braiding/Entanglement of Pauli Spin 3/2 matrices and Rotation of the bits with independent secret keys.
A FLOATING POINT DIVISION UNIT BASED ON TAYLOR-SERIES EXPANSION ALGORITHM AND...csandit
Floating point division, even though being an infrequent operation in the traditional sense, is
indis-pensable when it comes to a range of non-traditional applications such as K-Means
Clustering and QR Decomposition just to name a few. In such applications, hardware support
for floating point division would boost the performance of the entire system. In this paper, we
present a novel architecture for a floating point division unit based on the Taylor-series
expansion algorithm. We show that the Iterative Logarithmic Multiplier is very well suited to be
used as a part of this architecture. We propose an implementation of the powering unit that can
calculate an odd power and an even power of a number simultaneously, meanwhile having little
hardware overhead when compared to the Iterative Logarithmic Multiplier.
Module 6
Advanced Networking
Security problems with internet architecture, Introduction to Software defined networking, Working of SDN, SDN in data centre, SDN applications, Data centre networking, IoT.
BREAKING MIGNOTTE’S SEQUENCE BASED SECRET SHARING SCHEME USING SMT SOLVERijcsit
The secret sharing schemes are the important tools in cryptography that are used as building blocks in
many secured protocols. It is a method used for distributing a secret among the participants in a manner
that only the threshold number of participants together can recover the secret and the remaining set of
participants cannot get any information about the secret. Secret sharing schemes are absolute for storing
highly sensitive and important information. In a secret sharing scheme, a secret is divided into several
shares. These shares are then distributed to the participants’ one each and thus only the threshold (t)
number of participants can recover the secret. In this paper we have used Mignotte’s Sequence based
Secret Sharing for distribution of shares to the participants. A (k, m) Mignotte's sequence is a sequence of
pair wise co-prime positive integers. We have proposed a new method for reconstruction of secret even
with t-1 shares using the SMT solver.
Mathematics Research Paper - Mathematics of Computer Networking - Final DraftAlexanderCominsky
This Research Paper goes into the mathematics of computer networking hardware as well as encryption methods used to ensure data can safely and securely be transmitted from one point to another across a computer network and the web.
Comparison of BFS and Prim's Algorithm when used in MANETs RoutingEditor IJCATR
One of the greatest challenge in MANETs for data transmission is route update. The route update in MANETs is implemented
with the help of Breadth first search algorithm and Prim’s algorithm. Using Prim’s algorithm in route update mechanism will reduce the
end-to-end delay to a greater extend in MANETs. The end-to-end delay can lead to a performance degradation in the network. Different
algorithms can be used to update the route information in MANETs. The traditional approaches such as Breadth First Search algorithm
used will increase the end-to-end delay since this algorithm will go through all the parent nodes before it goes to the children nodes.
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMScsandit
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellites and cell phones. In order to transmit data in such systems we
need to cluster them in packages. To achieve a faster transmission we are allowed to preempt the
transmission of any packet in order to resume at a later time. Such preemptions though come with a delay
in order to setup for the next transmission. In this paper we propose an algorithm which yields improved
transmission scheduling. This algorithm we call MGA. We have proven an approximation ratio for MGA
and ran experiments to establish that it works even better in practice. In order to conclude that MGA will
be a very helpful tool in constructing an improved schedule for packet routing using preemtion with a setup
cost, we compare its results to two other efficient algorithms designed by researchers in the past.
In this work a method for video streaming authentication based on butterfly graphs is presanted. As well as other methods variables such as the sender delay, receiver delay, computation overhead, communication overhead, robustness against packet loss, should be considered. The aim of this work is improvement of communication overhead as an important parameter, in networks which packet loss ratio is random and burst. For this purpose we develop butterfly graph to increase authentication probability.
Load balancing in public cloud combining the concepts of data mining and netw...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Nearest Prime Cipher for Data Confidentiality and IntegrityEswar Publications
Communication is the process of transmitting information from source to destination. The information exchanged between sender and receiver through the proper channel. The information should not be stolen by unauthorized parties like hackers while sending or receiving via channel. To avoid this stealing of the information cryptography techniques are used. The key is playing prominent role in cryptography. This paper proposes a novel method for key generation by using nearest primes. Further 2’s complement and logical operations are
used in encryption and decryption process. The final cipher text is generated by representing the intermediate cipher in matrix form and then read by column wise.
Abstract
In the infancy of Cryptography Mono-alphabetic Substitution Ciphers were considered good enough to baffle any potential attackers but with the advancements in technology & the upsurge of computing power those methods have become trivial. Even the very complex methods of encryption are vulnerable to the brute force attacks of contemporary computers and with Quantum computing on the horizon even the current state of the art cryptosystems are at risk. Lots of research is being done and every possible field is being explored in order to create that elusive unbreakable cipher. Among other subjects, Geometry is also being applied and various ciphers based on the properties of different geometrical figures have been developed. This paper ventures to investigate the recent research applying the concept of geometry to boost the caliber of pre-existing cryptosystems enhance the understanding of the subject.
Keywords: Cryptography, Geometry, Encryption, Decryption, ECC, Circle, Chakra, Ellipse, Hyperbola, HCCS
An Enhanced Message Digest Hash Algorithm for Information Securitypaperpublications3
Abstract: Information is an important commodity in the world of Electronic communication. To achieve a secure communication between communicating parties, the protection of authenticity and integrity of information is necessary. Cryptographic hash functions play a central role in cryptology. A cryptographic hash function takes an input of arbitrary large size and returns a small fixed size hash value. It satisfies three major cryptographic properties: preimage resistance, second preimage resistance and collision resistance. Due to its cryptographic properties hash function has become an important cryptographic tool which is used to protect information authenticity and integrity. This thesis presents a review of cryptographic hash functions. The thesis includes various applications of hash functions. It gives special emphasis on dedicated hash functions MD5.
Recent breakthroughs in cryptanalysis of standard hash functions like SHA-1 and MD5 raise the need for alternatives. In the past few years, there have been significant research advances in the analysis of hash functions and it was shown that none of the hash algorithm is secure enough for critical purposes whether it is MD5 or SHA-1. Nowadays scientists have found weaknesses in a number of hash functions, including MD5, SHA and RIPEMD. So the purpose of this thesis is combination of some function to reinforce these functions and also increasing hash code of message digest of length up to 160 that makes stronger algorithm against collision and brute force attacks.
CORRELATION OF EIGENVECTOR CENTRALITY TO OTHER CENTRALITY MEASURES: RANDOM, S...csandit
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality
measures, including degree centrality, betweenness centrality, clustering coefficient centrality,
closeness centrality, and farness centrality, of various types of network (random network, smallworld
network, and real-world network). For each network, we compute those six centrality
measures, from which the correlation coefficient is determined. Our analysis suggests that the
degree centrality and the eigenvector centrality are highly correlated, regardless of the type of
network. Furthermore, the eigenvector centrality also highly correlates to betweenness on
random and real-world networks. However, it is inconsistent on small-world network, probably
owing to its power-law distribution. Finally, it is also revealed that eigenvector centrality is
distinct from clustering coefficient centrality, closeness centrality and farness centrality in all
tested occasions. The findings in this paper could lead us to further correlation analysis on
multiple centrality measures in the near future
CASCADE BLOCK CIPHER USING BRAIDING/ENTANGLEMENT OF SPIN MATRICES AND BIT ROT...IJNSA Journal
Secure communication of the sensitive information in disguised form to the genuine recipient so that an
intended recipient alone can remove the disguise and recover the original message is the essence of
Cryptography. Encrypting the message two or more times with different encryption techniques and with
different keys increases the security levels than the single encryption. A cascade cipher is stronger than the
first component. This paper presents multiple encryption schemes using different encryption techniques
Braiding/Entanglement of Pauli Spin 3/2 matrices and Rotation of the bits with independent secret keys.
A FLOATING POINT DIVISION UNIT BASED ON TAYLOR-SERIES EXPANSION ALGORITHM AND...csandit
Floating point division, even though being an infrequent operation in the traditional sense, is
indis-pensable when it comes to a range of non-traditional applications such as K-Means
Clustering and QR Decomposition just to name a few. In such applications, hardware support
for floating point division would boost the performance of the entire system. In this paper, we
present a novel architecture for a floating point division unit based on the Taylor-series
expansion algorithm. We show that the Iterative Logarithmic Multiplier is very well suited to be
used as a part of this architecture. We propose an implementation of the powering unit that can
calculate an odd power and an even power of a number simultaneously, meanwhile having little
hardware overhead when compared to the Iterative Logarithmic Multiplier.
Module 6
Advanced Networking
Security problems with internet architecture, Introduction to Software defined networking, Working of SDN, SDN in data centre, SDN applications, Data centre networking, IoT.
BREAKING MIGNOTTE’S SEQUENCE BASED SECRET SHARING SCHEME USING SMT SOLVERijcsit
The secret sharing schemes are the important tools in cryptography that are used as building blocks in
many secured protocols. It is a method used for distributing a secret among the participants in a manner
that only the threshold number of participants together can recover the secret and the remaining set of
participants cannot get any information about the secret. Secret sharing schemes are absolute for storing
highly sensitive and important information. In a secret sharing scheme, a secret is divided into several
shares. These shares are then distributed to the participants’ one each and thus only the threshold (t)
number of participants can recover the secret. In this paper we have used Mignotte’s Sequence based
Secret Sharing for distribution of shares to the participants. A (k, m) Mignotte's sequence is a sequence of
pair wise co-prime positive integers. We have proposed a new method for reconstruction of secret even
with t-1 shares using the SMT solver.
Mathematics Research Paper - Mathematics of Computer Networking - Final DraftAlexanderCominsky
This Research Paper goes into the mathematics of computer networking hardware as well as encryption methods used to ensure data can safely and securely be transmitted from one point to another across a computer network and the web.
Comparison of BFS and Prim's Algorithm when used in MANETs RoutingEditor IJCATR
One of the greatest challenge in MANETs for data transmission is route update. The route update in MANETs is implemented
with the help of Breadth first search algorithm and Prim’s algorithm. Using Prim’s algorithm in route update mechanism will reduce the
end-to-end delay to a greater extend in MANETs. The end-to-end delay can lead to a performance degradation in the network. Different
algorithms can be used to update the route information in MANETs. The traditional approaches such as Breadth First Search algorithm
used will increase the end-to-end delay since this algorithm will go through all the parent nodes before it goes to the children nodes.
Microgrids are the solution to the growing demand for energy in the recent times. It has the potential to improve local reliability, reduce cost and increase penetration rates for distributed renewable energy generation. Inclusion of Renewable Energy Systems(RES) which have become the topic of discussion in the recent times due to acute energy crisis, causes the power flow in the microgrid to be bi-directional in nature. The presence of the RES in the microgrid system causes the grid to be reconfigurable. This reconfiguration might also occur due to load or utility grid connection and disconnection. Thus conventional protection strategies are not applicable to micro-grids and is hence challenging for engineers to protect the grid in a fault condition. In this paper various Minimum Spanning Tree(MST) algorithms are applied in microgrids to identify the active nodes of the current topology of the network in a heuristic approach and thereby generating a tree from the given network so that minimum number of nodes have to be disconnected from the network during fault clearance. In the paper we have chosen the IEEE-39 and IEEE-69 bus networks as our sample test systems.
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is an open access international journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Wireless sensor networks (WSN) have been widely used in various applications.
In these networks nodes collect data from the attached sensors and send their data to a base
station. However, nodes in WSN have limited power supply in form of battery so the nodes
are expected to minimize energy consumption in order to maximize the lifetime of WSN. A
number of techniques have been proposed in the literature to reduce the energy
consumption significantly. In this paper, we propose a new clustering based technique
which is a modification of the popular LEACH algorithm. In this technique, first cluster
heads are elected using the improved LEACH algorithm as usual, and then a cluster of
nodes is formed based on the distance between node and cluster head. Finally, data from
node is transferred to cluster head. Cluster heads forward data, after applying aggregation,
to the cluster head that is closer to it than sink in forward direction or directly to the sink.
This reduction in distance travelled improves the performance over LEACH algorithm
significantly.
FAULT-TOLERANT MULTIPATH ROUTING SCHEME FOR ENERGY EFFICIENT WIRELESS SENSOR ...ijwmn
Themain challengein wireless sensor network is to improve the fault tolerance of each
node and also provide an energy efficient fast data routing service. In this paper we propose an
energyefficient node fault diagnosis and recovery for wireless sensor networks referred as fault tolerant
multipath routing scheme for energy efficientwireless sensor network (FTMRS).The FTMRSis based on
multipath data routing scheme. One shortest path is use for main data routing in FTMRS technique and
other two backup paths are used as alternative path for faulty network and to handle the overloaded
traffic on main channel.Shortest path data routing ensures energy efficient data routing. The
performance analysis of FTMRSshows better results compared to other popular fault tolerant techniques
in wireless sensor networks.
This work is proposed the feed forward neural network with symmetric table addition method to design the
neuron synapses algorithm of the sine function approximations, and according to the Taylor series
expansion. Matlab code and LabVIEW are used to build and create the neural network, which has been
designed and trained database set to improve its performance, and gets the best a global convergence with
small value of MSE errors and 97.22% accuracy.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
ADA Unit — 2 Greedy Strategy and Examples | RGPV De BunkersRGPV De Bunkers
Welcome to the comprehensive study material designed specifically for students of Rajiv Gandhi Proudyogiki Vishwavidyalaya (RGPV) in their 4th semester of the Computer Science Engineering program. In this study material, we will explore the essential concepts of "Analysis & Design of Algorithms," a crucial subject that forms the foundation of efficient problem-solving in computer science and engineering.
Unit 1: Greedy Strategy and Examples
This unit introduces the Greedy strategy, a powerful approach in algorithm design. Greedy algorithms make locally optimal choices at each step, aiming to achieve a globally optimal solution. We will explore its applications through various examples:
Optimal Merge Patterns: Learn how to merge sorted sequences efficiently using the Greedy approach, minimizing the number of comparisons needed.
Huffman Coding: Dive into the world of data compression with Huffman coding, assigning shorter binary codes to frequently occurring characters.
Minimum Spanning Trees (MST): Understand Prim's and Kruskal's algorithms to find the minimum weight spanning tree in a graph, crucial in network design and clustering.
Knapsack Problem: Discover the limitations of the Greedy strategy when solving the Knapsack problem and explore more efficient techniques.
Job Sequencing with Deadlines: Apply the Greedy approach to schedule jobs optimally based on deadlines and profits.
Single Source Shortest Path Algorithm: Master Dijkstra's algorithm to find the shortest paths from a single source vertex to all other vertices in a weighted graph.
Each topic is accompanied by detailed explanations, examples, and step-by-step algorithms to enhance your understanding and problem-solving skills.
About the Author
The study material is meticulously prepared by expert educators with vast experience in computer science and engineering. They have a deep understanding of the RGPV curriculum and the specific needs of 4th-semester students pursuing Computer Science Engineering.
How to Use this Study Material
This study material is designed to complement your regular coursework. Use it as a valuable resource for exam preparation, revision, and understanding complex concepts. Pay attention to algorithmic explanations, proof of correctness, and time complexity analysis.
Why This Study Material?
RGPV-Aligned Content: The material is tailored to align with the RGPV curriculum, ensuring relevance and applicability.
Comprehensive Coverage: All critical topics are covered in detail, providing a holistic understanding of the subject.
Clarity and Simplicity: Complex algorithms and concepts are explained in a clear and straightforward manner, making it accessible to all students.
Real-World Applications: Explore how algorithms are applied to solve real-world problems, enhancing your problem-solving skills.
Practice Questions: Practice questions and exercises are included to reinforce your learning.
Optimising Data Using K-Means Clustering AlgorithmIJERA Editor
K-means is one of the simplest unsupervised learning algorithms that solve the well known clustering problem. The procedure follows a simple and easy way to classify a given data set through a certain number of clusters (assume k clusters) fixed a priori. The main idea is to define k centroids, one for each cluster. These centroids should be placed in a cunning way because of different location causes different result. So, the better choice is to place them as much as possible far away from each other.
Vertex covering has important applications for wireless sensor networks such as monitoring link failures,
facility location, clustering, and data aggregation. In this study, we designed three algorithms for
constructing vertex cover in wireless sensor networks. The first algorithm, which is an adaption of the
Parnas & Ron’s algorithm, is a greedy approach that finds a vertex cover by using the degrees of the
nodes. The second algorithm finds a vertex cover from graph matching where Hoepman’s weighted
matching algorithm is used. The third algorithm firstly forms a breadth-first search tree and then
constructs a vertex cover by selecting nodes with predefined levels from breadth-first tree. We show the
operation of the designed algorithms, analyze them, and provide the simulation results in the TOSSIM
environment. Finally we have implemented, compared and assessed all these approaches. The transmitted
message count of the first algorithm is smallest among other algorithms where the third algorithm has
turned out to be presenting the best results in vertex cover approximation ratio.
Implementation of hybrid data collection (mobile element and hierarchical clu...IJARIIT
Wireless sensor network consider as real time embedded system deployed in a particular region to sense various types of
environmental parameters such as temperature, pressure, gas, humidity etc. The huge applications of WSN like habitant monitoring,
forest fire detection, surveillances, transport monitoring etc. have created a lot of interest among the researcher community in recent
past. Typically, WSNs are densely deployed in hazardous places where battery recharge or replacement is nearly impossible and
human monitoring scheme is highly risky.
Secured transmission through multi layer perceptron in wireless communication...ijmnct
In this paper, a multilayer perceptron guided encryption/decryption (STMLP) in wireless communication
has been proposed for exchange of data/information. Multilayer perceptron transmitting systems at both
ends generate an identical output bit and the network are trained based on the output which is used to
synchronize the network at both ends and thus forms a secret-key at end of synchronizations of the
networks. Weights or hidden units of the hidden layer help to form a secret session key. The plain text is
encrypted through chaining , cascaded xoring of multilayer perceptron generated session key. If size of the
final block of plain text is less than the size of the key then this block is kept unaltered. Receiver will use
identical multilayer perceptron generated session key for performing deciphering process for getting the
plain text. Parametric tests have been done and results are compared in terms of Chi-Square test, response
time in transmission with some existing classical techniques, which shows comparable results for the
proposed technique. Variation numbers of input vectors and hidden layers will increase the confusion
/diffusion of the schemeand hence increase the security. As a result variable energy based techniques may
be achieved which may be applicable devices/interface of the heterogeneous sizes of the network/device.
SCALING DISTRIBUTED DATABASE JOINS BY DECOUPLING COMPUTATION AND COMMUNICATIONijdms
To process a large volume of data, modern data management systems use a collection of machines
connected through a network. This paper proposes frameworks and algorithms for processing
distributed joins—a compute- and communication-intensive workload in modern data-intensive systems.
By exploiting multiple processing cores within the individual machines, we implement a system to
process database joins that parallelizes computation within each node, pipelines the computation with
communication, parallelizes the communication by allowing multiple simultaneous data transfers
(send/receive). Our experimental results show that using only four threads per node the framework
achieves a 3.5x gains in intra-node performance while compared with a single-threaded counterpart.
Moreover, with the join processing workload the cluster-wide performance (and speedup) is observed to
be dictated by the intra-node computational loads; this property brings a near-linear speedup with
increasing nodes in the system, a feature much desired in modern large-scale data processing system
SCALING DISTRIBUTED DATABASE JOINS BY DECOUPLING COMPUTATION AND COMMUNICATIONijdms
To process a large volume of data, modern data management systems use a collection of machines
connected through a network. This paper proposes frameworks and algorithms for processing
distributed joins—a compute- and communication-intensive workload in modern data-intensive systems.
By exploiting multiple processing cores within the individual machines, we implement a system to
process database joins that parallelizes computation within each node, pipelines the computation with
communication, parallelizes the communication by allowing multiple simultaneous data transfers
(send/receive). Our experimental results show that using only four threads per node the framework
achieves a 3.5x gains in intra-node performance while compared with a single-threaded counterpart.
Moreover, with the join processing workload the cluster-wide performance (and speedup) is observed to
be dictated by the intra-node computational loads; this property brings a near-linear speedup with
increasing nodes in the system, a feature much desired in modern large-scale data processing system.
Now-a-days, Internet has become an important part of human’s life, a person
can shop, invest, and perform all the banking task online. Almost, all the organizations have
their own website, where customer can perform all the task like shopping, they only have to
provide their credit card details. Online banking and e-commerce organizations have been
experiencing the increase in credit card transaction and other modes of on-line transaction.
Due to this credit card fraud becomes a very popular issue for credit card industry, it causes
many financial losses for customer and also for the organization. Many techniques like
Decision Tree, Neural Networks, Genetic Algorithm based on modern techniques like
Artificial Intelligence, Machine Learning, and Fuzzy Logic have been already developed for
credit card fraud detection. In this paper, an evolutionary Simulated Annealing algorithm is
used to train the Neural Networks for Credit Card fraud detection in real-time scenario.
This paper shows how this technique can be used for credit card fraud detection and
present all the detailed experimental results found when using this technique on real world
financial data (data are taken from UCI repository) to show the effectiveness of this
technique. The algorithm used in this paper are likely beneficial for the organizations and
for individual users in terms of cost and time efficiency. Still there are many cases which are
misclassified i.e. A genuine customer is classified as fraud customer or vise-versa.
The next generation wireless networks comprises of mobile users moving
between heterogeneous networks, using terminals with multiple access interfaces and
services. The most important issue in such environment is ABC (Always Best Connected) i.e.
allowing the best connectivity to applications anywhere at any time. For always best
connectivity requirement various vertical handover strategies for decision making have
been proposed. This paper provides an overview of the most interesting and recent
strategies.
This paper presents the design and performance comparison of a two stage
operational amplifier topology using CMOS and BiCMOS technology. This conventional op
amp circuit was designed by using RF model of BSIM3V3 in 0.6 μm CMOS technology and
0.35 μm BiCMOS technology. Both the op amp circuits were designed and simulated,
analyzed and performance parameters are compared. The performance parameters such as
gain, phase margin, CMRR, PSRR, power consumption etc achieved are compared. Finally,
we conclude the suitability of CMOS technology over BiCMOS technology for low power
RF design.
In Cognitive Radio Networks (CRN), Cooperative Spectrum Sensing (CSS) is
used to improve performance of spectrum sensing techniques used for detection of licensed
(Primary) user’s signal. In CSS, the spectrum sensing information from multiple unlicensed
(Secondary) users are combined to take final decision about presence of primary signal. The
mixing techniques used to generate final decision about presence of PU’s signal are also
called as Fusion techniques / rules. The fusion techniques are further classified as data
fusion and decision fusion techniques. In data fusion technique all the secondary users
(SUs) share their raw information of spectrum detection like detected energy or other
statistical information, while in decision fusion technique all the SUs take their local
decisions and share the decision by sending ‘0’ or ‘1’ corresponding to absence and presence
of PU’s signal respectively. The rules used in decision fusion techniques are OR rule, AND
rule and K-out-of-N rule. The CSS is further classified as distributed CSS and centralized
CSS. In distributed CSS all the SUs share the spectrum detection information with each
other and by mixing the shared information; all the SUs take final decision individually. In
centralized CSS all the SUs send their detected information to a secondary base station /
central unit which combines the shared information and takes final decision. The secondary
base station shares the final decision with all the SUs in the CRN. This paper covers
overview of information fusion methods used for CSS and analysis of decision fusion rules
with simulation results.
ZigBee has been developed to support lower data rates and low power consuming
applications. This paper targets to analyze various parameters of ZigBee physical (PHY).
Performance of ZigBee PHY is evaluated on the basis of energy consumption in
transmitting and receiving mode and throughput. Effect of variation in network size is
studied on these performance attributes. Some modulation schemes are also compared and
the best modulation scheme is suggested with tradeoffs between different performance
metrics.
This paper gives a brief idea of the moving objects tracking and its application.
In sport it is challenging to track and detect motion of players in video frames. Task
represents optical flow analysis to do motion detection and particle filter to track players
and taking consideration of regions with movement of players in sports video. Optical flow
vector calculation gives motion of players in video frame. This paper presents improved
Luacs Kanade algorithm explained for optical flow computation for large displacement and
more accuracy in motion estimation.
A rapid progress is seen in the field of robotics both in educational and industrial
automation sectors. The Robotics education in particular is gaining technological advances
and providing more learning opportunities. In automotive sector, there is a necessity and
demand to automate daily human activities by robot. With such an advancement and
demand for robotics, the realization of a popular computer game will help students to learn
and acquire skills in the field of robotics. The computer game such as Pacman offers
challenges on both software and hardware fronts. In software, it provides challenges in
developing algorithms for a robot to escape from the pool of attacking robots and to develop
algorithms for multiple ghost robots to attack the Pacman. On the hardware front, it
provides a challenge to integrate various systems to realize the game. This project aims to
demonstrate the pacman game in real world as well as in simulation. For simulation
purpose Player/Stage is used to develop single-client and multi-client architectures. The
multi- client architecture in player/stage uses one global simulation proxy to which all the
robot models are connected. This reduces the overhead to manage multiple robots proxy.
The single-client architecture enables only two robot models to connect to the simulation
proxy. Multi-client approach offers flexibility to add sensors to each port which will be used
distinctly by the client attached to the respective robot. The robots are named as Pacman
and Ghosts, which try to escape and attack respectively. Use of Network Camera has been
done to detect the global positions of the robots and data is shared through inter-process
communication.
In Content-Based Image Retrieval (CBIR) systems, the visual contents of the
images in the database are took out and represented by multi-dimensional characteristic
vectors. A well known CBIR system that retrieves images by unsupervised method known
as cluster based image retrieval system. For enhancing the performance and retrieval rate
of CBIR system, we fuse the visual contents of an image. Recently, we developed two
cluster-based CBIR systems by fusing the scores of two visual contents of an image. In this
paper, we analyzed the performance of the two recommended CBIR systems at different
levels of precision using images of varying sizes and resolutions. We also compared the
performance of the recommended systems with that of the other two existing CBIR systems
namely UFM and CLUE. Experimentally, we find that the recommended systems
outperform the other two existing systems and one recommended system also comparatively
performed better in every resolution of image.
Information Systems and Networks are subjected to electronic attacks. When
network attacks hit, organizations are thrown into crisis mode. From the IT department to
call centers, to the board room and beyond, all are fraught with danger until the situation is
under control. Traditional methods which are used to overcome these threats (e.g. firewall,
antivirus software, password protection etc.) do not provide complete security to the system.
This encourages the researchers to develop an Intrusion Detection System which is capable
of detecting and responding to such events. This review paper presents a comprehensive
study of Genetic Algorithm (GA) based Intrusion Detection System (IDS). It provides a
brief overview of rule-based IDS, elaborates the implementation issues of Genetic Algorithm
and also presents a comparative analysis of existing studies.
Step by step operations by which we make a group of objects in which attributes
of all the objects are nearly similar, known as clustering. So, a cluster is a collection of
objects that acquire nearly same attribute values. The property of an object in a cluster is
similar to other objects in same cluster but different with objects of other clusters.
Clustering is used in wide range of applications like pattern recognition, image processing,
data analysis, machine learning etc. Nowadays, more attention has been put on categorical
data rather than numerical data. Where, the range of numerical attributes organizes in a
class like small, medium, high, and so on. There is wide range of algorithm that used to
make clusters of given categorical data. Our approach is to enhance the working on well-
known clustering algorithm k-modes to improve accuracy of algorithm. We proposed a new
approach named “High Accuracy Clustering Algorithm for Categorical datasets”.
Brain tumor is a malformed growth of cells within brain which may be
cancerous or non-cancerous. The term ‘malformed’ indicates the existence of tumor. The
tumor may be benign or malignant and it needs medical support for further classification.
Brain tumor must be detected, diagnosed and evaluated in earliest stage. The medical
problems become grave if tumor is detected at the later stage. Out of various technologies
available for diagnosis of brain tumor, MRI is the preferred technology which enables the
diagnosis and evaluation of brain tumor. The current work presents various clustering
techniques that are employed to detect brain tumor. The classification involves classification
of images into normal and malformed (if detected the tumor). The algorithm deals with
steps such as preprocessing, segmentation, feature extraction and classification of MR brain
images. Finally, the confirmatory step is specifying the tumor area by technique called
region of interest.
A Proxy signature scheme enables a proxy signer to sign a message on behalf of
the original signer. In this paper, we propose ECDLP based solution for chen et. al [1]
scheme. We describe efficient and secure Proxy multi signature scheme that satisfy all the
proxy requirements and require only elliptic curve multiplication and elliptic curve addition
which needs less computation overhead compared to modular exponentiations also our
scheme is withstand against original signer forgery and public key substitution attack.
Water marking has been proposed as a method to enhance data security. Text
water marking requires extreme care when embedding additional data within the images
because the additional information must not affect the image quality. Digital water marking
is a method through which we can authenticate images, videos and even texts. Add text
water mark and image water mark to your photos or animated image, protect your
copyright avoid unauthorized use. Water marking functions are not only authentication, but
also protection for such documents against malicious intentions to change such documents
or even claim the rights of such documents. Water marking scheme that hides water
marking in method, not affect the image quality. In this paper method of hiding a data using
LSB replacement technique is proposed.
Today among various medium of data transmission or storage our sensitive data
are not secured with a third-party, that we used to take help of. Cryptography plays an
important role in securing our data from malicious attack. This paper present a partial
image encryption based on bit-planes permutation using Peter De Jong chaotic map for
secure image transmission and storage. The proposed partial image encryption is a raw data
encryption method where bits of some bit-planes are shuffled among other bit-planes based
on chaotic maps proposed by Peter De Jong. By using the chaotic behavior of the Peter De
Jong map the position of all the bit-planes are permuted. The result of the several
experimental, correlation analysis and sensitivity test shows that the proposed image
encryption scheme provides an efficient and secure way for real-time image encryption and
decryption.
This paper presents a survey of Dependency Analysis of Service Oriented
Architecture (SOA) based systems. SOA presents newer aspects of dependency analysis due
to its different architectural style and programming paradigm. This paper surveys the
previous work taken on dependency analysis of service oriented systems. This study shows
the strengths and weaknesses of current approaches and tools available for dependency
analysis task in context of SOA. The main motivation of this work is to summarize the
recent approaches in this field of research, identify major issue and challenges in
dependency analysis of SOA based systems and motivate further research on this topic.
In this paper, proposed a novel implementation of a Soft-Core system using
micro-blaze processor with virtex-5 FPGA. Till now Hard-Core processors are used in
FPGA processor cores. Hard cores are a fixed gate-level IP functions within the FPGA
fabrics. Now the proposed processor is Soft-Core Processor, this is a microprocessor fully
described in software, usually in an HDL. This can be implemented by using EDK tool. In
this paper, developed a system which is having a micro-blaze processor is the combination
of both hardware & Software. By using this system, user can control and communicate all
the peripherals which are in the supported board by using Xilinx platform to develop an
embedded system. Implementing of Soft-Core process system with different peripherals like
UART interface, SPA flash interface, SRAM interface has to be designed using Xilinx
Embedded Development Kit (EDK) tools.
Wimax technology has reshaped the framework of broadband wireless internet
service. It provides the internet service to unconnected or detached areas such as east South
Africa, rural areas of America and Asia region. Full duplex helpers employed with one of
the relay stations selection and indexing method that is Randomized Distributed Space Time
are used to expand the coverage area of primary Wimax station. The basic problem was
identified at cell edge due to weather conditions (rain, fog), insertion of destruction because
of multiple paths in the same communication channel and due to interference created by
other users in that communication. It is impractical task for the receiver station to decode
the transmitted signal successfully at the cell edges, which increases the high packet loss and
retransmissions. But Wimax is a outstanding technology which is used for improving the
quality of internet service and also it offers various services like Voice over Internet
Protocol, Video conferencing and Multimedia broadcast etc where a little delay in packet
transmission can cause a big loss in the communication. Even setup and initialization of
another Wimax station nearer to each other is not a good alternate, where any mobile
station can easily handover to another base station if it gets a strong signal from other one.
But in rural areas, for few numbers of customers, installation of base station nearer to each
other is costlier task. In this review article, we present a scheme using R-DSTC technique to
choose and select helpers (relay nodes) randomly to expand the coverage area and help to
mobile station as a helper to provide secure communication with base station. In this work,
we use full duplex helpers for better utilization of bandwidth.
Radio Frequency identification (RFID) technology has become emerging
technique for tracking and items identification. Depend upon the function; various RFID
technologies could be used. Drawback of passive RFID technology, associated to the range
of reading tags and assurance in difficult environmental condition, puts boundaries on
performance in the real life situation [1]. To improve the range of reading tags and
assurance, we consider implementing active backscattering tag technology. For making
mobiles of multiple radio standards in 4G network; the Software Defined Radio (SDR)
technology is used. Restrictions in Existing RFID technologies and SDR technology, can be
eliminated by the development and implementation of the Software Defined Radio (SDR)
active backscattering tag compatible with the EPC global UHF Class 1 Generation 2 (Gen2)
RFID standard. Such technology can be used for many of applications and services.
Vehicle technology has increased rapidly in recent years, particularly in relation
to braking system and sensing system. In parallel to the development of braking
technologies, sensors have been developed that are capable of detecting physical obstacles,
other vehicles or pedestrians around the vehicle. This development prevents accidents of
vehicles using Stereo Multi-Purpose cameras, Automated Emergency Braking Systems and
Ultrasonic Sensors. The stereo multi-purpose camera provides spatial intelligence of up to
50 metres in front of the vehicle and there is an environment recognition of 500 metres.
Cars can automatically brake due to obstacles or any hindrance when the sensor senses the
obstacles. The braking circuit function is to brake the car automatically after receiving
signal from the sensors. All cars are competent in applying brakes automatically to a
maximum extent of deceleration of 0.4g. Integrated safety systems are based on three
principles. They are: collision avoidance, collision mitigation braking systems and forward
collision warning.
Stability of software is related to the decomposing the classes. In any software,
major part of the code is suffers from the Yoyo problem with multiple issues related to
readability of code, understandability of code as well as maintainability of code. Due to
these issues, there is need to rethink, redesign, re-factor these pieces of code. The best way is
to simplify the inter relationship of class objects in such a manner that code becomes concise
with Liskov Substitution Principle by decomposition of classes. However this may lead to
unknown or unwanted issues affecting the stability of overall application which may even
lead to software erosion.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
How to Create Map Views in the Odoo 17 ERPCeline George
The map views are useful for providing a geographical representation of data. They allow users to visualize and analyze the data in a more intuitive manner.
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptxEduSkills OECD
Andreas Schleicher presents at the OECD webinar ‘Digital devices in schools: detrimental distraction or secret to success?’ on 27 May 2024. The presentation was based on findings from PISA 2022 results and the webinar helped launch the PISA in Focus ‘Managing screen time: How to protect and equip students against distraction’ https://www.oecd-ilibrary.org/education/managing-screen-time_7c225af4-en and the OECD Education Policy Perspective ‘Students, digital devices and success’ can be found here - https://oe.cd/il/5yV
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
2. 83
node. However, in the second method, we adopt a distributed approach so that each node gets the complete
graph information. Hence, we name our methods as ‘centralized’ and ‘decentralized’ accordingly.
Though, both centralized and decentralized approaches can be used for constructing MST and for finding
shortest paths, it has been shown in the complexity analysis that the centralized approach performs better for
constructing MST whereas the decentralized approach does well to find shortest paths.
A. Message Types and Data Structures
We assume an initiator node v V, which performs breadth first search (BFS) in the beginning. The initiator
could be any arbitrary node in the system. The BFS procedure outputs the BFS-tree with v as root. In BFS-
tree, there are two types of nodes, namely, leaf and non-leaf nodes. A leaf node has single edge connecting
parent and non-leaf node has two or more edges that connect it to its neighbors. Assume that there are total N
vertices and E edges in the graph. The value of E is upper bounded by N2
when each vertex is connected to
every other vertex. Each node is aware of its neighbors and the weight associated with the edges connecting
them.
Messages: Following messages have been used in the algorithm.
1. Make_Me_Parent: It is used by a node to request some other node to become its child.
2. ACCEPT: It is sent by a node, which accepts to become child, to the sender of Make_Me_Parent
message.
3. REJECT: It is sent by a node, which has already become child of some other node, in response to
Make_Me_Parent message.
4. E_Msg: It is sent by nodei to its parent. It is edges’ information message containing Id of all neighbors
for nodei and the weights associated with the edges connecting them. Also, nodei forwards with it all
other E_Msg messages received from its BFS neighbors. It also contains Id of its source node.
5. MST_Info_Msg: It is the message containing MST information.
6. Graph_Info_Msg: It is the message containing complete graph information.
Data Structures: Each nodei maintains the following data structures:
1. has_parenti: boolean variable indicating whether the nodei has parent.
2. allNeighborListi:It is the list containing Id of all neighbors (BFS and non-BFS) of nodei.
3. countInfoEdgei: It contains the number of edges through which nodei has received E_Msg. It is
initialized to zero and incremented on reception of each E_Msg.
4. countBFSedgei: It is variable that contains the number of BFS neighbors of nodei.
5. BFS_NeighborListi: It is the list containing Id of all BFS neighbors of nodei.
6. Array_listi[]: Each nodei maintains a 1-d array having number of elements equal to countBFSedgei;
Array_listi[j] = 1, in case, E_Msg received from node j; Array_listi[j] = 0, otherwise. Array_listi[j] is
initialized to 0 for all j.
7. Reject_Counti: Each nodei maintains this variable to count the number of REJECT messages received.
B. Algorithm I
We present the algorithm in event driven form. Firstly, the initiator starts the BFS protocol by sending
Make_Me_Parent message to its neighbors.
At Ordinary Node:
Event 1: on receiving Make_Me_Parent message:
if has_parent = 1 then reply REJECT else { reply ACCEPT;
If(|allNeighborList| == 1)
Then send E_Msg to the sender of Make_Me_Parent message.
Else
Forward Make_Me_Parent message to other neighbors.
}
Event 2: on receiving REJECT message: increment Reject_Count; If Reject_Count = |allNeighborList| - 1,
send E_Msg to parent.
Event 3: on receiving ACCEPT message: Put the sender Id in BFS_NeighborList.
Event 4: on receiving E_Msg from node j:
Set Array_list[j] ← 1;
countInfoEdge ← countInfoEdge + 1;
If (countInfoEdge = = countBFSedge - 1)
Then scan Array_list[] to find node k for which Array_list[k] = 0;
3. 84
append its own E_Msg message to other received E_Msg messages and forward this message to
node k.
Else If (countInfoEdge < countBFSedge - 1)
Then store the message;
Else if (countInfoEdge == countBFSedge) then
If (nodei . id < E_Msg.sender.id){
/* the entire graph information has converged at nodei */
calculate exact MST using Kruskal’s or Prim’s algorithm;
send MST_Info_Msg on newly computed MST edges.}
The Working of Algorithm I: The nodes that have received some ACCEPT messages are non-leaf nodes;
however, the nodes, which do not receive any ACCEPT message, become leaf nodes. Thus, each node is
inherently aware of its status as leaf or non-leaf node. The leaf nodes send edge information message to their
respective parent nodes. If a non-leaf node has degree e, then the node would wait for the arrival of edge
information messages on each of its e-1 BFS tree edges. Once it has received edge information messages on
its e-1 edges, the node appends its own edge information message to the received messages and forwards the
combined message on the remaining eth
edge. Finally, there would be a single node in the system that would
receive edge information messages on all of its BFS edges. As this node contains the entire graph
information, we call it ‘central’ node, henceforth. Also, we call algorithm I as centralized. Now, the central
node computes MST using Kruskal’s or Prim’s algorithm and disseminate the MST information on newly
computed MST edges.
C. Algorithm II
The Event 1, 2, and 3 are same as Algorithm I.
Event 4: on receiving E_Msg from node j:
Set Array_list[j] ← 1;
countInfoEdge ← countInfoEdge + 1;
If (countInfoEdge = = countBFSedge - 1)
Then scan Array_list[] to find node k for which Array_list[k] = 0;
append its own E_Msg message to other received E_Msg messages and forward this message to
node k.
Else If (countInfoEdge < countBFSedge - 1)
then store the message;
Else if (countInfoEdge == countBFSedge) then
If (nodei . id < E_Msg.sender.id){
/* the entire graph information has converged at nodei */
send Graph_Info_Msg on BFS edges.}
The Working of Algorithm II: Unlike Algorithm I, after receiving the entire graph information, the central
node does not compute MST, rather, it sends Graph_Info_Msg wave on BFS edges. The receiver nodes, in
turn, forward this wave to their BFS neighbors. In this way, all the nodes in the network receive the complete
graph information. Now, each node can apply Dijkstra’s single source shortest path (SSSP) algorithm to
compute shortest path to any vertex in the graph.
D. The Proof of Termination
Theorem: Only one node would receive the complete graph information.
Proof: We are using BFS tree for collecting graph information; thus, there exist no cycle in the graph.
Moreover, every node sends graph information on only one edge. Now, assume the contrary. Say, two
arbitrary nodes i and j, both, receive whole graph information at time t1 and t2 respectively. Without loss of
generality, assume t1 < t2. Now, there are two possibilities: (i) node i and j have a common ancestor node,
say k. Since node i and j both have received whole graph information, both nodes have received graph
information on all of its BFS edges. Therefore, the common ancestor node k has send data on two edges,
which is a contradiction. (ii) node i and j do not have common ancestor node. It is possible only if one of
them is parent of the other, i.e. either node i is parent of node j or vice versa. Thus, node i and j are neighbors.
In this situation, it is possible for both of them to receive the graph information, if they have different send
and receive channels; otherwise, the collision may occur. Hence, two neighbor nodes can receive the entire
graph information. However, under this situation, node Id is used for tie breaking. Therefore, the theorem
holds.
4. 85
E. Message Complexity
Theorem: The number of messages exchanged in Algorithm I as well as in Algorithm II is 4|E|.
Proof: We have considered our network consisting of N nodes as undirected connected graph G = (V, E),
where |E| represents the total number of edges in the graph. Now, looking at the operational view of both the
algorithms, when a node receives Make_Me_Parent message, it sends Make_Me_Parent message on its
every edge except to its parent. Also, every edge is shared between two nodes that are neighbors. Thus, every
edge is used to send Make_Me_Parent message by two nodes, a maximum of 2|E| Make_Me_Parent
messages can be send. However, on receiving first Make_Me_Parent message, except initiator node,
remaining (N-1) nodes will get parent and hence, they will not send Make_Me_Parent message to their
parents. Therefore, the number of Make_Me_Parent messages, actually propagated, will be (N-1) less than
2|E|, i.e. 2|E| - (N-1).
In response to each Make_Me_Parent message, a node receives either REJECT or ACCEPT message. Hence,
the total number of ACCEPT and REJECT messages will also amount to 2|E| - (N-1). Thus, the total number
of messages propagated to construct BFS tree will be 2{2|E| - (N-1)}.
Once BFS tree is in place, all the nodes, except the node that eventually becomes the central node, will send
graph information to their respective parents. Thus, the total number of E_Msg messages, to collect the whole
graph information at one node, will be (N-1). The computation of MST does not involve any additional
message propagation because it is local computation at central node. Finally, (N-1) additional messages are
required to distribute the MST information across all the nodes. Therefore, the total message overhead
amounts to 2{2|E| - (N-1)} + (N-1) + (N-1), i.e. 4|E|. The results will be same for Algorithm II also. It is
interesting to note that the message efficient algorithms [1–4], to construct MST, have message complexity O
(|E| + N log N).
F. Time Complexity
The time complexity of a distributed algorithm is the maximum time taken by a computation of the algorithm
under the following assumptions [8]: (i) a process can execute any finite number of events in zero time, i.e.,
the local computations performed by nodes do not affect the time complexity (alternatively, they are “free”
[7]), (ii) the time between sending and receipt of a message is at most one time unit. In other words, the
running time of any algorithm is equal to the number of sequential message propagations. Thus, if all
messages are propagated in sequence, the algorithm takes worst case running time. Hence, for computing
worst case time efficiency, we may assume all N nodes are arranged in a straight line and an extreme node is
the initiator. Therefore, the total number of edges would be (N-1). The BFS tree construction procedure
would propagate (N-1) Make_Me_Parent messages and (N-1) ACCEPT messages. There won’t be any
REJECT message, in this case. Once BFS tree is constructed, (N-1) E_Msg messages would be flown to
collect complete edge information at initiator, and the initiator would become central node. Now, the MST
computation is performed by the central node locally, hence, it does not incur any running time overhead.
Afterwards, additional (N-1) algorithm messages are exchanged to disseminate the MST information in the
entire network. Hence, total 4(N-1) sequential control messages are needed to construct MST. Therefore, the
algorithm requires O (N) rounds of distributed communication. Thus, the worst case running time of the
algorithm is O (N).
G. Simulation of Algorithm I
We have simulated an example ad hoc network using ns2. The nodes are randomly distributed in an area of
350 350 units. We vary the number of nodes and edges in the network arbitrarily. Accordingly, the number
of edges per node also varies. The total number of messages required to construct BFS tree and disseminate
the MST information in the graph, comes out to be 4|E| + 1, where E is the number of edges in the graph. It
may be noted that, the message count in the simulation result contains one extra message as compared to that
in section 2.5, because in the static analysis we consider no collision scenario. However, in the simulation
experiment, one additional E_Msg (terminate) message is generated because the complete graph information
is received, finally, by two neighbor nodes, out of which the lower Id node becomes the central node. Table 1
summarizes the results related to MST construction.
All eleven cases, from the above Table 1, have been plotted in the following Figure 1. In Figure 1 and Figure
3, the X-axis represents the simulation serial number (Sr. No.) as shown in Table 1 and Table 2. In both the
figures, Y-axis represents the count of nodes, edges, and messages that is shown in different colors
accordingly. Also, from Figure 2, we infer that message count increases linearly with the edge count in the
system.
5. 86
TABLE I. MST CONSTRUCTION RESULTS
Sr. No. No. of nodes No. of edges Messages edges/node 4*E + 1
1. 16 19 77 1.1875 77
2. 16 29 117 1.8125 117
3. 24 29 117 1.208333333 117
4. 16 41 165 2.5625 165
5. 24 47 189 1.958333333 189
6. 64 87 349 1.359375 349
7. 30 99 397 3.3 397
8. 100 139 557 1.39 557
9. 200 279 1117 1.395 1117
10. 200 325 1301 1.625 1301
11. 400 655 2621 1.6375 2621
Figure 1. Message count on varying node and edge count simultaneously in MST construction
Figure 2. Edge count Vs message count in MST construction
H. Simulation of Algorithm II
We use the same simulation set up as we used for Algorithm I. The total number of messages required to
construct BFS tree and disseminate the entire graph information to each vertex, comes out to be 4*E + 1,
where E is the number of edges in the graph. The value is same as in algorithm I. Also, the computation of
single source shortest path (SSSP) does not involve any message propagation because it is computed locally
by each node using the complete graph information available. Table 2 summarizes the results related to
Algorithm II. All ten cases in Table 2 have been plotted in Figure 3. We observe that the plot of Algorithm II
shows similar trend as that of Algorithm I.
III. CONCLUSIONS
A linear time algorithm to construct minimum spanning tree and single source shortest path was presented.
The message efficiency of our algorithms has been confirmed by static analysis as well as simulation results.
The message overhead is under strict control because the major computation work is local in case of both the
0
500
1000
1500
2000
2500
3000
1 2 3 4 5 6 7 8 9 10 11
Messages Edges Nodes
0
500
1000
1500
2000
2500
3000
19
29
29
41
47
87
99
139
279
325
655
Numberofmessages
Number of edges
Edge count Vs Message count
Messages
6. 87
TABLE II. ALGORITHM II RESULTS
Sr. No. No. of nodes No. of edges Messages edges/node 4*E+1
1. 16 19 77 1.1875 77
2. 16 29 117 1.8125 117
3. 24 29 117 1.208333333 117
4. 16 41 165 2.5625 165
5. 24 47 189 1.958333333 189
6. 64 87 349 1.359375 349
7. 30 99 397 3.3 397
8. 100 139 557 1.39 557
9. 200 279 1117 1.395 1117
10. 200 325 1301 1.625 1301
Figure 3. Message count on varying node and edge count simultaneously in Algorithm II
algorithms. Furthermore, the computation of spanning tree is predominantly a sequential task; nevertheless,
our algorithm manifests linear convergence time.
REFERENCES
[1] R. Gallager, P. Humblet, and P. Spira, “A distributed algorithm for minimum weight spanning trees,” ACM Trans.
Programming Languages and Systems, vol. 5, no. 1, pp. 66–77, 1983.
[2] F. Chin and H. Ting, “An almost linear time and O(n log n+e) messages distributed algorithm for minimum weight
spanning trees,” IEEE Symp. Foundations of Computer Science, pp. 257–266, 1985.
[3] E. Gafni, “Improvements in the time complexity of two message-optimal election algorithms,” ACM Symp.
Principles of Distributed Computing, pp. 175–185, 1985.
[4] B. Awerbuch, “Optimal distributed algorithms for minimum weight spanning tree: counting, leader election, and
related problems,” ACM Symp. Theory of Computing, pp. 230–240, 1987.
[5] J. Garay, S. Kutten, and D. Peleg, “A sublinear time distributed algorithm for minimum weight spanning trees,”
SIAM J. Comput, vol. 27, pp. 302–316, 1998.
[6] S. Kutten and D. Peleg, “Fast distributed construction of k-dominating sets and applications,” J. Algorithms, vol. 28,
pp. 40–66, 1998.
[7] M. Elkin, “A faster distributed protocol for constructing minimum spanning tree,” ACM-SIAM Symp. Discrete
Algorithms, pp. 352–361, 2004.
[8] G. Tel, Introduction to Distributed Algorithms, 2nd
ed., Cambridge Univ. Press, New York, 2000, pp. 209–210.
0
200
400
600
800
1000
1200
1400
1 2 3 4 5 6 7 8 9 10
Messages
Edges
Nodes