This document discusses secure routing and data transfer in mobile ad-hoc networks (MANETs). It proposes using onion routing and node characterization to securely route data through layered intermediate nodes while also sending dummy packets to securely transfer data. Onion routing works by removing intermediate node identifiers in reverse order from destination to source, like peeling layers of an onion. Node characterization identifies malicious nodes that drop or modify packets by adding sequence numbers, random node identifiers, and padding to packets. This approach aims to securely route and transfer data while reducing transmission time compared to establishing separate routes for each transmission.
In this paper we propose a system that allows a safe and secure data transfer in MANETs between the source and the destination. As MANETs are unplanned networks and networks of instant communication, they are prone to attacks like disclosure, brute force attacks etc. In this paper we mainly concentrate on limiting the disclosure attacks in MANETs. Disclosure attack means that the network is monitored quietly without modifying it. The monitoring of network is possible only if the traffic is known. Hiding of traffic between the source and destination would prevent disclosure attacks in MANETs. To hide the traffic between the source and destination we must identify it. The traffic is identified using STARS(Statistical Traffic Pattern Discovery System for MANETs) technique. Using this technique, the traffic is made observable only for the intermediary nodes and the data is sent via intermediary nodes to the destination as single hop. The data which is sent as single hop by hop via intermediary nodes prevents the malicious node from knowing the original source and destination and thus preventing MANETs from disclosure attack.
A Novel Key Distribution Scheme f or a Visual Crypto SystemIRJET Journal
This document proposes a novel key distribution scheme for visual cryptography. It begins with an introduction to cryptography and visual cryptography. It then describes the existing Diffie-Hellman key exchange algorithm. The proposed method generates a shared secret key through a multi-step process using asymmetric key cryptography and modulus operation on private keys and a public image. Both parties are able to derive the same symmetric key for encrypting future communications without directly transmitting their private keys. The methodology and implementation details are provided, along with experimental results demonstrating the generation of matching keys within 0.11 seconds on average.
Encryption is a technique that transforms a code from an understandable into an incomprehensible code. Many methods can be applied to an encryption process. One such method is RSA. RSA works by appointing on byte values. The value is obtained from character conversion to ASCII code. This algorithm is based on the multiplication of two relatively large primes. Applications of the RSA algorithm can be used in data security. This research provides RSA algorithm application on data security system that can guarantee data confidentiality. RSA algorithm is known as a very secure algorithm. This algorithm works with the number of bits in the search for prime numbers. The larger the bits, the less chance of ciphertext can be solved. The weakness of this method is the amount of ciphertext capacity will be floating in line with the number of prime numbers used. Also, to perform the process of encryption and decryption, RSA requires a relatively long time than other algorithms. The advantage of RSA is that complicated ciphertext is solved into plaintext.
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.
An Approach on Data Security with the Combination of Symmetric and Asymmetric...AnirbanBhowmik8
Data security is an important issue in modern era. In this paper, we use both symmetric and asymmetric key for encryption and decryption for data security. In our technique, two phases are used. In the 1st phase symmetric key encryption is used and in 2nd phase asymmetric key encryption like RSA is used.
Generate an Encryption Key by using Biometric Cryptosystems to secure transfe...IOSR Journals
The document describes a proposed method for generating an encryption key from biometric cryptosystems to securely transfer data over a network. It involves extracting minutiae points from a fingerprint scan, generating a cryptographic key from the biometric template, and using an RSA encryption algorithm with the biometric-derived private key. A public key is also calculated based on ridge and furrow patterns in the fingerprint scan. The goal is to uniquely generate encryption keys for each individual using their biometric fingerprint information to add an extra layer of security beyond traditional encryption techniques.
RSA is one of the most popular Public Key Cryptography based algorithm mainly used for digital
signatures, encryption/decryption etc. It is based on the mathematical scheme of factorization of very large
integers which is a compute-intensive process and takes very long time as well as power to perform.
Several scientists are working throughout the world to increase the speedup and to decrease the power
consumption of RSA algorithm while keeping the security of the algorithm intact. One popular technique
which can be used to enhance the performance of RSA is parallel programming. In this paper we are
presenting the survey of various parallel implementations of RSA algorithm involving variety of hardware
and software implementations.
Security Flows and Improvement of a Recent Ultra Light-Weight RFID Protocol ijujournal
In this paper, we analyze the security vulnerabilities of SSL-MAP, an ultra-lightweight RFID mutual
authentication protocol recently proposed by Rama N, Suganya R. We present two effective attacks, a desynchronization attack and a full-disclosure attack, against this protocol. The former permanently disables
the authentication capability of a RFID tag by destroying synchronization between the tag and the RFID
reader. The latter completely threats a tag by extracting all the secret information that are stored in the
tag. The de-synchronization attack can be carried out in three round of interaction in SSL-MAP while the
full-disclosure attack is accomplished across several runs of SSL-MAP. We also discuss ways to counter
the attacks.
In this paper we propose a system that allows a safe and secure data transfer in MANETs between the source and the destination. As MANETs are unplanned networks and networks of instant communication, they are prone to attacks like disclosure, brute force attacks etc. In this paper we mainly concentrate on limiting the disclosure attacks in MANETs. Disclosure attack means that the network is monitored quietly without modifying it. The monitoring of network is possible only if the traffic is known. Hiding of traffic between the source and destination would prevent disclosure attacks in MANETs. To hide the traffic between the source and destination we must identify it. The traffic is identified using STARS(Statistical Traffic Pattern Discovery System for MANETs) technique. Using this technique, the traffic is made observable only for the intermediary nodes and the data is sent via intermediary nodes to the destination as single hop. The data which is sent as single hop by hop via intermediary nodes prevents the malicious node from knowing the original source and destination and thus preventing MANETs from disclosure attack.
A Novel Key Distribution Scheme f or a Visual Crypto SystemIRJET Journal
This document proposes a novel key distribution scheme for visual cryptography. It begins with an introduction to cryptography and visual cryptography. It then describes the existing Diffie-Hellman key exchange algorithm. The proposed method generates a shared secret key through a multi-step process using asymmetric key cryptography and modulus operation on private keys and a public image. Both parties are able to derive the same symmetric key for encrypting future communications without directly transmitting their private keys. The methodology and implementation details are provided, along with experimental results demonstrating the generation of matching keys within 0.11 seconds on average.
Encryption is a technique that transforms a code from an understandable into an incomprehensible code. Many methods can be applied to an encryption process. One such method is RSA. RSA works by appointing on byte values. The value is obtained from character conversion to ASCII code. This algorithm is based on the multiplication of two relatively large primes. Applications of the RSA algorithm can be used in data security. This research provides RSA algorithm application on data security system that can guarantee data confidentiality. RSA algorithm is known as a very secure algorithm. This algorithm works with the number of bits in the search for prime numbers. The larger the bits, the less chance of ciphertext can be solved. The weakness of this method is the amount of ciphertext capacity will be floating in line with the number of prime numbers used. Also, to perform the process of encryption and decryption, RSA requires a relatively long time than other algorithms. The advantage of RSA is that complicated ciphertext is solved into plaintext.
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.
An Approach on Data Security with the Combination of Symmetric and Asymmetric...AnirbanBhowmik8
Data security is an important issue in modern era. In this paper, we use both symmetric and asymmetric key for encryption and decryption for data security. In our technique, two phases are used. In the 1st phase symmetric key encryption is used and in 2nd phase asymmetric key encryption like RSA is used.
Generate an Encryption Key by using Biometric Cryptosystems to secure transfe...IOSR Journals
The document describes a proposed method for generating an encryption key from biometric cryptosystems to securely transfer data over a network. It involves extracting minutiae points from a fingerprint scan, generating a cryptographic key from the biometric template, and using an RSA encryption algorithm with the biometric-derived private key. A public key is also calculated based on ridge and furrow patterns in the fingerprint scan. The goal is to uniquely generate encryption keys for each individual using their biometric fingerprint information to add an extra layer of security beyond traditional encryption techniques.
RSA is one of the most popular Public Key Cryptography based algorithm mainly used for digital
signatures, encryption/decryption etc. It is based on the mathematical scheme of factorization of very large
integers which is a compute-intensive process and takes very long time as well as power to perform.
Several scientists are working throughout the world to increase the speedup and to decrease the power
consumption of RSA algorithm while keeping the security of the algorithm intact. One popular technique
which can be used to enhance the performance of RSA is parallel programming. In this paper we are
presenting the survey of various parallel implementations of RSA algorithm involving variety of hardware
and software implementations.
Security Flows and Improvement of a Recent Ultra Light-Weight RFID Protocol ijujournal
In this paper, we analyze the security vulnerabilities of SSL-MAP, an ultra-lightweight RFID mutual
authentication protocol recently proposed by Rama N, Suganya R. We present two effective attacks, a desynchronization attack and a full-disclosure attack, against this protocol. The former permanently disables
the authentication capability of a RFID tag by destroying synchronization between the tag and the RFID
reader. The latter completely threats a tag by extracting all the secret information that are stored in the
tag. The de-synchronization attack can be carried out in three round of interaction in SSL-MAP while the
full-disclosure attack is accomplished across several runs of SSL-MAP. We also discuss ways to counter
the attacks.
Genetic Algorithm Based Cryptographic Approach using Karnatic MusicIRJET Journal
The document describes a genetic algorithm approach to musical cryptography. Musical notes and attributes from Karnatic music are used to encrypt plaintext messages. A transition probability matrix is generated from a raga (musical form) to determine the likelihood of transitions between notes. Candidate notes are selected from the matrix to encode each character. A genetic algorithm with selection, crossover and mutation operates on an initial population of encrypted musical sequences to determine the sequence with the highest fitness as the encrypted ciphertext. At the receiver, the musical notes are decrypted by searching the transition matrix to map each note back to the original character. The genetic algorithm helps select the optimal encrypted musical sequence to obscure the message content and reduce detection of being encrypted.
An Efficient Key Distribution Scheme for Wireless Sensor Networks using poly...Deepti Dohare
The document proposes a key distribution scheme for wireless sensor networks based on polynomials. It has the advantages of both probabilistic and deterministic schemes by providing full connectivity like deterministic schemes while also being resilient to node capture like probabilistic schemes. The scheme involves initially distributing symmetric polynomials to nodes. After establishing keys with neighbors, nodes erase their polynomials. To add new nodes, a set of polynomials is given and keys are established by exchanging encrypted values with neighbors. The scheme has low communication and space overhead compared to other approaches.
Data Security with Colors using RSA technique that integrates the RGB Color model with the well-known public key cryptographic algorithm RSA (Rivest, Shamir and Adleman). This model provides both confidentiality and authentication to the data sent across the network. RSA algorithm uses public key and private key to encrypt and decrypt the data and thus provides confidentiality. But the public key is known to everyone and so anyone can encrypt the data and send the message. Hence authentication of users is needed. In this technique we use RGB color model to provide authentication. Every user will have a unique color assigned to him. A sender must know the receiver’s color to send a message. The color value is encrypted using a key which is used as a password while decrypting the message. To decrypt the message, the receiver must provide his color values. If the decrypted color values and his color values are equal then the sender and receiver are send to be authentic. The data encryption and decryption follows RSA procedure. Thus both authentication and confidentiality are provided for the data.
Elgamal signature for content distribution with network codingijwmn
This document proposes a scheme that uses ElGamal signature in network coding to enhance security. Network coding allows nodes to generate output packets as linear combinations of input packets. However, this makes the network vulnerable to pollution attacks where malicious nodes can insert corrupted packets. The proposed scheme signs data packets with ElGamal signatures. When nodes receive packets, they can verify the signatures' validity to check for corrupted packets without decoding. The scheme exploits the linearity of network coding and allows nodes to easily check packet integrity. An example is provided to demonstrate how the ElGamal signature scheme would work in the context of network coding for content distribution.
This document discusses the RSA network security approach. It begins with an introduction to RSA, describing how it uses large prime numbers and exponentiation to encrypt and decrypt messages. It also discusses how RSA can be used for both encryption and digital signatures to provide authentication. The document then covers symmetric and public key cryptography concepts before focusing more on the specifics of the RSA algorithm and its use for secure network communications.
DATA SECURITY USING PRIVATE KEY ENCRYPTION SYSTEM BASED ON ARITHMETIC CODINGIJNSA Journal
Problem faced by today’s communicators is not only security but also the speed of communication and size of content.In the present paper, a scheme has been proposed which uses the concept of compression and data encryption. In first phase the focus has been made on data compression and cryptography. In the next phase we have emphasized on compression cryptosystem. Finally, proposed technique has been discussed which used the concept of data compression and encryption. In this first data is compressed to reduce the size of the data and increase the data transfer rate. Thereafter compress data is encrypted to provide security. Hence our proposed technique is effective that can reduce data size, increase data transfer rate and provide the security during communication.
This document summarizes and compares four routing algorithms for mobile ad hoc networks: Disjoint Multipath Routing, Trust based Multipath Routing, Message Trust based Multipath Routing, and a new proposed algorithm called Friend Based Ad-hoc Routing. It describes the key mechanisms of each algorithm, including how they establish routes, incorporate trust levels, and handle packet routing. The proposed FACES algorithm aims to improve security and efficiency by using friend, unauthenticated, and question mark lists to identify trusted routes and avoid malicious nodes.
The document proposes a novel secure scheme for computing the cosine similarity between two integer vectors with malicious adversaries. The scheme uses distributed ElGamal encryption and zero-knowledge proofs to privately compute the cosine coefficient between two parties' vector inputs while preserving privacy. Security analysis shows the scheme can resist attacks from malicious adversaries by simulating the ideal functionality using the encryption scheme and zero-knowledge proofs.
Quantum cryptography for secured communication networksIJECEIAES
Quantum cryptography is a method for accessing data with the cryptosystem more efficiently. The network security and the cryptography are the two major properties in securing the data in the communication network. The quantum cryptography uses the single photon passing through the polarization of a photon. In Quantum Cryptography, it's impossible for the eavesdropper to copy or modify the encrypted messages in the quantum states in which we are sending through the optical fiber channels. Cryptography performed by using the protocols BB84 and B92 protocols. The two basic algorithms of quantum cryptography are Shor’s algorithm and the Grover’s’s algorithm. For finding the number of integer factorization of each photon, Shor’s algorithm is used. Grover’s’s algorithm used for searching the unsorted data. Shor’s algorithm overcomes RSA algorithm by high security. By the implementation of quantum cryptography, we are securing the information from the eavesdropper and thereby preventing data in the communication channel.
Survey of Different DNA Cryptography based AlgorithmsIRJET Journal
This document summarizes and surveys different DNA cryptography algorithms. It begins by introducing DNA cryptography and its advantages over traditional cryptography, such as large data storage capacity and parallel computing power. It then describes two main DNA cryptography algorithms: 1) A bidirectional DNA encryption algorithm that encodes messages into DNA sequences using PCR primers as keys and 2) A quantum key exchange algorithm that generates and distributes encryption keys using quantum cryptography principles to prevent eavesdropping. The document concludes by outlining a complete secure messaging system combining quantum key exchange, authentication, key sharing, DNA-based encryption, and AES encryption.
TWO PHASE CLANDESTAIN IMAGE ENCRYPTION acijjournal
In today’s internet world is full of data steals and hackers. So, there is a essential to design a system that
assists the internet users to interchange their secret and private data safely across the web. Informationhiding
process in a Steganography system starts by identifying medium’s redundant bits. The encryption
process creates a stego medium by replacing these redundant bits with data from the hidden message.
So, we propose a method for encrypting the image, which has two phases. In the first phase, Perform
Circular Shift Operations on the image pixels and the number of rotations have been calculated based on
the length of the password. In the second phase, the first phase has undergone some bitwise operations
with a carriage image, by doing this; breaking of the cipher text is difficult.
Routing Protocols of Distributed Hash Table Based Peer to Peer NetworksIOSR Journals
Distributed hash tables (DHTs) is an extremely attractive study theme during the part of P2P
networks; such networks be fetching especially admired in functions similar to file sharing. The idea of the
Distributed Hash Table is given that the technique to explore the resources (especially files) within a P2P
network. A DHT protocol usually affords a solitary task to the P2P function: afford a key and find out the
node (or may be nodes) which is responsible for such key [1][3]. Each and every one function (such as
really recover the resource or storing the resource on the node afford for it) is offered by superior levels of the
P2P function. In such article our objective is to discover the security measures and determine them on
accessible routing procedures of such networks. The Chord [4] (a DHT protocol) is selected as the objective
approach for a variety of reasons it resolve be enclosed in this paper
This document discusses using threshold cryptography and maximum distance separable (MDS) codes for key management in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and the need for distributed key management approaches. It then provides background on threshold cryptography and MDS codes. The document proposes using threshold cryptography combined with MDS codes to create a distributed cooperative key management system for MANETs that generates and distributes encryption keys among network nodes in a secure and fault-tolerant manner.
Selective jamming attack prevention based on packet hiding methods and wormholesIJNSA Journal
Because of the widespread use of wireless sensor ne
tworks in many applications, and due to the nature
of
the specifications of these networks (WSN) in terms
of wireless communication, the network contract
specifications, and published it in difficult envir
onments. All this leads to the network exposure to
many
types of external attacks. Therefore, the protectio
n of these networks from external attacks is consid
ered the
one of the most important researches at this time.
In this paper we investigated the security in wirel
ess
sensor networks, Limitations of WSN, Characteristic
Values for some types of attacks, and have been
providing protection mechanism capable of detecting
and protecting wireless sensor networks from a wid
e
range of attacks
Naman Kumar presented on the topic of quantum cryptography. The presentation covered basic cryptography terms and techniques like encryption, decryption, and public key cryptography. It then discussed quantum key distribution and how it uses principles of quantum mechanics like photon polarization and Heisenberg's uncertainty principle to securely distribute encryption keys. The popular BB84 protocol was explained, which uses photon polarization to randomly generate and securely transmit encryption keys. Quantum cryptography provides unhackable secure communication up to 50km but has high setup costs. It could allow for perfectly secure transactions and communications in the future.
A SECURE DIGITAL SIGNATURE SCHEME WITH FAULT TOLERANCE BASED ON THE IMPROVED ...csandit
Fault tolerance and data security are two important issues in modern communication systems.
In this paper, we propose a secure and efficient digital signature scheme with fault tolerance
based on the improved RSA system. The proposed scheme for the RSA cryptosystem contains
three prime numbers and overcome several attacks possible on RSA. By using the Chinese
Reminder Theorem (CRT) the proposed scheme has a speed improvement on the RSA decryption
side and it provides high security also.
Key Management Scheme for Secure Group Communication in WSN with Multiple Gr...csandit
Security is one of the inherent challenges in the area of Wireless Sensor Network (WSN). At
present, majority of the security protocols involve massive iterations and complex steps of
encryptions thereby giving rise to degradation of quality of service. Many WSN applications are
based on secure group communication. In this paper, we have proposed a scheme for secure
group key management with simultaneous multiple groups. The scheme uses a key-based
approach for managing the groups and we show that membership change events can be
handled with less storage, communication and computation cost. The scheme also offers
authentication to the messages communicated within and among the groups.
This document presents a proposed algorithm for public key cryptography using matrices. The algorithm has three stages: 1) shuffling the original data using a linear congruential method and arranging it in a matrix, 2) traversing the data matrix in different patterns, and 3) generating a system of non-homogeneous linear equations from the matrix to derive private keys. The algorithm aims to provide data confidentiality, integrity and authentication for cloud computing applications using public key cryptography with matrices in a way that has constant complexity regardless of key size.
Why Should You Pay Attention To Quantum Computing?Milos Dunjic
Quantum computing, is an exciting and rather unusual field of informatics. Recently I had privilege to participate on The Quantum Panel, as part of the Payments Canada conference, where I shared some of my view with wider audience.
Cryptosystem An Implementation of RSA Using Verilogijcncs
This document describes an implementation of the RSA cryptosystem using Verilog for an FPGA. It presents the design of modules for key generation, encryption, and decryption. For key generation, it generates random prime numbers using an LFSR and primality tester, then calculates the public and private keys. Encryption and decryption are performed through modular exponentiation implemented with a right-to-left binary method. The modules are coded in Verilog and synthesized for an FPGA to provide a secure cryptosystem.
Genetic Algorithm Based Cryptographic Approach using Karnatic MusicIRJET Journal
The document describes a genetic algorithm approach to musical cryptography. Musical notes and attributes from Karnatic music are used to encrypt plaintext messages. A transition probability matrix is generated from a raga (musical form) to determine the likelihood of transitions between notes. Candidate notes are selected from the matrix to encode each character. A genetic algorithm with selection, crossover and mutation operates on an initial population of encrypted musical sequences to determine the sequence with the highest fitness as the encrypted ciphertext. At the receiver, the musical notes are decrypted by searching the transition matrix to map each note back to the original character. The genetic algorithm helps select the optimal encrypted musical sequence to obscure the message content and reduce detection of being encrypted.
An Efficient Key Distribution Scheme for Wireless Sensor Networks using poly...Deepti Dohare
The document proposes a key distribution scheme for wireless sensor networks based on polynomials. It has the advantages of both probabilistic and deterministic schemes by providing full connectivity like deterministic schemes while also being resilient to node capture like probabilistic schemes. The scheme involves initially distributing symmetric polynomials to nodes. After establishing keys with neighbors, nodes erase their polynomials. To add new nodes, a set of polynomials is given and keys are established by exchanging encrypted values with neighbors. The scheme has low communication and space overhead compared to other approaches.
Data Security with Colors using RSA technique that integrates the RGB Color model with the well-known public key cryptographic algorithm RSA (Rivest, Shamir and Adleman). This model provides both confidentiality and authentication to the data sent across the network. RSA algorithm uses public key and private key to encrypt and decrypt the data and thus provides confidentiality. But the public key is known to everyone and so anyone can encrypt the data and send the message. Hence authentication of users is needed. In this technique we use RGB color model to provide authentication. Every user will have a unique color assigned to him. A sender must know the receiver’s color to send a message. The color value is encrypted using a key which is used as a password while decrypting the message. To decrypt the message, the receiver must provide his color values. If the decrypted color values and his color values are equal then the sender and receiver are send to be authentic. The data encryption and decryption follows RSA procedure. Thus both authentication and confidentiality are provided for the data.
Elgamal signature for content distribution with network codingijwmn
This document proposes a scheme that uses ElGamal signature in network coding to enhance security. Network coding allows nodes to generate output packets as linear combinations of input packets. However, this makes the network vulnerable to pollution attacks where malicious nodes can insert corrupted packets. The proposed scheme signs data packets with ElGamal signatures. When nodes receive packets, they can verify the signatures' validity to check for corrupted packets without decoding. The scheme exploits the linearity of network coding and allows nodes to easily check packet integrity. An example is provided to demonstrate how the ElGamal signature scheme would work in the context of network coding for content distribution.
This document discusses the RSA network security approach. It begins with an introduction to RSA, describing how it uses large prime numbers and exponentiation to encrypt and decrypt messages. It also discusses how RSA can be used for both encryption and digital signatures to provide authentication. The document then covers symmetric and public key cryptography concepts before focusing more on the specifics of the RSA algorithm and its use for secure network communications.
DATA SECURITY USING PRIVATE KEY ENCRYPTION SYSTEM BASED ON ARITHMETIC CODINGIJNSA Journal
Problem faced by today’s communicators is not only security but also the speed of communication and size of content.In the present paper, a scheme has been proposed which uses the concept of compression and data encryption. In first phase the focus has been made on data compression and cryptography. In the next phase we have emphasized on compression cryptosystem. Finally, proposed technique has been discussed which used the concept of data compression and encryption. In this first data is compressed to reduce the size of the data and increase the data transfer rate. Thereafter compress data is encrypted to provide security. Hence our proposed technique is effective that can reduce data size, increase data transfer rate and provide the security during communication.
This document summarizes and compares four routing algorithms for mobile ad hoc networks: Disjoint Multipath Routing, Trust based Multipath Routing, Message Trust based Multipath Routing, and a new proposed algorithm called Friend Based Ad-hoc Routing. It describes the key mechanisms of each algorithm, including how they establish routes, incorporate trust levels, and handle packet routing. The proposed FACES algorithm aims to improve security and efficiency by using friend, unauthenticated, and question mark lists to identify trusted routes and avoid malicious nodes.
The document proposes a novel secure scheme for computing the cosine similarity between two integer vectors with malicious adversaries. The scheme uses distributed ElGamal encryption and zero-knowledge proofs to privately compute the cosine coefficient between two parties' vector inputs while preserving privacy. Security analysis shows the scheme can resist attacks from malicious adversaries by simulating the ideal functionality using the encryption scheme and zero-knowledge proofs.
Quantum cryptography for secured communication networksIJECEIAES
Quantum cryptography is a method for accessing data with the cryptosystem more efficiently. The network security and the cryptography are the two major properties in securing the data in the communication network. The quantum cryptography uses the single photon passing through the polarization of a photon. In Quantum Cryptography, it's impossible for the eavesdropper to copy or modify the encrypted messages in the quantum states in which we are sending through the optical fiber channels. Cryptography performed by using the protocols BB84 and B92 protocols. The two basic algorithms of quantum cryptography are Shor’s algorithm and the Grover’s’s algorithm. For finding the number of integer factorization of each photon, Shor’s algorithm is used. Grover’s’s algorithm used for searching the unsorted data. Shor’s algorithm overcomes RSA algorithm by high security. By the implementation of quantum cryptography, we are securing the information from the eavesdropper and thereby preventing data in the communication channel.
Survey of Different DNA Cryptography based AlgorithmsIRJET Journal
This document summarizes and surveys different DNA cryptography algorithms. It begins by introducing DNA cryptography and its advantages over traditional cryptography, such as large data storage capacity and parallel computing power. It then describes two main DNA cryptography algorithms: 1) A bidirectional DNA encryption algorithm that encodes messages into DNA sequences using PCR primers as keys and 2) A quantum key exchange algorithm that generates and distributes encryption keys using quantum cryptography principles to prevent eavesdropping. The document concludes by outlining a complete secure messaging system combining quantum key exchange, authentication, key sharing, DNA-based encryption, and AES encryption.
TWO PHASE CLANDESTAIN IMAGE ENCRYPTION acijjournal
In today’s internet world is full of data steals and hackers. So, there is a essential to design a system that
assists the internet users to interchange their secret and private data safely across the web. Informationhiding
process in a Steganography system starts by identifying medium’s redundant bits. The encryption
process creates a stego medium by replacing these redundant bits with data from the hidden message.
So, we propose a method for encrypting the image, which has two phases. In the first phase, Perform
Circular Shift Operations on the image pixels and the number of rotations have been calculated based on
the length of the password. In the second phase, the first phase has undergone some bitwise operations
with a carriage image, by doing this; breaking of the cipher text is difficult.
Routing Protocols of Distributed Hash Table Based Peer to Peer NetworksIOSR Journals
Distributed hash tables (DHTs) is an extremely attractive study theme during the part of P2P
networks; such networks be fetching especially admired in functions similar to file sharing. The idea of the
Distributed Hash Table is given that the technique to explore the resources (especially files) within a P2P
network. A DHT protocol usually affords a solitary task to the P2P function: afford a key and find out the
node (or may be nodes) which is responsible for such key [1][3]. Each and every one function (such as
really recover the resource or storing the resource on the node afford for it) is offered by superior levels of the
P2P function. In such article our objective is to discover the security measures and determine them on
accessible routing procedures of such networks. The Chord [4] (a DHT protocol) is selected as the objective
approach for a variety of reasons it resolve be enclosed in this paper
This document discusses using threshold cryptography and maximum distance separable (MDS) codes for key management in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and the need for distributed key management approaches. It then provides background on threshold cryptography and MDS codes. The document proposes using threshold cryptography combined with MDS codes to create a distributed cooperative key management system for MANETs that generates and distributes encryption keys among network nodes in a secure and fault-tolerant manner.
Selective jamming attack prevention based on packet hiding methods and wormholesIJNSA Journal
Because of the widespread use of wireless sensor ne
tworks in many applications, and due to the nature
of
the specifications of these networks (WSN) in terms
of wireless communication, the network contract
specifications, and published it in difficult envir
onments. All this leads to the network exposure to
many
types of external attacks. Therefore, the protectio
n of these networks from external attacks is consid
ered the
one of the most important researches at this time.
In this paper we investigated the security in wirel
ess
sensor networks, Limitations of WSN, Characteristic
Values for some types of attacks, and have been
providing protection mechanism capable of detecting
and protecting wireless sensor networks from a wid
e
range of attacks
Naman Kumar presented on the topic of quantum cryptography. The presentation covered basic cryptography terms and techniques like encryption, decryption, and public key cryptography. It then discussed quantum key distribution and how it uses principles of quantum mechanics like photon polarization and Heisenberg's uncertainty principle to securely distribute encryption keys. The popular BB84 protocol was explained, which uses photon polarization to randomly generate and securely transmit encryption keys. Quantum cryptography provides unhackable secure communication up to 50km but has high setup costs. It could allow for perfectly secure transactions and communications in the future.
A SECURE DIGITAL SIGNATURE SCHEME WITH FAULT TOLERANCE BASED ON THE IMPROVED ...csandit
Fault tolerance and data security are two important issues in modern communication systems.
In this paper, we propose a secure and efficient digital signature scheme with fault tolerance
based on the improved RSA system. The proposed scheme for the RSA cryptosystem contains
three prime numbers and overcome several attacks possible on RSA. By using the Chinese
Reminder Theorem (CRT) the proposed scheme has a speed improvement on the RSA decryption
side and it provides high security also.
Key Management Scheme for Secure Group Communication in WSN with Multiple Gr...csandit
Security is one of the inherent challenges in the area of Wireless Sensor Network (WSN). At
present, majority of the security protocols involve massive iterations and complex steps of
encryptions thereby giving rise to degradation of quality of service. Many WSN applications are
based on secure group communication. In this paper, we have proposed a scheme for secure
group key management with simultaneous multiple groups. The scheme uses a key-based
approach for managing the groups and we show that membership change events can be
handled with less storage, communication and computation cost. The scheme also offers
authentication to the messages communicated within and among the groups.
This document presents a proposed algorithm for public key cryptography using matrices. The algorithm has three stages: 1) shuffling the original data using a linear congruential method and arranging it in a matrix, 2) traversing the data matrix in different patterns, and 3) generating a system of non-homogeneous linear equations from the matrix to derive private keys. The algorithm aims to provide data confidentiality, integrity and authentication for cloud computing applications using public key cryptography with matrices in a way that has constant complexity regardless of key size.
Why Should You Pay Attention To Quantum Computing?Milos Dunjic
Quantum computing, is an exciting and rather unusual field of informatics. Recently I had privilege to participate on The Quantum Panel, as part of the Payments Canada conference, where I shared some of my view with wider audience.
Cryptosystem An Implementation of RSA Using Verilogijcncs
This document describes an implementation of the RSA cryptosystem using Verilog for an FPGA. It presents the design of modules for key generation, encryption, and decryption. For key generation, it generates random prime numbers using an LFSR and primality tester, then calculates the public and private keys. Encryption and decryption are performed through modular exponentiation implemented with a right-to-left binary method. The modules are coded in Verilog and synthesized for an FPGA to provide a secure cryptosystem.
BIDANI is a community-based program established in 1978 that aims to improve governance, food security, and nutrition in rural Philippine villages. It consists of three components: the Barangay Integrated Development Approach, Barangay Management Information System, and Participative Nutrition Enhancement Project. The program is implemented by State Universities and Colleges in partnership with local governments and other organizations. Its goal is to empower communities to participate in development efforts and improve nutrition, especially for young children.
A Test Analysis Method for Black Box Testing Using AUT and Fault Knowledge.Tsuyoshi Yumoto
With a rapid increase in size and complexity of software today, the scope of software testing is also expanding. The efficiency of software testing needs to be improved in order to ensure the appropriate delivery deadline and cost of software development. For improving efficiency of software testing, the test needs to be designed in a way that the number of test cases is sufficient and appropriate in quantity. Test analysis is the activity to refine Application Under Test (AUT) into proper size that test design techniques can be applied to. It is for designing the test properly. However, the classification for proper size depends on individual’s own judgments. This paper proposes a test analysis method for the black box testing using a test category that is the classification based on fault and AUT knowledge.
Iaetsd a survey on enroute filtering scheme inIaetsd Iaetsd
This document discusses enroute filtering schemes in wireless sensor networks to prevent false data injection attacks. It provides an overview of existing statistical enroute filtering and location-based resilient security schemes that have limitations such as threshold restrictions. The document then proposes using a cluster-based compromise resilient enroute filtering scheme where sensor nodes are organized into clusters. In this scheme, cluster heads aggregate and transmit data to base stations through forwarding nodes. This is said to provide higher security than other filtering schemes by overcoming prior limitations and disadvantages related to compromised node thresholds, non-resilience to attacks, and dependency on node localization.
Este documento analisa as praças públicas de cidades da região sul do Rio Grande do Sul, examinando seus limites, caminhos e centralidade. Apresenta o surgimento histórico da praça pública e sua evolução. Descreve as primeiras praças gaúchas e sua influência jesuítica. Explora três elementos essenciais das praças estudadas através de uma leitura fenomenológica.
Este documento fornece informações sobre a instalação e manutenção de centrais de gás, incluindo sobre válvulas reguladoras, pressão correta, defeitos comuns, manutenção preventiva, tubulações adequadas e cuidados com a instalação.
BIDANI is a community-based program established in 1978 that aims to improve governance, food security, and nutrition in rural Philippine villages. It consists of three components: the Barangay Integrated Development Approach, Barangay Management Information System, and Participative Nutrition Enhancement Project. The program is implemented by State Universities and Colleges in partnership with local governments and other organizations. Its goal is to empower communities to participate in development efforts and improve nutrition through activities like data collection, development planning, and addressing malnutrition.
Verbal and non verbal strokes - Transactional AnalysisManu Melwin Joy
You are walking along the street. You catch sight of a neighbor of yours coming in the other direction.
As you and the neighbor pass, you smile and say: “Nice day!”.
Your neighbor smiles back and replies: “ Yes, it is”.
You and your neighbor exchanged both verbal and non verbal strokes.
You spoke to each other and you smiled.
BIDANI is a community-based program established in 1978 that aims to improve governance, food security, and nutrition in rural Philippine villages. It utilizes participatory development approaches and partnerships between community members, local governments, and state universities. The program's vision is to develop healthy, well-nourished children and adults. Key components include the Barangay Integrated Development Approach, Barangay Management Information System, and Participative Nutrition Enhancement Project, which work together to strengthen programs, build local capacity, and enhance nutrition. BIDANI currently operates in 781 villages across the Philippines.
Iaetsd a review on ecg arrhythmia detectionIaetsd Iaetsd
This document proposes a method to detect cardiac arrhythmias from electrocardiogram (ECG) signals using double density discrete wavelet transformation (DD-DWT). The method involves preprocessing the ECG signal, extracting features using DD-DWT, and classifying rhythms using support vector machines (SVM). Features extracted include temporal intervals between peaks and morphological characteristics. DD-DWT decomposes the ECG into sub-bands, allowing subtle changes to be detected. SVM is used for classification. The method is tested on the MIT-BIH Arrhythmia database and is found to provide better arrhythmia detection compared to existing methods.
The document summarizes the Nordeast Nest, a custom eco home built in Minneapolis, MN from 2012-2014 that incorporates passive house principles and components. It achieved a very low annual heating demand of 32 kWh/m2 through an extremely well insulated and airtight building envelope. Key elements included walls with R-values of R-51 and R-39, a cold roof with R-70 insulation, high performance windows and doors, and an extremely tight air barrier that achieved an airtightness of 0.36 ACH50. HVAC systems included an energy recovery ventilator, air source heat pumps for heating and cooling, and a tankless water heater to provide heating, cooling, ventilation
Engaging Students: Modes of Communication: Text, Type or SkypeGuidedPath
This document provides an agenda for an online webinar about engaging students in the college planning process. The webinar host, Cyndy McDonald, is a middle school and high school counselor who founded several college access programs. The webinar will discuss how to connect with today's "connected generation" of students using technology and online tools. It will cover topics like understanding students' motivations, how they view technology, generating a college search and list, and tips for staying organized while counseling many students virtually.
LIBRO SOBRE LA PLANTA DE LA AMAPOLA. DESCRIPCIÓN MEDIANTE FOTOS, PALABRAS Y FRASES CORTAS DE LAS PARTES DE LA PLANTA DE LA AMAPOLA, PARA EJERCITAR LA LECTURA,CON DIFERENTES NIVELES DE DIFICULTAD, Y CONOCER EL MEDIO NATURAL DEL NIÑO.
The document expresses gratitude to Allah for allowing the completion of new facilities at PusPeTa that are already being used. It thanks the school's leaders, Atok and Ummi, for devoting their lives to student enlightenment, and teachers Ustaz Sanusi and Ustazah Nasirah for being educators, mentors, and encouragers. The summary also expresses appreciation to PusPeTa's teachers for their hard work, to the parents for trusting the school with their children, and to the students for allowing the teachers to instruct and grow with them.
The Maddox Rod is used to detect heterophoria and heterotropia. It consists of a series of cylindrical lenses mounted in a trial frame that produces an elongated streak of light. When viewed through the Maddox Rod, a spot of light will appear as a streak. This allows detection of deviations by assessing whether the streak is to the left or right of the spot for horizontal deviations, or above or below for vertical deviations. Prisms of increasing strength are used to measure the degree of deviation.
This document summarizes a research paper that proposes a hybrid routing protocol for mobile ad hoc networks (MANETs) that combines proactive and reactive routing approaches. The goal is to provide fast and secure routing in MANETs. The key aspects are:
1) A traffic monitor node manages network traffic and checks if new nodes are malicious. Reactive routing finds paths through new nodes, while proactive routing is used otherwise.
2) The traffic monitor periodically checks node responses to identify malicious nodes and informs the network.
3) Nodes maintain a trust list from the traffic monitor to identify paths that avoid malicious nodes during route discovery.
This document discusses the detection of black hole attacks in mobile ad hoc networks (MANETs) that use the Ad Hoc On-Demand Distance Vector (AODV) routing protocol. It proposes using authentication techniques including authenticated nodes, authentication on paths, authentication key packets, and a data routing information table on each node to detect black hole nodes. An example network is presented to demonstrate how the proposed techniques would detect a black hole node by analyzing authentication packet responses. The goal is to securely route data packets by detecting malicious nodes using these authentication methods.
TRIDNT: THE TRUST-BASED ROUTING PROTOCOL WITH CONTROLLED DEGREE OF NODE SELFI...IJNSA Journal
In Mobile ad-hoc network, nodes must cooperate to achieve the routing purposes. Node misbehaviour due to selfish or malicious intention could significantly degrade the performance of MANET because most existing routing protocols in MANET are aiming at finding most efficiency path. In this paper, we propose a Two node-disjoint Routes protocol for Isolating Dropper Node in MANET (TRIDNT) to deal with misbehaviour in MANET. TRIDNT allows some degree of selfishness to give an incentive to the selfish nodes to declare itself to its neighbours, which reduce the misbehaving nodes searching time. In TRIDNT two node-disjoint routes between the source and destination are selected based on their trust values. We use both DLL-ACK and end-to-end TCP-ACK to monitor the behaviour of routing path nodes: if a malicious behaviour is detected then the path searching tool starts to identify the malicious nodes and isolate them. Finally by using a mathematical analysis we find that our proposed protocol reduces the searching time of malicious nodes comparing to the route expected life time, and avoids the isolated misbehaving node from sharing in all future routes, which improve the overall network throughput.
SECURE LOCATION BASED ROUTING FOR MANETSAnkur Singhal
The video demonstrates sending the file from source to the destination by initially encrypting it using multihops and then decrypting it at the receiver's end
An Ad hoc network in a wireless system consist of an autonomous system, without centralization which results forming of mobile nodes. In MANET, each node works in a dual form that consists of a router as well as hosts. These nodes configure dynamically and communicate using hop to hop. Due to its simplicity it is used in mobile conferencing, military communication. In MANET nodes can join and leave the network so MANET becomes vulnerable. Certain factors like dynamic network configures, distribution cooperation, open medium terrorized in routing which give rise to security issues. Once such protocol AODV has been a victim of security. In existing, MANET faces a severe problem known as the Black Hole problem. This Black hole problem is mostly found in reactive routing protocol called AODV.The black hole conducts its malicious node during route discovery process. Black hole node is a severe threat in AODV protocol that easily employed and becomes vulnerable in MANET. In this paper various techniques are discussed to overcome the Black hole attack.
This document is an assignment report for a course on data communication and networks. It contains an acknowledgement section thanking the course teacher and others for their support. The content section lists 12 topics that will be covered in the report, including introductions to packet switching, datagram and virtual circuit networks, encryption, and approaches to encryption across packet switching networks like link encryption and end-to-end encryption. Figures and tables are included to illustrate key concepts.
An Efficient Secured And Inspection of Malicious Node Using Double Encryption...IRJET Journal
This document proposes a method called Statistical-based Detection of Black hole and Grey hole attackers (SDBG) to detect both individual and colluding attacks in delay tolerant networks (DTNs). SDBG works by having a trusted authority monitor nodes' behavior based on their encounter records, message records, and forwarding histories. It aims to improve detection accuracy and reduce the impact of false positives compared to existing detection methods. The methodology involves network and authority creation, route finding and data forwarding, and detecting colluding attacks based on monitoring nodes' interactions and messages. Simulation results show SDBG can effectively detect attacks with varying drop rates even under collusion with high accuracy and low false positives.
Behavioral Model to Detect Anomalous Attacks in Packet TransmissionIOSR Journals
This document summarizes a proposed behavioral model to detect anomalous attacks in packet transmission in wireless networks. The model aims to identify packet droppers and modifiers by having nodes monitor their neighbors' forwarding behaviors over time. A tree-based routing structure is used, where each packet is marked as it travels toward the sink node. The marks provide information to help the sink node determine which nodes are misbehaving. The proposed scheme aims to gradually identify bad nodes through statistical analysis of their behaviors across different network topologies over time, with low false positives. It aims to catch both packet droppers and modifiers within a single detection module.
The document proposes a behavioral model called PFMDA to detect anomalous packet dropping and modification attacks in wireless ad hoc networks. The PFMDA scheme establishes a routing tree with the sink node at the root. As data packets are transmitted along the tree, each sender or forwarder adds a small number of "packet marks" to the packet. This allows the sink to determine the dropping ratio for each node and identify nodes that are definitely dropping/modifying packets or are suspicious of such behavior. The scheme uses node categorization and heuristic ranking algorithms to gradually identify misbehaving nodes with few false positives. The goal is to detect packet droppers and modifiers within the network.
An Approach to Detect Packets Using Packet Sniffingijcses
This document summarizes a research paper that examines packet sniffing. It discusses how packet sniffers work in both switched and non-switched networks. In non-switched networks, all nodes are connected to a hub, allowing packet sniffers to capture all traffic by putting the network card in promiscuous mode. In switched networks, packet sniffers can operate through techniques like ARP cache poisoning, CAM table flooding, and switch port stealing. The document also outlines positive applications of packet sniffing like network traffic analysis and intrusion detection.
This document summarizes a research paper on finding alternate paths in wireless networks using fast rerouting. It discusses how wireless ad hoc networks are self-configuring and nodes can join networks anywhere. Existing routing techniques have delays when links fail. The paper proposes calculating alternate paths instantly when a node fails to reduce packet loss. It would find a new path from the source to destination much faster than existing systems. When a node fails or does not respond, it would choose the next closest responding node and reroute packets along the new path immediately, without waiting for routing tables to update. This provides faster rerouting and recovery from link failures in wireless networks.
The document summarizes research on preserving source location privacy in wireless sensor networks. It proposes using computer-based image recognition to analyze traffic patterns and detect modified data packets. The key points are:
1) Wireless sensor networks are vulnerable to traffic analysis attacks that can reveal the location of data sources. Existing solutions have limitations like increased energy use.
2) The paper proposes using computer-based image recognition to analyze traffic and identify packets whose delivery was delayed, indicating modification by an attacker.
3) If the attacking node is identified, it would be removed from the network. This approach aims to effectively preserve source location privacy against traffic analysis attacks.
Survey of Security Threats and Protection Techniques in Mobile Ad Hoc Networksdrsrinivasanvenkataramani
This document summarizes various security threats and protection techniques in mobile ad hoc networks (MANETs). It discusses several proposed solutions, including those based on cryptography using public/private keys, trusted certificate servers, detecting node capture and forged routing messages, watchdog mechanisms to detect misbehaving nodes, using route request packets to establish secure routes, redundant routing messages to detect attacks, reputation-based approaches, and using firewalls. The document provides an overview of the key challenges in securing MANETs and surveys different existing approaches, their advantages and limitations.
IEEE 2014 DOTNET PARALLEL DISTRIBUTED PROJECTS A probabilistic-misbehavior-de...IEEEMEMTECHSTUDENTPROJECTS
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
One of the most popular areas of research is wireless communication. Mobile Ad Hoc network (MANET) is a network with wireless mobile nodes, infrastructure less and self organizing. With its wireless and distributed nature it is exposed to several security threats. One of the threats in MANET is the wormhole attack. In this attack a pair of attacker forms a virtual link thereby recording and replaying the wireless transmission. This paper presents types of wormhole attack and also includes different technique for detecting wormhole attack in MANET..
This document summarizes several proposed solutions for improving security in mobile ad hoc networks (MANETs). It discusses approaches that use cryptography, trust models, observation-based detection of misbehaving nodes, analyzing routing message semantics, watchdog mechanisms, controlling routing message trust levels, using redundant routing messages, reputation-based models, and firewalls. The document surveys the key techniques proposed in recent literature and discusses their advantages and limitations to provide researchers an overview of the security challenges and approaches in MANETs.
This document discusses preventing and isolating black hole attacks in mobile ad hoc networks (MANETs) using alarm packets. It begins with background on MANETs and security attacks they face such as black hole attacks. Then, it reviews existing literature on detecting and preventing black hole attacks. Next, it describes how black hole attacks work in MANETs by having malicious nodes advertise short paths to destinations and drop packets. The proposed solution will use alarm packets to isolate and prevent black hole attacks in MANETs.
DESIGN OF A SCHEME FOR SECURE ROUTING IN MOBILE AD HOC NETWORKScscpconf
Security has become a primary concern in order to provide protected communication between
mobile nodes in a hostile environment. Unlike the wireline networks, the unique characteristics
of mobile ad hoc networks pose a number of nontrivial challenges to security design, such as
open peer-to-peer network architecture, shared wireless medium, stringent resource constraints,
and highly dynamic network topology. These challenges clearly make a case for building
multifence security solutions that achieve both broad protection and desirable network
performance. So,we focus on the fundamental security problem of protecting the multihop
network connectivity between mobile nodes in a MANET. We identify the security issues related
to this problem, discuss the challenges to security design, and review the state of-the-art security
proposals that protect the MANET link- and network-layer operations of delivering packets over the multihop wireless channel.
S IMULATION B ASED S TUDY OF C OOPERATIVE B LACK H OLE A TTACK R ESOLU...pijans
An Ad hoc Network is a pool of wireless mobile node
s energetically forming a network without the use o
f
any pre-accessible network infrastructure or centra
lized administrator. These nodes communicate with
each other by hop-to-hop communication. This dynami
c topology of mobile ad-hoc networks (MANETs)
allows nodes to get attached and leave the network
at any second of time. Thus MANET can be used in a
variety of fields. Current MANETs are designed prim
ary for military utility. This generic characterist
ic of
MANET has rendered its vulnerability to security at
tacks. Due to which unprotected attacks of the
malicious nodes can occur at any time. This paper f
ocuses on one such attack known as “Black hole
attack” and the routing protocol being used here is
AODV
RTOS BASED SECURE SHORTEST PATH ROUTING ALGORITHM IN MOBILE AD- HOC NETWORKSIJNSA Journal
Increase of number of the nodes in the wireless computing environment leads to different issues like power, data rate, QoS, simulators and security. Among these the security is the peak issue faced by most of the wireless networks. Especially networks without having a centralized system (MANETS) is facing severe security issues. One of the major security issues is the wormhole attack while finding the shortest path. The aim of this paper is to propose an algorithm to find a secure shortest path against wormhole attack. Existing algorithms are mainly concentrated on detecting the malicious node but they are hardware specific like directional antennas and synchronized clocks. But the proposed algorithm is both software and hardware specific. RTOS is included to make the ad hoc network a real time application.
Similar to Iaetsd a layered security approach through femto cell using (20)
iaetsd Survey on cooperative relay based data transmissionIaetsd Iaetsd
The document discusses cooperative relay based data transmission and proposes a system to select the most energy efficient relay node for a source node to transmit data through. It analyzes different cooperative relaying techniques like amplify-and-forward, decode-and-forward, and compress-and-forward. The proposed system aims to minimize the source node's cost for cooperation by selecting the relay node that provides the highest energy efficiency. This allows high data transmission over long distances with improved energy efficiency compared to direct transmission without a relay.
iaetsd Software defined am transmitter using vhdlIaetsd Iaetsd
This document discusses the design and implementation of an amplitude modulation (AM) software defined radio transmitter using an FPGA. It begins with an abstract describing the goals of the project. It then provides an overview of the system design, including discussion of the individual components like the microphone, analog to digital converter, digital to analog converter, carrier frequency generator, and antenna. It describes how these components will be implemented on the FPGA, including using behavioral modeling with VHDL. It also discusses designing filters and modulation/demodulation circuits. The overall summary is that this document outlines the goals and high-level system design for creating an AM transmitter using an FPGA that can transmit an audio signal by digitally modulating a carrier frequency.
iaetsd Health monitoring system with wireless alarmIaetsd Iaetsd
The document describes a health monitoring system with wireless alarm that detects a patient's heart rate and temperature. It consists of a sensor unit worn on the wrist that monitors vital signs and transmits data wirelessly to an alarm and display unit. This allows caregivers to be alerted quickly if a patient's condition changes, such as if their heart rate is too high or low. The system uses a microcontroller to process sensor readings from a pulse oximetry sensor and transmit data via RF to the receiving unit, which contains another microcontroller connected to an RF receiver and buzzer alarm. If an abnormal heart rate is detected, the system triggers an alarm to notify caregivers.
iaetsd Equalizing channel and power based on cognitive radio system over mult...Iaetsd Iaetsd
This document summarizes a research paper about equalizing power and channel allocation in a cognitive radio system using multiuser OFDM. It discusses how frequency spectrum is becoming scarce due to increased wireless usage, and how cognitive radio can help improve spectrum utilization by allowing unlicensed secondary users to access licensed bands opportunistically when primary users are not using them. The paper presents a system model for a cognitive radio network with one primary user and multiple secondary user pairs. It formulates the problem of allocating subcarriers and power to the secondary users while avoiding interference to the primary user.
iaetsd Economic analysis and re design of driver’s car seatIaetsd Iaetsd
The document discusses redesigning car seats to improve comfort. It notes that car seat design must balance comfort, safety, and health. Static comfort relates to the seat's form and support, while dynamic comfort considers vibration levels. The study reexamines existing car seat designs and proposes a novel design with improvements in form, features, usability, and comfort. A survey was also conducted to define important comfort factors like pain prevention to help guide future seat designs.
iaetsd Design of slotted microstrip patch antenna for wlan applicationIaetsd Iaetsd
This document describes the design and simulation of a slotted microstrip patch antenna for wireless local area network (WLAN) applications operating at 2.4 GHz. The antenna was designed on an FR-4 substrate with a dielectric constant of 4.2 and thickness of 1.6 mm. Simulation in HFSS showed the antenna has a voltage standing wave ratio of 1.88 at the resonant frequency, with omnidirectional radiation patterns. The compact size and simple design make this slotted patch antenna suitable for use in embedded wireless systems.
REVIEW PAPER- ON ENHANCEMENT OF HEAT TRANSFER USING RIBSIaetsd Iaetsd
This document reviews research on enhancing heat transfer using ribs mounted inside ducts. Various studies investigated ribs of different shapes, pitches, heights and angles. Continuous ribs, transverse ribs, angled ribs, and other rib configurations were examined. Most studies found that ribs increased turbulence and heat transfer compared to smooth ducts. Some key findings included V-shaped ribs providing better performance than other shapes, and certain rib pitches and angles performing better depending on parameters like Reynolds number. In general, ribs were found to effectively enhance heat transfer through boundary layer disruption and increased turbulence compared to smooth ducts.
A HYBRID AC/DC SOLAR POWERED STANDALONE SYSTEM WITHOUT INVERTER BASED ON LOAD...Iaetsd Iaetsd
This document discusses two methods for generating power from solar panels for a home without using inverters or batteries.
Method 1 proposes a hybrid AC/DC home grid system that shifts harmonic intensive loads to the DC side to reduce power conversion losses and isolates harmonic content. Solar power is fed to the home through a DC-DC converter, MPPT, and inverter to power AC loads, with a separate DC connection for DC loads.
Method 2 generates AC power directly from an array of solar cells connected in an alternating anti-parallel configuration, eliminating power losses from an inverter. Compatibility with residential loads is analyzed. This novel technique could remove the need for batteries and reduce overall cost.
The performance of
This document describes the fabrication of a dual power bike that can operate using either an internal combustion engine or electric motor. The goal is to improve fuel efficiency and reduce pollution by allowing electric-only operation in the city. The bike combines a petrol engine with a battery and electric motor, resulting in twice the fuel economy of a conventional bike. It works by using the electric motor powered by the battery for low-power city driving, and switching to the petrol engine for higher speeds or power needs. This hybrid system aims to lower costs and pollution compared to other vehicles.
This document discusses Blue Brain technology and the goal of creating an artificial brain using silicon chips. It aims to upload the contents of a natural human brain into a virtual brain. This would allow human intelligence, memories, and personalities to potentially persist after death through the virtual brain. The document outlines how nanobots could scan a human brain at a cellular level and transfer that information to a supercomputer to recreate the brain's structure and function virtually. It compares key aspects of natural and virtual brains, such as how inputs, interpretation, outputs, memory, and processing would theoretically work for a virtual brain modeled after the human brain.
iirdem The Livable Planet – A Revolutionary Concept through Innovative Street...Iaetsd Iaetsd
The document proposes an innovative street lighting and surveillance system using Internet of Things (IoT) and Li-Fi technologies. The system uses LED street lights equipped with sensors and cameras that can monitor traffic, detect crimes, and provide emergency assistance. Data from the lights would be transmitted using Li-Fi and stored in the cloud for analysis. This integrated system could save energy, reduce costs, and improve safety, traffic management, and emergency response capabilities in cities.
The document proposes a Surveillance Aided Robotic Bird (SARB) to improve on existing surveillance systems. SARB would be designed like a bird and equipped with cameras, including night vision, to monitor areas remotely. It would be powered by carbon nanotubes, allowing for wireless charging and extended flight time. SARB could track intruders under the control of image processing and fly between fixed points for charging. This would provide a more natural, mobile and energy efficient form of surveillance compared to static cameras.
iirdem Growing India Time Monopoly – The Key to Initiate Long Term Rapid GrowthIaetsd Iaetsd
This document discusses how small and medium enterprises can achieve long term rapid growth. It focuses on the concept of "time monopoly" which has two components - a competitive advantage over competitors in a niche market, and a time advantage where it takes competitors longer to catch up.
The literature review discusses different sources of competitive advantage according to Porter, including variety-based positioning, needs-based positioning, and access-based positioning. It also discusses the importance of fit between different business activities for achieving a competitive advantage.
The paper proposes five propositions for rapid growth. These include that all areas can enable or hinder growth; areas can be transformed from hindering to enabling growth; businesses need scalability; and time monopoly,
iirdem Design of Efficient Solar Energy Collector using MPPT AlgorithmIaetsd Iaetsd
This document discusses the design of an efficient solar energy collector using a Maximum Power Point Tracking (MPPT) algorithm. It aims to maximize solar energy output through the use of lenses to concentrate sunlight onto solar panels and an MPPT algorithm to track the optimal power point. The methodology involves designing a DC-DC boost converter, lens-based solar cell, and a microcontroller with driver circuit. Simulations and hardware implementation will analyze the solar array, boost converter, and verify the system collects more energy than a fixed panel system.
iirdem CRASH IMPACT ATTENUATOR (CIA) FOR AUTOMOBILES WITH THE ADVOCATION OF M...Iaetsd Iaetsd
This document describes a proposed crash impact attenuation system for automobiles that uses mechatronic systems. The system includes an accident prediction system using ultrasound sensors to monitor vehicle surroundings and detect potential collisions. It also includes a crash absorption system with components like a pneumatic cylinder attached to the vehicle chassis that can push and pull a shock energy absorber upon detection of an imminent crash by the microcontroller. This proposed system aims to reduce crash impacts and potentially save lives by fully absorbing crash forces through controlled actuation of the absorber components.
iirdem ADVANCING OF POWER MANAGEMENT IN HOME WITH SMART GRID TECHNOLOGY AND S...Iaetsd Iaetsd
1) The document describes a smart home energy management system that uses wireless sensor networks and ZigBee technology to monitor and control home appliances in real-time. Electrical parameters like voltage, current, and power consumption are measured.
2) The system allows flexible control of appliances based on consumer needs. Appliances can be monitored and controlled remotely or automatically based on power consumption thresholds.
3) Key features of the system include using a TRIAC circuit to control appliances without needing a microcontroller, and providing flexible control options to users for switching devices on/off according to their preferences. This allows improving consumer comfort while optimizing energy use.
iaetsd Shared authority based privacy preserving protocolIaetsd Iaetsd
This document proposes a Shared Authority based Privacy preserving Authentication protocol (SAPA) for handling privacy issues in cloud storage. SAPA achieves shared access authority through an anonymous access request matching mechanism. It applies attribute-based access control to allow users to reliably access their own data fields. It also uses proxy re-encryption to provide temporary authorized data sharing among multiple users. The goal is to preserve user privacy during data access and sharing in the cloud.
iaetsd Secured multiple keyword ranked search over encrypted databasesIaetsd Iaetsd
This document proposes a Robust Key-Aggregate Cryptosystem (RKAC) that allows flexible and efficient assignment of decryption rights for encrypted data stored in cloud storage. The RKAC produces constant-sized ciphertexts such that a constant-sized aggregate decryption key can decrypt any subset of ciphertexts. This allows the data owner to share access to selected encrypted files by sending a single small aggregate key to authorized users, without decrypting the files themselves or distributing individual keys. The RKAC is described as providing a secure and flexible method for sharing encrypted data stored in the cloud.
iaetsd Robots in oil and gas refineriesIaetsd Iaetsd
This document discusses attribute-based encryption in cloud computing with outsourced revocation. It proposes a pseudonym generation scheme for identity-based encryption and outsourced revocation in cloud computing. The scheme offloads most key generation operations to a Key Update Cloud Service Provider during key issuing and updating, leaving only simple operations for the Private Key Generator and users. It aims to reduce computation overhead at the Private Key Generator while using an untrusted cloud service provider.
iaetsd Modeling of solar steam engine system using parabolicIaetsd Iaetsd
The document describes the modeling and testing of a solar-steam engine system using a parabolic concentrator. The system focuses solar radiation onto a boiler to generate steam, which is then used to power an oscillating steam engine coupled to a generator to produce electricity. The parabolic dish has a diameter of 0.625m and focuses sunlight onto a 1L boiler. Testing showed the system could produce 9V with no load and 5.3V under load, demonstrating its potential for rural electrification applications.
Null Bangalore | Pentesters Approach to AWS IAMDivyanshu
#Abstract:
- Learn more about the real-world methods for auditing AWS IAM (Identity and Access Management) as a pentester. So let us proceed with a brief discussion of IAM as well as some typical misconfigurations and their potential exploits in order to reinforce the understanding of IAM security best practices.
- Gain actionable insights into AWS IAM policies and roles, using hands on approach.
#Prerequisites:
- Basic understanding of AWS services and architecture
- Familiarity with cloud security concepts
- Experience using the AWS Management Console or AWS CLI.
- For hands on lab create account on [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
# Scenario Covered:
- Basics of IAM in AWS
- Implementing IAM Policies with Least Privilege to Manage S3 Bucket
- Objective: Create an S3 bucket with least privilege IAM policy and validate access.
- Steps:
- Create S3 bucket.
- Attach least privilege policy to IAM user.
- Validate access.
- Exploiting IAM PassRole Misconfiguration
-Allows a user to pass a specific IAM role to an AWS service (ec2), typically used for service access delegation. Then exploit PassRole Misconfiguration granting unauthorized access to sensitive resources.
- Objective: Demonstrate how a PassRole misconfiguration can grant unauthorized access.
- Steps:
- Allow user to pass IAM role to EC2.
- Exploit misconfiguration for unauthorized access.
- Access sensitive resources.
- Exploiting IAM AssumeRole Misconfiguration with Overly Permissive Role
- An overly permissive IAM role configuration can lead to privilege escalation by creating a role with administrative privileges and allow a user to assume this role.
- Objective: Show how overly permissive IAM roles can lead to privilege escalation.
- Steps:
- Create role with administrative privileges.
- Allow user to assume the role.
- Perform administrative actions.
- Differentiation between PassRole vs AssumeRole
Try at [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
Software Engineering and Project Management - Introduction, Modeling Concepts...Prakhyath Rai
Introduction, Modeling Concepts and Class Modeling: What is Object orientation? What is OO development? OO Themes; Evidence for usefulness of OO development; OO modeling history. Modeling
as Design technique: Modeling, abstraction, The Three models. Class Modeling: Object and Class Concept, Link and associations concepts, Generalization and Inheritance, A sample class model, Navigation of class models, and UML diagrams
Building the Analysis Models: Requirement Analysis, Analysis Model Approaches, Data modeling Concepts, Object Oriented Analysis, Scenario-Based Modeling, Flow-Oriented Modeling, class Based Modeling, Creating a Behavioral Model.
Rainfall intensity duration frequency curve statistical analysis and modeling...bijceesjournal
Using data from 41 years in Patna’ India’ the study’s goal is to analyze the trends of how often it rains on a weekly, seasonal, and annual basis (1981−2020). First, utilizing the intensity-duration-frequency (IDF) curve and the relationship by statistically analyzing rainfall’ the historical rainfall data set for Patna’ India’ during a 41 year period (1981−2020), was evaluated for its quality. Changes in the hydrologic cycle as a result of increased greenhouse gas emissions are expected to induce variations in the intensity, length, and frequency of precipitation events. One strategy to lessen vulnerability is to quantify probable changes and adapt to them. Techniques such as log-normal, normal, and Gumbel are used (EV-I). Distributions were created with durations of 1, 2, 3, 6, and 24 h and return times of 2, 5, 10, 25, and 100 years. There were also mathematical correlations discovered between rainfall and recurrence interval.
Findings: Based on findings, the Gumbel approach produced the highest intensity values, whereas the other approaches produced values that were close to each other. The data indicates that 461.9 mm of rain fell during the monsoon season’s 301st week. However, it was found that the 29th week had the greatest average rainfall, 92.6 mm. With 952.6 mm on average, the monsoon season saw the highest rainfall. Calculations revealed that the yearly rainfall averaged 1171.1 mm. Using Weibull’s method, the study was subsequently expanded to examine rainfall distribution at different recurrence intervals of 2, 5, 10, and 25 years. Rainfall and recurrence interval mathematical correlations were also developed. Further regression analysis revealed that short wave irrigation, wind direction, wind speed, pressure, relative humidity, and temperature all had a substantial influence on rainfall.
Originality and value: The results of the rainfall IDF curves can provide useful information to policymakers in making appropriate decisions in managing and minimizing floods in the study area.
Comparative analysis between traditional aquaponics and reconstructed aquapon...bijceesjournal
The aquaponic system of planting is a method that does not require soil usage. It is a method that only needs water, fish, lava rocks (a substitute for soil), and plants. Aquaponic systems are sustainable and environmentally friendly. Its use not only helps to plant in small spaces but also helps reduce artificial chemical use and minimizes excess water use, as aquaponics consumes 90% less water than soil-based gardening. The study applied a descriptive and experimental design to assess and compare conventional and reconstructed aquaponic methods for reproducing tomatoes. The researchers created an observation checklist to determine the significant factors of the study. The study aims to determine the significant difference between traditional aquaponics and reconstructed aquaponics systems propagating tomatoes in terms of height, weight, girth, and number of fruits. The reconstructed aquaponics system’s higher growth yield results in a much more nourished crop than the traditional aquaponics system. It is superior in its number of fruits, height, weight, and girth measurement. Moreover, the reconstructed aquaponics system is proven to eliminate all the hindrances present in the traditional aquaponics system, which are overcrowding of fish, algae growth, pest problems, contaminated water, and dead fish.
Advanced control scheme of doubly fed induction generator for wind turbine us...IJECEIAES
This paper describes a speed control device for generating electrical energy on an electricity network based on the doubly fed induction generator (DFIG) used for wind power conversion systems. At first, a double-fed induction generator model was constructed. A control law is formulated to govern the flow of energy between the stator of a DFIG and the energy network using three types of controllers: proportional integral (PI), sliding mode controller (SMC) and second order sliding mode controller (SOSMC). Their different results in terms of power reference tracking, reaction to unexpected speed fluctuations, sensitivity to perturbations, and resilience against machine parameter alterations are compared. MATLAB/Simulink was used to conduct the simulations for the preceding study. Multiple simulations have shown very satisfying results, and the investigations demonstrate the efficacy and power-enhancing capabilities of the suggested control system.
Discover the latest insights on Data Driven Maintenance with our comprehensive webinar presentation. Learn about traditional maintenance challenges, the right approach to utilizing data, and the benefits of adopting a Data Driven Maintenance strategy. Explore real-world examples, industry best practices, and innovative solutions like FMECA and the D3M model. This presentation, led by expert Jules Oudmans, is essential for asset owners looking to optimize their maintenance processes and leverage digital technologies for improved efficiency and performance. Download now to stay ahead in the evolving maintenance landscape.
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...IJECEIAES
Climate change's impact on the planet forced the United Nations and governments to promote green energies and electric transportation. The deployments of photovoltaic (PV) and electric vehicle (EV) systems gained stronger momentum due to their numerous advantages over fossil fuel types. The advantages go beyond sustainability to reach financial support and stability. The work in this paper introduces the hybrid system between PV and EV to support industrial and commercial plants. This paper covers the theoretical framework of the proposed hybrid system including the required equation to complete the cost analysis when PV and EV are present. In addition, the proposed design diagram which sets the priorities and requirements of the system is presented. The proposed approach allows setup to advance their power stability, especially during power outages. The presented information supports researchers and plant owners to complete the necessary analysis while promoting the deployment of clean energy. The result of a case study that represents a dairy milk farmer supports the theoretical works and highlights its advanced benefits to existing plants. The short return on investment of the proposed approach supports the paper's novelty approach for the sustainable electrical system. In addition, the proposed system allows for an isolated power setup without the need for a transmission line which enhances the safety of the electrical network
An improved modulation technique suitable for a three level flying capacitor ...IJECEIAES
This research paper introduces an innovative modulation technique for controlling a 3-level flying capacitor multilevel inverter (FCMLI), aiming to streamline the modulation process in contrast to conventional methods. The proposed
simplified modulation technique paves the way for more straightforward and
efficient control of multilevel inverters, enabling their widespread adoption and
integration into modern power electronic systems. Through the amalgamation of
sinusoidal pulse width modulation (SPWM) with a high-frequency square wave
pulse, this controlling technique attains energy equilibrium across the coupling
capacitor. The modulation scheme incorporates a simplified switching pattern
and a decreased count of voltage references, thereby simplifying the control
algorithm.
An improved modulation technique suitable for a three level flying capacitor ...
Iaetsd a layered security approach through femto cell using
1.
Abstract— In earlier process, making a secure routing only
discussed and never discuss about how to transfer data in a
secured manner. Even though we performed routing in a
secured manner, there will be chances of data should be
dropped or revealed by an illegal persons. We use an onion
routing to make a highly secured routing, so this routing
includes the mechanism of layered by layered approach from
one node to another node’s. And we transfer the data in
secured manner by sending dummy packets from source to
destination, and these dummy packets are mold up by the
mechanism of node characterization technique. And in earlier
process they never looked for time and speed reduction. That
is, in existing system, they use the concept of secured routing
each and every time when data will be sent. So this will increase
the speed reduction process which is at every moment of
transaction we need to perform separate routing, to overcome
this we proposed onion routing and node characterization. And
we using femto cell device for strengthening the signal when
there is no sufficient signal to work on the process.
Keywords— MANETs, Routing Protocols, Secure Onion Routing,
Layered Approach, Packet authentication, Femto cell, NS2.
I. INTRODUCTION
1.1 MANET
The term MANET refers to Mobile Ad-hoc NETwork.
MANET is a less infrastructure network; nodes are under
mobility. It should be moved here and there and it won’t rely
stable. Mobile Ad-hoc networks are most familiar to security
issues due to the characteristics of such networks such as a
wireless medium and dynamic topology. It is very harder to
provide trusted and secure communications in enemy
environments such as battle fields. On one hand, the
malicious persons outside the network may have an idea to
reveal the information about the communicating nodes, even
when communications are encrypted. On the other hand
nodes involved inside network will always be trusted, since
a trusted node may be hold by illegal person and become
malicious.
In MANET, a set of interacting nodes should cooperatively
implement routing functions to enable end-to-end
communication along dynamic paths composed by multi-
hop wireless links. Several multi-hop routing protocols have
been proposed for MANET, and most popular ones include:
Dynamic Source Routing (DSR), Optimized Link-State
Routing (OLSR), Destination-Sequenced Distance-Vector
(DSDV) and Ad Hoc On-Demand Distance Vector (AODV).
Most of these protocols are do their function on assumption
of trusted manner. But sometimes it could not been trusted it
behaves like secured less, because when there is a presence
of malicious node at that time it emerges the weakness of
MANET to cause various kinds of attacks.
1.2 ADHOC
Ad-hoc is a Latin word which refers to “all purpose”. For
example, take two access points as access point 1 and access
point 2. There will be twenty kilometer distance in between
those two access point.
Access Point 1 20 k Access Point 2
If user A starts to download the data from access point 1,
immediately user A tends to travel from access point 1 to
access point 2. Now download is under half fulfilled. When
user A which comes under out of coverage from access point
1 due to travelling. They face a problem about downloading.
Due to these criteria, we go for intermediate nodes concept
to prevent interrupts which occurred in data transfer. So, that
time the concept of Ad-hoc is established i.e. intermediate
node is formed. Now data could be transformed very
successfully but there will be a problem occurred under
security concept. Because now the job is hold under
intermediate nodes, we does not known details about
intermediate nodes i.e. either it is a legal or illegal. When it
is illegal, data will not been under secured way. So the major
cause of this paper is about,
Done secure routing
Along with that the data transfer also will be in an
secured manner
The remainder of this paper is organized as follows. The
basic concepts and routing processes are analyzed in Section
II. The protocol design is presented in Section III. The
protocol evaluation is discussed in Section IV. Performance
A Layered Security Approach through FEMTO CELL using
Onion Routing in MANET
T. Sathish1
, M.Senthil Kumar2
1
Department of Computer Science and Engineering, M.E. Scholar, Anna University,
Sree Sowdambika College of Engineering, Aruppukottai, TamilNadu, India.
princeofpersia123555@gmail.com
2
Department of Computer Science and Engineering, Assistant Professor, Anna University,
Sree Sowdambika College of Engineering, Aruppukottai, TamilNadu,India.
rmsenthik@gmail.com
Proceedings of International Conference on Developments in Engineering Research
ISBN NO : 378 - 26 - 13840 - 9
www.iaetsd.in
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
1
2. analysis is evaluated in Section V and Section VII concludes
this paper. The future scope is conferred in Section VII.
II. BACKGROUND AND RELATED WORK
In existing system, they tell about how to perform a secure
routing. They choose the main concept of secure routing as
onion routing. Why they named as secured means, how an
onion makes different layers when we start to cut it into
small pieces, likewise here also they we forms different
layers for checking each and every nodes as an one by one.
It is like a layered i.e. what is the action handled by two
nodes as a one layered. So we can name it’s for our
understanding as onion routing is also known as layered
approach.
Source Intermediate Nodes Destination
Fig.2.1 Layered approach
The main concept done in existing system is they did how to
do secure routing for providing path. This will be discussed
as follows. To accommodate secure rating these cases
requires three kinds of techniques, they are:
Setting a trap
Routing by means of layered approach(onion
routing)
Signature process
2.1 SETTING A TRAP
The general meaning of trap is to find out an unidentified or
illegal person by without knowing an alert for the person
whom is involved. The main concept involved in this
technique is as follows. Let consider, there are six nodes
from source to destination.
Source Destination
To set a “trap” separate id is given to each node. The id
should also been included for source and destination node
too. For Source Node,
I1 identity “id” for Node 1
So, these processes are going on until data or message
reaches the destination node. By setting an identity for each
node ‘I’ can able to find the illegal persons, because illegal
persons do not have their identity number. So step by step, it
travels from source node to destination node which comes
across through different intermediate nodes. The nature
cause of this mechanism is to set a route request message
from source to destination node.
2.2 ONION ROUTING
Once a route request message is perfectly reached by
destination node, the destination node again they start a
work about route reply. The ROUTE REPLY is a main
process for this mechanism, by the mechanism using in my
project is about onion routing. In setting a trap, the route
request message is starts from source node to destination
node. But here in route reply it starts from destination node
to source node.
WORKING PROCESS OF ONION ROUTING
It is a simple process here we are going to removing the
identity number of each intermediate nodes from destination
end points to source end points(reverse process).
Source Intermediate Nodes Destination
Fig.2.2 Process of Onion Routing
In the above diagram route reply request is send from
destination node and its moved to the intermediate node.
Here how they will choose intermediate node means that the
path which the route request came across. So its starts from
the intermediate node first its goes for last intermediate
node. In that it removes the top of the key which is present.
Intermediate Node
From this diagram, I2 will be removed. This is a top of the
key. Once it is finished then it will be moved for another
node. This process is known as layered approach and finally
its came to source node and delivered the route reply
message.
2.3 SIGNATURE PROCESS
In signature process, we are going to generate group
signature and along with that session key. The main process
key is to finish their process with in their time limits which
we set for that.
SID DID Encrypted Message
SID DID Encrypted Message I1 I2
SID DID Encrypted Message I1 I2
SIO DIO Encrypted Message Source Sign I1 Sign
Layer 1 Layer 2 Layer 3
Proceedings of International Conference on Developments in Engineering Research
ISBN NO : 378 - 26 - 13840 - 9
www.iaetsd.in
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
2
3. For example, the session number=5 packets means, there
should be five packets could be sent at a time. If there is
exceeding of any packet count there will be some jobs did by
an illegal person
III. PROTOCOL DESIGN
We invent a much effective method to make an protection
under both packet dropper and modifier’s, in this method
let’s take upon routing tree which is at sink it will be
accomplished very first. At the time of sensor data are make
an survey along the tree structure towards the sink, every
packet sender adds upon small number of extra bits to it,
which is also known as packet marker’s to the packet. And
then runs up the node characterization algorithm for
identifying node’s which hold packet dropper and modifier.
This is the one of the way to identify the bad nodes.
3.1 NODE CHARACTERIZATION ALGORITHM
This algorithm includes the following methods. They are,
o Stepwise ranking method
o Global wise method
o Hybrid ranking method
Using this algorithm, we are going to send dummy packet
with sequence number, random number and padding.
Sequence number is for the packet which we are
going to sent.
Random number for the node, here why we choose
random number for node means, to find out the
hacker which is either it was good node or bad
node.
Padding shows the position of the node. If it is a
first node means, it shows the position as 0th node
(zeroth node).
Source Intermediate Nodes Destination
Fig.3.1 Parameters of Node Characterization Algorithm
For example, I need to transfer 50 kp packets
means, I split as 10 kp as first packet and 20 kp as
second packet and 20 kp as third packet and it is an
automated one.
From the above diagram, first packet of node
includes,
This information will be in the source node only
and this is a general concept.
PROCESS WHICH ARE GOING
Step 1:
Source Destination
When the first dummy packets are in Node ‘A’ that is under
source node it holds the information of,
0th
node
Here sequence number provides some identity number for
first packet as for example: ‘1’. And random number also
has been provided. After that padding will be stored as 0th
position because it’s a first position of the node.
Step 2:
Similarly the same first packet will be moved from Node A
to Node B. The Node B holds the information like,
1st
Node
When same first packet will be moved from Node A to Node
B, it should contains same sequence number, and also been
with source random number id, along with that new
intermediate node random number, and finally intermediate
node padding position is 1st
Node.
C
Source Destination
(Now, we are in Node B)
Step 3:
The same first packets move from Node B to Node C. For
example, we found that we have packet modification. So,
this packet modification shows that the presence of changed
packet information. That is an anonymous person could
modify the data. For example, how can we find our data will
be modified means?
1. There will be changed in sequence number example
we use ‘1’ as an sequence number means these will
be changed as 1.4 or 1.7 which what we given it
won’t present here.
2. The random number should not been generated for
illegal person.
Step 4:
If we are going to send second packet means, the sequence
number will be changed as ‘2’ then its move from Node A ,
Node B, Node C.
General Rule:
o First packet ‘1’ sequence number
o Second packet ‘2’ sequence number
o Third packet ‘3’ sequence number
IV. PROTOCOL EVALUATION
The proposed system has the following features:
Identifies both a kind of malicious activity like
packet dropping and modifying.
Achieving low communication and overheads.
SID DID Sequence Number Random Number Padding
SID DID Sequence Number Random Number Padding
SID DID Sequence Number Random Number Padding
SID DID Sequence
Number
Intermediate
Random Number
Intermediate
Padding
B C DA
B C DA
Proceedings of International Conference on Developments in Engineering Research
ISBN NO : 378 - 26 - 13840 - 9
www.iaetsd.in
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
3
4. Much more suitable for existing false packet
filtering schemes that is this scheme will make
an end point for malicious packets.
We going to deployment large number of sensor nodes in an
two dimensional area. The nature job of each sensor node’s
generate the data regularly and intended to forward packets
towards an sink and the sink is located inside the network.
A. STEP WISE RANKING METHOD
Yet now we find the one will be safer node. So, now we
going to note which node will be good node or which will be
bad node. So for finding, I will just make all nodes under
tree formation. That is the nodes which are nearby.
Fig.4.1 Tree Structure of Nodes Formation
For example, in node A we have 10 packets, now we going
to check of these whether this remaining nodes are good
node or bad node. Node A sent 10 packets to every nodes
which are present in the tree (b,c,d,e,f,g,h,i,j,k,l,m,n,o).
20/10
10/10
9/10 7/10
Fig.4.2 Step Wise Ranking Method
Good Node – 10/10
Bad Node – 20/10, 8/10, 7/10
Unknown Node (Either Bad or Good) – 9/10,11/10
By using this, we may find either which one will be good
node or which one will be bad node. It is a step wise ranking
method. We are going to see step by step which is from top
layer of the tree. When we seen, Node B as 10/10 means it
will be good node and it will be selected. Similarly, take
Node ‘D’, it has 9/10 so it is under the scenario of unknown
either bad or good. If we reject these nodes, their child node
also deleted and it is a drawback of this method.
B. GLOBAL WISE RANKING METHOD
To overcome the drawback which are comes under stepwise
ranking method we need to seen these node under over all
view that is which one will be best. By selecting that best
one, we are going to use the best one for our process that is
for packet transaction.
C. HYBRID RANKING METHOD
These methods are combination of stepwise ranking method
and global ranking method. Here the node which is having
highest priority will choose as first and it is most likely bad
node.
D. FEMTO CELL
Femto cell is an device which act as wireless access point ,
its used to strength the signal and to provide the same signal
range whatever its came from the core network and the
range of femto cell process about 10 metres. These femto
cell are particularly designed for small environment, so this
theme got correlated with my project which is after selecting
an particular route for my data transmission here I’ll have
some less amount of node’s , so the data starts to travel
across the node which I framed. The main problem is node
coverage will be differs according to distance of each node
from the core network’s and this leads to higher time
consumption in data transfer. So when we use femto cell
near to node which does not have fulfilled coverage means
we can able to successful in over-come these drawback.
V. PERFORMANCE ANALYSIS
5.1 NETWORK CONFIGURATIONS
TOPOLOGIES
In our research the network area is about 1500m x 600m
with 80 nodes normally and it should be equally distributed.
Here the function of distributed coordination IEEE 802.11 is
used as the MAC layer. And the capacity of channel is about
A
B C
D E F G
H I J K L OM N
A
B C
D E F G
H I J K
Proceedings of International Conference on Developments in Engineering Research
ISBN NO : 378 - 26 - 13840 - 9
www.iaetsd.in
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
4
5. 3Mbps, transmission range is occurred was 250m.The
mobility in node should be there by using random way point
model. The total of 20 UDP based CBR sessions are used to
create the network traffic.
ATTACKING MODELS
The general assumption about the intermediate nodes along
the route may become malicious If there is any malicious
node then the routing packets are randomly dropped. For
example in previous routing like ANODR and AODV will
suffer more packet loss. The AASR detect the malicious
node by using the signature method and find out the details
of attackers in routing table.
SIMULATION RESULTS
Effects of Mobility Scenario
To simulate the enemy environment, we are going to choose
twenty percentage of total nodes, which is ten nodes as
malicious nodes and then we can able to change the network
mobility from one to eight m=s and record the performance
results. From the results the average nodal speed increases,
similarly the throughput also varies because nodes have an
capability of move randomly. Due to performance variation
secure routing always achieve highest throughput. The
following figures a, b, c describe the performance of
different mobility settings.
a. Per Flow Throughput
c. Packet Loss Ratio
c. End-to-end Delay
Effects of Malicious Attacks
The configuration of mobile network with an average as
4m=s, therefore in general the number of malicious nodes
increases similarly the throughput decreases. The following
figures a, b, c show the performance in the presence of
different number of malicious nodes
d. Per Flow Throughput
e. Packet Loss Ratio
13
13.5
14
14.5
15
15.5
16
1 2 3 4 5
AverageThroughput
PerFlow(kbps)
Mean Node Speed (m/s)
AODV
SR
ANODR
8
10
12
14
16
18
20
22
1 2 3 4 5
PacketLossRatio(%)
Mean Node Speed (m/s)
AODV
SR
ANODR
0
50
100
150
200
250
300
350
1 2 3 4 5
DataPacketDelay(ms)
Mean Node Speed (m/s)
AODV
SR
ANODR
14
14.5
15
15.5
16
16.5
17
1 3 5 7 9
AverageThroughputPer
Flow(kbps)
Numberof Malicious Node
AODV
SR
ANODR
2
4
6
8
10
12
14
1 3 5 7 9
PacketLossRatio(%)
Numberof Malicious Node
AODV
SR
ANODR
Proceedings of International Conference on Developments in Engineering Research
ISBN NO : 378 - 26 - 13840 - 9
www.iaetsd.in
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
5
6. f. End-to-end Delay
VI. CONCLUSION
There will be lot of MANET security routing concept can be
obtained, but yet now there will be no intimation to secure
packet authentication. If there is any malicious activity
means those packet will be dropped so the information might
be destroyed. Therefore this is a correct solution for an
hackers or intruders they achieve their task which means
they finish their main job. But I’ll find a solution by
introducing the dummy packet concept with some secured
mechanism, this will helpful for lightning a successful path
of conveying original information from source to
destination. And I’ll used femto cell to make more
strengthened signal coverage for achieving more efficient
process.
VII. FUTURE SCOPE
The nature cause of anonymous is come due to a
confidential message or data which is sent through an
intermediate node. So I first focused about how to make an
malicious intermediate node into trustable intermediate
node. I’ll going to accomplish this task by generating
survey about nodes by finding out good node, bad node and
unknown status about either good or bad node. It is an
attainable solution by using the ranking method concepts.
VIII. REFERENCES
1. (Nevin) Lianwen Zhang and David Poole, “Stepwise-Decomposable
Influence Diagrams”, Department of Computer Science, University of
British Columbia, Vancouver, B.C, V6T/Z2, Canada.
2. N.Vanitha, G.Jenifa, “Detection of Packet Droppers in Wireless Sensor
Networks Using Node Categorization Algorithm”, International Journal
of Advanced Research in Computer Science and Software Engineering,
Volume 3,Issues 3,pp.69-74, March 2013.
3. Hussein Al-Bahadili and Khalid Kaabnel, “Analyzing the
Performanceof Probabilistic Algorithm in Noisy MANETs”,
International Journal of Wireless and Mobile Networks, pp.82-94,
Vol.2, No.3, August 2010.
4. Shio Kumar Singh, M.P Singh and D.K Singh, “Routing Protocols
in Wireless Sensor Networks - A Survey”, International Journal
of Computer Science and Engineering Survey, Vol.1, No.2,
November 2010.
5. Hee Yong Youn, Chansu Yu, Ben Lee,”Routing Algorithms for
Balanced Energy Consumption in Ad-hoc Networks”.
6. Zaiba Ishrat, Pankaj Singh, “An Enhanced DSR Protocol Using
Path Ranking Technique”, International Journal of Engineering
Research and Applications, Vol.3, Issue 3, pp.1252-1256, May-
JUNE 2013.
7. Wenjia Li, Anupam Joshi and Tim Finin, “SMART: An SVM-
Based Misbehavior Detection and Trust Management Framework
for Mobile Ad-hoc Networks”.
8. Ruchi Rani, Manisha Dawra, “Performance Characterization of
AODV Protocol in MANET”, International Journal of Advanced
Research in Computer Engineering and Technology, Vol. 1, Issue
3, May 2012.
9. Kannan Govindan, Member IEEE and Prasant Mohapatra, Fellow
IEEE, “Trust Computations and Trust Dynamics in Mobile Ad-
hoc Networks: A Survey”.
10. Changbin Liu, Yun Mao, Mihai Opera, Prithwish Basu, Boon
Thau Loo, “A Declarative Perspective on Adaptive MANET
Routing”, August 2008.
11. Mamatha.T, “Network Security for MANETs”, International
Journal of Soft Computing and Engineering, Vol.2, Issue 2, MAY
2012.
12. Muhammad Arshad Ali and Yasir Sarwar, “Security Issues
Regarding MANET (Mobile Ad-hoc Networks): Challenges and
Solutions”, Master Thesis, Computer Science, Thesis No: MCS-
2011-11, March 2011.
13. DSF for MANETs (Distributed Services Framework for Mobile
Ad-hoc Networks).
14. Gagandeep, Aashima, Pawan Kumar, “Analysis of Different
Security Attacks in MANETs in Protocol Stack A-Review”,
International Journal of Engineering and Advanced Technology,
Vol.1, Issue 5, June 2012.
15. WWRF/WG4/Ad-hoc Networking-Subgroup WhitePpaper,
Version 1.0, 17th
June 2002.
20
40
60
80
100
120
140
160
180
200
220
1 3 5 7 9
DataPacketDelay(ms)
Numberof Malicious Node
AODV
SR
ANODR
Proceedings of International Conference on Developments in Engineering Research
ISBN NO : 378 - 26 - 13840 - 9
www.iaetsd.in
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
6