This document summarizes techniques for securing mobile ad hoc networks (MANETs) against security threats. It discusses cryptographic approaches using keys, a trusted certificate server approach, and node-capture attack detection methods. Cryptographic solutions use encryption but are resource-intensive, while other approaches use trust, observation or reputation but are still vulnerable to some attacks. The document surveys these security methods, outlining their capabilities and limitations to provide researchers an overview of the challenges and potential solutions in securing MANETs.
Anew approach to broadcast in wormhole routed three-dimensional networks is proposed. One of the most
important process in communication and parallel computer is broadcast approach.. The approach of this
case of Broadcasting is to send the message from one source to all destinations in the network which
corresponds to one-to-all communication. Wormhole routing is a fundamental routing mechanism in
modern parallel computers which is characterized with low communication latency. We show how to apply
this approach to 3-D meshes. Wormhole routing is divided the packets into set of FLITS (flow control
digits). The first Flit of the packet (Header Flit) is containing the destination address and all subsets flits
will follow the routing way of the header Flit. In this paper, we consider an efficient algorithm for
broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. We introduce an efficient
algorithm, Y-Hamiltonian Layers Broadcast(Y-HLB). In this paper the behaviors of this algorithm were
compared to the previous results, our paradigm reduces broadcast latency and is simpler. In this paper our
simulation results show the average of our proposed algorithm over the other algorithms that presented.
USING A DEEP UNDERSTANDING OF NETWORK ACTIVITIES FOR SECURITY EVENT MANAGEMENTIJNSA Journal
With the growing deployment of host-based and network-based intrusion detection systems in increasingly
large and complex communication networks, managing low-level alerts from these systems becomes
critically important. Probes of multiple distributed firewalls (FWs), intrusion detection systems (IDSs) or
intrusion prevention systems (IPSs) are collected throughout a monitored network such that large series of
alerts (alert streams) need to be fused. An alert indicates an abnormal behavior, which could potentially be
a sign for an ongoing cyber attack. Unfortunately, in a real data communication network, administrators
cannot manage the large number of alerts occurring per second, in particular since most alerts are false
positives. Hence, an emerging track of security research has focused on alert correlation to better identify
true positive and false positive. To achieve this goal we introduce Mission Oriented Network Analysis
(MONA). This method builds on data correlation to derive network dependencies and manage security
events by linking incoming alerts to network dependencies.
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.
A Framework for Secure Computations with Two Non-Colluding Servers and Multip...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
Anew approach to broadcast in wormhole routed three-dimensional networks is proposed. One of the most
important process in communication and parallel computer is broadcast approach.. The approach of this
case of Broadcasting is to send the message from one source to all destinations in the network which
corresponds to one-to-all communication. Wormhole routing is a fundamental routing mechanism in
modern parallel computers which is characterized with low communication latency. We show how to apply
this approach to 3-D meshes. Wormhole routing is divided the packets into set of FLITS (flow control
digits). The first Flit of the packet (Header Flit) is containing the destination address and all subsets flits
will follow the routing way of the header Flit. In this paper, we consider an efficient algorithm for
broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. We introduce an efficient
algorithm, Y-Hamiltonian Layers Broadcast(Y-HLB). In this paper the behaviors of this algorithm were
compared to the previous results, our paradigm reduces broadcast latency and is simpler. In this paper our
simulation results show the average of our proposed algorithm over the other algorithms that presented.
USING A DEEP UNDERSTANDING OF NETWORK ACTIVITIES FOR SECURITY EVENT MANAGEMENTIJNSA Journal
With the growing deployment of host-based and network-based intrusion detection systems in increasingly
large and complex communication networks, managing low-level alerts from these systems becomes
critically important. Probes of multiple distributed firewalls (FWs), intrusion detection systems (IDSs) or
intrusion prevention systems (IPSs) are collected throughout a monitored network such that large series of
alerts (alert streams) need to be fused. An alert indicates an abnormal behavior, which could potentially be
a sign for an ongoing cyber attack. Unfortunately, in a real data communication network, administrators
cannot manage the large number of alerts occurring per second, in particular since most alerts are false
positives. Hence, an emerging track of security research has focused on alert correlation to better identify
true positive and false positive. To achieve this goal we introduce Mission Oriented Network Analysis
(MONA). This method builds on data correlation to derive network dependencies and manage security
events by linking incoming alerts to network dependencies.
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.
A Framework for Secure Computations with Two Non-Colluding Servers and Multip...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
AUTHENTICATION USING TRUST TO DETECT MISBEHAVING NODES IN MOBILE AD HOC NETWO...IJNSA Journal
Providing security in Mobile Ad Hoc Network is crucial problem due to its open shared wireless medium,
multi-hop and dynamic nature, constrained resources, lack of administration and cooperation.
Traditionally routing protocols are designed to cope with routing operation but in practice they may be
affected by misbehaving nodes so that they try to disturb the normal routing operations by launching
different attacks with the intention to minimize or collapse the overall network performance. Therefore
detecting a trusted node means ensuring authentication and securing routing can be expected. In this
article we have proposed a Trust and Q-learning based Security (TQS) model to detect the misbehaving
nodes over Ad Hoc On Demand Distance-Vector (AODV) routing protocol. Here we avoid the misbehaving
nodes by calculating an aggregated reward, based on the Q-learning mechanism by using their historical
forwarding and responding behaviour by the way misbehaving nodes can be isolated.
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.
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.
Performance and Simulation Study of TheProposed Direct, Indirect Trust Distri...cseij
ABSTRACT
In this paper, we propose a routing protocol that is based on securing the routing information from
unauthorized users. Even though routing protocols of this category are already proposed, they are not
efficient, in the sense that, they use the same kind of encryption algorithms (mostly high level) for every
Bit of routing information they pass from one intermediate node to another in the routing path. The
proposed mechanism is evaluated against selected alternative trust schemes, with the results showing that
our proposal achieves its goals.Our research aims at providing a secure and distributed
authentication service in the ad hoc networks.
A SYMMETRIC TOKEN ROUTING FOR SECURED COMMUNICATION OF MANET cscpconf
The communication should be much secured in Mobile Adhoc Networks in the
protective environment such as Military atmosphere and in a disaster relief. Due to the attackers,
Mobile Adhoc Networks resulting in denial of Service attacks modify packets, Error packets,
Missing Packets, Theft of Nodes, etc. To overcome this problem, We propose a new Symmetric
Token Routing Protocol (STRP) for mobile ad hoc networks provides much security against
MANET. The proposed protocol distributed a secured shared symmetric token for each node to
provide security against hackers and attackers. Simulation results shows the better delivery against
the existing protocol in MANET.
Secure and efficient handover authentication and detection of spoofing attackeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Authentic Data Access Scheme for Variant Disruption- Tolerant NetworksEditor IJCATR
Mobile nodes in military environments such as a battlefield or a hostile region are likely to suffer from intermittent network
connectivity and frequent partitions. Disruption-tolerant network (DTN) technologies are becoming successful solutions that allow
wireless devices carried by soldiers to communicate with each other and access the confidential information or command reliably by
exploiting external storage nodes. However, the problem of applying CP-ABE in decentralized DTNs introduces several security and
privacy challenges with regard to the attribute revocation, key escrow, and coordination of attributes issued from different authorities.
In this paper, we propose a secure data retrieval scheme using CP-ABE for decentralized DTNs where multiple key authorities manage
their attributes independently. We demonstrate how to apply the proposed mechanism to securely and efficiently manage the
confidential data distributed in the disruption-tolerant military network. Since some users may change their associated attributes at
some point (for example, moving their region), or some private keys might be compromised, key revocation (or update) for each
attribute is necessary in order to make systems secure. This implies that revocation of any attribute or any single user in an attribute
group would affect the other users in the group. It may result in bottleneck during rekeying procedure, or security degradation due to
the windows of vulnerability if the previous attribute key is not updated immediately.
A Novel Multipoint Relay based Secure Routing in MANETIJNSA Journal
Security in routing is a challenging issue in mobile ad-hoc (MANET) network because of its open nature, infrastructure less property, mobility and energy constraints. Messages typically roam in multi-hopped fashion and nodes may be powered by limited energy source and with limited physical security. So we proposed a new scheme which is significantly different from others available schemes to provide security during routing in mobile ad hoc networks. In this paper, our proposed scheme, Secure Multipoint Relay based Routing in MANET (SMRR) provides routing based on trust, which is an integer value that helps to select Multipoint Relay (administrator) inside the network for routing. We have also implemented the message confidentiality and integrity in our proposed scheme. Our simulation results show the robustness, reliability and trustworthiness of our scheme.
5 ijaems jan-2016-16-survey on encryption techniques in delay and disruption ...INFOGAIN PUBLICATION
Delay and disruption tolerant network (DTN) is used for long area communication in computer network, where there is no direct connection between the sender and receiver and there was no internet facility. Delay tolerant network generally perform store and forward techniques as a result intermediate node can view the message, the possible solution is using encryption techniques to protect the message. Starting stages of DTN RSA, DES, 3DES encryption algorithms are used but now a day’s attribute based encryption (ABE) techniques are used. Attribute based encryption technique can be classified in to two, key policy attribute based encryption (KPABE) and cipher policy attribute based encryption (CPABE). In this paper we perform a categorized survey on different encryption techniques presents in delay tolerant networks. This categorized survey is very helpful for researchers to propose modified encryption techniques. Finally the paper compares the performance and effectiveness of different encryption algorithms.
LSR PROTOCOL BASED ON NODES POTENTIALITY IN TRUST AND RESIDUAL ENERGY FOR WSNSIJNSA Journal
In Wireless Sensor Networks (WSNs), all the nodes selected for packet routing must be trustworthy, and at the same time energetic too. Smooth conservation of nodes energies and the trust levels, are an important issues in WSN because they directly affects the life span and reliability of the nodes as well as the entire network. The energy utilization at every node must be very smooth and at the same time, packets should be forwarded via trusted nodes only. In this paper, we propose an Energy Efficient Link State Routing Protocol (EELSRP) using the potential nodes selected by applying the fuzzy logic on the trust and residual energy levels. This routing protocol finds the best route by balancing the nodesresidual energies and trust levels, and protects the WSN against routing attacks by eliminating the untrusted nodes before the creation of route.
MEKDA: Multi-Level ECC based Key Distribution and Authentication in Internet ...IJCNCJournal
The Internet of Things (IoT) is an extensive system of networks and connected devices with minimal human interaction and swift growth. The constraints of the System and limitations of Devices pose several challenges, including security; hence billions of devices must protect from attacks and compromises. The resource-constrained nature of IoT devices amplifies security challenges. Thus standard data communication and security measures are inefficient in the IoT environment. The ubiquity of IoT devices and their deployment in sensitive applications increase the vulnerability of any security breaches to risk lives. Hence, IoT-related security challenges are of great concern. Authentication is the solution to the vulnerability of a malicious device in the IoT environment. The proposed Multi-level Elliptic Curve Cryptography based Key Distribution and Authentication in IoT enhances the security by Multi-level Authentication when the devices enter or exit the Cluster in an IoT system. The decreased Computation Time and Energy Consumption by generating and distributing Keys using Elliptic Curve Cryptography extends the availability of the IoT devices. The Performance analysis shows the improvement over the Fast Authentication and Data Transfer method.
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.
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.
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.
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.
AUTHENTICATION USING TRUST TO DETECT MISBEHAVING NODES IN MOBILE AD HOC NETWO...IJNSA Journal
Providing security in Mobile Ad Hoc Network is crucial problem due to its open shared wireless medium,
multi-hop and dynamic nature, constrained resources, lack of administration and cooperation.
Traditionally routing protocols are designed to cope with routing operation but in practice they may be
affected by misbehaving nodes so that they try to disturb the normal routing operations by launching
different attacks with the intention to minimize or collapse the overall network performance. Therefore
detecting a trusted node means ensuring authentication and securing routing can be expected. In this
article we have proposed a Trust and Q-learning based Security (TQS) model to detect the misbehaving
nodes over Ad Hoc On Demand Distance-Vector (AODV) routing protocol. Here we avoid the misbehaving
nodes by calculating an aggregated reward, based on the Q-learning mechanism by using their historical
forwarding and responding behaviour by the way misbehaving nodes can be isolated.
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.
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.
Performance and Simulation Study of TheProposed Direct, Indirect Trust Distri...cseij
ABSTRACT
In this paper, we propose a routing protocol that is based on securing the routing information from
unauthorized users. Even though routing protocols of this category are already proposed, they are not
efficient, in the sense that, they use the same kind of encryption algorithms (mostly high level) for every
Bit of routing information they pass from one intermediate node to another in the routing path. The
proposed mechanism is evaluated against selected alternative trust schemes, with the results showing that
our proposal achieves its goals.Our research aims at providing a secure and distributed
authentication service in the ad hoc networks.
A SYMMETRIC TOKEN ROUTING FOR SECURED COMMUNICATION OF MANET cscpconf
The communication should be much secured in Mobile Adhoc Networks in the
protective environment such as Military atmosphere and in a disaster relief. Due to the attackers,
Mobile Adhoc Networks resulting in denial of Service attacks modify packets, Error packets,
Missing Packets, Theft of Nodes, etc. To overcome this problem, We propose a new Symmetric
Token Routing Protocol (STRP) for mobile ad hoc networks provides much security against
MANET. The proposed protocol distributed a secured shared symmetric token for each node to
provide security against hackers and attackers. Simulation results shows the better delivery against
the existing protocol in MANET.
Secure and efficient handover authentication and detection of spoofing attackeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Authentic Data Access Scheme for Variant Disruption- Tolerant NetworksEditor IJCATR
Mobile nodes in military environments such as a battlefield or a hostile region are likely to suffer from intermittent network
connectivity and frequent partitions. Disruption-tolerant network (DTN) technologies are becoming successful solutions that allow
wireless devices carried by soldiers to communicate with each other and access the confidential information or command reliably by
exploiting external storage nodes. However, the problem of applying CP-ABE in decentralized DTNs introduces several security and
privacy challenges with regard to the attribute revocation, key escrow, and coordination of attributes issued from different authorities.
In this paper, we propose a secure data retrieval scheme using CP-ABE for decentralized DTNs where multiple key authorities manage
their attributes independently. We demonstrate how to apply the proposed mechanism to securely and efficiently manage the
confidential data distributed in the disruption-tolerant military network. Since some users may change their associated attributes at
some point (for example, moving their region), or some private keys might be compromised, key revocation (or update) for each
attribute is necessary in order to make systems secure. This implies that revocation of any attribute or any single user in an attribute
group would affect the other users in the group. It may result in bottleneck during rekeying procedure, or security degradation due to
the windows of vulnerability if the previous attribute key is not updated immediately.
A Novel Multipoint Relay based Secure Routing in MANETIJNSA Journal
Security in routing is a challenging issue in mobile ad-hoc (MANET) network because of its open nature, infrastructure less property, mobility and energy constraints. Messages typically roam in multi-hopped fashion and nodes may be powered by limited energy source and with limited physical security. So we proposed a new scheme which is significantly different from others available schemes to provide security during routing in mobile ad hoc networks. In this paper, our proposed scheme, Secure Multipoint Relay based Routing in MANET (SMRR) provides routing based on trust, which is an integer value that helps to select Multipoint Relay (administrator) inside the network for routing. We have also implemented the message confidentiality and integrity in our proposed scheme. Our simulation results show the robustness, reliability and trustworthiness of our scheme.
5 ijaems jan-2016-16-survey on encryption techniques in delay and disruption ...INFOGAIN PUBLICATION
Delay and disruption tolerant network (DTN) is used for long area communication in computer network, where there is no direct connection between the sender and receiver and there was no internet facility. Delay tolerant network generally perform store and forward techniques as a result intermediate node can view the message, the possible solution is using encryption techniques to protect the message. Starting stages of DTN RSA, DES, 3DES encryption algorithms are used but now a day’s attribute based encryption (ABE) techniques are used. Attribute based encryption technique can be classified in to two, key policy attribute based encryption (KPABE) and cipher policy attribute based encryption (CPABE). In this paper we perform a categorized survey on different encryption techniques presents in delay tolerant networks. This categorized survey is very helpful for researchers to propose modified encryption techniques. Finally the paper compares the performance and effectiveness of different encryption algorithms.
LSR PROTOCOL BASED ON NODES POTENTIALITY IN TRUST AND RESIDUAL ENERGY FOR WSNSIJNSA Journal
In Wireless Sensor Networks (WSNs), all the nodes selected for packet routing must be trustworthy, and at the same time energetic too. Smooth conservation of nodes energies and the trust levels, are an important issues in WSN because they directly affects the life span and reliability of the nodes as well as the entire network. The energy utilization at every node must be very smooth and at the same time, packets should be forwarded via trusted nodes only. In this paper, we propose an Energy Efficient Link State Routing Protocol (EELSRP) using the potential nodes selected by applying the fuzzy logic on the trust and residual energy levels. This routing protocol finds the best route by balancing the nodesresidual energies and trust levels, and protects the WSN against routing attacks by eliminating the untrusted nodes before the creation of route.
MEKDA: Multi-Level ECC based Key Distribution and Authentication in Internet ...IJCNCJournal
The Internet of Things (IoT) is an extensive system of networks and connected devices with minimal human interaction and swift growth. The constraints of the System and limitations of Devices pose several challenges, including security; hence billions of devices must protect from attacks and compromises. The resource-constrained nature of IoT devices amplifies security challenges. Thus standard data communication and security measures are inefficient in the IoT environment. The ubiquity of IoT devices and their deployment in sensitive applications increase the vulnerability of any security breaches to risk lives. Hence, IoT-related security challenges are of great concern. Authentication is the solution to the vulnerability of a malicious device in the IoT environment. The proposed Multi-level Elliptic Curve Cryptography based Key Distribution and Authentication in IoT enhances the security by Multi-level Authentication when the devices enter or exit the Cluster in an IoT system. The decreased Computation Time and Energy Consumption by generating and distributing Keys using Elliptic Curve Cryptography extends the availability of the IoT devices. The Performance analysis shows the improvement over the Fast Authentication and Data Transfer method.
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.
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.
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.
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.
Unidad Didáctica de Educación Física basada en las aventuras de Los Imposibles, de Martín Pinos Quílez, para alumnos de 4º de Educación Primaria basada en la educación en valores.
Each month, join us as we highlight and discuss hot topics ranging from the future of higher education to wearable technology, best productivity hacks and secrets to hiring top talent. Upload your SlideShares, and share your expertise with the world!
Not sure what to share on SlideShare?
SlideShares that inform, inspire and educate attract the most views. Beyond that, ideas for what you can upload are limitless. We’ve selected a few popular examples to get your creative juices flowing.
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.
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.
A Survey on Secure Hierarchical LEACH Protocol over Wireless Sensor NetworkIJERD Editor
Wireless Sensor Network contain number of nodes. Lifetime of Sensor nodes depend on their battery
power, which cannot be reenergize. Thus, to save the node energy & lifetime of the Network energy efficient
LEACH protocol is introduced. Wireless sensor networks are facing many experiments such as the partial source
in processing power, storage and energy. The inadequate energy source is one of the main tasks facing the security
in such networks. LEACH doesn’t shield the safety harms. So we want to improve security scenario of Secure
LEACH protocol. Hierarchical or cluster base routing protocol for WSNs is the most energy-efficient among other
routing protocols. This paper shows different security mechanism used in LEACH protocol. This all protocol is
based on Hierarchical routing protocol. This paper shows basic scenario of security in LEACH.
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 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.
Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNsijsrd.com
The multi-hop routing in wireless sensor networks (WSNs) offers little protection against identity deception through replaying routing information. An adversary can exploit this defect to launch various harmful or even devastating attacks against the routing protocols, including sinkhole attacks, wormhole attacks and Sybil attacks. The situation is further aggravated by mobile and harsh network conditions. Traditional cryptographic techniques or efforts at developing trust-aware routing protocols do not effectively address this severe problem. To secure the WSNs against adversaries misdirecting the multi-hop routing, we have designed and implemented TARF, a robust trust-aware routing framework for dynamic WSNs. Without tight time synchronization or known geographic information, TARF provides trustworthy and energy-efficient route. Most importantly, TARF proves effective against those harmful attacks developed out of identity deception; the resilience of TARF is verified through extensive evaluation with both simulation and empirical experiments on large-scale WSNs under various scenarios including mobile and RF-shielding network conditions. Further, we have implemented a low-overhead TARF module in Tiny OS; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. Based on TARF, we also demonstrated a proof-of-concept mobile target detection application that functions well against an anti-detection mechanism.
Data Transfer Security solution for Wireless Sensor NetworkEditor IJCATR
WSN is a wide growth area for specific resource limited application. Factor associated with technology like, the encryption
security, operating speed and power consumption for network. Here, we introduce a mechanism for secure transferring of data is WSN
and various security related issues. This energy-efficient encryption is a secure communication framework in which an algorithm is
used to encode the sensed data using like, RC5, AES and CAST Algorithm. The proposed scheme is most suitable for wireless sensor
networks that incorporate data centric routing protocols. An algorithm in sensor network is help to designers predict security
performance under a set of constraints for WSNs. This symmetric key function is used to guarantee secure communications between
in-network nodes and reliable operation cost. RC5 is good on the code point of view, but the key schedule consumes more resource
time for efficient security aspects.
SECURE ADHOC ROUTING PROTOCOL FOR PRIVACY RESERVATIONEditor IJMTER
Privacy preserving routing is crucial for some Ad hoc networks that require
stronger privacy protection. A number of schemes have been proposed to protect privacy in
Ad hoc networks. However, none of these schemes offer unobservability property since data
packets and control packets are still linkable and distinguishable in these schemes. In this
paper, we define stronger privacy requirements regarding privacy preserving routing in
mobile ad hoc networks. Then we propose an Unobservable Secure Routing scheme (USOR)
to offer complete unlinkability and content unobservability for all types of packets. USOR is
efficient as it uses a novel combination of group signature and ID-based encryption for route
discovery. Security analysis demonstrates that USOR can well protect user privacy against
both inside and outside attackers. We implement USOR on Network Security (NS2), and
evaluate its performance by comparing with Ad Hoc On demand Distance Vector Routing
(AODV) and MASK. The simulation results show that USOR not only has satisfactory
performance compared to AODV, but also achieves stronger privacy protection than existing
schemes like Mask.
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 secure trust-based protocol for hierarchical routing in wireless sensor ne...IJECEIAES
Wireless sensor networks (WSNs) became the backbone of the internet of things (IoT). IoT applications are vital and demand specific quality of service (QoS) requirements. In addition, security has become a primary concern to provide secure communication between wireless nodes, with additional challenges related to the node’s computational resources. Particular, the design of secure and resource efficient routing protocol is a critical issue in the current deployment of WSNs. Therefore, this paper proposes a novel secure-trust aware routing protocol (ST2A) that provides secure and reliable routing. The proposed protocol establishes communication routes based on calculated trust value in joint with a novel cluster head selection algorithm in the hierarchical routing process. The proposed trust-aware routing algorithm improves the routing security in WSN and optimizes many performance metrics related to WSNs unique characteristics. The results of simulation validate the feasibility of the proposed algorithm for enhancing the network lifetime up to 18% and data delivery by 17% as compared with some state-of-the-art routing algorithms.
Similar to A Survey of Techniques against Security Threats in Mobile Ad Hoc Networks (20)
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
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.
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.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
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.
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.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
A Survey of Techniques against Security Threats in Mobile Ad Hoc Networks
1. A Survey of Techniques against Security Threats in Mobile
Ad Hoc Networks
Srinivasan Venkataramani
Easwari Engineering College, TamilNadu, India
DrSrinivasanVenkataramani@gmail.com
ABSTRACT
In Mobile Ad Hoc Networks (MANETs), the security threats
are critical, when deploying secure applications especially
considering the confidentiality of the data that can be com-
promised. In usual communication networks, there is a need
to establish ad hoc temporary connections in many scenar-
ios. Data transfer in this ad hoc wireless network is impor-
tant 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 en-
vironment. Many papers proposed various solutions as to
counter-act internal and external security attacks. However,
most solutions have certain trade-offs. There are some meth-
ods designed only to counter-act specific attacks. Others
provide solutions to counter-act general attacks but con-
sider 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 knowl-
edge,there is no other surveys that discusses the new secured
methods in the literature.
CCS Concepts
•Security and privacy → Mobile and wireless security;
Keywords
Security Threats, Mobile Ad Hoc Networks
1. INTRODUCTION
The development of smaller and more powerful mobile
devices enables mobile ad hoc networks (MANETs) to be-
come one of the fastest growing areas of research. As a new
type of self-organizing network combines wireless communi-
cation with high mobility, they are unlike traditional wired
networks and have no fixed infrastructure (base stations,
Permission to make digital or hard copies of all or part of this work for personal or
classroom use is granted without fee provided that copies are not made or distributed
for profit or commercial advantage and that copies bear this notice and the full cita-
tion on the first page. Copyrights for components of this work owned by others than
ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or re-
publish, to post on servers or to redistribute to lists, requires prior specific permission
and/or a fee. Request permissions from permissions@acm.org.
c 2016 ACM. ISBN 978-1-4503-2138-9.
DOI: 10.1145/1235
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 disas-
ter recovery operations, where the existing fixed infrastruc-
ture may be disconnected. The ad hoc organization makes
them useful for virtual conferences, where setting up a tra-
ditional 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 fig-
ure 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 an-
nihilation 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 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 trade-
off between choosing those secured methods that consume
a huge amount of resources (large memory, high bandwidth
utilization and heavy processors for high computations), and
those methods that consume fewer resources but are suscep-
tible 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, assump-
tions, 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 secu-
rity aspects of MANETs will have the distinct notion about
2. security issues and different approaches which can be used
for providing better security. Further study can be initi-
ated from a clear perspective of choosing which methods are
appropriate according to the area of interest.
2. SURVEY OF PROPOSED SOLUTIONS
Frequently changing wireless links in MANETs makes it
susceptible to attack. Thus, the first step before sharing in-
formation 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. Se-
curity 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 pro-
tect the messages from being tampering and losing their in-
tegrity. But encryption/decryption schemes are not suitable
for resource-constrained devices.
2.1 Trusted Certificate Server Approach
[19] proposed the use of a trusted certificate server to gen-
erate 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 certifi-
cate 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 mes-
sage, removes 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 tran-
sit. Figure 1 shows its route discovery mechanism.
2.2 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 au-
thority. 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 au-
thentic 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.
2.3 Node-capture Attack Detection
[34] provided two methods to detect the node capture:
Simple Distributed Detection (SDD) which uses local infor-
mation 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 corre-
sponding 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.
2.4 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.
2.5 Misbehaving Watchdog
[8] explain that Watchdog recognizes misbehaving nodes
and a Pathrater supports the routing protocols to avoid
3. 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 imple-
mented 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 cer-
tain failure threshold, if it is excesses, then the node is de-
termined to be misbehaving and source is notified about it.
Pathrater calculates the negative value path metric to indi-
cate 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.
2.6 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 in-
termediate 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 rout-
ing 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 encryp-
tion to check alteration. This protocol finds the assured
secured route between two nodes.
2.7 Redundant Routing Message Approach
[30] proposed protocol that uses redundant copies of rout-
ing 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 Certifi-
cate 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 key and uses key
hash function to protect the route discovery message. Fi-
nally, 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 mes-
sage along with QoS information before forwarding to next
hop.
2.8 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 in-
crements 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 reputa-
tion node. Intermediate nodes also forward the data packet
to the highest reputation hop till it reaches to the desti-
nation node. The destination node acknowledges a signed
DACK (data Acknowledgment packet) to the source that
modifies its reputation values table by recommending +1 to
the first hop of reverse route. Subsequently all the inter-
mediate nodes in the route recommends +1 to their corre-
sponding 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 cor-
responding entries from their tables on time-out expire. If
the reputation value of the next hop falls below -40 (thresh-
old 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 pack-
ets 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.
2.9 Firewalls
[39] focus on attack which tries to drain the battery of
nodes in the network. This scheme is based on ROFL (Rout-
ing 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 an-
nouncement to a node, the node is first been checked that
whether it is authorized to access or not. To stop the ad-
vertised 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)
4. for distributing routing information. Once a path between
source and destination node is created by underlying rout-
ing protocol, each node in that path refers to its local rout-
ing table to match the routing announcement and if the
same matched announcement is found, then its source pre-
fix 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.
2.10 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 con-
tains 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 neigh-
bor 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 (inten-
tionally or by fault) caused by a legitimate node, a node is
declared as a misbehavior node and revoked from its neigh-
bor’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 an-
nouncements.
3. 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 mo-
bile every day. In the future MANETs will likely be a part
of our lives. There has been much research on this promis-
ing 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 re-
search 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. Differ-
ent 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 ap-
proaches. 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 prone to attacks.
So in future maintaining rate of node’s mobility and topolo-
gies in the network is required. Also distributing use of bat-
teries 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 distri-
bution and use of available bandwidth, providing physical
safety to the network bodies, increasing size of network, sig-
nal fading and jittering due to large number of multi hops
and setting up of minimum and maximum rate of trans-
mission power, eliminating tradeoffs between packet deliv-
ery 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 devel-
oped should also take care of the other aspects of the net-
work which are very important as far as providing security or
avoiding threats are concerned. These are provision of secu-
rity 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 bal-
ancing, Medium Access Control methods for channel con-
tention, 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.
4. 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.
5. [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. Deshpande, “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, “Detecting 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 Ganapathy, 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 Exchange 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 Detection 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 Byzantine 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 Enforcement 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.