IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
This document summarizes a research paper on reducing packet loss in mobile ad hoc networks (MANETs). The paper discusses how MANETs are vulnerable to various security threats like black hole attacks that can cause packet dropping. It evaluates existing authentication schemes like ACK-based schemes that have overhead issues. The paper then proposes a modified ACK-based scheme using finite state automata to overcome decision ambiguity and minimize packet dropping while authenticating nodes in the MANET. Simulation results show that the proposed approach improves packet delivery ratio, throughput and reduces routing load compared to not using secure authentication.
Migrating packet dropping in mobile ad hoc network based on modified ack-base...Alexander Decker
This document discusses migrating packet dropping in mobile ad-hoc networks using a modified ACK-based authentication scheme. It begins by introducing mobile ad-hoc networks and some of the security challenges they face, such as packet dropping attacks. It then discusses existing ACK-based authentication schemes and their limitations, such as generating a large overhead and having ambiguity when nodes refuse acknowledgments. The document proposes a modified ACK-based scheme that uses a secure channel to overcome these limitations and minimize packet dropping. It evaluates the proposed scheme through simulation experiments and finds it improves performance metrics like packet delivery ratio and throughput compared to not using a secure channel. In conclusion, the modified scheme is presented as a way to enhance node authentication and reduce packet dropping in mobile
Data Security via Public-Key Cryptography in Wireless Sensor NetworkIJCI JOURNAL
This document discusses using public-key cryptography for data security in wireless sensor networks. It begins with an abstract that introduces public-key infrastructure for sensor networks to allow services like digital signatures. It then provides background on wireless sensor networks and discusses their limitations, including limited resources and vulnerability of nodes. It reviews different techniques for distributing public keys, including public announcement, publicly available directories, using a public-key authority, and public-key certificates. It analyzes whether a public-key infrastructure is feasible for sensor networks given their constraints. The document concludes by discussing potential public-key schemes that could work for wireless sensor networks.
Wormhole attack detection algorithms in wireless network coding systemsPvrtechnologies Nellore
This document proposes algorithms to detect wormhole attacks in wireless network coding systems. It first discusses how wormhole attacks can severely impact network coding protocols by disrupting routing and introducing unfair workload distributions. It then presents a centralized algorithm that uses a central node to detect wormholes by measuring changes in expected transmission counts. For distributed systems without a central node, it proposes DAWN, a distributed algorithm that examines the order nodes receive innovative packets and their expected transmission counts to detect wormholes. The algorithms aim to detect wormholes using only local information available from regular network coding protocols to keep overhead low. Extensive testing validated the effectiveness and efficiency of the proposed approaches.
The document discusses defense mechanisms against flooding attacks in mobile ad hoc networks (MANETs). It begins with broad background on networks and network security. It then discusses specific areas including MANETs and flooding attacks. The document reviews several papers from 2008-2011 on related topics. It discusses methodologies, advantages and drawbacks of approaches for detecting and preventing flooding attacks in MANETs, including using period-based mechanisms, trust-based classification of nodes, and probabilistic broadcasting. The comparative study section provides brief summaries of several papers analyzing defenses against flooding attacks in MANETs.
This document provides an overview of mobile ad hoc networks (MANets) and security attacks against them. It discusses the following key points:
1. MANets are self-configuring, dynamic wireless networks without centralized administration or fixed infrastructure that allow nodes to connect to each other.
2. Security in MANets is challenging due to the lack of infrastructure and centralized monitoring. Common attacks target the physical, data link, network, transport, and multi-layers of the network.
3. Attacks discussed include flooding, blackhole, link spoofing, wormhole, denial of service, and traffic monitoring aimed at different layers of the network. Countermeasures are needed to strengthen MANet security.
The document proposes an enhanced anonymous position-based security aware routing protocol called E-APSAR for mobile ad hoc networks (MANETs). It aims to address security issues like black hole attacks in dynamic source routing (DSR) protocol. E-APSAR divides the network area into zones and implements encryption to securely transmit data between neighboring zones. Simulation results show that E-APSAR has lower routing overhead and higher throughput and packet delivery ratio compared to DSR, especially at certain mobility levels. The protocol performance is analyzed against different node densities and mobility to evaluate its effectiveness against black hole attacks in MANETs.
Analyzing the Impact of Eaves on Energy Consumption of AODV Routing Protocol ...ijwmn
The document analyzes the impact of an eavesdropper on the energy consumption of the AODV routing protocol in mobile ad hoc networks (MANETs). Simulations were conducted using the QualNet simulator for 20, 40, 60, 80, and 100 nodes. The results show that the presence of an eavesdropper degrades network performance and increases energy consumption compared to the standard AODV protocol. Specifically, throughput was lower, delay and jitter were higher, and transmit energy usage increased in scenarios with an eavesdropper node. The eavesdropper attracts network traffic, forcing nodes to transmit more and reducing overall efficiency.
This document summarizes a research paper on reducing packet loss in mobile ad hoc networks (MANETs). The paper discusses how MANETs are vulnerable to various security threats like black hole attacks that can cause packet dropping. It evaluates existing authentication schemes like ACK-based schemes that have overhead issues. The paper then proposes a modified ACK-based scheme using finite state automata to overcome decision ambiguity and minimize packet dropping while authenticating nodes in the MANET. Simulation results show that the proposed approach improves packet delivery ratio, throughput and reduces routing load compared to not using secure authentication.
Migrating packet dropping in mobile ad hoc network based on modified ack-base...Alexander Decker
This document discusses migrating packet dropping in mobile ad-hoc networks using a modified ACK-based authentication scheme. It begins by introducing mobile ad-hoc networks and some of the security challenges they face, such as packet dropping attacks. It then discusses existing ACK-based authentication schemes and their limitations, such as generating a large overhead and having ambiguity when nodes refuse acknowledgments. The document proposes a modified ACK-based scheme that uses a secure channel to overcome these limitations and minimize packet dropping. It evaluates the proposed scheme through simulation experiments and finds it improves performance metrics like packet delivery ratio and throughput compared to not using a secure channel. In conclusion, the modified scheme is presented as a way to enhance node authentication and reduce packet dropping in mobile
Data Security via Public-Key Cryptography in Wireless Sensor NetworkIJCI JOURNAL
This document discusses using public-key cryptography for data security in wireless sensor networks. It begins with an abstract that introduces public-key infrastructure for sensor networks to allow services like digital signatures. It then provides background on wireless sensor networks and discusses their limitations, including limited resources and vulnerability of nodes. It reviews different techniques for distributing public keys, including public announcement, publicly available directories, using a public-key authority, and public-key certificates. It analyzes whether a public-key infrastructure is feasible for sensor networks given their constraints. The document concludes by discussing potential public-key schemes that could work for wireless sensor networks.
Wormhole attack detection algorithms in wireless network coding systemsPvrtechnologies Nellore
This document proposes algorithms to detect wormhole attacks in wireless network coding systems. It first discusses how wormhole attacks can severely impact network coding protocols by disrupting routing and introducing unfair workload distributions. It then presents a centralized algorithm that uses a central node to detect wormholes by measuring changes in expected transmission counts. For distributed systems without a central node, it proposes DAWN, a distributed algorithm that examines the order nodes receive innovative packets and their expected transmission counts to detect wormholes. The algorithms aim to detect wormholes using only local information available from regular network coding protocols to keep overhead low. Extensive testing validated the effectiveness and efficiency of the proposed approaches.
The document discusses defense mechanisms against flooding attacks in mobile ad hoc networks (MANETs). It begins with broad background on networks and network security. It then discusses specific areas including MANETs and flooding attacks. The document reviews several papers from 2008-2011 on related topics. It discusses methodologies, advantages and drawbacks of approaches for detecting and preventing flooding attacks in MANETs, including using period-based mechanisms, trust-based classification of nodes, and probabilistic broadcasting. The comparative study section provides brief summaries of several papers analyzing defenses against flooding attacks in MANETs.
This document provides an overview of mobile ad hoc networks (MANets) and security attacks against them. It discusses the following key points:
1. MANets are self-configuring, dynamic wireless networks without centralized administration or fixed infrastructure that allow nodes to connect to each other.
2. Security in MANets is challenging due to the lack of infrastructure and centralized monitoring. Common attacks target the physical, data link, network, transport, and multi-layers of the network.
3. Attacks discussed include flooding, blackhole, link spoofing, wormhole, denial of service, and traffic monitoring aimed at different layers of the network. Countermeasures are needed to strengthen MANet security.
The document proposes an enhanced anonymous position-based security aware routing protocol called E-APSAR for mobile ad hoc networks (MANETs). It aims to address security issues like black hole attacks in dynamic source routing (DSR) protocol. E-APSAR divides the network area into zones and implements encryption to securely transmit data between neighboring zones. Simulation results show that E-APSAR has lower routing overhead and higher throughput and packet delivery ratio compared to DSR, especially at certain mobility levels. The protocol performance is analyzed against different node densities and mobility to evaluate its effectiveness against black hole attacks in MANETs.
Analyzing the Impact of Eaves on Energy Consumption of AODV Routing Protocol ...ijwmn
The document analyzes the impact of an eavesdropper on the energy consumption of the AODV routing protocol in mobile ad hoc networks (MANETs). Simulations were conducted using the QualNet simulator for 20, 40, 60, 80, and 100 nodes. The results show that the presence of an eavesdropper degrades network performance and increases energy consumption compared to the standard AODV protocol. Specifically, throughput was lower, delay and jitter were higher, and transmit energy usage increased in scenarios with an eavesdropper node. The eavesdropper attracts network traffic, forcing nodes to transmit more and reducing overall efficiency.
Mobile Ad-Hoc Networks are most usefully in current environments. It’s required high performance, networks load and Throughput. In Mobile Ad-hoc Networks Routing is the hot topic for research. Basically two types routing protocols are work in the mobile Ad-hoc Networks: 1) Proactive and 2) Reactive. Researchers have projected different routing algorithm. Important work has been done on routing in ad hoc networks, some of the important works so far were the destination-sequence distance vector (DSDV) protocol, the temporally ordered routing protocol (TORA), dynamic source routing protocol (DSR) and ad hoc on demand routing protocol (AODV). These algorithms use Open Shortest Path First (OSPF) for find optimum route source to destination.ThesisScientist.com
A Novel Key Management Paradigm for Broadcasting to Remote Cooperative GroupsIJMER
A Mobile Ad Hoc Network(MANET) is a system made up of wireless mobile nodes. These
MANET nodes have wireless communication and networking characteristics. MANETs have been
proposed to serve as an effective networking system facilitating information exchange between mobile
devices even without fixed infrastructures. In MANETs, it is important to support group-oriented
applications, such as audio/video conference and one-to-many data dissemination in disaster or
battlefield rescue scenarios. In the above group oriented communication scenarios, the common problem
is to enable a sender to securely transmit secret messages to a remote cooperative group. A solution to
the above problem must meet several constraints. First, the sender must be remote and can be dynamic.
Second, the message transmission may cross various networks including open insecure networks before
reaching the intended recipients. Third, the data communication from the group members to the sender
may be limited. Also, the sender may wish to choose only a subset of the overall group as the intended
recipients. Furthermore, it is hard to resort to a fully trusted third party to secure the overall
communication. In contrast to the above constraints, mitigating features are that the group members are
cooperative and the secret communication among them is local and efficient. This paper exploits these
mitigating features to facilitate the remote access control of group-oriented communications without
relying on a fully trusted secret key generation center.
The document discusses behavioral malware detection in delay tolerant networks. It proposes using a Naive Bayesian model to characterize proximity malware based on behavior. It identifies two challenges for applying Bayesian detection in DTNs: insufficient evidence collection risk and filtering false evidence sequentially and distributedly. It proposes a method called "look-ahead" to address these challenges, as well as two extensions - dogmatic filtering and adaptive look-ahead - to address malicious nodes sharing false evidence. Real mobile network traces are used to evaluate the effectiveness of the proposed methods.
Black hole Attack Avoidance Protocol for wireless Ad-Hoc networksijsrd.com
A Mobile Ad-Hoc Network is a collection of mobile nodes or a temporary network set up by wireless mobile nodes moving arbitrary in the places that have no network infrastructure in such a manner that the interconnections between nodes are capable of changing on continual basis. Thus the nodes find a path to the destination node using routing protocols. However, due to security vulnerabilities of the routing protocols, wireless ad-hoc networks are unprotected to attacks of the malicious nodes. Various attacks and one of those attacks is the Black Hole Attack against network integrity absorbing all data packets in the network. Since the data packets do not reach the destination node on account of this attack, data loss will occur. Therefore, it is a severe attack that can be easily employed against routing in mobile ad hoc networks. There are lots of detection and defense mechanisms to eliminate the intruder that carry out the black hole attack. . Virtual Infrastructure achieves reliable transmission in Mobile Ad Hoc Network. Black Hole Attack is the major problem to affect the Virtual Infrastructure. In this paper, approach on analyzing and improving the security of AODV, which is one of the popular routing protocols for MANET. Our aim is to ensuring the avoidance against Black hole attack.
Enhancing msf for mobile ad hoc network security though active handshaking &a...ijctet
This document summarizes a research paper that proposes a new security framework called Multipath Security Framework (MSF) to enhance security in mobile ad hoc networks. MSF divides messages into encrypted shares that are transmitted across multiple network paths to increase confidentiality and robustness. Even if an attacker obtains some shares, it is difficult for them to reconstruct the original message. The framework includes multipath routing, node authentication through handshaking, and encryption of message shares. The goal is to improve security against eavesdropping, active and passive attacks, and jamming in mobile ad hoc networks.
DETECTION OF SYBIL ATTACK IN MOBILE ADHOCK NETWORKINGPrakash Kumar
The document discusses a proposed system to detect Sybil attackers in a wireless network using a centralized base station without additional hardware like GPS. It aims to identify Sybil identities with accuracy even when nodes are mobile. A Sybil attacker can create multiple identities on a single device to launch coordinated attacks. The proposed system uses a Neighbor Discovery Distance algorithm and centralized authentication server to reduce packet delay and detect attackers, enabling efficient secure data transmission. It evaluates topology design, neighbor discovery, and how Sybil attacks work to spoof identities and impact networks. Simulation results showed the scheme can effectively detect static and mobile Sybil attackers.
MANETs have unique characteristics like dynamic topology, wireless radio medium, limited resources and lack of centralized administration; as a result, they are vulnerable to different types of attacks in different layers of protocol stack. wormhole attack detection in wireless sensor networks
A Distributed Approach for Detecting Wormhole Attack in Wireless Network Codi...IRJET Journal
This document presents a distributed algorithm called DAWN to detect wormhole attacks in wireless network coding systems. The algorithm has two phases: 1) a detection phase where each node uses the expected transmission count (ETX) metric to detect if any attackers exist, and 2) a reporting phase where detected attackers are reported to other nodes. ETX represents the number of transmissions needed for a packet to be received and can reveal the network topology. DAWN examines the order nodes receive packets and their ETX values to identify attackers. It signatures reports to prevent manipulation and distributes the workload of detection across all nodes. The algorithm successfully detects wormhole attacks with high rates while imposing low computation and communication overhead.
Detection and prevention of wormhole attack in mobile adhoc networksambitlick
This document discusses detection and prevention of wormhole attacks in mobile ad hoc networks. A wormhole attack is a powerful attack where two or more malicious nodes collude to tunnel packets between them, emulating a shorter route and attracting traffic. This can severely disrupt network communication. The paper proposes a novel trust-based scheme to identify wormhole-creating nodes without cryptography. Extensive simulations show the scheme effectively handles colluding malicious nodes without imposing extra network conditions.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
WDA: Wormhole Attack Detection Algorithm based on measuring Round Trip Delay ...ijsrd.com
The recent advancements in the wireless arena and their wide-spread utilization have introduced new security vulnerabilities. The wireless media being shared is exposed to outside world, so it is susceptible to various attacks at different layers of OSI network stack. For example, jamming and device tampering at the physical layer; disruption of the medium access control (MAC) layer; routing attacks like Blackhole, rushing, wormhole; targeted attacks on the transport protocol like session hijacking, SYN flooding or even attacks intended to disrupt specific applications through viruses, worms and Trojan Horses. Wormhole attack is one of the serious routing attacks amongst all the network layer attacks launched on MANET. Wormhole attack is launched by creation of tunnels and it leads to total disruption of the routing paths on MANET. In this paper, Wormhole detection algorithm (WDA) is proposed based on modifying the forwarding packet process that detects and isolates wormhole nodes in ad hoc on demand distance vector (AODV) routing protocol.
Behavioral malware detection in delay tolerant networkBittu Roy
This document proposes a system for detecting behavioral malware in delay tolerant networks. It presents a general behavioral characterization of proximity malware based on a naive Bayesian model. This model has been successfully used to detect malware in non-DTN settings. The system addresses challenges in extending this model to DTNs, including having insufficient evidence due to limited node contact and the risk of collecting evidence from infected nodes. It proposes techniques like look-ahead and adaptive look-ahead to balance these risks.
1- Mobile ad hoc networks are formed dynamically by an
autonomous system of mobile nodes that are connected
via wireless links.
2- Multihop communication- node communicate with the
help of two or more node from source to destination.
3- No existing fixed infrastructure or centralized administration –No base station.
4- Mobile nodes are free to move randomly-Network topology changes frequently
5- May Operate as standalone fashion or also can be connected to the larger internet.
6- Each node work as router
Primary Goals of Security in MANET
To assure a reliable data transfer over the communication networks and to protect the system resources a number of security services are classified in five categories:-
1-Authentication:- The process of identifying an individual , usually based on a username and password.
2- Confidentially:- Confidentiality aims at protecting the data from disclosure to unauthorized person.
Network attacks against confidentiality
* Packet capturing
Password attack
Port scanning
Dumpster Diving
Wiretapping
Phishing and Pharming
2-Non repudiation:- Integrity guarantees that a message being transferred is never corrupted.
3- Integrity:- Integrity guarantees that a message being transferred is never corrupted.
network attack against integrity
Salami attack
trust relationship attacks
Man in the middle attack
Session hijacking attacks
4- Availability:- Its ensure that data ,network resources or network services are available to legitimate user when required.
network attack against availability
Denial of services attacks
Distributed denial of services attack
SYN flood attacks and ICMP flood attacks
Electrical power attacks
Server Room environment attacks
Key management
The security in networking is in many cases dependent on proper key management.
Key management consists of various services, of which each is vital for the security
of the networking systems
* Trust model:-Its must determine how much different element in the network can trust each other.
* Cryptosystem:- Public and symmetric key mechanism can be applied .
* Key creation:- It must determine which parties are allowed to generate key to themselves.
* Key storage :- In adhoc network any network element may have to store its own key and possibly key of other element as well.
* Key distribution:- The key management service must ensure that the generated keys are securely distributed to their owners.
Delay tolerant network routing protocol a comprehensive survey with hybrid...eSAT Journals
Abstract
Delay –disruption Tolerant networks are sparse wireless network which is recently being used by the existing /current network for the purpose to connect devices or the underdeveloped area of the world that works in challenging environment. In DTN there majority of time does not exist the total path from source to target which is leads to the difficulty of how to route the packet in such environment. A communications network which is accomplished of storing packets temporarily in intermediate nodes, until the time an end-to-end route is re-established or regenerated is known as a delay tolerant networks. Routing in such network is very difficult and for that different routing protocols are developed. In this Survey paper we discuss about various routing Strategy and at the end compared the different routing protocol with their various performance metrics.
Keywords: Delay tolerant networks (DTNs), Erasure coding, Replication, Routing.
The document discusses secure routing protocols for wireless sensor networks. It begins by describing the components and design challenges of wireless sensor networks, including limited resources and security issues. It then discusses various attacks on wireless sensor networks like spoofing, selective forwarding, and sinkhole attacks. The document analyzes several secure routing protocols that aim to prevent such attacks, including Distributed Security Framework, Multipath Data Transfer Protocol, Secure and Energy Efficient Disjoint Route, and Bio-inspired Self-Organized Secure Autonomous Routing Protocol. It concludes by discussing future work to develop a new routing approach with low energy consumption, high delivery ratio, and strong security against possible threats.
NetSim Webinar on Network Attacks and DetectionDESHPANDE M
Webinar Contents:
Why use a Network Simulator
Introduction to NetSim
Introduction to Sinkhole Attack : Attack scenario in MANET using NetSim
Intrusion Detection System: Detection mechanism in MANET using NetSim
Analyzing Metrics
Areas of R & D in MANET
Q & A
Survey paper on Detecting Blackhole Attack by different Approaches and its Co...IJARIIE JOURNAL
This document summarizes research on detecting blackhole attacks in mobile ad hoc networks (MANETs). It first defines MANETs and describes blackhole attacks, where malicious nodes drop packets to disrupt routing. The document then reviews several approaches for detecting single or cooperative blackhole attacks and compares their assumptions and effectiveness. It finds that while various methods have been proposed, consistently detecting multiple cooperative blackhole nodes remains a challenge, as detection requires cooperation between non-malicious nodes. Future work could involve further simulation-based comparison of detection method performances.
This document proposes a Tiered Authentication scheme called TAM for multicast traffic in ad-hoc networks. TAM exploits network clustering to reduce overhead and ensure scalability. Within a cluster, one-way hash chains authenticate message sources by appending an authentication code to messages. Between clusters, messages include multiple authentication codes based on different keys from the source to authenticate it. TAM aims to securely deliver multicast traffic while addressing challenges like resource constraints and packet loss in ad-hoc networks.
This document describes a system for measuring and controlling water temperature and flow for testing thermal discharge models from power plants. The system uses digital temperature sensors, flow meters, and level sensors along with a PID controller. Measurements are transmitted wirelessly and processed using MATLAB software. Experimental results show the system can control temperature and flow rate to desired set points, helping evaluate environmental impacts of power plant discharge and meet regulatory standards.
This document summarizes a study on fluid flow and heat transfer from multiple circular jets impinging on a flat plate. Computational fluid dynamics simulations were performed using the k-ω SST turbulence model to analyze the flow structure and pressure distribution. Experiments using an oil-lampblack visualization technique were also conducted for comparison. The simulations examined the effects of varying the jet-to-plate spacing ratio (h/d) from 0.5 to 4 and the Reynolds number from 9075 to 13624. It was observed that the flow topology was independent of Reynolds number but depended strongly on h/d. Primary pressure peaks occurred at stagnation points and secondary peaks at wall jet interaction regions.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Mobile Ad-Hoc Networks are most usefully in current environments. It’s required high performance, networks load and Throughput. In Mobile Ad-hoc Networks Routing is the hot topic for research. Basically two types routing protocols are work in the mobile Ad-hoc Networks: 1) Proactive and 2) Reactive. Researchers have projected different routing algorithm. Important work has been done on routing in ad hoc networks, some of the important works so far were the destination-sequence distance vector (DSDV) protocol, the temporally ordered routing protocol (TORA), dynamic source routing protocol (DSR) and ad hoc on demand routing protocol (AODV). These algorithms use Open Shortest Path First (OSPF) for find optimum route source to destination.ThesisScientist.com
A Novel Key Management Paradigm for Broadcasting to Remote Cooperative GroupsIJMER
A Mobile Ad Hoc Network(MANET) is a system made up of wireless mobile nodes. These
MANET nodes have wireless communication and networking characteristics. MANETs have been
proposed to serve as an effective networking system facilitating information exchange between mobile
devices even without fixed infrastructures. In MANETs, it is important to support group-oriented
applications, such as audio/video conference and one-to-many data dissemination in disaster or
battlefield rescue scenarios. In the above group oriented communication scenarios, the common problem
is to enable a sender to securely transmit secret messages to a remote cooperative group. A solution to
the above problem must meet several constraints. First, the sender must be remote and can be dynamic.
Second, the message transmission may cross various networks including open insecure networks before
reaching the intended recipients. Third, the data communication from the group members to the sender
may be limited. Also, the sender may wish to choose only a subset of the overall group as the intended
recipients. Furthermore, it is hard to resort to a fully trusted third party to secure the overall
communication. In contrast to the above constraints, mitigating features are that the group members are
cooperative and the secret communication among them is local and efficient. This paper exploits these
mitigating features to facilitate the remote access control of group-oriented communications without
relying on a fully trusted secret key generation center.
The document discusses behavioral malware detection in delay tolerant networks. It proposes using a Naive Bayesian model to characterize proximity malware based on behavior. It identifies two challenges for applying Bayesian detection in DTNs: insufficient evidence collection risk and filtering false evidence sequentially and distributedly. It proposes a method called "look-ahead" to address these challenges, as well as two extensions - dogmatic filtering and adaptive look-ahead - to address malicious nodes sharing false evidence. Real mobile network traces are used to evaluate the effectiveness of the proposed methods.
Black hole Attack Avoidance Protocol for wireless Ad-Hoc networksijsrd.com
A Mobile Ad-Hoc Network is a collection of mobile nodes or a temporary network set up by wireless mobile nodes moving arbitrary in the places that have no network infrastructure in such a manner that the interconnections between nodes are capable of changing on continual basis. Thus the nodes find a path to the destination node using routing protocols. However, due to security vulnerabilities of the routing protocols, wireless ad-hoc networks are unprotected to attacks of the malicious nodes. Various attacks and one of those attacks is the Black Hole Attack against network integrity absorbing all data packets in the network. Since the data packets do not reach the destination node on account of this attack, data loss will occur. Therefore, it is a severe attack that can be easily employed against routing in mobile ad hoc networks. There are lots of detection and defense mechanisms to eliminate the intruder that carry out the black hole attack. . Virtual Infrastructure achieves reliable transmission in Mobile Ad Hoc Network. Black Hole Attack is the major problem to affect the Virtual Infrastructure. In this paper, approach on analyzing and improving the security of AODV, which is one of the popular routing protocols for MANET. Our aim is to ensuring the avoidance against Black hole attack.
Enhancing msf for mobile ad hoc network security though active handshaking &a...ijctet
This document summarizes a research paper that proposes a new security framework called Multipath Security Framework (MSF) to enhance security in mobile ad hoc networks. MSF divides messages into encrypted shares that are transmitted across multiple network paths to increase confidentiality and robustness. Even if an attacker obtains some shares, it is difficult for them to reconstruct the original message. The framework includes multipath routing, node authentication through handshaking, and encryption of message shares. The goal is to improve security against eavesdropping, active and passive attacks, and jamming in mobile ad hoc networks.
DETECTION OF SYBIL ATTACK IN MOBILE ADHOCK NETWORKINGPrakash Kumar
The document discusses a proposed system to detect Sybil attackers in a wireless network using a centralized base station without additional hardware like GPS. It aims to identify Sybil identities with accuracy even when nodes are mobile. A Sybil attacker can create multiple identities on a single device to launch coordinated attacks. The proposed system uses a Neighbor Discovery Distance algorithm and centralized authentication server to reduce packet delay and detect attackers, enabling efficient secure data transmission. It evaluates topology design, neighbor discovery, and how Sybil attacks work to spoof identities and impact networks. Simulation results showed the scheme can effectively detect static and mobile Sybil attackers.
MANETs have unique characteristics like dynamic topology, wireless radio medium, limited resources and lack of centralized administration; as a result, they are vulnerable to different types of attacks in different layers of protocol stack. wormhole attack detection in wireless sensor networks
A Distributed Approach for Detecting Wormhole Attack in Wireless Network Codi...IRJET Journal
This document presents a distributed algorithm called DAWN to detect wormhole attacks in wireless network coding systems. The algorithm has two phases: 1) a detection phase where each node uses the expected transmission count (ETX) metric to detect if any attackers exist, and 2) a reporting phase where detected attackers are reported to other nodes. ETX represents the number of transmissions needed for a packet to be received and can reveal the network topology. DAWN examines the order nodes receive packets and their ETX values to identify attackers. It signatures reports to prevent manipulation and distributes the workload of detection across all nodes. The algorithm successfully detects wormhole attacks with high rates while imposing low computation and communication overhead.
Detection and prevention of wormhole attack in mobile adhoc networksambitlick
This document discusses detection and prevention of wormhole attacks in mobile ad hoc networks. A wormhole attack is a powerful attack where two or more malicious nodes collude to tunnel packets between them, emulating a shorter route and attracting traffic. This can severely disrupt network communication. The paper proposes a novel trust-based scheme to identify wormhole-creating nodes without cryptography. Extensive simulations show the scheme effectively handles colluding malicious nodes without imposing extra network conditions.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
WDA: Wormhole Attack Detection Algorithm based on measuring Round Trip Delay ...ijsrd.com
The recent advancements in the wireless arena and their wide-spread utilization have introduced new security vulnerabilities. The wireless media being shared is exposed to outside world, so it is susceptible to various attacks at different layers of OSI network stack. For example, jamming and device tampering at the physical layer; disruption of the medium access control (MAC) layer; routing attacks like Blackhole, rushing, wormhole; targeted attacks on the transport protocol like session hijacking, SYN flooding or even attacks intended to disrupt specific applications through viruses, worms and Trojan Horses. Wormhole attack is one of the serious routing attacks amongst all the network layer attacks launched on MANET. Wormhole attack is launched by creation of tunnels and it leads to total disruption of the routing paths on MANET. In this paper, Wormhole detection algorithm (WDA) is proposed based on modifying the forwarding packet process that detects and isolates wormhole nodes in ad hoc on demand distance vector (AODV) routing protocol.
Behavioral malware detection in delay tolerant networkBittu Roy
This document proposes a system for detecting behavioral malware in delay tolerant networks. It presents a general behavioral characterization of proximity malware based on a naive Bayesian model. This model has been successfully used to detect malware in non-DTN settings. The system addresses challenges in extending this model to DTNs, including having insufficient evidence due to limited node contact and the risk of collecting evidence from infected nodes. It proposes techniques like look-ahead and adaptive look-ahead to balance these risks.
1- Mobile ad hoc networks are formed dynamically by an
autonomous system of mobile nodes that are connected
via wireless links.
2- Multihop communication- node communicate with the
help of two or more node from source to destination.
3- No existing fixed infrastructure or centralized administration –No base station.
4- Mobile nodes are free to move randomly-Network topology changes frequently
5- May Operate as standalone fashion or also can be connected to the larger internet.
6- Each node work as router
Primary Goals of Security in MANET
To assure a reliable data transfer over the communication networks and to protect the system resources a number of security services are classified in five categories:-
1-Authentication:- The process of identifying an individual , usually based on a username and password.
2- Confidentially:- Confidentiality aims at protecting the data from disclosure to unauthorized person.
Network attacks against confidentiality
* Packet capturing
Password attack
Port scanning
Dumpster Diving
Wiretapping
Phishing and Pharming
2-Non repudiation:- Integrity guarantees that a message being transferred is never corrupted.
3- Integrity:- Integrity guarantees that a message being transferred is never corrupted.
network attack against integrity
Salami attack
trust relationship attacks
Man in the middle attack
Session hijacking attacks
4- Availability:- Its ensure that data ,network resources or network services are available to legitimate user when required.
network attack against availability
Denial of services attacks
Distributed denial of services attack
SYN flood attacks and ICMP flood attacks
Electrical power attacks
Server Room environment attacks
Key management
The security in networking is in many cases dependent on proper key management.
Key management consists of various services, of which each is vital for the security
of the networking systems
* Trust model:-Its must determine how much different element in the network can trust each other.
* Cryptosystem:- Public and symmetric key mechanism can be applied .
* Key creation:- It must determine which parties are allowed to generate key to themselves.
* Key storage :- In adhoc network any network element may have to store its own key and possibly key of other element as well.
* Key distribution:- The key management service must ensure that the generated keys are securely distributed to their owners.
Delay tolerant network routing protocol a comprehensive survey with hybrid...eSAT Journals
Abstract
Delay –disruption Tolerant networks are sparse wireless network which is recently being used by the existing /current network for the purpose to connect devices or the underdeveloped area of the world that works in challenging environment. In DTN there majority of time does not exist the total path from source to target which is leads to the difficulty of how to route the packet in such environment. A communications network which is accomplished of storing packets temporarily in intermediate nodes, until the time an end-to-end route is re-established or regenerated is known as a delay tolerant networks. Routing in such network is very difficult and for that different routing protocols are developed. In this Survey paper we discuss about various routing Strategy and at the end compared the different routing protocol with their various performance metrics.
Keywords: Delay tolerant networks (DTNs), Erasure coding, Replication, Routing.
The document discusses secure routing protocols for wireless sensor networks. It begins by describing the components and design challenges of wireless sensor networks, including limited resources and security issues. It then discusses various attacks on wireless sensor networks like spoofing, selective forwarding, and sinkhole attacks. The document analyzes several secure routing protocols that aim to prevent such attacks, including Distributed Security Framework, Multipath Data Transfer Protocol, Secure and Energy Efficient Disjoint Route, and Bio-inspired Self-Organized Secure Autonomous Routing Protocol. It concludes by discussing future work to develop a new routing approach with low energy consumption, high delivery ratio, and strong security against possible threats.
NetSim Webinar on Network Attacks and DetectionDESHPANDE M
Webinar Contents:
Why use a Network Simulator
Introduction to NetSim
Introduction to Sinkhole Attack : Attack scenario in MANET using NetSim
Intrusion Detection System: Detection mechanism in MANET using NetSim
Analyzing Metrics
Areas of R & D in MANET
Q & A
Survey paper on Detecting Blackhole Attack by different Approaches and its Co...IJARIIE JOURNAL
This document summarizes research on detecting blackhole attacks in mobile ad hoc networks (MANETs). It first defines MANETs and describes blackhole attacks, where malicious nodes drop packets to disrupt routing. The document then reviews several approaches for detecting single or cooperative blackhole attacks and compares their assumptions and effectiveness. It finds that while various methods have been proposed, consistently detecting multiple cooperative blackhole nodes remains a challenge, as detection requires cooperation between non-malicious nodes. Future work could involve further simulation-based comparison of detection method performances.
This document proposes a Tiered Authentication scheme called TAM for multicast traffic in ad-hoc networks. TAM exploits network clustering to reduce overhead and ensure scalability. Within a cluster, one-way hash chains authenticate message sources by appending an authentication code to messages. Between clusters, messages include multiple authentication codes based on different keys from the source to authenticate it. TAM aims to securely deliver multicast traffic while addressing challenges like resource constraints and packet loss in ad-hoc networks.
This document describes a system for measuring and controlling water temperature and flow for testing thermal discharge models from power plants. The system uses digital temperature sensors, flow meters, and level sensors along with a PID controller. Measurements are transmitted wirelessly and processed using MATLAB software. Experimental results show the system can control temperature and flow rate to desired set points, helping evaluate environmental impacts of power plant discharge and meet regulatory standards.
This document summarizes a study on fluid flow and heat transfer from multiple circular jets impinging on a flat plate. Computational fluid dynamics simulations were performed using the k-ω SST turbulence model to analyze the flow structure and pressure distribution. Experiments using an oil-lampblack visualization technique were also conducted for comparison. The simulations examined the effects of varying the jet-to-plate spacing ratio (h/d) from 0.5 to 4 and the Reynolds number from 9075 to 13624. It was observed that the flow topology was independent of Reynolds number but depended strongly on h/d. Primary pressure peaks occurred at stagnation points and secondary peaks at wall jet interaction regions.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
This document presents an efficient soft set approach for mining association rules that uses an initial support constraint to filter out false frequent items and rarely occurring items. This improves the structure of the dataset and results in faster, more accurate results that use less memory than previous approaches. The improved dataset is transformed into a Boolean-valued information system, allowing it to be represented as a soft set. Association rules are then mined between sets of co-occurring parameters using soft set theory. Experimental results show this approach produces strong association rules faster with the same accuracy using less memory space.
This document proposes a new framework for secure mobile commerce (m-commerce) that combines double layer encryption, steganography, and secure XML messages transferred between a mobile terminal and server. The framework is based on J2ME/MIDP and aims to provide strong security and invisibility while maintaining high operating efficiency and compatibility with many mobile terminals. It encrypts data using an elliptic curve cryptography algorithm and hides the encrypted information in images using random least significant bit steganography before transmitting between devices.
Natural Disaster (Tsunami) and Its Socio Economic and Environmental Impact – ...IJERA Editor
Natural Disaster (Tsunami) and Its Socio Economic And Environmental Impact – A Case Study Of
Kanyakumari Coast”. Kanyakumari is the southernmost district of Tamil Nadu. The software Arc Gis are used
to demarcate the Natural Disaster ( Tsunami) and its socio Economic and Environment Impact. The district lies
between longitudes is 77˚15‟ E 77˚36‟ Eastern longitudes. The Latitudes is 8˚03‟ N to 8˚35‟ Northern
latitudes.The District is bound by Tirunelveli District on the North and the East. The South Eastern boundary is
the Gulf of Manner. On the South and the South West, the boundaries are the Indian Ocean and the Arabian Sea.
On the West and Northwest it is bounded by Kerala. The Kanyakumari District total areas area is 1430.3Km.
The Coastal Villages elevations are 5 meter to 50 meter above mean sea level.Tirunelveli linked with the
Kanyakumari city by both road and railways. It is located south of Trichy at distance of 335km .Kanyakumari
was formed 1835 AD. It has an area of 1671.3 Km2 with 16.76 Lakh populations as per 2011 Census. The study
made by the researcher confirmed the various relief measures carried out in the affected areas in general and in
Agashteeshwaram Taluk in Kanyakumari measures be programmed in such a way that they facilities of their
livelihood besides regaining their aspirations of life.
Congestion Control in Wireless Sensor Networks: A surveyIJERA Editor
Congestion is a major problem in almost all kinds of wireless networks such as mobile ad-hoc networks; wireless
sensor networks (WSNs). There are variety of applications of WSN such as defense, temperature monitoring,
health monitoring. Congestion occurs in the sensor network because of limited resources such as low processing
power of the sensor node. As all the sensor nodes are battery powered. Hence, congestion in the sensor network
results in waste of energy of sensor nodes. All the layers of protocol suite of the network can be involved in the
congestion control process. This paper gives a brief idea about various congestion control methods. In some of
the schemes, cross-layer design is applied for better results.
Graphical Password by Watermarking for securityIJERA Editor
The most common authentication method is to use alphanumerical usernames and passwords. This method has
been shown to have considerable disadvantage. For example, users tend to pick passwords that can be easily
guessed. On the other hand, if a password is very difficult to guess, then it is often difficult to remember. To
address this problem, some researchers have developed authentication methods that use pictures as passwords.
Graphical Password based on the fact that humans tend to remember images better. In this paper, we will
propose a new algorithm that using watermarking technique as the solution to solving image gallery attacks and
using the random character set generation for each image for resistance to shoulder surfing attack to provide
better system security. All the information images in registration phase will be process by copy right protection
of watermarking where the login page will check this information for security purposes.
Analysis of a Compessor Rotor using Finite Element AnalysisIJERA Editor
This document analyzes the stresses on an axial compressor rotor using finite element analysis. It summarizes the modeling, analysis, and results of analyzing an existing 18-blade rotor model using two materials (chromium steel and titanium alloy), as well as modified 16-blade and 14-blade models using the same materials. Von Mises stresses were lowest for the 14-blade titanium alloy model. The conclusion is that titanium alloy provides better performance than chromium steel, and reducing the number of blades from 18 to 14 further reduces stresses.
A Review: Significant Research on Time And Frequency Synchronization In MIMO ...IJERA Editor
This paper proposes a fast and dependable procedure for timing and frequency synchronization of multiple-input
multiple- output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. Orthogonal frequency
division multiplexing (OFDM) could be a outstanding technique for high info rate remote transmission. The
execution of OFDM framework is exceptionally touchy to transporter repeat Offset (CFO) that presents between
bearer electric resistances (ICI). Multi data multi yield frame work used for increasing various qualities increase
and limit of the framework. During this space repeat synchronization in associate OFDM framework is
contemplated and gave past work OFDM framework.
Validation of the Newly Developed Fabric Feel Tester for Its Accuracy and Rep...IJERA Editor
The present paper deals with a comprehensive study of reproducibility of the newly developed instrument to
study fabric handle characteristics using extraction principle. As reported earlier that a new nozzle extraction
method for objective measurement of fabric handle characteristics has been developed. The force exerted by the
fabric being drawn out of the nozzle is known as extraction force and the force exerted by the fabric at the side
wall of the nozzle is known as radial force. A few fabric samples have been tested on this newly developed
instrument and the effect of numbers of tests has been studied. It has been observed that minimum five samples
of a fabric test in this instrument gives lower standard deviation of the test results. Also the overall deviations of
results justified the reproducibility of the instrument and hence the said instrument if validated for its testing
parameters.
SRGM Analyzers Tool of SDLC for Software Improving QualityIJERA Editor
Software Reliability Growth Models (SRGM) have been developed to estimate software reliability measures such as
software failure rate, number of remaining faults and software reliability. In this paper, the software analyzers tool proposed
for deriving several software reliability growth models based on Enhanced Non-homogeneous Poisson Process (ENHPP) in
the presence of imperfect debugging and error generation. The proposed models are initially formulated for the case when
there is no differentiation between failure observation and fault removal testing processes and then this extended for the case
when there is a clear differentiation between failure observation and fault removal testing processes. Many Software
Reliability Growth Models (SRGM) have been developed to describe software failures as a random process and can be used
to measure the development status during testing. With SRGM software consultants can easily measure (or evaluate) the
software reliability (or quality) and plot software reliability growth charts.
A Microcontroller Based Intrusion Detection SystemIJERA Editor
A Microcontroller based Intrusion Detection System is designed and implemented. Rampant, Okintrusion to
restricted zones have highlighted the need for embedded systems that can effectively monitor, instantly alert
personnel of any breach in security and retrieve graphic evidence of any such activity in the secured area. At the
heart of the intrusion detection system is the PIC 168F77A Microcontroller that transmits pulses at 38 KHz. It is
suitably interfaced to a GSM modem that can send SMS on sight of infringement and a webcam that can take
snapshots. The report also presents the system software which has been developed in two parts: one in C++
Language using MPLAB KIT and the other written in AT COMMAND resident in the GSM modem. The
system is very cost-effective, uses easily available components and is adaptable to control systems.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
This study evaluated methods for in vitro mass propagation of Asclepias curassavica through direct and indirect regeneration. Leaf explants produced the most callus on MS medium supplemented with 2,4-D. Organogenic callus developed shoots when transferred to MS medium with BAP and GA3. Nodal explants performed better than shoot tips. Among media, L2 medium with KN and auxins produced the most shoots. L2 medium was superior for shoot multiplication and elongation compared to MS medium. This work developed an efficient protocol for micropropagation of this medicinally important plant using nodal explants on L2 medium.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
[1] O documento descreve funcionalidades do ArcGIS para criação de layouts para impressão, incluindo a interface de layout, uso de modelos, propriedades de página, elementos de layout e configuração da estrutura de dados. [2] É explicado como criar um layout a partir de um modelo existente ou criar um novo modelo, e como configurar propriedades como moldura, grades de coordenadas e elementos do layout. [3] São detalhados os passos para adicionar diferentes elementos ao layout, como título, texto, legenda e barra de escala.
O relatório apresenta dados sobre o mercado de trabalho da Região Metropolitana de Recife em março de 2014. A taxa de desemprego ficou estável em 5,5% em relação a fevereiro de 2014 e caiu 1,3 pontos percentuais em relação a março de 2013. O número de pessoas ocupadas e desocupadas permaneceu estável no mês, enquanto a renda média dos trabalhadores aumentou 1,3% no ano.
El documento describe los conceptos básicos de entrada/salida (E/S) en sistemas computacionales. Explica que la E/S permite la interacción entre programas y usuarios mediante la entrada de datos y órdenes por el usuario y la salida de respuestas por el programa. También cubre temas como almacenamiento de datos en archivos, tipos de E/S, dispositivos de E/S, y técnicas para realizar operaciones de E/S como la programada, dirigida por interrupciones y acceso directo a memoria.
Este documento proporciona información sobre inversiones inmobiliarias en Brasil. Resume datos económicos como el crecimiento del PIB y la distribución de la renta por estado. Explica que la clase media ahora es la mayoría de la población brasileña. También describe oportunidades en los sectores inmobiliario y comercial, incluyendo viviendas, centros comerciales y cadenas de restaurantes. Resalta que Brasil ofrece costos más bajos de construcción y suelo que España.
Enhanced Quality of Service Based Routing Protocol Using Hybrid Ant Colony Op...Editor IJCATR
The main problem of QoS routing is to setup a multicast hierarchy that may meet particular QoS constraint. In order to reduce the constraints of the earlier work a new improved technique is proposed in this work. In the proposed technique the issue of multi-cast tree is eliminated using clustering based technique. First of all multi-radio and multichannel based clustering is deployed and these cluster head are responsible
for the multicasting. It will diminish the overall energy consumption of nodes and complexity of intelligent algorithms. The path will be evaluated based upon the ant colony optimization. Thus it has produced better results than other techniques.
Enhanced Quality of Service Based Routing Protocol Using Hybrid Ant Colony Op...Editor IJCATR
This document presents a new routing protocol for mobile ad hoc networks that uses a hybrid of ant colony optimization and particle swarm optimization algorithms. It aims to improve quality of service for routing by using a clustering technique to eliminate multicast trees and assign cluster heads to be responsible for multicasting. The path selection is evaluated based on ant colony optimization to produce better results than other techniques. It is proposed that this approach will diminish overall energy consumption and complexity compared to previous work. The document provides background on mobile ad hoc networks, routing protocols, and related work applying swarm intelligence and other algorithms to routing.
Enhanced Quality of Service Based Routing Protocol Using Hybrid Ant Colony Op...Editor IJCATR
The main problem of QoS routing is to setup a multicast hierarchy that may meet particular QoS constraint. In order to reduce the constraints
of the earlier work a new improved technique is proposed in this work. In the proposed technique the issue of multi-cast tree is eliminated
using clustering based technique. First of all multi-radio and multichannel based clustering is deployed and these cluster head are responsible
for the multicasting. It will diminish the overall energy consumption of nodes and complexity of intelligent algorithms. The path will be
evaluated based upon the ant colony optimization. Thus it has produced better results than other techniques.
Enhanced Quality of Service Based Routing Protocol Using Hybrid Ant Colony Op...Editor IJCATR
This document presents a new routing protocol for mobile ad hoc networks that uses a hybrid of ant colony optimization and particle swarm optimization algorithms. It aims to improve quality of service for routing by using a clustering technique to eliminate multicast trees and assign cluster heads to be responsible for multicasting. The path selection is evaluated based on ant colony optimization to produce better results than other techniques. It is proposed that this approach will diminish overall energy consumption and complexity compared to previous algorithms. The document provides background on mobile ad hoc networks, routing protocols, and related work applying swarm intelligence and other approaches to improve QoS routing.
This document provides an overview of computer networks and their basic components. It discusses how networks connect devices like computers, printers and servers to allow sharing of resources. Local area networks (LANs) connect devices within a building, while wide area networks (WANs) span greater distances. The two main types of networks are peer-to-peer and client-server. Client-server networks have centralized data storage on servers for easier management. Network topologies like star, bus and ring determine how data flows. Key network components include network interface cards, hubs, switches, bridges, routers and gateways. The document also describes the CSMA/CD and token ring access methods for transmitting data over the network.
This document discusses integrating the internet with mobile ad-hoc networks using an extended version of the AODV routing protocol. It begins with an introduction to mobile ad-hoc networks and their applications. It then discusses challenges in routing for MANETs and existing routing protocols like AODV. It proposes extending the AODV protocol with additional "I-flag" to discover internet gateways. The extended RREQ and RREP messages are described. It then discusses using the Network Simulator 2 to simulate this extended AODV approach with different scenarios connecting wireless and wired networks via 1 or more hops. The goal is to provide internet connectivity for mobile nodes with high packet delivery and low delay.
The International Journal of Engineering and Science (The IJES)theijes
The document summarizes a study on the Enhanced Adaptive Acknowledge (EAACK) scheme for detecting misbehaving nodes in mobile ad hoc networks (MANETs). It discusses the limitations of existing acknowledgment-based intrusion detection systems like Watchdog, TWOACK, and AACK in handling receiver collisions. The key issues related to acknowledgment-based schemes for detecting misbehavior in MANETs are addressed. The focus is on analyzing the limitations of acknowledgment approaches like AACK and studying EAACK as an improved approach for addressing receiver collisions in MANETs.
Correlation Associativity b/w Sensor Information Network Architecture & Softw...Iqra khalil
This document summarizes the correlation between sensor information network architecture and software-defined wireless networks. It discusses how software-defined networking aims to make networks more flexible and agile. It also covers several wireless network types including mobile wireless sensor networks, wireless ad hoc networks, mobile ad hoc networks, and vehicular ad hoc networks. The document presents sensor information network architecture and its use of a sensor query and tasking language to programmatically interface with sensor networks.
This document discusses security challenges in wireless sensor networks. It outlines key challenges like limited energy and communication capabilities as sensors are often deployed in accessible areas. It discusses approaches for secure key establishment, privacy concerns around surveillance, threats like denial of service attacks, and the need for secure routing, intrusion detection, and data aggregation given the resource constraints of sensor networks. Research is still needed to address security challenges posed by the unique aspects of sensor network environments and applications.
This document discusses firewall security in computer networks. It begins by defining firewalls as hardware, software, or a combination used to prevent unauthorized access to private networks or computers. It then summarizes the differences between hardware and software firewalls. The document goes on to explain how software firewalls work by inspecting packets of data. The rest of the document discusses wireless mesh networks, including routing protocols, standards, network architecture, advantages, and disadvantages.
A Survey on Secure Routing Protocol for Data Transmission in ad hoc NetworksBRNSSPublicationHubI
The document summarizes research on secure routing protocols for data transmission in ad hoc networks. It discusses five main points:
1) It examines security threats to ad hoc routing protocols like AODV and proposes ARAN, an authenticated routing protocol that detects malicious actions through authentication, integrity checks, and non-repudiation.
2) It discusses implementing end-to-end security on mobile devices using the TLS protocol to secure transmissions.
3) It proposes OLSR, an optimized link-state routing protocol for large, dense ad hoc networks that reduces control packet sizes and flooding.
4) It develops a security mechanism using digital signatures and hash chains to secure AODV routing messages and
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.
Iaetsd key reconstruction and clustering opponent nodes in minimum costIaetsd Iaetsd
This document summarizes a paper on securing wireless mesh networks using clustering and cryptography. It discusses how wireless mesh networks work and security issues related to packet transmission. It proposes using clustering to group nodes and identify misbehaving nodes. A multipath split routing protocol is used to generate multiple disjoint paths. Finite state machines are used to analyze node behavior and identify selfish nodes. Misbehaving nodes are clustered separately from authorized nodes. Cryptographic key regeneration techniques are then used to provide encryption on packets and protect data from adversary nodes.
This document proposes a secure communication protocol (SCP) for ad hoc networks using clustering techniques and Kerberos authentication. Key points:
M = {Nid, Knch, CHid}
- The network is divided into clusters, each with a cluster head (CH) node responsible for authentication.
Is encrypted by using public key of new node
Kun and send to new node. The new node
decrypts the message and stores Nid, Knch, CHid
information. Now the new node is authenticated
node of that cluster. The CH updates its
database with new node information.
- CHs use Kerberos authentication to generate IDs and passwords for nodes to authenticate each
Analysis Of Wireless Sensor Network Routing ProtocolsAmanda Brady
This document proposes using Border Gateway Protocol (BGP) and inter-domain packet filters (IDPFs) to limit IP spoofing on the internet. IDPFs would be constructed using information from BGP route updates and deployed on border routers. IDPFs aim to minimize IP spoofing without requiring global routing information. The framework is designed so that it does not incorrectly discard packets with valid source addresses. With even partial deployment, IDPFs could reduce the level of IP spoofing on the internet.
AggreLEACH: Enhance Privacy Preserving in Wireless Sensor Networkijsrd.com
Privacy preservation is an important issue in today's context of extreme penetration of internet and mobile technology. It is more important in the case of wireless sensor network where collected data often requires in network processing and collaborative computing. Security is always booming in wireless sensor network. Privacy preserving data aggregation emerged as an important concern in designing data aggregation algorithm. Encryption schemes that support operation over cipher text are of utmost for wireless sensor networks & especially in LEACH protocol. The salient limit of LEACH is energy. Due to this limitation, it seems important to design Confidentiality scheme for WSN so that sensing data can be transmitted to the receiver securely and efficiently and the energy consumed must be minimum hence we proposed AggreLEACH in which confidentiality scheme i.e. holomorphic encryption is added to LEACH protocol. In holomorphic encryption data can be aggregated without decryption and hence less energy consumption. The objective is to provide secure data transmission between sensor node and aggregator. Simulation result are obtain in terms of two metrics- total energy Consumed of node, life-time of node. It is observed that the performance of AggreLEACH compare to LEACH. We have performed theoretical analysis as well as simulation to check the performance in terms of accuracy, complexity and security.
Ad hoc networks are the special networks formed for specific applications. Operating in ad-hoc mode
allows all wireless devices within range of each other to discover and communicate in a peer-to-peer
fashion without involving central access points. Many routing protocols like AODV, DSR etc have been
proposed for these networks to find an end to end path between the nodes. These routing protocols are
prone to attacks by the malicious nodes. There is a need to detect and prevent these attacks in a timely
manner before destruction of network services.
This document discusses security issues in ad-hoc networks. It begins by outlining some key problems in ad-hoc network routing including lack of infrastructure, dynamic topology changes, wireless communication vulnerabilities, and implicit trust between nodes. It then analyzes specific attacks like modifying routing protocol messages. Several solutions are proposed, including concealing network topology using security agents or zone routing, and using watchdog and pathrater mechanisms to identify and isolate misbehaving nodes to improve throughput. The watchdog detects nodes that fail to forward packets by listening to transmissions, while pathrater avoids routing through misbehaving nodes to choose more reliable paths.
The document describes a pairwise key establishment scheme for ad hoc networks. It proposes using cellular automata rules to dynamically establish shared keys between two nodes. Each node sends either a cellular automata rule or the initialization parameters to the other node. The receiving node then uses the rule and parameters along with cellular automata computations to independently derive the shared key. This allows keys to be established dynamically without transmitting the actual keys or requiring an online server. The scheme aims to provide secure communication through pairwise key establishment while being computationally efficient and not relying on predistributed keys.
Black-Hole and Wormhole Attack in Routing Protocol AODV in MANETIJCSEA Journal
Mobile ad hoc network (MANET) is a self-configuring network that is formed automatically via wireless links by a collection of mobile nodes without the help of a fixed infrastructure or centralized management. The mobile nodes allow communication among the nodes outside the wireless transmission range by hop to hop and the forward packets to each other. Due to dynamic infrastructure-less nature and lack of centralized monitoring points, the ad hoc networks are vulnerable to attacks. The network performance and reliability is break by attacks on ad hoc network routing protocols. AODV is a important on-demand reactive routing protocol for mobile ad hoc networks. There is no any security provision against a “BlackvHole” and “Wormhole” attacks in existing AODV protocol. Black hole nodes are those malicious nodes that conform to forward packet to destination. But they do not forward packet intentionally to the destination node. The black hole nodes degrade the performance of network eventually by participating in the network actively. The propose watchdog mechanism detect the black hole nodes in a MANET. This method first detects a black hole attack in the network and then provide a new route to this node. In this, the performance of original AODV and modified AODV in the presence of multiple black hole nodes is find
out on the basis of throughput and packet delivery ratio. In a wormhole attack, intruders tunnel the data from one end of the network to the other, leading distant network nodes to trust they are neighbors’ and making them communicate through the wormhole link.
From Natural Language to Structured Solr Queries using LLMsSease
This talk draws on experimentation to enable AI applications with Solr. One important use case is to use AI for better accessibility and discoverability of the data: while User eXperience techniques, lexical search improvements, and data harmonization can take organizations to a good level of accessibility, a structural (or “cognitive” gap) remains between the data user needs and the data producer constraints.
That is where AI – and most importantly, Natural Language Processing and Large Language Model techniques – could make a difference. This natural language, conversational engine could facilitate access and usage of the data leveraging the semantics of any data source.
The objective of the presentation is to propose a technical approach and a way forward to achieve this goal.
The key concept is to enable users to express their search queries in natural language, which the LLM then enriches, interprets, and translates into structured queries based on the Solr index’s metadata.
This approach leverages the LLM’s ability to understand the nuances of natural language and the structure of documents within Apache Solr.
The LLM acts as an intermediary agent, offering a transparent experience to users automatically and potentially uncovering relevant documents that conventional search methods might overlook. The presentation will include the results of this experimental work, lessons learned, best practices, and the scope of future work that should improve the approach and make it production-ready.
"$10 thousand per minute of downtime: architecture, queues, streaming and fin...Fwdays
Direct losses from downtime in 1 minute = $5-$10 thousand dollars. Reputation is priceless.
As part of the talk, we will consider the architectural strategies necessary for the development of highly loaded fintech solutions. We will focus on using queues and streaming to efficiently work and manage large amounts of data in real-time and to minimize latency.
We will focus special attention on the architectural patterns used in the design of the fintech system, microservices and event-driven architecture, which ensure scalability, fault tolerance, and consistency of the entire system.
"Choosing proper type of scaling", Olena SyrotaFwdays
Imagine an IoT processing system that is already quite mature and production-ready and for which client coverage is growing and scaling and performance aspects are life and death questions. The system has Redis, MongoDB, and stream processing based on ksqldb. In this talk, firstly, we will analyze scaling approaches and then select the proper ones for our system.
[OReilly Superstream] Occupy the Space: A grassroots guide to engineering (an...Jason Yip
The typical problem in product engineering is not bad strategy, so much as “no strategy”. This leads to confusion, lack of motivation, and incoherent action. The next time you look for a strategy and find an empty space, instead of waiting for it to be filled, I will show you how to fill it in yourself. If you’re wrong, it forces a correction. If you’re right, it helps create focus. I’ll share how I’ve approached this in the past, both what works and lessons for what didn’t work so well.
LF Energy Webinar: Carbon Data Specifications: Mechanisms to Improve Data Acc...DanBrown980551
This LF Energy webinar took place June 20, 2024. It featured:
-Alex Thornton, LF Energy
-Hallie Cramer, Google
-Daniel Roesler, UtilityAPI
-Henry Richardson, WattTime
In response to the urgency and scale required to effectively address climate change, open source solutions offer significant potential for driving innovation and progress. Currently, there is a growing demand for standardization and interoperability in energy data and modeling. Open source standards and specifications within the energy sector can also alleviate challenges associated with data fragmentation, transparency, and accessibility. At the same time, it is crucial to consider privacy and security concerns throughout the development of open source platforms.
This webinar will delve into the motivations behind establishing LF Energy’s Carbon Data Specification Consortium. It will provide an overview of the draft specifications and the ongoing progress made by the respective working groups.
Three primary specifications will be discussed:
-Discovery and client registration, emphasizing transparent processes and secure and private access
-Customer data, centering around customer tariffs, bills, energy usage, and full consumption disclosure
-Power systems data, focusing on grid data, inclusive of transmission and distribution networks, generation, intergrid power flows, and market settlement data
Must Know Postgres Extension for DBA and Developer during MigrationMydbops
Mydbops Opensource Database Meetup 16
Topic: Must-Know PostgreSQL Extensions for Developers and DBAs During Migration
Speaker: Deepak Mahto, Founder of DataCloudGaze Consulting
Date & Time: 8th June | 10 AM - 1 PM IST
Venue: Bangalore International Centre, Bangalore
Abstract: Discover how PostgreSQL extensions can be your secret weapon! This talk explores how key extensions enhance database capabilities and streamline the migration process for users moving from other relational databases like Oracle.
Key Takeaways:
* Learn about crucial extensions like oracle_fdw, pgtt, and pg_audit that ease migration complexities.
* Gain valuable strategies for implementing these extensions in PostgreSQL to achieve license freedom.
* Discover how these key extensions can empower both developers and DBAs during the migration process.
* Don't miss this chance to gain practical knowledge from an industry expert and stay updated on the latest open-source database trends.
Mydbops Managed Services specializes in taking the pain out of database management while optimizing performance. Since 2015, we have been providing top-notch support and assistance for the top three open-source databases: MySQL, MongoDB, and PostgreSQL.
Our team offers a wide range of services, including assistance, support, consulting, 24/7 operations, and expertise in all relevant technologies. We help organizations improve their database's performance, scalability, efficiency, and availability.
Contact us: info@mydbops.com
Visit: https://www.mydbops.com/
Follow us on LinkedIn: https://in.linkedin.com/company/mydbops
For more details and updates, please follow up the below links.
Meetup Page : https://www.meetup.com/mydbops-databa...
Twitter: https://twitter.com/mydbopsofficial
Blogs: https://www.mydbops.com/blog/
Facebook(Meta): https://www.facebook.com/mydbops/
inQuba Webinar Mastering Customer Journey Management with Dr Graham HillLizaNolte
HERE IS YOUR WEBINAR CONTENT! 'Mastering Customer Journey Management with Dr. Graham Hill'. We hope you find the webinar recording both insightful and enjoyable.
In this webinar, we explored essential aspects of Customer Journey Management and personalization. Here’s a summary of the key insights and topics discussed:
Key Takeaways:
Understanding the Customer Journey: Dr. Hill emphasized the importance of mapping and understanding the complete customer journey to identify touchpoints and opportunities for improvement.
Personalization Strategies: We discussed how to leverage data and insights to create personalized experiences that resonate with customers.
Technology Integration: Insights were shared on how inQuba’s advanced technology can streamline customer interactions and drive operational efficiency.
Essentials of Automations: Exploring Attributes & Automation ParametersSafe Software
Building automations in FME Flow can save time, money, and help businesses scale by eliminating data silos and providing data to stakeholders in real-time. One essential component to orchestrating complex automations is the use of attributes & automation parameters (both formerly known as “keys”). In fact, it’s unlikely you’ll ever build an Automation without using these components, but what exactly are they?
Attributes & automation parameters enable the automation author to pass data values from one automation component to the next. During this webinar, our FME Flow Specialists will cover leveraging the three types of these output attributes & parameters in FME Flow: Event, Custom, and Automation. As a bonus, they’ll also be making use of the Split-Merge Block functionality.
You’ll leave this webinar with a better understanding of how to maximize the potential of automations by making use of attributes & automation parameters, with the ultimate goal of setting your enterprise integration workflows up on autopilot.
Freshworks Rethinks NoSQL for Rapid Scaling & Cost-EfficiencyScyllaDB
Freshworks creates AI-boosted business software that helps employees work more efficiently and effectively. Managing data across multiple RDBMS and NoSQL databases was already a challenge at their current scale. To prepare for 10X growth, they knew it was time to rethink their database strategy. Learn how they architected a solution that would simplify scaling while keeping costs under control.
zkStudyClub - LatticeFold: A Lattice-based Folding Scheme and its Application...Alex Pruden
Folding is a recent technique for building efficient recursive SNARKs. Several elegant folding protocols have been proposed, such as Nova, Supernova, Hypernova, Protostar, and others. However, all of them rely on an additively homomorphic commitment scheme based on discrete log, and are therefore not post-quantum secure. In this work we present LatticeFold, the first lattice-based folding protocol based on the Module SIS problem. This folding protocol naturally leads to an efficient recursive lattice-based SNARK and an efficient PCD scheme. LatticeFold supports folding low-degree relations, such as R1CS, as well as high-degree relations, such as CCS. The key challenge is to construct a secure folding protocol that works with the Ajtai commitment scheme. The difficulty, is ensuring that extracted witnesses are low norm through many rounds of folding. We present a novel technique using the sumcheck protocol to ensure that extracted witnesses are always low norm no matter how many rounds of folding are used. Our evaluation of the final proof system suggests that it is as performant as Hypernova, while providing post-quantum security.
Paper Link: https://eprint.iacr.org/2024/257
What is an RPA CoE? Session 1 – CoE VisionDianaGray10
In the first session, we will review the organization's vision and how this has an impact on the COE Structure.
Topics covered:
• The role of a steering committee
• How do the organization’s priorities determine CoE Structure?
Speaker:
Chris Bolin, Senior Intelligent Automation Architect Anika Systems
Discover top-tier mobile app development services, offering innovative solutions for iOS and Android. Enhance your business with custom, user-friendly mobile applications.
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdfChart Kalyan
A Mix Chart displays historical data of numbers in a graphical or tabular form. The Kalyan Rajdhani Mix Chart specifically shows the results of a sequence of numbers over different periods.
"What does it really mean for your system to be available, or how to define w...Fwdays
We will talk about system monitoring from a few different angles. We will start by covering the basics, then discuss SLOs, how to define them, and why understanding the business well is crucial for success in this exercise.
"What does it really mean for your system to be available, or how to define w...
Lt2520382043
1. Prof. Pranita M. Potey, Prof.Manish Potey, Prof. Nandini C. Nag / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 5, September- October 2012, pp.2038-2043
Authentication Based Scheme In MANET Using Cluster Based
Routing Protocol
Prof. Pranita M. Potey, Prof.Manish Potey, Prof. Nandini C. Nag
(Department of Electronics & Telecommunication, Mumbai University, India)
(Department of Computer Engineering, Mumbai University, India)
(Department of Electronics & Telecommunication, Mumbai University, India)
.
ABSTRACT
Mobile and wireless technology is problems & priority mechanisms to provide certain
growing at a rapid rate. These advances have quality of service. This type of networks provides
resulted in breakthroughs that have made greatest possible flexibility.
feasible several prospects that were thought as
impossible. Ad hoc networks are a consequence of The absence of any central coordinator or
the ceaseless research efforts in Mobile and base station makes the routing a complex one
Wireless networks. Ad hoc network is a class of compared to cellular networks. In an ad hoc wireless
wireless networks where there is no fixed network the routing and resource management are
infrastructure. Unlike traditional networks they done in a distributed manner in which all the nodes
do not have base stations to coordinate the coordinate to enable communication among them.
activities of mobile hosts. This requires each node to be more intelligent so that
In this paper we proposed the it can function both as a network host for
authentication scheme using CBRP in MANETS. transmitting and receiving data and as a network
Here we have explored the concept of MANETS router for routing packets from other nodes. Hence
in location database management with proper the mobile nodes in ad hoc wireless networks are
authentication. For this purpose we have more complex than their counterparts in cellular
presented a distributed network consisting of two networks. The ad hoc routing protocol should
clusters along with their cluster heads. minimize routing overhead, broken links or new
Keywords- Authentication, CBRP, Cluster, routes should be detected as soon as possible,
MANET. changes to the network topology should be detected
and new routes must be created as soon as possible.
1. INTRODUCTION It should also minimize memory or computation
Mobile Adhoc wireless networks are power at the hosts.
basically the category of wireless networks that
utilize multi–hop radio relaying and are capable of Wireless mesh networks and wireless
operating without the support of any fixed sensor networks are specific examples of ad hoc
infrastructure. Hence they are also called wireless networks.These networks could be
infrastructures less networks. extremely useful in any scenario where
geographical, terrestrial or time constraints make it
Ad hoc wireless networks don‟t need any impossible to have base stations. In battlefields or
infrastructure to work. In this each node can any other disaster situation where a network needs to
communicate with another node without any access be formed on an ad hoc basis without the support of
point controlling medium access. Nodes in an ad hoc any fixed infrastructure. In military applications it
network can communicate only if they can is also desirable to have a distributed system so that
physically reach each other i.e. if they are within the risk of the entire network being compromised
each other‟s radio range or if other nodes can due to a single central authority is taken care of.
forward the message. Nodes from two ad hoc
networks can‟t therefore communicate with each 2. AUTHENTICATION IN MANETS
other if they are not within the same radio range. In Basically there are two main approaches to
ad hoc networks there might be only selected nodes solve the authentication problem in ad hoc networks.
which have the capability to forward data. In such a These two groups of cryptographic technique are
case most of the nodes have to connect to such a defined using the basic classification used in
special node first in order to transmit data if the cryptography which distinguishes between secret
receiver is out of range. and public key methods.
The solution included in the first group are
In ad hoc networks, the complexity of each not many and they are recommended for sensor
node is higher because every node has to implement networks as the devices forming these networks are
medium access mechanisms which are the even more constrained in their resources.
mechanisms to handle hidden or exposed terminal
2038 | P a g e
2. The second approach methods based on Public Key different sessions. Hence protocols have been
Infrastructure (PKI) are the most studied so far. The proposed to drive a strong key (not vulnerable to
main focus is on how to use public key cryptography attacks) from the weak passwords given by the
and how to manage public key certificates in this participants. This password based system could be
restricted atmosphere. two parties, with a separate exchange between any
two participants, or it could be for whole group, with
Among the available possibilities to a leader being elected to preside over the sessions.
implement PKI in ad-hoc networks the easiest way is Leader election is a special case of establishing an
to employ a global trusted centralized certification order among participants. The protocol used is as
authority (CA).Nevertheless this approximation follows. Each participant generates a random
should be discarded as it will hinder scalability. The number, and sends to all others. When every node
main obstacle is that the access to this entity may has received a random number of every other node, a
provoke a bottleneck slowing down the common presided function is applied on all the
communications among the member of the network numbers to calculate a reference value. The nodes
since it is compulsory connecting with CA and are ordered based on the difference between their
verify each time the certificate. The most natural random number and the reference value.
modification is to distribute the CA task among a set
of nodes. In this sense the CA‟S functions will be 3.2 Threshold Cryptography
developed by a set of special servers included in the Public key infrastructure (PKI) enables the
network. These servers will sign the public key of easy distribution of keys and a scalable method.
the nodes. In this way each time a component of the Each node has a public/private key pair and a
network B wishes to communicate with A of its peer certifying authority (CA) can bind the keys to the
should be in contact with the servers in advance in particular node. But the CA has to be present all the
order to obtain A‟s public key signed with CA‟S time, which may not be feasible in ad hoc wireless
secret Key. network. It is also not advisable to simply duplicate
the CA at different nodes. A scheme based on
3. KEY MANAGMENT threshold cryptography has been proposed by which
Ad hoc wireless networks pose certain n servers exists in ad hoc wireless network, out of
specific challenges in key management due to lack which any (t + 1) servers can jointly perform any
of infrastructure in such networks. Two types of arbitration or authorization successfully, but t
infrastructure have been identified which are absent servers cannot perform the same. Hence up to t
in the ad hoc was the network in wireless network. compromised servers can be tolerated, this is called
The first infrastructure, such as dedicated routers and as (n, t+1) configuration, where n >3t+1.
stable links. This ensures communication with all
nodes. The second missing infrastructure in ad hoc To sign a certificate each server generates a
wireless networks is the administrative support of partial signature using its private key and submits it
certifying authorities. to a combiner. The combiner can be any one of the
servers, in order to ensure that the key is combined
3.1 Password Based Group Systems correctly, t+1 combiner can be used to account for at
Several solutions for group keying in ad most t malicious servers, using t+1 partial signatures
hoc wireless networks have been suggested in the (obtained from itself and t other servers), the
example scenario for implementation is a meeting combiner computes a signature and verifies its
room, where different mobile devices want to start a validity using a public key. If the verification fails it
secure session. The parties involved in the session means that any one of the t+1 key is not valid, so
are to be identifies based on location, that is, all another subset of t+1 key is tried. If the combiner
devices in the room can be part of session. Hence, itself is malicious, it cannot get a valid key, because
relative location can be used as the criterion for the partial signature of itself is always invalid.
access control. If a TTP which knows the location of
the participants exists, that it can implement location The scheme can be applied to asynchronous
based access control. A prior shared secret key can networks, with no bound on message delivery or
be obtained by plugging on to a wired network first, processing times. This is one of the strengths of the
before switching to the wireless mode. A password scheme, as the requirement of synchronization
based system has been explored where, in the makes the system vulnerable to DOS attacks, an
simplest case, a long string is given as a password adversary can delay a node long enough to violate
for users for one session. However human beings the synchrony assumption, thereby disrupting a
tend to favor natural flavor, natural language phrases system.
as password, over randomly generated strings. Such
passwords if used as keys directly during a session, Sharing a secret in a secure manner alone
are really weak and open to attack because of high does not completely fortify a system. Mobile
redundancy, and the possibility of reuse over adversaries can move from one server to another,
2039 | P a g e
3. attack them and get hold of their private keys. To infrastructure, each node has a public / private key
counter this share refreshing has been proposed, by pair, public keys can be distributed to other nodes,
which servers create a new independent set of shares while private keys should be kept confidential to
(the partial signatures which are used by the servers) individual nodes. There is a trusted entity called
periodically. Hence to break the system, an advisory Certification Authority (CA) for key management
has to attack and capture more than t servers within .The CA has a public / private key pair, with its
the period between two successive refreshes. public key known to every node, and signs
Otherwise the earlier share information will no certificates binding public keys to nodes. The trusted
longer be valid. This improves protection against CA has to stay on – line to reflect the current
mobile adversaries. bindings, because the bindings could change over
time: A public key should be revoked if the owner
3.3 Self Organized Public Key Management node is no longer trusted or is out of the network a
For Mobile Ad hoc Network node may refresh its key pair periodically to reduce
We have proposed a completely self- the chance of a successful brute-force attack on its
organized public key system for ad hoc wireless private key.
networks. This makes use of absolutely no
infrastructure – TTP, CA, or server even during It is problematic to establish a key
initial configuration. The users in the ad hoc wireless management service using a single CA in ad hoc
network issue certificates to each other based on networks. The CA, responsible for the security of
personal acquaintance. A certificate is a binding the entire network, is a vulnerable point of the
between a node and its public key. These certificates network. If the CA is unavailable, nodes cannot get
are also stored and used by users themselves. the current public keys of other nodes or to establish
Certificates are issued only for specific period of secure communication with others. If the CA is
time and contain their time of expiry along with compromised and leaks its private key to an
them. Before it expires, the certificate is updated by adversary, the adversary can then sign any erroneous
the user who had issued the certificate. certificate using this private key to impersonate any
node or to revoke any certificate.
Initially each user has a local storage area
consisting of certificate issued by him and the A standard approach to improve availability
certificate issued by the other user to him hence, of a service is replication. But a replication of the
each certificate is stored twice by the issuer and the CA makes the service more vulnerable. Compromise
person for whom it has issued, periodically of any single replica, which possesses the service
certificates from neighbors are requested and the private key, could lead to collapse of the entire
repository is updated by adding any new certificates. system. To solve this Problem, we distribute the
If any of the certificates are conflicting (example, trust to a set of nodes by letting these nodes share
the same public key to different users, or the same the key management.
user having different public keys), it is possible that
a malicious note has issued a false certificate. A 5. AUTHENTICATION STRATEGY
node than labels such certificates as conflicting and The authentication strategy presented here
tries to resolve the conflict. Various method exist to is for a hierarchical architecture. A cluster based
compare the confidence in one certificate over network has been used. The routing protocol that
another for instance another set of certificates uses this is cluster based routing protocol, i.e.,
obtained from another neighbor can be used to take a CBRP.
majority decision. This can be used to evaluate the The cluster based architecture was devised
trust in other users and protect malicious nodes. If to minimize the flooding of route discovery packets.
the certificate issued by some node is found to be The routing protocol that uses this is Cluster Based
wrong, then that node may be assumed to be Routing Protocol, CBRP. This kind of architecture is
malicious. most suitable for large networks with several nodes.
The entire network is divided into a number of
4. KEY MANAGEMENT SERVICE overlapping or disjoint 2-hop-diameter clusters as
We employ cryptographic schemes, such as shown in figure below
digital signatures, to protect both routing
information and data traffic. Use of such schemes
usually requires a key management services. We
adopt a public key infrastructure because of its
superiority in distributing keys and in achieving
integrity and non-repudiation. Efficient secret key
schemes are used to secure further communication
after nodes authenticate each other and establish a
shared secret session key. In a public key
2040 | P a g e
4. public key and broadcast by the head. Each cluster
head also has a unique pair of public/private key
called headkey.
This private key is known only to the head
that generates it. The corresponding public key is
known to all the network nodes. This is done by
means of a network wide broadcast that is initiated
by each head immediately after it gets elected as the
leader. Thus each member node needs to maintain a
pair of system keys, a cluster key and a table
consisting of cluster ids and the corresponding
head‟s public key. The cluster head has an additional
responsibility of storing securely its private key.
Fig 5.1. Cluster Formation STRUCTURE
FIG 5.CLUSTER
7. ALGORITHM
Nodes A, B and their respective cluster
A cluster head is elected for each cluster to heads, CH1 and CH2, are marked. The cluster head
maintain the cluster membership information. A acts as the certification authority for all its members.
cluster is identified by its cluster Head ID. Each If A wishes to communicate with B, the following
node in the network knows its Cluster Head(s) and steps are to be performed for data authentication and
therefore knows which cluster(s) it belongs to. A integrity.
node regards itself as in cluster X if it has bi-
directional link to the head of cluster X. In the The two communicating parties, A and B,
current implementation of CBRP, the node with exchange a session key that is only valid for one
lower node ID is elected as cluster head. All the TCP session. This is exchanged after mutual
nodes broadcast HELLO messages periodically. The authentication for which their corresponding heads
hello messages also contain tables carrying act as CAs. The head‟s keys are used for secretly
information about neighboring nodes and adjacent exchanging session keys. The Cluster Heads then
clusters.These HELLO messages are useful for decrypt and transmit the session key to their
maintaining upto date 2-hop topology. corresponding members who are involved in the
The main focus is on authentication scheme that is session.
most optimal for such hierarchical architectures. When a node wants to establish a session
with another node, it also sends this request to the
6. ASSUMPTIONS head.
The proposed scheme is based on the following
assumptions: The head generates a set of k random prime
1. All the nodes of the network mutually trust one numbers, (R1, R2, Rk), that are fairly large. The
another. This can be safely assumed because the value of k could be as small as 16 or 32.The k
formation of the network itself is after the approval. numbers are encrypted first with the head’s private
2. Each network node has sufficient computational key and then with the cluster key. Along with each
power to execute the encryption algorithms and key number a time-stamp is encrypted so that they could
generation algorithms. be used for a limited amount of time. Therefore,
3. Each node has sufficient memory to store the each cluster head has a table containing Eck
keys. (Epv(R1; tv)); to Eck(Epv(Rk; tv)) where Eck is
4. The transport protocol used is TCP. encryption using cluster key, Epv is encryption using
the head‟s private key and tv is the corresponding
Prior to the explaining the approach, we timestamp.
define the different key types that are used and the The head then broadcasts the k encrypted
method adopted for the distribution of these keys. values, Eck(Epv(R1; tv)); toEck(Epv(Rk; tv)). All
other cluster members could also receive this and
When a node joins the network, it is given a buffer the values since these k values could serve as
system public key and system private key. This pair authentication tags for any of the members. The tags
of keys is shared by all the nodes of the network. are decrypted with the cluster key before they are
Besides the system key, each node also needs a buffered. They can be used as authentication tags
cluster key. This cluster key is unique to every because they have been encrypted with the head‟s
cluster and a single cluster key is shared by all the private key. They are also encrypted with the session
nodes belonging to a cluster. This key is generated key to protect them from malicious listeners.
by the cluster head and distributed to all the cluster
members. This key is encrypted with the system
2041 | P a g e
5. If the sender already has unexpired tags that it 8. RESULTS
acquired by listening to earlier broadcasts from head,
then it would use the same and not send any request
to the head.
When a window of w packets is to be sent,
the k encrypted tags are used to obtain a permutation
of size w. Each of these tags is appended to one
packet.
When the receiver receives the packets with
tags appended, it should be able to verify the origin
and authenticity of the tags. A function called check
is used for this purpose. The tags are input to the
function, and the output of the function is a value
that is unique for each set of input. Since the tags are
prime numbers the check function could be as
simple as the product of the decrypted tags. It would
be unique.
Fig 8.1. Cluster1 and the various nodes are created
The sender applies the check function to the
tags, considering „m‟ at a time (the number „m‟ can
be decided according to the application). This
function is computed as check(R0;R2…..R(m - 1)) ,
check(R(m+1) , R - (m + 2)…….R(2m - 1)), and
so on.
The output of the function is encrypted. The
highest sequence number among these „m‟ packets is
also encrypted along with the value obtained from
the check function. The session key is used for this
encryption.
When the receiver receives the packets, it
also computes the check function of the received
tags. The computed value is compared with that sent
by the sender. If they match the sender accepts, else
the sender could identify that some tags are invalid.
Since the check function is computed for Fig 8.2. Cluster2 and the various nodes are created
every „m‟ packets the receiver could even narrow
down the search for unauthentic packets to a range
of „m‟. The checksum field of the TCP header is also
encrypted with session key so that any tampering of
data during transit would be detected by computing
checksum.
Fig 8.3.Cluster Head and Cluster1 and Cluster2 are
formed
2042 | P a g e
6. Key Management for Mobile AdHoc
Networks”, IEEE transaction on mobile
computing, volume 2, No.1 ,march-
January2003
[6] Kitada, Y., Watanabe, A., Sasase, I.,
Takemori, K., “On demand distributed
public key management for wireless ad hoc
networks”, 2005 IEEE Pacific Rim
Conference on Communications,
Computers and Signal Processing, IEEE,
Aug. 2005, pp.454-457
[7] Capkun, S., Buttyan, L., Hubaux, J.-P.,
“Self-organized public-key management for
mobile ad hoc networks”, IEEE
Transactions on Mobile Computing, IEEE
Educational Activities Department, Volume
Fig 8.4. Adding node to cluster 1 2, Issue 1, Jan.-Mar. 2003, pp.52-64
[8] Gutmann, P., “Simplifying public key
management”, Computer, IEEE Computer
Society, Volume 37, Issue 2, Feb. 2004,
pp.101-103.
[9] Ruidong Li, Jie Li, Kameda, H., Peng Liu,
“Localized public-key management for
mobile ad hoc networks”, Proceedings of
the IEEE 2004 Global Communications
Conference, IEEE, Volume 2, 29 Nov.-3
Dec. 2004, pp.1284-1289
Fig 8.5 .Indicating range of node
REFERENCES
[1] Ben-Jye Chang; Szu-Liang Kuo, “Markov
Chain Trust Model for Trust-Value
Analysis and Key Management in
Distributed Multicast MANETs”, Vehicular
Technology, IEEE Transactions Volume:
58 , Issue: 4 , 2009 , Page(s): 1846 -
1863IEEE JOURNALS
[2] Denko, M.K., Jun Tian , Nkwe, T.
,Obaidat, M.S. Dept. of Comput. “Cluster-
Based Cross-Layer Design for Cooperative
Caching in Mobile Ad Hoc Networks”,
Canada,Systems Journal, IEEE Volume: 3 ,
Issue: 4 , 2009.
[3] Jane Y. Yu and Peter H.J. Chong, “A
Survey of Clustering Schemes For Mobile
Ad Hoc Networks” IEEE Commun. Survey
& Tutorial, First quarter 2005, Vol 7 No.1.
[4] Shengrong Bu; Yu, F.R.; Liu, X.P.; Mason,
P.; Tang, “Distributed Combined
Authentication and Intrusion Detection with
Data Fusion in High-Security Mobile Ad
Hoc Networks”. Vehicular Technology,
IEEE Transactions , 2011 , IEEE
JOURNAL
[5] Jean-Pierre Hubaux, Srdjan Capkun,
Student Member “Self-Organized Public-
2043 | P a g e