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.
ATMC: Anonymity and Trust Management Scheme Applied to Clustered Wireless Sen...IDES Editor
Wireless Sensor Networks consists of sensor nodes
that are capable of sensing the information and maintaining
security. In this paper, an Anonymity and Trust Management
Scheme applied to Clustered Wireless Sensor Networks
(ATMC) is proposed which enhances the security level. It also
provides a stable path for communication. It is observed that
the performance of the network is better than existing schemes
through simulation
A Survey on Comparisons of Cryptographic Algorithms Using Certain Parameters ...IJECEIAES
he Wireless Sensor Networks (WSNs) have spread its roots in almost every application. Owing to their scattered nature of sensor nodes, they are more prone to attacks. There are certain applications e.g. military, where sensor data‟s confidentiality requirement during transmission is essential. Cryptography has a vital role for achieving security in WSNs.WSN has resource constraints like memory size, processing speed and energy consumption which bounds the applicability of existing cryptographic algorithms for WSN. Any good security algorithms has higher energy consumption by the nodes, so it‟s a need to choose most energy-efficient cryptographic encryption algorithms for WSNs. This paper surveys different asymmetric algorithms such as RSA, Diffie-Hellman, DSA, ECC, hybrid and DNA cryptography. These algorithms are compared based on their key size, strength, weakness, attacks and possible countermeasures in the form of table.
A novel paradigm in authentication systemIJNSA Journal
Maintaining the security of your computer, network and private/sensitive data against unauthorized access
and a wide variety of security threats can be challenging. Verifying data integrity and authentication are
essential security services in order to secure data transmission process. In this paper we propose a novel
security technique which uses new encryption and decryption algorithms to achieve authenticated
communication and enhanced data integrity. The proposed technique is very complex for attackers to
decode, and it is applicable to client-server architecture.
ATMC: Anonymity and Trust Management Scheme Applied to Clustered Wireless Sen...IDES Editor
Wireless Sensor Networks consists of sensor nodes
that are capable of sensing the information and maintaining
security. In this paper, an Anonymity and Trust Management
Scheme applied to Clustered Wireless Sensor Networks
(ATMC) is proposed which enhances the security level. It also
provides a stable path for communication. It is observed that
the performance of the network is better than existing schemes
through simulation
A Survey on Comparisons of Cryptographic Algorithms Using Certain Parameters ...IJECEIAES
he Wireless Sensor Networks (WSNs) have spread its roots in almost every application. Owing to their scattered nature of sensor nodes, they are more prone to attacks. There are certain applications e.g. military, where sensor data‟s confidentiality requirement during transmission is essential. Cryptography has a vital role for achieving security in WSNs.WSN has resource constraints like memory size, processing speed and energy consumption which bounds the applicability of existing cryptographic algorithms for WSN. Any good security algorithms has higher energy consumption by the nodes, so it‟s a need to choose most energy-efficient cryptographic encryption algorithms for WSNs. This paper surveys different asymmetric algorithms such as RSA, Diffie-Hellman, DSA, ECC, hybrid and DNA cryptography. These algorithms are compared based on their key size, strength, weakness, attacks and possible countermeasures in the form of table.
A novel paradigm in authentication systemIJNSA Journal
Maintaining the security of your computer, network and private/sensitive data against unauthorized access
and a wide variety of security threats can be challenging. Verifying data integrity and authentication are
essential security services in order to secure data transmission process. In this paper we propose a novel
security technique which uses new encryption and decryption algorithms to achieve authenticated
communication and enhanced data integrity. The proposed technique is very complex for attackers to
decode, and it is applicable to client-server architecture.
Three Party Authenticated Key Distribution using Quantum CryptographyIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
Certificate less key management scheme inIJNSA Journal
In mobile adhoc networks (MANETs) an efficient and secure key management scheme is extremely crucial. Key management schemes for MANETs are mainly based on identity-based public key cryptography (ID-PKC) or certificate-based public key cryptography, both of which has their inherit problem. The ID-PKC has the key escrow problem and certificate based cryptography have a high computational costs of certificates deployment. In this paper, we present a distributed key management scheme, in which a combination of certificate less public key cryptography (CL-PKC) and threshold cryptography is employed. The scheme proposed in this paper not only achieves several enhanced security attributes for key management in MANET but also eliminates the need for certificate-based public key distribution and the key escrow problem efficiently.
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.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
RSA and RC4 Cryptosystem Performance Evaluation Using Image and TextYekini Nureni
The process of transforming plaintext data into cipher text in order to conceal its meaning in case it fall to hand of unauthorized recipient is refers to as encryption. The systems that perform the encryption processes are known as cryptosystems, there are several cryptosystem algorithms: RSA, RC4, DES, 3DES, Blowfish, AES, IDEA, Skipjack, DSA, ElGamal, etc. The major features that identify and differentiate one cryptosystem algorithm from another are its ability to secure the protected data against attacks and its speed/efficiency. In this paper: application software was designed to implement RSA, and RCA encryption algorithms with advanced features of visual Basic 6 for the front end interface. Microsoft Access is used to design backend of the application, and the Macromedia Flash was also used to incorporate dynamic features that enhance the appearance of the application. The program was used to compare the performance of RSA and RC4. The encryption operation was carried out for both RSA and RC4 using five text files and five graphic files of different sizes 10, 50, 100, 150, and 200 kilobyte respectively. The major factor considered for measuring the performance of the algorithms (RSA and RC4) is the speed of execution using time of execution (TE) as parameter for the evaluation. The performance result was presented and analyzed. We discovered that the RC4 is better compare to RSA algorithm based on the experimental facts presented and the result analysis of the two evaluated algorithms.
A Trust Conscious Secure Route Data Communication in MANETSCSCJournals
Security in mobile adhoc networks is difficult to achieve, notably because of the vulnerability of wireless links, the limited physical protection of nodes, the dynamically changing topology, the absence of a certification authority, and the lack of a centralized monitoring or management point. The major difficulty in adhoc network occurs when a new node join network but not having any trusts relation with other node of network. We have proposed a new mechanism that provides trust conscious and secure data communication between the nodes. In this mechanism we will dynamically increase the trust from (Low to High) between the mobile nodes using proxy node. When mobile node needs secure data communication, it will generate a dynamic secret session key with the desired destination mobile node directly or via proxy mobile node. These dynamic secret session keys are generated using message digest and Diffie-Hellmann protocol.
Security analysis of fbdk block cipher for digital imageseSAT Journals
Abstract Network security is one of the major concerns in the modern world. In this regard, a strong security technique is required to protect user data. Cryptography techniques plays an important role in secured transmission through encryption of data and thus ensuring integrity, authenticity, confidentiality of information. Several encryption algorithms have been proposed like AES (Advanced Encryption Standard), DES (Data Encryption Standard) and RSA. These provide very good encryption for text applications. However, these encryption schemes appear not to be ideal for image applications. Some algorithms like GKSBC and RC6 provide very good encryption for digital images. New techniques are emerging that are aimed at providing secured transmission of images over networks. The FBDK (Fixed Block with Dynamic Key Size) block cipher is a new cryptography technique designed using simple operations like XOR, substitutions, circular shifting. The FBDK algorithm is applicable for blocks of any size with key size being dynamic for each block. It does not involve any complex mathematical operations like modular exponentiation. It is a hybrid cryptography technique based on symmetric key and asymmetric key cryptosystems. This paper investigates the security of FBDK block cipher for digital images against brute-force attack, statistical analysis and Differential analysis attacks. In this paper, various security analysis tests has been discussed which are helpful in finding out whether the FBDK encryption algorithm can do secure encryption or not. Experimental results proves the security and efficiency of FBDK cipher for images against all aforementioned types of attacks which justifies its consideration for real time image applications. Keywords: Cryptography, Ciphers, Encryption, Security, and cryptanalysis.
Cluster Based Misbehaviour Detection and Authentication Using Threshold Crypt...CSCJournals
In mobile ad hoc networks, the misbehaving nodes can cause dysfunction in the network resulting in damage of other nodes. In order to establish secure communication with the group members of a network, use of a shared group key for confidentiality and authentication is required. Distributing the shares of secret group key to the group members securely is another challenging task in MANET. In this paper, we propose a Cluster Based Misbehavior Detection and Authentication scheme using threshold cryptography in MANET. For secure data transmission, when any node requests a certificate from a cluster head (CH), it utilizes a threshold cryptographic technique to issue the certificate to the requested node for authentication. The certificate of a node is renewed or rejected by CH, based on its trust counter value. An acknowledgement scheme is also included to detect and isolate the misbehaving nodes. By simulation results, we show that the proposed approach reduces the overhead.
Improving the Secure Socket Layer by Modifying the RSA AlgorithmIJCSEA Journal
Secure Socket Layer (SSL) is a cryptographic protocol which has been used broadly for making secure connection to a web server. SSL relies upon the use of dependent cryptographic functions to perform a secure connection. The first function is the authentication function which facilitates the client to identify the server and vice versa [1]. There have been used, several other functions such as encryption and integrity for the imbuement of security. The most common cryptographic algorithm used for ensuring security is RSA. It still has got several security breaches that need to be dealt with. An improvement over this has been implemented in this paper. In this paper, a modification of RSA has been proposed that switches from the domain of integers to the domain of bit stuffing to be applied to the first function of SSL that would give more secure communication. The introduction of bit stuffing will complicate the access to the message even after getting the access to the private key. So, it will enhance the security which is the inevitable requirement for the design of cryptographic protocols for secure communication.
Enhanced security for non English users of Wireless Sensor NetworksEswar Publications
Wireless Sensor Networks is an infrastructure less, self-configured, reprogrammable, energy-aware network used
in various applications. Many networks works on security of data including mainly ASCII values but not the non English end users. BDNA cryptography describes how to encrypt non English patterns but which leads to propagation of more bits transmitted means indirectly consumes more energy in WSN. In this we propose new steps to reduce the transmission of more bytes in the network. This gives high propagation speed in the network with minimum hash overhead.
Mobile Ad hoc Network is a collection of wireless mobile nodes forming a network without
using any existing infrastructure. MANET is a collection of mobile nodes along with wireless
transmitter and receiver that with each other via a bi-directional links either directly or indirectly. A
new intrusion detection system named communicates Enhanced Adaptive Acknowledgment
(EAACK) specially designed for MANETs. It is based on the digital signature algorithm (DSA). To
enhance the security in the mobile adhoc networks, we introduce a new approach called Hybrid
cryptography algorithm that provides integrity, confidentiality and authentication. This hybrid
cryptography algorithm is based on two cryptography algorithms such as RSA and AES. Encryption is
achieved by using, RSA algorithm for authentication and symmetric algorithm for the integrity. By
using the symmetric and asymmetric cryptographic algorithm, we can achieve better security and
integrity than the EAACK
Hierarchical Key Agreement Protocol for Wireless Sensor Networksidescitation
Wireless sensor network promises ubiquitous data
collection and processing for variety of commercial, healthcare
and military applications. Practical realization of WSN
applications is possible only after assuring network security.
Cryptographic key distribution is an important phase in
network security which establishes initial trust in the network.
Security protocol implementation in WSN is limited by
resource constrained nature of sensor nodes. The key
distribution algorithm satisfying security requirements of
given WSN application should be implemented with minimum
communication and memory overhead. As a solution to this
problem, hierarchical key management technique is proposed
in this paper. Symmetric key pre-distribution technique with
less computational overhead and ID-based asymmetric key
(IBK) distribution technique with less communication
overhead are applied simultaneously in the network at
different levels. Resilience strength and resource overhead of
the proposed scheme is compared with both symmetric and
asymmetric techniques.
Guillou-quisquater protocol for user authentication based on zero knowledge p...TELKOMNIKA JOURNAL
Authentication is the act of confirming the validity of someone’s personal data. In the traditional
authentication system, username and password are sent to the server for verification. However, this
scheme is not secure, because the password can be sniffed. In addition, the server will keep the user’s
password for the authentication. This makes the system vulnerable when the database server is hacked.
Zero knowledge authentication allows server to authenticate user without knowing the user’s password. In
this research, this scheme was implemented with Guillou-Quisquater protocol. Two login mechanisms
were used: file-based certificate with key and local storage. Testing phase was carried out based on the
Open Web Application Security Project (OWASP) penetration testing scheme. Furthermore, penetration
testing was also performed by an expert based on Acunetix report. Three potential vulnerabilities were
found and risk estimation was calculated. According to OWASP risk rating, these vulnerabilities were at the
medium level.
A Lightweight Secure Scheme for Detecting Provenance Forgery and Packet Drop ...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
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.
A Key Management Approach For Wireless Sensor NetworksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
Three Party Authenticated Key Distribution using Quantum CryptographyIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
Certificate less key management scheme inIJNSA Journal
In mobile adhoc networks (MANETs) an efficient and secure key management scheme is extremely crucial. Key management schemes for MANETs are mainly based on identity-based public key cryptography (ID-PKC) or certificate-based public key cryptography, both of which has their inherit problem. The ID-PKC has the key escrow problem and certificate based cryptography have a high computational costs of certificates deployment. In this paper, we present a distributed key management scheme, in which a combination of certificate less public key cryptography (CL-PKC) and threshold cryptography is employed. The scheme proposed in this paper not only achieves several enhanced security attributes for key management in MANET but also eliminates the need for certificate-based public key distribution and the key escrow problem efficiently.
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.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
RSA and RC4 Cryptosystem Performance Evaluation Using Image and TextYekini Nureni
The process of transforming plaintext data into cipher text in order to conceal its meaning in case it fall to hand of unauthorized recipient is refers to as encryption. The systems that perform the encryption processes are known as cryptosystems, there are several cryptosystem algorithms: RSA, RC4, DES, 3DES, Blowfish, AES, IDEA, Skipjack, DSA, ElGamal, etc. The major features that identify and differentiate one cryptosystem algorithm from another are its ability to secure the protected data against attacks and its speed/efficiency. In this paper: application software was designed to implement RSA, and RCA encryption algorithms with advanced features of visual Basic 6 for the front end interface. Microsoft Access is used to design backend of the application, and the Macromedia Flash was also used to incorporate dynamic features that enhance the appearance of the application. The program was used to compare the performance of RSA and RC4. The encryption operation was carried out for both RSA and RC4 using five text files and five graphic files of different sizes 10, 50, 100, 150, and 200 kilobyte respectively. The major factor considered for measuring the performance of the algorithms (RSA and RC4) is the speed of execution using time of execution (TE) as parameter for the evaluation. The performance result was presented and analyzed. We discovered that the RC4 is better compare to RSA algorithm based on the experimental facts presented and the result analysis of the two evaluated algorithms.
A Trust Conscious Secure Route Data Communication in MANETSCSCJournals
Security in mobile adhoc networks is difficult to achieve, notably because of the vulnerability of wireless links, the limited physical protection of nodes, the dynamically changing topology, the absence of a certification authority, and the lack of a centralized monitoring or management point. The major difficulty in adhoc network occurs when a new node join network but not having any trusts relation with other node of network. We have proposed a new mechanism that provides trust conscious and secure data communication between the nodes. In this mechanism we will dynamically increase the trust from (Low to High) between the mobile nodes using proxy node. When mobile node needs secure data communication, it will generate a dynamic secret session key with the desired destination mobile node directly or via proxy mobile node. These dynamic secret session keys are generated using message digest and Diffie-Hellmann protocol.
Security analysis of fbdk block cipher for digital imageseSAT Journals
Abstract Network security is one of the major concerns in the modern world. In this regard, a strong security technique is required to protect user data. Cryptography techniques plays an important role in secured transmission through encryption of data and thus ensuring integrity, authenticity, confidentiality of information. Several encryption algorithms have been proposed like AES (Advanced Encryption Standard), DES (Data Encryption Standard) and RSA. These provide very good encryption for text applications. However, these encryption schemes appear not to be ideal for image applications. Some algorithms like GKSBC and RC6 provide very good encryption for digital images. New techniques are emerging that are aimed at providing secured transmission of images over networks. The FBDK (Fixed Block with Dynamic Key Size) block cipher is a new cryptography technique designed using simple operations like XOR, substitutions, circular shifting. The FBDK algorithm is applicable for blocks of any size with key size being dynamic for each block. It does not involve any complex mathematical operations like modular exponentiation. It is a hybrid cryptography technique based on symmetric key and asymmetric key cryptosystems. This paper investigates the security of FBDK block cipher for digital images against brute-force attack, statistical analysis and Differential analysis attacks. In this paper, various security analysis tests has been discussed which are helpful in finding out whether the FBDK encryption algorithm can do secure encryption or not. Experimental results proves the security and efficiency of FBDK cipher for images against all aforementioned types of attacks which justifies its consideration for real time image applications. Keywords: Cryptography, Ciphers, Encryption, Security, and cryptanalysis.
Cluster Based Misbehaviour Detection and Authentication Using Threshold Crypt...CSCJournals
In mobile ad hoc networks, the misbehaving nodes can cause dysfunction in the network resulting in damage of other nodes. In order to establish secure communication with the group members of a network, use of a shared group key for confidentiality and authentication is required. Distributing the shares of secret group key to the group members securely is another challenging task in MANET. In this paper, we propose a Cluster Based Misbehavior Detection and Authentication scheme using threshold cryptography in MANET. For secure data transmission, when any node requests a certificate from a cluster head (CH), it utilizes a threshold cryptographic technique to issue the certificate to the requested node for authentication. The certificate of a node is renewed or rejected by CH, based on its trust counter value. An acknowledgement scheme is also included to detect and isolate the misbehaving nodes. By simulation results, we show that the proposed approach reduces the overhead.
Improving the Secure Socket Layer by Modifying the RSA AlgorithmIJCSEA Journal
Secure Socket Layer (SSL) is a cryptographic protocol which has been used broadly for making secure connection to a web server. SSL relies upon the use of dependent cryptographic functions to perform a secure connection. The first function is the authentication function which facilitates the client to identify the server and vice versa [1]. There have been used, several other functions such as encryption and integrity for the imbuement of security. The most common cryptographic algorithm used for ensuring security is RSA. It still has got several security breaches that need to be dealt with. An improvement over this has been implemented in this paper. In this paper, a modification of RSA has been proposed that switches from the domain of integers to the domain of bit stuffing to be applied to the first function of SSL that would give more secure communication. The introduction of bit stuffing will complicate the access to the message even after getting the access to the private key. So, it will enhance the security which is the inevitable requirement for the design of cryptographic protocols for secure communication.
Enhanced security for non English users of Wireless Sensor NetworksEswar Publications
Wireless Sensor Networks is an infrastructure less, self-configured, reprogrammable, energy-aware network used
in various applications. Many networks works on security of data including mainly ASCII values but not the non English end users. BDNA cryptography describes how to encrypt non English patterns but which leads to propagation of more bits transmitted means indirectly consumes more energy in WSN. In this we propose new steps to reduce the transmission of more bytes in the network. This gives high propagation speed in the network with minimum hash overhead.
Mobile Ad hoc Network is a collection of wireless mobile nodes forming a network without
using any existing infrastructure. MANET is a collection of mobile nodes along with wireless
transmitter and receiver that with each other via a bi-directional links either directly or indirectly. A
new intrusion detection system named communicates Enhanced Adaptive Acknowledgment
(EAACK) specially designed for MANETs. It is based on the digital signature algorithm (DSA). To
enhance the security in the mobile adhoc networks, we introduce a new approach called Hybrid
cryptography algorithm that provides integrity, confidentiality and authentication. This hybrid
cryptography algorithm is based on two cryptography algorithms such as RSA and AES. Encryption is
achieved by using, RSA algorithm for authentication and symmetric algorithm for the integrity. By
using the symmetric and asymmetric cryptographic algorithm, we can achieve better security and
integrity than the EAACK
Hierarchical Key Agreement Protocol for Wireless Sensor Networksidescitation
Wireless sensor network promises ubiquitous data
collection and processing for variety of commercial, healthcare
and military applications. Practical realization of WSN
applications is possible only after assuring network security.
Cryptographic key distribution is an important phase in
network security which establishes initial trust in the network.
Security protocol implementation in WSN is limited by
resource constrained nature of sensor nodes. The key
distribution algorithm satisfying security requirements of
given WSN application should be implemented with minimum
communication and memory overhead. As a solution to this
problem, hierarchical key management technique is proposed
in this paper. Symmetric key pre-distribution technique with
less computational overhead and ID-based asymmetric key
(IBK) distribution technique with less communication
overhead are applied simultaneously in the network at
different levels. Resilience strength and resource overhead of
the proposed scheme is compared with both symmetric and
asymmetric techniques.
Guillou-quisquater protocol for user authentication based on zero knowledge p...TELKOMNIKA JOURNAL
Authentication is the act of confirming the validity of someone’s personal data. In the traditional
authentication system, username and password are sent to the server for verification. However, this
scheme is not secure, because the password can be sniffed. In addition, the server will keep the user’s
password for the authentication. This makes the system vulnerable when the database server is hacked.
Zero knowledge authentication allows server to authenticate user without knowing the user’s password. In
this research, this scheme was implemented with Guillou-Quisquater protocol. Two login mechanisms
were used: file-based certificate with key and local storage. Testing phase was carried out based on the
Open Web Application Security Project (OWASP) penetration testing scheme. Furthermore, penetration
testing was also performed by an expert based on Acunetix report. Three potential vulnerabilities were
found and risk estimation was calculated. According to OWASP risk rating, these vulnerabilities were at the
medium level.
A Lightweight Secure Scheme for Detecting Provenance Forgery and Packet Drop ...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
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.
A Key Management Approach For Wireless Sensor NetworksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
A Key Management Approach For Wireless Sensor NetworksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
Network Security Enhancement in WSN by Detecting Misbehavioural Activity as C...ijtsrd
This system proposes a centralized system for replica identification. The network is divided into segments and an inspection node is chosen for each segment. Inspection node identifies a clone node by checking the nodes ID and cryptographic key. In this process, Chord algorithm is used to detect the clone node, every node is assigned with random key, before it transmits the data it has to give its key which would be verified by the witness node. If same key is given by another node then the witness node identifies the cloned node. Here every node only needs to know the neighbor list containing all neighbor IDs and its location. In this scheme, Energy Efficient Clustering Protocol EECP protocol is used to implement different energy saving methods. Dr. B. R. Tapas Bapu | Hemavathi S U | Poonkuzhali K | Sweety J "Network Security Enhancement in WSN by Detecting Misbehavioural Activity as Copy Cat Nodes" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-4 , June 2020, URL: https://www.ijtsrd.com/papers/ijtsrd31257.pdf Paper Url :https://www.ijtsrd.com/engineering/computer-engineering/31257/network-security-enhancement-in-wsn-by-detecting-misbehavioural-activity-as-copy-cat-nodes/dr-b-r-tapas-bapu
A key management approach for wireless sensor networksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
Implementation of New Routing Protocol for Node Security in a Mobile Ad Hoc N...CSCJournals
A routing protocol plays important role to handle entire network for communication and determines the paths of packets. A node is a part of the defined network for transferring information in form of packets. If all packets transferred from source to destination successfully, it has been assumed that the routing protocol is good. But, an attacker turns this dealing as a speed breaker and turning point of a highway. So, prevention from attacks and secure packets, a new routing protocol is being introduced in this paper. The proposed routing protocol is called by SNAODV (Secure Node AODV). This paper is also tried to maximize throughput as compared with AODV and SAODV.
Advanced Data Protection and Key Organization Framework for Mobile Ad-Hoc Net...AM Publications,India
Key organization and protect routing are two major subjects for Mobile Ad-hoc Networks nonetheless preceding explanations tend to contemplate them distinctly. This indicates to Key organization and protects routing inters dependency cycle problem. In this paper, we recommend a Key organization and protection of routing integrated scheme that speeches Key organization and protection of routing inter dependency cycle problem. By using identity based cryptography this scheme delivers produced including confidentiality, honesty, verification, cleanness, and non-repudiation. Connected to symmetric cryptography and conventional asymmetric cryptography as well as preceding IBC arrangements, this arrangement has developments in many features. We deliver hypothetical resistant of the refuge of the scheme and validate the efficiency of the scheme with applied simulation.
Mitigating Various Attacks in Mobile Ad-hoc Networks Using Trust Based ApproachIJLT EMAS
A Mobile ad hoc network (MANET) is self-organizing,
decentralized and infrastructure-less wireless network. The
successful transmission of the data packet depends on the
complete cooperation of each node in the network. These types of
network don’t have permanent base station, so each node in the
network acts as a router. Due to openness, decentralized, selforganizing
nature of MANET, it is vulnerable to various attacks.
So security is the main concern in MANET.
In this project, we have considered 2 attacks; Vampire
attack and DDoS attacks. Vampire attack drains the energy of
the nodes. DDoS attack exhausts the resources available to a
network, such that the node cannot provide any services. Here,
we discuss methods 2 methods as a solution to our problem; one
is to prevent the attack from happening and other to detect and
recover from the attacks.
ANALYSIS OF SECURITY ASPECTS FOR DYNAMIC RESOURCE MANAGEMENT IN DISTRIBUTED S...ijcseit
Millions of people all over the world are now connected to the Internet for doing business. Therefore, the demand for Internet and web-based services continues to grow. So, need to install required infrastructure to balance the computing. In spite the success of new infrastructure, it is susceptible to several critical
malfunctions. Therefore, to guarantee the secure operations on Network and Data, several solutions need to be developed. The researchers are working in this direction to have the better solution for security. In distributed environment, at the time of management of resources both computing and networking,
resource allocation and resource utilization, etc, the security is most crucial problem. In this paper, an extensive review has been made on the different security aspect, different types of attack and techniques to sustain and block the attack in the distributed environment.
ANALYSIS OF SECURITY ASPECTS FOR DYNAMIC RESOURCE MANAGEMENT IN DISTRIBUTED S...ijcseit
Millions of people all over the world are now connected to the Internet for doing business. Therefore, the
demand for Internet and web-based services continues to grow. So, need to install required infrastructure
to balance the computing. In spite the success of new infrastructure, it is susceptible to several critical
malfunctions. Therefore, to guarantee the secure operations on Network and Data, several solutions need
to be developed. The researchers are working in this direction to have the better solution for security.
In distributed environment, at the time of management of resources both computing and networking,
resource allocation and resource utilization, etc, the security is most crucial problem. In this paper, an
extensive review has been made on the different security aspect, different types of attack and techniques to
sustain and block the attack in the distributed environment.
REVIEW ON KEY PREDISTRIBUTION SCHEMES IN WIRELESS SENSOR NETWORKSijassn
A wireless sensor network consist distributed sensors which are used to monitor physical or environmental conditions like temperature, sound, pressure and so on. Wireless sensor network are used in future in many applications like military, investigation teams, researches and so on. Security is the main issue in wireless sensor network. Sensor network arrange several types of data packets, packets of routing protocols and packets of key management protocols. Key management is the most effective method for providing better security against several types of attacks. This paper discusses the various key pre-distribution approaches along with their advantages and disadvantages.
Review on key predistribution schemes in wireless sensor networksijassn
A wireless sensor network consist distributed sensors which are used to monitor physical or environmental
conditions like temperature, sound, pressure and so on. Wireless sensor network are used in future in many
applications like military, investigation teams, researches and so on. Security is the main issue in wireless
sensor network. Sensor network arrange several types of data packets, packets of routing protocols and
packets of key management protocols. Key management is the most effective method for providing better
security against several types of attacks. This paper discusses the various key pre-distribution approaches
along with their advantages and disadvantages.
SHARED INFORMATION BASED SECURITY SOLUTION FOR MOBILE AD HOC NETWORKSijwmn
The mobile ad hoc networks get subjected to security threats like other wireless networks. But due to their
peer to peer approach and absence of infrastructural resources the mobile ad hoc networks can not use
strong cryptographic mechanisms as used by their other wireless counterparts. This led to the
development of trust based methods as security solutions wherein a trusted node is relaxed from security
checks when the trust value reaches to a particular limit. The trust methods are prone to security risks but
have found their acceptance due to efficiency over computationally expensive and time consuming
cryptographic methods. The major problem with the trust methods is the period during which trust is
growing and is yet to reach the requisite threshold. This paper proposes security mechanism dependent
upon Random Electronic Code Book (RECB) combined with permutation functions. The proposed
mechanism has low time complexity, is easier to implement, computationally inexpensive and has very
high brute force search value. It can be used as the temporary security guard during the trust growth
phase. The impetus behind the proposed design is the reliance upon shared information between the peers
in the ad hoc networks.
Secure dynamic source routing protocol for defending black hole attacks in mo...nooriasukmaningtyas
Wireless Ad Hoc Network is a dynamically organized network on emergency
situations, in which a group of wireless devices send data among themselves
without requiring any base stations for forwarding data. Here the nodes itself
perform the functions of routing. This important characteristic of mobile ad
hoc networks allows the hassle free set up of the network for
communications in different crisis such as battlefield and natural disaster
zones. Multi hop communication in MANET is achieved by the cooperation
of nodes in forwarding data packets. This feature of MANET is largely
exploited to launch a security attack called black hole attack. A light weight
solution called SEC-DSR is proposed to defend the network from black hole
attack and enables communication among nodes even in the presence of
attackers. In this scheme, by analyzing only the control packets used for
routing in the network, the compromised nodes launching the attack are
identified. From the collective judgment by the participating nodes in the
routing path, a secure route free of black hole nodes is selected for
communication by the host. Simulation results validate and ensure the
effectiveness of the proposed solution tested on an ad hoc network with
compromised black hole nodes.
A SECURE CLUSTER BASED COMMUNICATION IN WIRELESS NETWORK USING CRYPTOGRAPHIC ...IJNSA Journal
Mobile Adhoc Networks are becoming very popular in current Wireless Technology, which is been associated to business, socially and in some critical applications like Military etc, The network which is formed by self configuring wireless links which are connected to each other. These applications are categorized by hostile environment that they serve while communicating between nodes. However in such Wireless Network will be more exposed to different types of security attacks. The challenge is to meet secure network communication. In this paper we focus on cluster based secure communication to improve the reliability between clusters. In this scheme the Cluster Members (CM) submits a report to the Cluster Head (CH) and temporarily stores Evidences as a security tokens. The reports contain digital signatures. The CH will verify the consistency of the CM report and updates to Accounting Centre (AC). AC will verify the uniformity of reports and clears the cryptographic operations. For attacker nodes, the security tokens are requested to classify and expel the attacker nodes which submit wrong reports.
SRAAA – Secured Right Angled and Ant Search Hybrid Routing Protocol for MANETsAM Publications,India
— This paper is a contribution in the field of security analysis on mobile ad-hoc networks, and security requirements of applications. Limitations of the mobile nodes have been studied in order to design a secure routing protocol that thwarts different kinds of attacks. Our approach is based on the Right Angled and Ant Search Hybrid Routing Protocol (RAAA); the most popular hybrid routing protocol. The importance of the proposed solution lies in the fact that it ensures security as needed by providing a comprehensive architecture of secured Right Angled and Ant Search Hybrid Routing Protocol (SRAAA) based on efficient key management, secure neighbor discovery, secure routing packets, detection of malicious nodes, and preventing these nodes from destroying the network. In order to fulfill these objectives, both efficient key management and secure neighbor mechanisms have been designed to be performed prior to the functioning of the protocol. To validate the proposed solution, we use the network simulator NS-2 to test the performance of secure protocol and compare it with the conventional zone routing protocol over different number of factors that affect the network. Our results evidently show that our secure version paragons the conventional protocol in the packet delivery ratio while it has a tolerable increase in the routing overhead and average delay. Also, security analysis proves in details that the proposed protocol is robust enough to thwart all classes of ad-hoc attacks.
DESIGN AND IMPLEMENTATION OF A TRUST-AWARE ROUTING PROTOCOL FOR LARGE WSNSIJNSA Journal
The domain of Wireless Sensor Networks (WSNs) applications is increasing widely over the last few years. As this new type of networking is characterized by severely constrained node resources, limited network resources and the requirement to operate in an ad hoc manner, implementing security functionality to protect against adversary nodes becomes a challenging task. In this paper, we present a trust-aware, location-based routing protocol which protects the WSN against routing attacks, and also supports large-scale WSNs deployments. The proposed solution has been shown to efficiently detect and avoid malicious nodes and has been implemented in state-of-the-art sensor nodes for a real-life test-bed. This work focuses on the assessment of the implementation cost and on the lessons learned through the design, implementation and validation process.
Similar to New Security Threats and Protection Techniques in Mobile Ad Hoc Networks (20)
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
New Security Threats and Protection Techniques in Mobile Ad Hoc Networks
1. 1
New Security Threats and Protection Techniques in
Mobile Ad Hoc Networks
Srinivasan Venkataramani
Abstract—The security threats are critical in Mobile Ad
Hoc Networks (MANETs), when deploying secure applications
especially considering the confidentiality of the data that can be
compromised. In usual communication networks, there is a need
to establish ad hoc temporary connections in many scenarios.
Data transfer in this ad hoc wireless network is important
and it is not easy to establish the large infrastructure. When
data is highly confidential, then it is a challenging task to
provide security particularly in the malicious environment. Many
papers proposed various solutions as to counter-act internal
and external security attacks. However, most solutions have
certain trade-offs. There are some methods designed only to
counter-act specific attacks. Others provide solutions to counter-
act general attacks but consider the factors such as delay, high
resource utilization. This paper surveys many security solutions
that have been developed from in the past years. We present
the current approaches in the development of secured systems.
These methods can be used by simple approaches to enhance the
security with small complexity. To the best of our knowledge,there
is no other surveys that discusses the new secured methods in
the literature.
Index Terms—ecurity Threats, Mobile Ad Hoc Networksecu-
rity Threats, Mobile Ad Hoc NetworksS
I. INTRODUCTION
The development of smaller and more powerful mobile devices
enables mobile ad hoc networks (MANETs) to become one of the
fastest growing areas of research. As a new type of self-organizing
network combines wireless communication with high mobility,
they are unlike traditional wired networks and have no fixed
infrastructure (base stations, centralized management points,
etc.). The combination of nodes forms an any topology. This
make easy for many applications in military, where the network
topology may change rapidly to reflect a team’s movements,
and in disaster recovery operations, where the existing fixed
infrastructure may be disconnected. The ad hoc organization
makes them useful for virtual conferences, where setting up a
traditional network infrastructure is time-consuming. To make it
work in well-organized way, the discovery of shortest and least
congested routes in the varying topologies need to figure out first.
But here lies another problem that MANET uses the wireless
shared medium and where there is a shared medium there are
chances of interference, snooping and annihilation of information
as well as the network’s physical entities. So it raised the need
for data’s confidentiality and integrity before exchanging it in
the network and also the system’s physical security.
There are many other immense challenges and security re-
quirements which we need to contemplate before deploying
MANETs. Many researchers proposed their solutions [1], [2]
which provide excellent security but they require very complex
computations and consume a lot of resources like memory,
bandwidth etc. They have reduced the effect of various attacks
but still they are insufficient and become compromised in some
attacks [3], [4]. Other solutions [8], [24], [34], [35] are better
Easwari Engineering College, TamilNadu, India. Email: DrSrinivasan-
Venkataramani@gmail.com
in terms of providing some extent of quality of services (low
memory utilization, low bandwidth, low power etc.) but they
are also promising with certain type of attacks [24], [25]. This
has become a big tradeoff between choosing those secured
methods that consume a huge amount of resources (large mem-
ory, high bandwidth utilization and heavy processors for high
computations), and those methods that consume fewer resources
but are susceptible to various attacks. In this paper, we have
explored different approaches of those secured methods which
use a large number of resources and computations (encryption/
decryption/ digital signatures etc.) and those which uses simple
methods (trust/ observation/ reputation etc.). Then we surveyed
most common types of attacks and different solutions proposed
for their alleviation. Following we have summarized the secure
methods, their assertions, assumptions, metrics, positive and
negative aspects. We have tried to extract out the expedient
information from the reviewed papers and then finally we have
presented our outlooks on the various research areas that can
be defined and explored based on the problems we will discuss.
From this survey paper, researchers who are interested in the
area of security aspects of MANETs will have the distinct notion
about security issues and different approaches which can be used
for providing better security. Further study can be initiated from
a clear perspective of choosing which methods are appropriate
according to the area of interest.
II. SURVEY OF PROPOSED SOLUTIONS
Frequently changing wireless links in MANETs makes it sus-
ceptible to attack. Thus, the first step before sharing information
is to discover the most secured routes which can be only accessed
by the authorized users. Many protocols proposed claim their
approaches to be most secured. Security routing protocols can be
cryptographic based, trust based, observation based, reputation
based and others. In cryptographic based techniques [1], [5], [19],
asymmetric and symmetric keys are distributed among nodes
to protect the messages from being tampering and losing their
integrity. But encryption/decryption schemes are not suitable for
resource-constrained devices.
A. Trusted Certificate Server Approach
[19] proposed the use of a trusted certificate server to generate
cryptographic certificates for each node that wants to enter
into the network and a public key which is known to all legal
nodes. Keys are created and exchanged through an existing
relationship between server and each node. Before arriving in
to the network, each node must request a certificate from server.
Each node obtains exactly one certificate after securely verifying
their identity to server. All nodes must retain fresh certificates
with the trusted server. Using this certification, source verifies
that the intended target was reached. In this process, when a node
gets route discovery message, it sets up a reverse track back to the
source by recording the neighbor’s id from which it received the
route discovery message. The destination then uncast the route
reply message through that reverse track back to the source.
Each node in the track checks the previous node’s signature,
updates its routing table with the address of the node that send
it RDP packet, signs the original contents of the message, removes
2. 2
its certificate and signature and attaches its own certificate and
then forward the message. This is done to prevent alterations in
the route discovery packets in transit. Figure 1 shows its route
discovery mechanism.
B. Public/Private Key Approach
[1] proposed a protocol with each mobile node has a pub-
lic/private key pair which is certified from a certificate author-
ity. Every pair of source/destination has a shared secret key.
TESLA is used as an authentication protocol. To use TESLA
for authentication, each sender chooses a random initial key and
generates a one-way key chain by computing a oneway hash
function again and again. To authenticate any received value
on the one-way chain, an equation is applied to verify if the
computed value matches an earlier known authentic key on the
chain. Each sender predetermines a time schedule at which it
discloses each key of its one-way key chain, in the reverse order
from their creation. It is assumed that each node can obtain an
authentic TESLA key from the distribution center. Legitimate
keys are bootstrapped between pairs of nodes. Route discovery
process is initiated by key distribution centre with a special
reserved address as target. This address is not the address of
any real node. It then uses each returned path to send legitimate
keys to each node in the network. This process repeats when
a node requests a shared key with any other node and also to
KDC, in route reply that node sends the list of nodes for which
it requests keys. Before sending the packet, the sender adds a
message authentication code (MAC) computed using key. Since
the receiver knows the sender’s clock may be faster by 1, packet
is discarded if the key has already been published or unless it is
received at least 1 before the scheduled key release time. When
it is verified that the packet’s key is not yet published, receiver
buffers the packet and waits for the sender to publish key.
C. Node-capture Attack Detection
[34] provided two methods to detect the node capture: Simple
Distributed Detection (SDD) which uses local information on
nodes and Cooperative Distribution Detection (CDD) which uses
the local nodes cooperation. These two methods are based on the
simple observation that if a node (e.g. node A) does not re-meet
another node (e.g. node B) within a specific time then it is possible
that node B has been captured. This protocol uses random way-
point mobility model [35] and specifically trusts on the honest
node re-meeting time to collect overall information about the
presence of other nodes in network. The SDD is an event based
method. Each node set the corresponding meeting time to the
value of its internal clock and starts the corresponding time-out
that expires after k seconds. When two nodes meet, they execute
the method, SDD-Meeting. If it is received before the Maximum
Interval Time (MIT), then the counter for node B is reset to 1 and
if received after MIT, then the counter is incremented by 1. It is
to avoid false positive alarms. In CDD, nodes share information
only when cooperative nodes are present within the same range
of communication. It uses the same method trace used for SDD.
If two nodes e.g. node A and node B are tracing the third node
e.g. node C, then the two nodes compare their meeting time with
third node when they last met.
D. Forged Routing Messages Detection
[33] proposed Intrusion detection system based on OLSR
(optimized link state routing) protocol. This protocol tries to
thwart attack which is made by legitimate nodes present in
the network. It also works where cryptographic based solution
doesn’t work. It can be implemented on all nodes in the network.
Nodes continuously evaluate the semantics of routing message
and then act accordingly. When an intruder is spotted, alerts are
signaled and they are banned. It checks before taking its decision-
is untrusted node an intruder or not? And accordingly implies
a low false positive rate. It focuses on detection of generation
of fake topology control (TC) messages because they can create
confusions in the whole network if disseminated. When a node
receives a TC message, according to its local topology statistics, it
checks if the initiator of this TC message is 1-hop distance from
the common announced MPR selector node or if the common
announced MPR selector node had actually nominated the TC
originator node as MPR and then assigns one of the three statuses
(normal, suspected or intruder) to its originator. After updating
its topology table, receiver then forwards its TC message.
E. Misbehaving Watchdog
[8] explain that Watchdog recognizes misbehaving nodes and
a Pathrater supports the routing protocols to avoid these nodes.
It is supposed that all routing nodes do not misbehave. When
a node forwards the packet, Watchdog promiscuously listens
in the network and confirms that the next node in the path
also forwards the packet. If the next node does not forward
the packet, then it is confirmed as misbehaving. By using this
information, Pathrater selects which route is best to deliver the
packets. They have implemented the watchdog by maintaining a
buffer of newly sent packets and compare each listened packet
with the packet stored in the buffer to see if there is a match.
There is certain failure threshold, if it is excesses, then the node
is determined to be misbehaving and source is notified about it.
Pathrater calculates the negative value path metric to indicate
the presence of suspected nodes in the path. The nodes having
negative ratings are suspended for some time until their ratings
are increased to nonnegative values. Pathrater uses Send extra
Route Request (SRR) to find a new routes if the well-known
route holds only misbehaving nodes.
F. Route Request Packet Approach
[32] explain that security mechanism is made into the route
request packets. Sender sends route request packets with some
metric based on its security and authenticity. On receiving this
packet, Intermediate nodes check this packet’s security level.
If they find it authentic, they forward or reply accordingly
otherwise drop it. After discovering the secured route by testing
the required security metric on each intermediate node, route
reply message is sent back by the receiver node. In this protocol,
packets are encrypted using a symmetric encryption/decryption
key which is generated with respect to different trust levels. Nodes
can only read the route request packets or route reply packets of
their trust level. Moreover the floating packets of higher or lower
trust level are supposed to be dropped if they are interrupted by a
malicious node because node filters packets that belong to its trust
level. So this mechanism of broadcasting the routing packets by
confirming their trust levels can help in the discovery of attacks
by eavesdroppers. It also offers some cryptographic techniques
like digital signatures and encryption to check alteration. This
protocol finds the assured secured route between two nodes.
G. Redundant Routing Message Approach
[30] proposed protocol that uses redundant copies of routing
messages to spot internal attacks. Pair wise secret keys are used
between source and destination and intermediate nodes along
the established path to protect route discovery messages. Also
based on the observations, the node builds the trust on its
neighboring nodes by creating a local Certificate Repository. It
is assumed that each node in the network is initialized with a
unique address and pair of public/private keys embedded into it.
Also they can form a self-organized Public Key Infrastructure
by relating the current CR and present maintenance methods for
public key management. When a node starts a route discovery
process, it chooses a random number, signs it with its private
3. 3
key and uses key hash function to protect the route discovery
message. Finally, the signature and key hash value is appended
to the route discovery message which is sent to its neighbors
hop by hop until it gets reached to target. To choose a more
optimal path, if two nodes show same level of trust, then hop
counts are measured, if hop counts are also same then their
performance is checked. When receiver (intermediate) gets route
request message, it computes the trustworthiness quality index
(TQI) and appends it to the route request message along with
QoS information before forwarding to next hop.
H. Reputation Approach
[43] proposed protocol that uses reputation based scheme. The
protocol observes the behavior of other nodes and rates each node
accordingly. Rating is first set to zero, which increments by +1
on every positive action and decrements by -2 on every negative
action. Negative threshold is set to -40 below which the node
is added to a list of faulty nodes. The source node forwards
the data packets to the highest reputation node. Intermediate
nodes also forward the data packet to the highest reputation
hop till it reaches to the destination node. The destination node
acknowledges a signed DACK (data Acknowledgment packet)
to the source that modifies its reputation values table by rec-
ommending +1 to the first hop of reverse route. Subsequently
all the intermediate nodes in the route recommends +1 to their
corresponding next hop in the route. Each node stores a Route
Ranker Table to store the reputation values of each node based
on its direct observations on that node. If two next-hop nodes
have the same reputation values then randomly anyone is chosen
by the source node and that information is also stored in sent-
table. If DACK is not received by source node in specified time
set by source’s timer, it recommends -2 to the first hop of that
route and removes its entry from the sent-table after the time-out
expires. Intermediate nodes also recommend -2 to their next hop
in the route up to that selfish node who dropped the packet and
removes the corresponding entries from their tables on time-out
expire. If the reputation value of the next hop falls below -40
(threshold value) then it is temporally suspended from the node’s
routing table and an error message is sent to the upcoming nodes
in its path. Later this suspended node can re-join the network
with the reputation value initialized to zero. This process aims
to prevent selfish nodes from dropping packets because source
nodes only choose the nodes with higher reputation values to
forward their data packets and selfish nodes need to maintain
their reputation constant in order to receive the packets.
I. Firewalls
[39] focus on attack which tries to drain the battery of nodes
in the network. This scheme is based on ROFL (Routing as
the Firewall Layer) mechanism [40] and sets some constraints
on the network nodes and the services provided to these nodes.
When a service is advertisement to some particular network,
only nodes of that particular network can access that service.
They cannot access services which are not advertised for them.
Before passing any service announcement to a node, the node
is first been checked that whether it is authorized to access or
not. To stop the advertised service, the routing metric M is set
to infinity, and then this infinity route is advertised. Destination
address provides services to only those nodes that come under
the list of approved source prefixes. Immediately, the packet
is dropped if it is forwarded from a source address which is
not listed in the source prefix filtering (SPF) constraints of a
corresponding route. This packet filtering is applied by layering
it on top of routing. Underlying routing protocol provides the
pattern (i.e. unicast, multicast or broadcast) for distributing
routing information. Once a path between source and destination
node is created by underlying routing protocol, each node in
that path refers to its local routing table to match the routing
announcement and if the same matched announcement is found,
then its source prefix constraint is extracted i.e. data packet’s
header contents (source, destination address and destination port
number) and checked before the receiver takes its forwarding
decision. If it is forwarded from an authorized node, then it is
passed to upper layer otherwise it is discarded. To implement this
scheme in AODV, only route reply packet’s information of AODV
is replaced with service specific announcement (SPF constraints,
destination port address, service port address etc.). And then this
route announcement is distributed into the network on getting
route request and in case of OLSR, these announcements are
distributed by flooding Topology Control (TC) messages into the
network.
J. Double-layer Transport Layer
[42] used double-layer scheme that detects attacks at the
transport layer but responds to them at the network layer. It
implements four modules. First is watch nodes (LS) module
that monitors and detect misbehavior nodes, second is node
isolation algorithm (NIA) that isolates the infected nodes from
the honest node’s list. Third is congestion window surveillance
(CWS) module that verifies if the node has fault or compromised
because CW size may be increased due to congestion in network.
Last is alternate route finder (ARF) module. If CWS sees any
abnormalities, it calls ARF to find or build a new path. LS module
builds a list that contains each node’s first-hop neighbors and
neighbors of each first hop’s neighbor in the end of neighbor
discovery process. This is created to first monitor the presence
of any malicious nodes and later isolate them from the network
using NIA. This process is assumed to be secure and it is done
only once in the whole life span of a node. There is no exchange
of packets between the nodes which are not neighbors. The node
maintains information of its second-hop neighbor to verify if
a received packet forwarded from its one hop neighbor has
actually forwarded from its second hop neighbor or not. A watch
buffer and a malicious counter are maintained in the each node
to monitor the packets exchanged between its neighbors. Each
entry in the buffer is time stamped and has a time threshold.
Malicious counter monitors the length of sliding window and it
increments for the node which is detected as malicious by the
watch node. These increments depend upon the type i.e. either
the packet is fabricated or dropped by the malicious node. To
avoid failures (intentionally or by fault) caused by a legitimate
node, a node is declared as a misbehavior node and revoked
from its neighbor’s list, if its malicious counter exceeds threshold.
It is done by announcing an authenticated alert message to
each of its neighbors using shared keys to prevent from false
announcements.
III. FUTURE RESEARCH DIRECTIONS
The flexibility of MANETs are very attractive for military
and disaster recovery applications. Moreover mobile devices are
getting smaller, cheaper, more powerful and more mobile every
day. In the future MANETs will likely be a part of our lives.
There has been much research on this promising new networking.
Security is one of the hot topics in the area due to new security
threats MANETs have introduced. The threats to MANETs have
been examined in many research papers. However more research
needs to be done on identifying new security threats. We believe
that with the increase in the use of MANETs, new intrusions are
going to emerge continuously.
MANETs are prone to attacks from the intruders. Different
security mechanisms have been proposed in the past to provide
security in MANETs. In this paper we have tried to compare the
advantages and drawbacks of several approaches. The purpose of
doing so is to provide a guideline towards development of a secure
routing protocol and the conditions that make the environment so
4. 4
prone to attacks. So in future maintaining rate of node’s mobility
and topologies in the network is required. Also distributing use
of batteries and other power resources and eliminating tradeoffs
between rate of battery consumption and updating nodes due to
frequent topological changes is also required. Some other factors
also should be taken into account like distribution and use of
available bandwidth, providing physical safety to the network
bodies, increasing size of network, signal fading and jittering
due to large number of multi hops and setting up of minimum
and maximum rate of transmission power, eliminating tradeoffs
between packet delivery and time delay, eliminating tradeoffs
between bandwidth capacity and congestion and distributing
authorized access to every node in the network.
The methodology or the protocol which is to be developed
should also take care of the other aspects of the network which
are very important as far as providing security or avoiding
threats are concerned. These are provision of security in all
seven layers of OSI, detecting number of malicious nodes and
formulating malicious activities in the network, Maintaining
traffic rate of control/data packets according to the type of traffic
(Constant Bit Rate or Varying) and setting up the minimum-
maximum rate, routing load balancing, Medium Access Control
methods for channel contention, reducing tradeoffs between
application aspects and security aspects, focusing maximum
route availabilities and finding shortest route from them and
maintaining periodic routing table information proactively and
reactively.
REFERENCES
[1] Y.C. HU, A. Perrig, and D. B. Johnson, “ARIADNE: a secure on-
demand routing protocol for ad hoc networks,” in Proc. MOBICOM,
2002, pp. 12-23.
[2] P. Papadimitratos and Z. Haas, “Secure routing for mobile ad hoc
networks,” in Proc. CNDS, 2002.
[3] Y.-C. HU, A. Perrig, and D.B. Johnson, “PACKET LEASHES: a
defense against wormhole attacks in wireless networks,” in Proc.
INFOCOM, 2003, pp.1976-1986.
[4] Y.-C. HU, A. Perrig, and D. B. Johnson, “Rushing attacks and defense
in wireless ad hoc network routing protocols,” in Proc. WISE, 2003,
pp. 30-40.
[5] D. Liu and P. Ning, “Efficient distribution of key chain commitments
for broadcast authentication in distributed sensor networks,” in Proc.
NDSS, 2003, pp. 263-276.
[6] B. Awerbuch, D. Holser, C. Nita-rotaru, and H. Rubens, “An On
demand secure routing protocol resilient to byzantine failures,” in
Proc. WISE, 2002, pp. 21-30.
[7] S. Buchegger and J.Y. Le boudec, “Nodes bearing grudges: towards
routing security, fairness, and robustness in mobile ad hoc networks,”
in Proc. PDP, 2002, pp. 403-410.
[8] S. Marti, T. Giuli, k. Lai, and M. Baker, “Mitigating routing
misbehavior in mobile ad hoc networks,” in Proc. MOBICOM, 2000,
pp. 255-265.
[9] W. Yu, Y. Sun, and K. J. R. Liu, “Hadof: defense against routing
disruptions in mobile ad hoc networks,” in Proc. INFOCOM, 2005,
pp. 1252-1261.
[10] Pradip M. Jawandhiya, Mangesh Ghonge, M.S. Ali and J.S. Desh-
pande, “A Survey of Mobile Ad Hoc Network Attacks“, IJEST, 2010,
pp. 4063-4071.
[11] L.Tamilselvan, V.Sankaranarayanan, “Prevention of Black hole
Attack in MANET,” Proc. AusWireless, 2007, pp. 21- 26.
[12] S.Lee, B.Han, and M.Shin, “Robust Routing in Wireless Ad Hoc
Networks,” ICPP Workshop, 2002, pp. 73-78.
[13] M.A.Shurman, S.M.Yoo, and S.Park, “Black Hole Attack in Mobile
Ad Hoc Networks,” ACM SE, 2004, pp. 96-97.
[14] S.Kurosawa, H.Nakayama, N.Kato, A.Jamalipour, and Y.Nemoto,
“Detecting Black hole Attack on AODV-Based Mobile Ad Hoc
Networks by Dynamic Learning Method,” IJNS, 2007, pp. 338-346.
[15] Y.C.Hu, A.Perrig, and D.Johnson, “Wormhole Attacks in Wireless
Networks,” IEEE JSAC, 2006, pp. 370-380.
[16] L. Qian, N. Song, and X. Li, “Detecting and Locating Wormhole
Attacks in Wireless Ad Hoc Networks Through Statistical Analysis
of Multi-path,” IEEE WCNC, 2005, pp.2106-2111.
[17] X.Su, R.V.Boppana, “On Mitigating In-band Wormhole Attacks in
Mobile Ad Hoc Networks,” Proc. ICC, 2007, pp. 1136-1141.
[18] M.A.Gorlatova, P.C.Mason, M.Wang, L.Lamont, R. Liscano, “De-
tecting Wormhole Attacks in Mobile Ad Hoc Networks through
Protocol Breaking and Packet Timing Analysis,” Proc. MILCOM,
2006, pp. 1-7.
[19] K. Sanzgiri, D. LaFlamme, B. Dahill, B. N. Levine, C. Shields
and E. M. Belding-Royer, “A Secure Routing Protocol for Ad Hoc
Networks,” in Proc. ICNP , 2002, pp. 78-87.
[20] W. Yu, Y. Sun, and K. J. R. Liu, “Hadof: defense against routing
disruptions in mobile ad hoc networks,” in Proc. INFOCOM, 2005,
pp. 1252-1261.
[21] Joshua Wright, GCIH, CCNA, 2003, Detecting wireless LAN MAC
addresses spoofing, technical document.
[22] Gayathri Chandrasekaran, John-Austen Deymious,Vinod Ganapa-
thy, Marco Gruteser, Wade Trappe, “Detecting Identity Spoofs in
802.11e Wireless Networks“, In Proc. GLOBECOM, 2009, pp.4244-
4147.
[23] S. Murphy, “Routing Protocol Threat Analysis,” Internet Draft,
draft-murphy-threat-00.txt, 2002.
[24] J. F. Raymond, “Traffic Analysis: Protocols, Attacks, Design Issues
and Open Problems,” in Proc. Wksp. Design Issues in Anonymity
and Unobservability, Berkeley, CA, 2000, pp. 7-26.
[25] J. Hubaux and E. W. Knightly, “Denial of service resilience in ad
hoc networks,” in Proc. MOBICOM, 2004, pp. 202-215.
[26] Lin, R.Lu, H.Zhu, P.H.Ho, X.Shen and Z.Cao, “ASRPAKE: An
Anonymous Secure Routing Protocol with Authenticated Key Ex-
change for Wireless Ad Hoc Networks,” in Proc. ICC, 2007, pp.
1247 - 1253.
[27] Kejun Liu, Jing Deng, Member, Pramod K. Varshney and Kashyap
Balakrishnan,”An Acknowledgment-Based Approach for the Detec-
tion of Routing Misbehavior in MANETs“, IEEE TMC, 2007.
[28] C. Kaufman, R. Perlman, and M. Speciner, “Network Security
Private Communication in a Public World“, Prentice Hall PTR, A
division of Pearson Education, Inc., 2002.
[29] Ming Yu , Mengchu Zhou and Wei Su , “A Secure Routing
Protocol Against Byzantine Attacks for MANETs in Adversarial
Environments“,in Proc. IEEE Vehicular Technology Society, 2009
pp. 449 - 460.
[30] S. Albert Rabara and S.Vijayalakshmi, “Rushing attack mitigation
in multicast manet (RAM3)“, in Proc, IJRRCS, 2010, pp. 131-138.
[31] Xu Su, Dissertation, “Integrated prevention and detection of Byzan-
tine attacks in mobile ad hoc networks“, University of Texas at San
Antonio, 2009.
[32] S. Yi, P. Naldurg, and R. Kravets, “A Security-Aware Routing
Protocol for Wireless Ad hoc Networks“, in Proc. MOBIHOC, 2002
pp. 286-292.
[33] A. Fourati; K. Al Agha, “Detecting forged routing messages in
Adhoc networks“, Springer published on nov, 2008, pp.205 - 214.
[34] M. Conti, R. Di Pietro, L. V. Mancini, and A. Mei, “Emergent
properties: Detection of the node-capture attack in mobile wireless
sensor networks“, ACM WiSec, 2008 pages 214-219.
[35] J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. Jetcheva.
“A performance comparison of multi-hop wireless ad hoc network
routing protocols“ in Proc. MOBICOM, 1998, pages 85-97.
[36] S. Ganeriwal, S. Capkun, C. C. Han and M. B. Srivastava. Secure
time synchronization service for sensor networks. In WiSe, 2005,
pages 97-106.
[37] K. Sun, P. Ning, and C. Wang, “Fault-tolerant cluster-wise clock
synchronization for wireless sensor networks“ TDSC, 2005, pg.177-
189.
[38] S. Bansal and M.Baker,” Observation-based Cooperation Enforce-
ment in ad hoc network“, July 2003.
[39] H. Zhao and S. M. Bellovin, “High Performance Firewalls in
MANETs“ Proc. MSN, 2010 pages 154-160.
[40] H. Zhao, C.-K. Chau, and S. M. Bellovin, “ROFL: Routing as the
firewall layer,” in New Security Paradigms Workshop, September
2008.
[41] T. Eissa; S. A. Razak; R. H. Khokhar; N. Samian, “Trust-
Based Routing Mechanism in MANET: Design and Implementation“,
Springer, Mobile Networks and Applications June 2011.
[42] H. N. Saha, D. Bhattacharyya, A. K. Bandhyopadhyay and P. K.
Banerjee, “Two-Level Secure Re-routing (TSR) in Mobile Ad Hoc
Networks“ Proc. MNCAPPS, 2012 Pages 119-122.