There are several services that build on the availability of closest node location information like geographic routing in spontaneous networks, data gathering in sensor networks, movement coordination among autonomous robotic nodes, location specific services for hand held devices and danger warning or traffic monitoring in vehicular networks. Ad hoc networking protocols and location-aware services require that mobile nodes identify the location of their closest nodes. Such a process can be easily misuses or stop by opposed nodes. In absence of a priori trusted nodes, the spotting and identifying of closest node position presents challenges that have been scarcely investigated in the literature. Node can also send message from one to many nodes in a broadcasting manner here.
A Secure message exchange and anti-jamming mechanism in manetIJSRD
Secure neighbor discovery is the fundamental process in the MANET deployed in aggressive environment. It refers to the process that nodes exchange messages to discover and authenticate each other. It is defenseless to the jamming attack in which the adversary intentionally transmits signals to prevent neighboring nodes from exchanging messages. Existing anti-jamming communications depends on JR-SND. The JR-SND, a jamming-resilient secure neighbor discovery scheme for MANETs based on Random spread-code pre-distribution and Direct Sequence Spread Spectrum (DSSS). In Existing, they prevent the jamming and introduce the anti-jamming mechanism using DSSS introduce the secure message exchange mechanism and prevent the collisions during packet transmission. But in this we lack of introducing to detect the selfish and malicious nodes in the network. For this, in the Future Work we will enhance the work by detecting the selfish nodes using Watchdog and Neighbor Coverage-based Probabilistic Rebroadcast Protocol (NCPR).
Defending against collaborative attacks byranjith kumar
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
JPN1422 Defending Against Collaborative Attacks by Malicious Nodes in MANETs...chennaijp
Get the latest IEEE ns2 projects in JP INFOTECH; we are having following category wise projects like Industrial Informatics, Vehicular Technology, Networking, WSN and Manet.
For More Details:
http://jpinfotech.org/final-year-ieee-projects/2014-ieee-projects/ns2-projects/
Covert channels is a vital setup in the analysing the strength of security in a network. Covert Channel is
illegitimate channelling over the secured channel and establishes a malicious conversation. The trap-door
set in such channels proliferates making covert channel sophisticated to detect their presence in network
firewall. This is due to the intricate covert scheme that enables to build robust covert channel over the
network. From an attacker's perspective this will ameliorate by placing multiple such trapdoors in
different protocols in the rudimentary protocol stack. This leads to a unique scenario of “Hybrid Covert
Channel", where different covert channel trapdoors exist at the same instance of time in same layer of
protocol stack. For detection agents to detect such event is complicated due to lack of knowledge over the
different covert schemes. To improve the knowledge of the detection engine to detect the hybrid covert
channel scenario it is required to explore all possible clandestine mediums used in the formation of such
channels. This can be explored by different schemes available and their entropy impact on hybrid covert
channel. The environment can be composed of resources and subject under at-tack and subject which
have initiated the attack (attacker). The paper sets itself an objective to understand the different covert
schemes and the attack scenario (modelling) and possibilities of covert mediums along with metric for
detection.
A Secure message exchange and anti-jamming mechanism in manetIJSRD
Secure neighbor discovery is the fundamental process in the MANET deployed in aggressive environment. It refers to the process that nodes exchange messages to discover and authenticate each other. It is defenseless to the jamming attack in which the adversary intentionally transmits signals to prevent neighboring nodes from exchanging messages. Existing anti-jamming communications depends on JR-SND. The JR-SND, a jamming-resilient secure neighbor discovery scheme for MANETs based on Random spread-code pre-distribution and Direct Sequence Spread Spectrum (DSSS). In Existing, they prevent the jamming and introduce the anti-jamming mechanism using DSSS introduce the secure message exchange mechanism and prevent the collisions during packet transmission. But in this we lack of introducing to detect the selfish and malicious nodes in the network. For this, in the Future Work we will enhance the work by detecting the selfish nodes using Watchdog and Neighbor Coverage-based Probabilistic Rebroadcast Protocol (NCPR).
Defending against collaborative attacks byranjith kumar
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
JPN1422 Defending Against Collaborative Attacks by Malicious Nodes in MANETs...chennaijp
Get the latest IEEE ns2 projects in JP INFOTECH; we are having following category wise projects like Industrial Informatics, Vehicular Technology, Networking, WSN and Manet.
For More Details:
http://jpinfotech.org/final-year-ieee-projects/2014-ieee-projects/ns2-projects/
Covert channels is a vital setup in the analysing the strength of security in a network. Covert Channel is
illegitimate channelling over the secured channel and establishes a malicious conversation. The trap-door
set in such channels proliferates making covert channel sophisticated to detect their presence in network
firewall. This is due to the intricate covert scheme that enables to build robust covert channel over the
network. From an attacker's perspective this will ameliorate by placing multiple such trapdoors in
different protocols in the rudimentary protocol stack. This leads to a unique scenario of “Hybrid Covert
Channel", where different covert channel trapdoors exist at the same instance of time in same layer of
protocol stack. For detection agents to detect such event is complicated due to lack of knowledge over the
different covert schemes. To improve the knowledge of the detection engine to detect the hybrid covert
channel scenario it is required to explore all possible clandestine mediums used in the formation of such
channels. This can be explored by different schemes available and their entropy impact on hybrid covert
channel. The environment can be composed of resources and subject under at-tack and subject which
have initiated the attack (attacker). The paper sets itself an objective to understand the different covert
schemes and the attack scenario (modelling) and possibilities of covert mediums along with metric for
detection.
Network coding combined with onion routing for anonymous and secure communica...IJCNCJournal
This paper presents a novel scheme that provides high level of security and privacy in a Wireless Mesh
Network (WMN). We combine an approach of Network Coding with multiple layered encryption of onion routing for a WMN. An added superior feature provides higher level of security and privacy. Sensitive network information is confined to 1-hop neighborhood which is available anyways in a wireless medium with nodes using a bivariate polynomial. The only routing information divulged to a relay node is about next hop. No plain text is ever transmitted and all data can only be decrypted by its source and destination.Prior work finds it difficult to enforce encryption with network coding without divulging in complete
routing information,hence losing privacy and anonymity. We compare our scheme with other existing approach for several networks. The preliminary results show this work to provide superior security and anonymity at low overhead cost.
A key management approach for wireless sensor networksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
CROSS LAYER INTRUSION DETECTION SYSTEM FOR WIRELESS SENSOR NETWORKIJNSA Journal
The wireless sensor networks (WSN) are particularly vulnerable to various attacks at different layers of the protocol stack. Many intrusion detection system (IDS) have been proposed to secure WSNs. But all these systems operate in a single layer of the OSI model, or do not consider the interaction and collaboration between these layers. Consequently these systems are mostly inefficient and would drain out the WSN. In this paper we propose a new intrusion detection system based on cross layer interaction between the network, Mac and physical layers. Indeed we have addressed the problem of intrusion detection in a different way in which the concept of cross layer is widely used leading to the birth of a new type of IDS. We have experimentally evaluated our system using the NS simulator to demonstrate its effectiveness in detecting different types of attacks at multiple layers of the OSI model.
Implementation of New Routing Protocol for Node Security in a Mobile Ad Hoc N...CSCJournals
A routing protocol plays important role to handle entire network for communication and determines the paths of packets. A node is a part of the defined network for transferring information in form of packets. If all packets transferred from source to destination successfully, it has been assumed that the routing protocol is good. But, an attacker turns this dealing as a speed breaker and turning point of a highway. So, prevention from attacks and secure packets, a new routing protocol is being introduced in this paper. The proposed routing protocol is called by SNAODV (Secure Node AODV). This paper is also tried to maximize throughput as compared with AODV and SAODV.
A Novel Acknowledgement based Intrusion Detection System for MANETsIJMER
In Mobile Ad Hoc Networks(MANETs), a set of interacting nodes should cooperatively
implement the routing functions to enable end-to-end communication along dynamic paths composed by
multi-hop wireless links. Several multi-hop routing protocols have been proposed for ad hoc networks,
and most popular ones include: Dynamic Source Routing (DSR), Optimized Link-State Routing (OLSR),
Ad Hoc On-Demand Distance Vector (AODV) and Destination- Sequenced Distance-Vector (DSDV).
Most of these protocols rely on the assumption of a trustworthy cooperation among all participating
nodes; unfortunately, this may not be a realistic assumption in real hosts. Malicious hosts could exploit
the weakness of MANET to launch various kinds of attacks. Node mobility on ad hoc network cannot be
restricted. As results, many Intrusion Detection System(IDS) solutions have been proposed for the wired
network, which they are defined on strategic points such as switches, gateways, and routers, can not be
implemented on the MANET. Thus, the wired network IDS characteristics must be modified prior to be
implemented in the ad hoc network. Thus an IDS should be added to enhance the security level of
MANETs. If MANET can detect the attackers as soon as they enter the network, we will be able to
completely eliminate the potential vulnerabilities caused by compromised nodes at the first time. IDSs
usually act as the second layer in MANETs. This paper presents an novel IDS for MANETs which is
based on acknowledgements.
A Review of Network Layer Attacks and Countermeasures in WSNiosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Wireless Sensor Network (WSN) consists of large number of sensor nodes capable of forming
instantaneous network with dynamic topology. Each node simultaneously as both router and
host. Number of nodes in a WSN can vary either due to the mobility or death of nodes due to
drained conditions. Low Energy Aware Cluster Hierarchy (LEACH) is a most popular dynamic
clustering protocol for WSN. Deployment in unattended environment, limited memory, limited
power and low computational power of a sensor node make these networks susceptible to
attacks launched by malicious nodes. This paper provides an overview of LEACH protocol and
how LEACH can be compromised by malicious nodes. We propose a attack on LEACH –
Snooze attack. This paper we present a way to simulate this attack on NS-2 which is
demonstrative on throughput. We observe that during simulation throughput drops as an effect
of attack. It is observed that the effect of the attack gets aggregated as we increase the number
of attackers.
IEEE 2014 DOTNET PARALLEL DISTRIBUTED PROJECTS A probabilistic-misbehavior-de...IEEEMEMTECHSTUDENTPROJECTS
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Secure and Reliable Data Routing in Wireless Sensor Networkdbpublications
Wireless Sensor Networks (WSNs) are materializing as one of the dominant technologies of the future because of their large range of applications in military and civilian fields. Because of their operating behavior, they are often neglected and thus vulnerable to various types of attacks. For instance, an attacker could catch sensor nodes, getting all the information saved therein-sensor nodes are generally considered to not be temper-proof. Hence, an attacker may clone cached sensor nodes and use them in the network to conduct a variety of mischievous activities. As the decisions taken by a sensor network rely on the information gathered by the sensor nodes, if an adversary inhibits the necessary or confidential data from being forwarded to the BS/ target, this will cause the whole breakdown of the network or outcomes in the wrong judgment being made, possibly causing deliberate loss. There are many types of attacks such as compromised node, denial of service attack, black hole attack, etc. Hence there is a necessity to find all such attacks in WSN, and to safely route our sensitive information to the target. This paper represents the survey of some types of attacks and there detection techniques. Also the survey includes different techniques for secure and reliable data collection in Wireless Sensor Networks.
Creation of smart spaces and scaling of devices to achieve miniaturization in pervasive computing environments has put forth a question on the degree of security of such devices. Security being a unique challenge in such environments, solution demands scalability, access control, heterogeneity, trust. Most of the existing cryptographic solutions widely in use rely on the hardness of factorization and number theory
problems. With the increase in cryptanalytic attacks these schemes will soon become insecure. We need an alternate security mechanism which is as hard as the existing number theoretic approaches. In this work, we discuss the aspects of Lattice based cryptography as a new dimension of providing security whose strength lies in the hardness of lattice problems. We discuss about a cryptosystem whose security relies on high lattice dimension.
Secure multipath routing scheme using keyijfcstjournal
Multipath routing in WSN has been a long wish in security scenario where nodes on next-hop may be
targeted to compromise. Many proposals of Multipath routing has been proposed in ADHOC Networks but
under constrained from keying environment most seems ignorant. In WSN where crucial data is reported by
nodes in deployment area to their securely located Sink, route security has to be guaranteed. Under
dynamic load and selective attacks, availability of multiple secure paths is a boon and increases the
attacker efforts by many folds. We propose to build a subset of neighbors as our front towards destination
node. We also identified forwarders for query by base station. The front is optimally calculated to maintain
the security credential and avail multiple paths. According to our knowledge ours is a novel secure
multipath routing protocol for WSN. We established effectiveness of our proposal with mathematical
analysis.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Implementation of a Cellular Manufacturing Tool for Minimization of Non Value...IJERA Editor
The purpose of this study is to develop a plan for reducing lead-times and increasing profit of Centre bolt product by using value stream mapping. The Centre bolt product manufacturer is inefficient because it produces products in large batch quantities and has poor product flow as operations being departmentalized and departments are very far away from each other due to this increase in lead-times could cause a loss in the market share to its competitors. The Centre bolt product manufacturer must reduce its lead-times in order to remain competitive and continue its growth by providing quality products in a timely manner. A study will be carried out using value stream mapping to determine areas of potential improvement on the plant floor. A current state map will be developed and analyzed the areas that have potential for improvement. A future state map will then be created to suggest ways to reduce lead-times and increase profit. The map will include lean manufacturing methods to reduce wastes in the system; increasing profit and reducing lead-times. Current state and future state of manufacturing of a firm are compared and witnessed: 50 percent reduction in lead time, 4 percent reduction in processing time, 58.5 percent reduction in WIP and 22 percent reduction in manpower required to perform same amount of work.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Cascade process and Pareto rule: application to runoff data of two Mexican ri...IJERA Editor
This paper has two objectives: the first is to show that the annual runoff of rivers such as Conchos and Nazas (Mexico), follow the Pareto rule of 80:20 when classes are ordered from largest to less, and can be compared with cascade processes. The second objective is to show that cascade process produce the core which gives rise to fractional integral and therefore to differential equations of fractional order. Finally, we conclude that the Pareto rule is a first approach to saturation described by the complementary characteristic function, and runoff data provide the order of the temporal derivative. Therefore, cascade processes are manifested ubiquitously in nature, and show us a way to evolve towards the imbalanced and become in distribution mechanisms that turn into a transition that destroys old and build new correlations.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Network coding combined with onion routing for anonymous and secure communica...IJCNCJournal
This paper presents a novel scheme that provides high level of security and privacy in a Wireless Mesh
Network (WMN). We combine an approach of Network Coding with multiple layered encryption of onion routing for a WMN. An added superior feature provides higher level of security and privacy. Sensitive network information is confined to 1-hop neighborhood which is available anyways in a wireless medium with nodes using a bivariate polynomial. The only routing information divulged to a relay node is about next hop. No plain text is ever transmitted and all data can only be decrypted by its source and destination.Prior work finds it difficult to enforce encryption with network coding without divulging in complete
routing information,hence losing privacy and anonymity. We compare our scheme with other existing approach for several networks. The preliminary results show this work to provide superior security and anonymity at low overhead cost.
A key management approach for wireless sensor networksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
CROSS LAYER INTRUSION DETECTION SYSTEM FOR WIRELESS SENSOR NETWORKIJNSA Journal
The wireless sensor networks (WSN) are particularly vulnerable to various attacks at different layers of the protocol stack. Many intrusion detection system (IDS) have been proposed to secure WSNs. But all these systems operate in a single layer of the OSI model, or do not consider the interaction and collaboration between these layers. Consequently these systems are mostly inefficient and would drain out the WSN. In this paper we propose a new intrusion detection system based on cross layer interaction between the network, Mac and physical layers. Indeed we have addressed the problem of intrusion detection in a different way in which the concept of cross layer is widely used leading to the birth of a new type of IDS. We have experimentally evaluated our system using the NS simulator to demonstrate its effectiveness in detecting different types of attacks at multiple layers of the OSI model.
Implementation of New Routing Protocol for Node Security in a Mobile Ad Hoc N...CSCJournals
A routing protocol plays important role to handle entire network for communication and determines the paths of packets. A node is a part of the defined network for transferring information in form of packets. If all packets transferred from source to destination successfully, it has been assumed that the routing protocol is good. But, an attacker turns this dealing as a speed breaker and turning point of a highway. So, prevention from attacks and secure packets, a new routing protocol is being introduced in this paper. The proposed routing protocol is called by SNAODV (Secure Node AODV). This paper is also tried to maximize throughput as compared with AODV and SAODV.
A Novel Acknowledgement based Intrusion Detection System for MANETsIJMER
In Mobile Ad Hoc Networks(MANETs), a set of interacting nodes should cooperatively
implement the routing functions to enable end-to-end communication along dynamic paths composed by
multi-hop wireless links. Several multi-hop routing protocols have been proposed for ad hoc networks,
and most popular ones include: Dynamic Source Routing (DSR), Optimized Link-State Routing (OLSR),
Ad Hoc On-Demand Distance Vector (AODV) and Destination- Sequenced Distance-Vector (DSDV).
Most of these protocols rely on the assumption of a trustworthy cooperation among all participating
nodes; unfortunately, this may not be a realistic assumption in real hosts. Malicious hosts could exploit
the weakness of MANET to launch various kinds of attacks. Node mobility on ad hoc network cannot be
restricted. As results, many Intrusion Detection System(IDS) solutions have been proposed for the wired
network, which they are defined on strategic points such as switches, gateways, and routers, can not be
implemented on the MANET. Thus, the wired network IDS characteristics must be modified prior to be
implemented in the ad hoc network. Thus an IDS should be added to enhance the security level of
MANETs. If MANET can detect the attackers as soon as they enter the network, we will be able to
completely eliminate the potential vulnerabilities caused by compromised nodes at the first time. IDSs
usually act as the second layer in MANETs. This paper presents an novel IDS for MANETs which is
based on acknowledgements.
A Review of Network Layer Attacks and Countermeasures in WSNiosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Wireless Sensor Network (WSN) consists of large number of sensor nodes capable of forming
instantaneous network with dynamic topology. Each node simultaneously as both router and
host. Number of nodes in a WSN can vary either due to the mobility or death of nodes due to
drained conditions. Low Energy Aware Cluster Hierarchy (LEACH) is a most popular dynamic
clustering protocol for WSN. Deployment in unattended environment, limited memory, limited
power and low computational power of a sensor node make these networks susceptible to
attacks launched by malicious nodes. This paper provides an overview of LEACH protocol and
how LEACH can be compromised by malicious nodes. We propose a attack on LEACH –
Snooze attack. This paper we present a way to simulate this attack on NS-2 which is
demonstrative on throughput. We observe that during simulation throughput drops as an effect
of attack. It is observed that the effect of the attack gets aggregated as we increase the number
of attackers.
IEEE 2014 DOTNET PARALLEL DISTRIBUTED PROJECTS A probabilistic-misbehavior-de...IEEEMEMTECHSTUDENTPROJECTS
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Secure and Reliable Data Routing in Wireless Sensor Networkdbpublications
Wireless Sensor Networks (WSNs) are materializing as one of the dominant technologies of the future because of their large range of applications in military and civilian fields. Because of their operating behavior, they are often neglected and thus vulnerable to various types of attacks. For instance, an attacker could catch sensor nodes, getting all the information saved therein-sensor nodes are generally considered to not be temper-proof. Hence, an attacker may clone cached sensor nodes and use them in the network to conduct a variety of mischievous activities. As the decisions taken by a sensor network rely on the information gathered by the sensor nodes, if an adversary inhibits the necessary or confidential data from being forwarded to the BS/ target, this will cause the whole breakdown of the network or outcomes in the wrong judgment being made, possibly causing deliberate loss. There are many types of attacks such as compromised node, denial of service attack, black hole attack, etc. Hence there is a necessity to find all such attacks in WSN, and to safely route our sensitive information to the target. This paper represents the survey of some types of attacks and there detection techniques. Also the survey includes different techniques for secure and reliable data collection in Wireless Sensor Networks.
Creation of smart spaces and scaling of devices to achieve miniaturization in pervasive computing environments has put forth a question on the degree of security of such devices. Security being a unique challenge in such environments, solution demands scalability, access control, heterogeneity, trust. Most of the existing cryptographic solutions widely in use rely on the hardness of factorization and number theory
problems. With the increase in cryptanalytic attacks these schemes will soon become insecure. We need an alternate security mechanism which is as hard as the existing number theoretic approaches. In this work, we discuss the aspects of Lattice based cryptography as a new dimension of providing security whose strength lies in the hardness of lattice problems. We discuss about a cryptosystem whose security relies on high lattice dimension.
Secure multipath routing scheme using keyijfcstjournal
Multipath routing in WSN has been a long wish in security scenario where nodes on next-hop may be
targeted to compromise. Many proposals of Multipath routing has been proposed in ADHOC Networks but
under constrained from keying environment most seems ignorant. In WSN where crucial data is reported by
nodes in deployment area to their securely located Sink, route security has to be guaranteed. Under
dynamic load and selective attacks, availability of multiple secure paths is a boon and increases the
attacker efforts by many folds. We propose to build a subset of neighbors as our front towards destination
node. We also identified forwarders for query by base station. The front is optimally calculated to maintain
the security credential and avail multiple paths. According to our knowledge ours is a novel secure
multipath routing protocol for WSN. We established effectiveness of our proposal with mathematical
analysis.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Implementation of a Cellular Manufacturing Tool for Minimization of Non Value...IJERA Editor
The purpose of this study is to develop a plan for reducing lead-times and increasing profit of Centre bolt product by using value stream mapping. The Centre bolt product manufacturer is inefficient because it produces products in large batch quantities and has poor product flow as operations being departmentalized and departments are very far away from each other due to this increase in lead-times could cause a loss in the market share to its competitors. The Centre bolt product manufacturer must reduce its lead-times in order to remain competitive and continue its growth by providing quality products in a timely manner. A study will be carried out using value stream mapping to determine areas of potential improvement on the plant floor. A current state map will be developed and analyzed the areas that have potential for improvement. A future state map will then be created to suggest ways to reduce lead-times and increase profit. The map will include lean manufacturing methods to reduce wastes in the system; increasing profit and reducing lead-times. Current state and future state of manufacturing of a firm are compared and witnessed: 50 percent reduction in lead time, 4 percent reduction in processing time, 58.5 percent reduction in WIP and 22 percent reduction in manpower required to perform same amount of work.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Cascade process and Pareto rule: application to runoff data of two Mexican ri...IJERA Editor
This paper has two objectives: the first is to show that the annual runoff of rivers such as Conchos and Nazas (Mexico), follow the Pareto rule of 80:20 when classes are ordered from largest to less, and can be compared with cascade processes. The second objective is to show that cascade process produce the core which gives rise to fractional integral and therefore to differential equations of fractional order. Finally, we conclude that the Pareto rule is a first approach to saturation described by the complementary characteristic function, and runoff data provide the order of the temporal derivative. Therefore, cascade processes are manifested ubiquitously in nature, and show us a way to evolve towards the imbalanced and become in distribution mechanisms that turn into a transition that destroys old and build new correlations.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
E-Commerce Privacy and Security SystemIJERA Editor
The Internet is a public networks consisting of thousand of private computer network connected together. Private computer network system is exposed to potential threats from anywhere on the public network. In physical world, crimes often leave evidence finger prints, footprints, witnesses, video on security comes and so on. Online a cyber –crimes, also leaves physical, electronic evidence, but unless good security measures are taken, it may be difficult to trace the source of cyber crime. In certain e-commerce-related areas, such as networking, data transfer and data storage, researchers applied scanning and testing methods, modeling analysis to detect potential risks .In the Security system ,Questions are related to online security in which given options are Satisfied, Unsatisfied ,Neutral, Yes, No. and weak password , Strong password. it is revealed that it is quite difficult, if not impossible, to suggest that which online security is best. Online security provide the flexibility, efficiency of work, provide the better security of net banking . The main feature of the research that the data is safe in banking management for long time and open any account after along time. The Future scope of the study of Security is use to reduce threats. Security is used in the long run results in the reduction of number of branches, saying rentals of related and properties. If the better Security operate than net banking and e-marketing will be increase.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Scalable and Robust Hierarchical Group of Data in Wireless Sensor NetworksIJERA Editor
In many sensor applications, the data collected from individual nodes is aggregated at a base station or host computer. To reduce energy consumption, many systems also perform in-network aggregation of sensor data at intermediate nodes enrooted to the base station. Most existing aggregation algorithms and systems do not include any provisions for security, and consequently these systems are vulnerable to a wide variety of attacks. In particular, compromised nodes can be used to inject false data that leads to incorrect aggregates being computed at the base station. We discuss the security vulnerabilities of data aggregation systems, and present a survey of robust and secure aggregation protocols that are resilient to false data injection attacks. The Proposed SHIA Algorithm builds on the Secure Hierarchical In-Network Aggregation, in order to achieve not only secure but also efficient WSN data collection over a series of aggregations.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Resource Infrastructure Facilities and its Management in Thiruvarur District ...IJERA Editor
The present study on “Effective Resources, Infrastructure facilities” and its management in Tiruvarur district”, Tiruvarur district a first grade municipal town in TamilNadu, is located 60 km east of Thanjavur, and it is a district headquarter town. The strategic location of this district to nearby urban centers Well connected by national highway, state highway and major district road and Railway junction too. Tiruvarur district forms part of eastern coastal plain of TamilNadu. It is surrounded on north and east by newly carved out district of Nagapattinam, on the south by pack-starit and on the west by its parent ie. Thanjavur. The infrastructure facilities available in Tiruvarur district. In the year 2014, urbanization pattern, transportation, urban services, like water supply, medical facilities, industrial development, education wise analyzed. In this study mainly for infrastructural facilities and other important places are discussed in this study.
Image Restoration UsingNonlocally Centralized Sparse Representation and histo...IJERA Editor
Due to the degradation of observed image the noisy, blurred, distorted image can be occurred .To restore the image informationby conventional modelsmay not be accurate enough for faithful reconstruction of the original image. I propose the sparse representations to improve the performance of based image restoration. In this method the sparse coding noise is added for image restoration, due to this image restoration the sparse coefficients of original image can be detected. The so-called nonlocally centralized sparse representation (NCSR) model is as simple as the standard sparse representation model, fordenoising the image here we use the histogram clipping method by using histogram based sparse representation to effectively reduce the noise and also implement the TMR filter for Quality image. Various types of image restoration problems, including denoising, deblurring and super-resolution, validate the generality and state-of-the-art performance of the proposed algorithm.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Experimental Test of Stainless Steel Wire Mesh and Aluminium Alloy With Glass...IJERA Editor
At present, composite materials are mostly used in aircraft structural components, because of their excellent properties like lightweight, high strength to weight ratio, high stiffness, and corrosion resistance and less expensive. In this experimental work, the mechanical properties of laminate, this is reinforced with stainless steel wire mesh, aluminum sheet metal, perforated aluminum sheet metal and glass fibers to be laminate and investigated. The stainless steel wire mesh and perforated aluminum metal were sequentially stacked to fabricate, hybrid composites. The aluminum metal sheet is also employed with that sequence to get maximum strength and less weight. The tensile, compressive and flexure tests carried out on the hybrid composite. To investigate the mechanical properties and elastic properties of the metal matrix composite laminate of a material we are using experimental test and theoretical calculation. The experimental work consists of Tensile, compressive and flexural test. The expectation of this project results in the tensile and compressive properties of this hybrid composite it is slightly lesser than carbon fibers but it could facilitate a weight reduction compared with CFRP panels. So this hybrid laminates composite material offering significant weight savings and maximum strength over some other GFRP conventional panels.
SRAAA – Secured Right Angled and Ant Search Hybrid Routing Protocol for MANETsAM Publications,India
— This paper is a contribution in the field of security analysis on mobile ad-hoc networks, and security requirements of applications. Limitations of the mobile nodes have been studied in order to design a secure routing protocol that thwarts different kinds of attacks. Our approach is based on the Right Angled and Ant Search Hybrid Routing Protocol (RAAA); the most popular hybrid routing protocol. The importance of the proposed solution lies in the fact that it ensures security as needed by providing a comprehensive architecture of secured Right Angled and Ant Search Hybrid Routing Protocol (SRAAA) based on efficient key management, secure neighbor discovery, secure routing packets, detection of malicious nodes, and preventing these nodes from destroying the network. In order to fulfill these objectives, both efficient key management and secure neighbor mechanisms have been designed to be performed prior to the functioning of the protocol. To validate the proposed solution, we use the network simulator NS-2 to test the performance of secure protocol and compare it with the conventional zone routing protocol over different number of factors that affect the network. Our results evidently show that our secure version paragons the conventional protocol in the packet delivery ratio while it has a tolerable increase in the routing overhead and average delay. Also, security analysis proves in details that the proposed protocol is robust enough to thwart all classes of ad-hoc attacks.
Discovery and verification of neighbor positions in mobile ad hoc networksIEEEFINALYEARPROJECTS
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.co¬m-Visit Our Website: www.finalyearprojects.org
Cooperative Black Hole Attack Prevention by Particle Swarm Optimization with ...IJARIIT
MANET (Mobile Ad Hoc Network) is a type of ad hoc network that can change locations and configure
itself, because of moving of nodes. As MANETs are mobile in nature, they use wireless connections to connect various
networks without infrastructure or any centralized administration. Open medium, dynamic topology, distributed
cooperation are the characteristics of MANET and hence ad hoc networks are open to different types of security
attacks. A Grey hole is a node that selectively drops and forwards data packets after advertises itself as having the
shortest path to the destination node in response to a route request message. Our mechanism helps to protect the
network by detecting and reacting to malicious activities of any node. The results enable us to minimize the attacks on
integrated MANET-Internet communication efficiently. Simulation will be carried out by using network simulator
tool so as to address the problem of detection & prevention of grey hole attack in mobile ad-hoc network. In this thesis
uses Particle swarm optimization(PSO).Which monitors by changing its values because of adhoc nature ,if node
converge then it change its value infinite and prevent the node to send packet.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
A Novel Approach to Detect & Prevent Wormhole Attack over MANET & Sensor n/w ...IOSR Journals
Abstract: In Mobile Ad hoc Network (MANET) mobile node is responsible for route establishment using
wireless link where each node may behave like both as a host and router. MANET encounters number of
security threats because of its open entrusted environment, with little security arrangement, security over
MANET can be enhance up to some satisfactory level because of its inherent characteristics. Among some of
the prominent security threats wormhole attack is considered to be a very serious security threat over MANET.
In wormhole two selfish node which is geographically very far away to each other makes tunnel between each
other to hide their actual location and give the illusion that they are true neighbours and attract other nodes to
make conversation through the wormhole tunnel. Many researchers focused on detecting wormhole attack and
its prevention mechanism. It seems that in the previous technique there is a need to improve their results in the
brink of false negative rate, routing overhead etc. The present paper has proposed the hybrid model in order to
detect and prevent the wormhole attack. This approach has been work with neighbour node and hop count
method.
Keywords: Mobile Ad hoc Network, Selfish node, Malicious node, AODV
Secure dynamic source routing protocol for defending black hole attacks in mo...nooriasukmaningtyas
Wireless Ad Hoc Network is a dynamically organized network on emergency
situations, in which a group of wireless devices send data among themselves
without requiring any base stations for forwarding data. Here the nodes itself
perform the functions of routing. This important characteristic of mobile ad
hoc networks allows the hassle free set up of the network for
communications in different crisis such as battlefield and natural disaster
zones. Multi hop communication in MANET is achieved by the cooperation
of nodes in forwarding data packets. This feature of MANET is largely
exploited to launch a security attack called black hole attack. A light weight
solution called SEC-DSR is proposed to defend the network from black hole
attack and enables communication among nodes even in the presence of
attackers. In this scheme, by analyzing only the control packets used for
routing in the network, the compromised nodes launching the attack are
identified. From the collective judgment by the participating nodes in the
routing path, a secure route free of black hole nodes is selected for
communication by the host. Simulation results validate and ensure the
effectiveness of the proposed solution tested on an ad hoc network with
compromised black hole nodes.
HOW TO DETECT MIDDLEBOXES: GUIDELINES ON A METHODOLOGYcscpconf
Internet middleboxes such as VPNs, firewalls, and proxies can significantly change handling of traffic streams. They play an increasingly important role in various types of IP networks. If end hosts can detect them, these hosts can make beneficial, and in some cases, crucial improvements in security and performance But because middle boxes have widely varying behavior and effects on the traffic they handle, no single technique has been discovered that can detect all of them.
Devising a detection mechanism to detect any particular type of middle box interference involves many design decisions and has numerous dimensions. One approach to assist with the
complexity of this process is to provide a set of systematic guidelines. This paper is the first attempt to introduce a set of general guidelines (as well as the rationale behind them) to assist researchers with devising methodologies for end-hosts to detect middle boxes by the end-hosts. The guidelines presented here take some inspiration from the previous work of other
researchers using various and often ad hoc approaches. These guidelines, however, are mainly based on our own experience with research on the detection of middle boxes. To assist
researchers in using these guidelines, we also provide an example of how to bring them into play for detection of network compression.
How to detect middleboxes guidelines on a methodologycsandit
Internet middleboxes such as VPNs, firewalls, and proxies can significantly change handling of
traffic streams. They play an increasingly important role in various types of IP networks. If end
hosts can detect them, these hosts can make beneficial, and in some cases, crucial improvements
in security and performance But because middleboxes have widely varying behavior and effects
on the traffic they handle, no single technique has been discovered that can detect all of them.
Devising a detection mechanism to detect any particular type of middlebox interference involves
many design decisions and has numerous dimensions. One approach to assist with the
complexity of this process is to provide a set of systematic guidelines. This paper is the first
attempt to introduce a set of general guidelines (as well as the rationale behind them) to assist
researchers with devising methodologies for end-hosts to detect middleboxes by the end-hosts.
The guidelines presented here take some inspiration from the previous work of other
researchers using various and often ad hoc approaches. These guidelines, however, are mainly
based on our own experience with research on the detection of middleboxes. To assist
researchers in using these guidelines, we also provide an example of how to bring them into
play for detection of network compression
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Identification of Closest and Phantom Nodes in Mobile Ad Hoc Networks
1. G. Satyachellayi Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 8( Version 6), August 2014, pp.20-29
www.ijera.com 20 | P a g e
Identification of Closest and Phantom Nodes in Mobile Ad Hoc Networks G. Satyachellayi*, T. Veerraju** *M.Tech Student, CSE Department, Sri AdityaEngineering College, A.P, India **Associate professor, CSE Department, Sri AdityaEngineering College, A.P, India Abstract There are several services that build on the availability of closest node location information like geographic routing in spontaneous networks, data gathering in sensor networks, movement coordination among autonomous robotic nodes, location specific services for hand held devices and danger warning or traffic monitoring in vehicular networks. Ad hoc networking protocols and location-aware services require that mobile nodes identify the location of their closest nodes. Such a process can be easily misuses or stop by opposed nodes. In absence of a priori trusted nodes, the spotting and identifying of closest node position presents challenges that have been scarcely investigated in the literature. Node can also send message from one to many nodes in a broadcasting manner here. Index Terms: Closest Nodes, Mobile Ad Hoc Networks, Phantom Nodes, Position identification, Vehicular Networks.
I. INTRODUCTION
Location details has become an important asset in mobile systems, where a wide range of protocols and applications require knowledge of the position of the participating nodes. Geographic routing in impetuous networks, data gathering in sensor networks, movement coordination among autonomous robotic nodes, location-specific services for handheld devices, and danger warning or traffic monitoring in vehicular networks are all examples of services that build on the availability of closest node location information. The correctness of node locations is therefore an all- important issue in mobile networks, and it becomes particularly challenging in the presence of adversaries aiming at harming the system. In these cases, we need solutions that let nodes 1) correctly establish their location in spite of attacks feeding false location information, and 2) verify the positions of their neighbors, so as to detect adversarial nodes announcing false locations. This system focus on the latter aspect, hereinafter referred to as closest node location identification (NPV for short). Specifically, we deal with a mobile ad hoc network, where a pervasive infrastructure is not present, and the location data must be obtained through node-to-node communication. Such a scenario is of particular interest since it leaves the door open for adversarial nodes to misuse or stop the location-based services.
For example, by advertising forged positions, adversaries could bias geographic routing or data gathering processes, attracting network traffic and then eavesdropping or discarding it. Similarly, counterfeit positions could grant adversaries unauthorized access to location-dependent services, let vehicles forfeit road tolls, stop vehicular traffic or endanger passengers and drivers. A fully distributed, lightweight NPV procedure that enables each node to acquire the locations advertised by its neighbors, and assess their truthfulness. We therefore propose an NPV protocol that has the following features: . It is designed for impetuous ad hoc environments, and, as such, it does not rely on the presence of a trusted infrastructure or of a priori trustworthy nodes; . It leverages cooperation but allows a node to perform all identification procedures autonomously. This approach has no need for lengthy interactions, e.g., to reach a consensus among multiple nodes, making our scheme suitable for both low- and high- mobility environments; . It is reactive, meaning that it can be executed by any node, at any point in time, without prior knowledge of the neighborhood; . It is robust against independent and colluding adversaries; . It is lightweight, as it generates low overhead traffic.
Additionally, our NPV scheme is compatible with state-of- the-art security architectures, including the ones that have been proposed for vehicular networks [1], [2], which represent a likely deployment environment for NPV.The rest of the project is organized as follows:In Section2, we review previous works, highlighting the novelty of
RESEARCH ARTICLE OPEN ACCESS
2. G. Satyachellayi Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 8( Version 6), August 2014, pp.20-29
www.ijera.com 21 | P a g e
our solution. In Section 3, we describe the system model, while the communication protocol, the objectives of the identification procedure and our main results are outlined in Section 4. The details of the NPV protocol and of identification tests are then presented in Section5, Finally, we provide a performance evaluation of the protocol in a vehicular scenario in Section 6, and draw conclusions in Section. 2.RELATEDWORK Although the literature carries a multitude of ad hoc security protocols addressing a number of problems related to NPV, there are no lightweight, robust solutions to NPV that can operate autonomously in an open, ephemeral environment, without relying on trusted nodes. Below, we list relevant works and highlight the novelty of our contribution. For clarity of presentation, we first review solutions to some NPV-related problems, such as secure positioning and secure discovery, and then we discuss solutions specifically addressing NPV. Securely determining own location. In mobile environments, self-localization is mainly achieved through Global Navigation Satellite Systems, e.g., GPS, whose security can be provided by cryptographic and no cryptographic defense mechanisms [3]. Alternatively, terrestrial special- purpose infrastructure could be used [4], [5], along with techniques to deal with no honest beacons [6]. We remark that this problem is orthogonal to the problem of NPV. In the rest of this project, we will assume that devices employ one of the techniques above to securely determine their own position and time reference. Secure neighbor discovery (SND) deals with the identification of nodes with which a communication link can be established or that are within a given distance. SND is only a step toward the solution we are after: simply put, an adversarial node could be securely discovered as neighbor and be indeed a neighbor (within some SND range), but it could still cheat about its position within the same range. In other words, SND is a subset of the NPV problem, since it lets a node assess whether another node is an actual neighbor but it does not verify the location it claims to be at. SND is most often employed to counter wormhole attacks [7], [8]; practical solutions to the SND problem have been proposed in [9], while properties of SND protocols with proven secure solutions can be found in [10], [11].
Neighbor position identification was studied in the context of ad hoc and sensor networks; however, existing NPV schemes often rely on fixed [12], [13] or mobile [14] trustworthy nodes, which are assumed to be always available for the identification of the positions announced by third parties. In ad hoc environments, however, the pervasive presence of either infrastructure or neighbor nodes that can be aprioristically trusted is quite unrealistic. Thus, we devise a protocol that is autonomous and does not require trustworthy neighbors. In [15], an NPV protocol is proposed that first lets nodes calculate distances to all neighbors, and then commends that all triplets of nodes encircling a pair of other nodes act as verifiers of the pair’s positions. This scheme does not rely on trustworthy nodes, but it is designed for static sensor networks, and requires lengthy multiround computations involving several nodes that seek consensus on a common neighbor identification. Furthermore, the resilience of the protocol in [15] to colluding attackers has not been demonstrated. The scheme in [16] suits static sensor networks too, and it requires several nodes to exchange information on the signal emitted by the node whose location has to be verified. Moreover, it aims at assessing not the position but whether the node is within a given region or not. Our NPV solution, instead, allows any node to validate the position of all of its neighbors through a fast, one-time message exchange, which makes it suitable to both static and mobile environments. Additionally, we show that our NPV scheme is robust against several different colluding attacks. Similar differences can be found between our work and [17]. In [18], the authors propose an NPV protocol that allows nodes to validate the position of their neighbors through local observations only. This is performed by checking whether subsequent positions announced by one neighbor draw a movement over time that is physically possible. The approach in [18] forces a node to collect several data on its neighbor movements before a decision can be taken, making the solution unfit to situations where the location information is to be obtained and verified in a short time span. Moreover, an adversary can fool the protocol by simply announcing false positions that follow a realistic mobility pattern. Conversely, by exploiting cooperation among nodes, our NPV protocol is 1) reactive, as it can be executed at any instant by any node, returning a result in a short time span, and 2) robust to fake, yet realistic, mobility patterns announced by adversarial nodes over time.
To our knowledge, our protocol is the first to provide a fully distributed, lightweight solution to the NPV problem that does not require any infrastructure or a priori trusted neighbors and is robust to several different attacks, including coordinated attacks by colluding adversaries. Also, unlike previous works, our solution is suitable for both low and high mobile environments and
3. G. Satyachellayi Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 8( Version 6), August 2014, pp.20-29
www.ijera.com 22 | P a g e
it only assumes RF communication. Indeed, non-RF communication, e.g., infrared or ultrasound, is unfeasible in mobile networks, where non-line-of- sight conditions are frequent and device-to- device distances can be in the order of tens or hundreds of meters. An early version of this work, sketching the NPV protocol and some of the identification tests to detect independent adversaries, can be found in [19]. 3.SYSTEM AND ADVERSARY MODEL We consider a mobile network and define as communication neighbors of a node all the other nodes that it can reach directly with its transmissions . We assume that each node knows its own position with some maximum error p , and that it shares a common time reference with the other nodes: both requirements can be met by equipping communication nodes with GPS receivers.
Fig. 1. Message exchange overview, during one instance of the NPV protocol.
Fig. 2. Example of topological information stored by verifier S at the end of the message exchange and effect of a fake position announcement by M . nodes can perform Time-of-Flight-based RF ranging with a maximum error equal to r . As discussed in [15], this is a reasonable assumption, although it requires modifications to off-the-shelf radio interfaces; also, promising techniques for precise ToF-based RF ranging have been developed [20]. We assume that node positions do not vary significantly during a protocol execution, since a complete message exchange takes no more than a few hundreds of milli- seconds. The relative spatial movements of the nodes during such a period are taken into account through the tolerance value m .
Nodes carry a unique identity2 and can authenticate messages of other nodes through public key cryptography. In particular, we assume that each node X owns a private key, kX , and a public key, KX , as well as a set of one-time use keys {k0 ; K0 }, as proposed in emerging
architectures for secure and privacy-enhancing communication [2]. Node X can encrypt and decrypt data with its keys and the public keys of other nodes; also, it can produce digital signatures (SigX ) with its private key. We assume that the binding between X and KX can be validated by any node, as in state-of-the-art secure communication architectures [2]. Nodes are correct if they comply with the NPV protocol, and adversarial if they deviate from it. As authentication essentially thwarts external adversaries, we focus on the more powerful internal ones, i.e., nodes that possess the cryptographic material to participate in the NPV and try to exploit it, by advertising arbitrarily erroneous own posi- tions or inject misleading information. Internal adversaries cannot forge messages on behalf of other nodes whose keys they do not have. Thus, attacks against the cryptosystem are not considered, as correct implementation of cryptographic primitives makes them computationally infeasible. We further classify adversaries into: knowledgeable, if at each time instant they know positions and (temporary) identities of all their communication neighbors, and unknowledgeable, otherwise; independent, if they act indivi- dually, and colluding, if they coordinate their actions. The protocol as well as the gist of its resilience analysis. Detailed discussions of message format, verification test is provided in Section 5. A verifier, S, can initiate the protocol at any time instant, by triggering the 4-step message exchange depicted in Fig. 1, within its 1-hop neighborhood. The aim of the message exchange is to let S collect information it can use to compute distances between any pair of its communication neighbors. To that end, POLL and REPLY messages are first broadcasted by S and its neighbors, respectively.
These messages are anonymous and take advantage of the broadcast nature of the wireless medium, allowing nodes to record reciprocal timing information without disclosing their identities. Then, after a REVEAL broadcast by the verifier, nodes disclose to S, through secure and authenti- cated REPORT messages, their identities as well as
4. G. Satyachellayi Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 8( Version 6), August 2014, pp.20-29
www.ijera.com 23 | P a g e
the anonymous timing information they collected. The verifier S uses such data to match timings and identities; then, it uses the timings to perform ToF-based ranging and compute distances between all pairs of communicating 4.COOPERATIVE NPV: AN OVERVIEW We propose a fully distributed cooperative scheme for NPV, which enables a node, hereinafter called the verifier, to discover and verify the position of its communication neighbors. For clarity, here we summarize the principles of nodes in its neighborhood. Once S has derived such distances, it runs several position verification tests in order to classify each candidate neighbor as either: 1. Verified, i.e., a node the verifier deems to be at the claimed position; 2. Faulty, i.e., a node the verifier deems to have announced an incorrect position; 3. Unverifiable, i.e., a node the verifier cannot prove to be either correct or faulty, due to insufficient information. Clearly, the verification tests aim at avoiding false negatives (i.e., adversaries announcing fake positions that are deemed verified) and false positives (i.e., correct nodes whose positions are deemed faulty), as well as at minimizing the number of unverifiable nodes. We remark that our NPV scheme does not target the creation of a consistent “map” of neighborhood relations throughout an ephemeral network: rather, it allows the verifier to independently classify its neighbors. The basic principle the verification tests build upon is best explained by means of the example in Fig. 2. There, M is a malicious node announcing a false location M 0 , so as to fraudulently gain some advantage over other nodes. The figure portrays the actual network topology with black edges, while the modified topology, induced by the fake position announced by M , is shown with gray edges. It is evident that the displacement of M to M 0 causes its edges with the other nodes to rotate e. The tests thus look for discrepancies in the node distance information to identify incorrect node positions.
TABLE 1
Summary of Notations
A malicious node, knowing the protocol, can try to outsmart the tests in a number of different ways. Section 6 contains a comprehensive discussion of the protocol resilience, covering conceivable attack strategies that adver- sarial nodes could adopt. Overall, our analysis proves that: . An unknowledgeable adversary has no possibility of success against our NPV protocol; . An independent knowledgeable adversary M can move at most two links (with the verifier S and with a shared neighbor X) without being detected: how- ever, any additional link (e.g., with another shared neighbor Y ) leads to inconsistencies between dis- tances and positions that allow to identify the attacker: this is the situation depicted in Fig. 2. In a nutshell, independent adversaries, although knowl- edgeable, cannot harm the system; . Colluding knowledgeable adversaries can announce timing information that reciprocally validate their distances, and pose a more dangerous threat to the system. However, we prove that an overwhelming presence of colluders in the verifier neighborhood is required for an attack to be successful. Additionally, simulations in realistic scenarios prove the robust- ness of the NPV protocol even against large groups of colluding knowledgeable adversaries. 5.NPV PROTOCOL We detail the message exchange between the verifier and its communication neighbors, followed by a description of the tests run by the verifier. Table 1 summarizes the notations used throughout the protocol description.
5. G. Satyachellayi Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 8( Version 6), August 2014, pp.20-29
www.ijera.com 24 | P a g e
5.1 Protocol Message Exchange The value pX is the current position of X, and INX is the current set of its communication neighbors. We denote by tX the time at which a node X starts a broadcast transmission and by tXY the time at which a node Y starts receiving it. Note that these time values refer to the actual instant at which the node starts transmitting/receiving the first bit of the message at the physical layer. To retrieve the exact transmission and reception time instants, avoiding the unpredictable latencies introduced by interrupts trig- gered at the drivers level, a solution such as that implemented in is required.3 Furthermore, the GPS receiver should be integrated in the 802.11 card; software defined radio solutions combining GPS and 802.11 capabil- ities are proposed. Now, consider a verifier S that initiates the NPV protocol. The message exchange procedure is outlined in Algorithm 1 for S, and in Algorithm 2 for any of S s communication neighbors. Algorithm 1. Message exchange protocol: verifier.
Algorithm2. Message exchange protocol: any neighbor.
POLL message. The verifier starts the protocol by broadcasting a POLL whose transmission time tS it stores locally (Algorithm 1, lines 2-3). The POLL is anonymous, since 1) it does not carry the identity of the verifier, 2) it is transmitted employing a fresh, software-generated MAC
address, and 3) it contains a public key K0s taken from S’s pool of anonymous one-time use keys that do not allow neighbors to map the key onto a specific node. We stress that keeping the identity of the verifier hidden is important in order to make our NPV robust to attacks . Since a source address has to be included in the MAC-layer header of the message, a fresh, software-generated MAC address is needed; note that this is considered a part of emerging cooperative systems [2]. Including a one- time key in the POLL also ensures that the message is fresh (i.e., the key acts as a nonce). 3. This leads to a timing precision of around 23 ns, dictated by the 44 MHz clock of standard 802.11a/b/g cards. As mentioned above, we account for these errors through the r parameter. REPLY message. A communication neighbor X 2 INS that receives the POLL stores its reception time tSX , and extracts a random wait interval TX 2 ½0; Tmax (Algorithm 2, lines 2-4). After TX has elapsed, X broadcasts an anon- ymous REPLY message using a fresh MAC address, and locally records its transmission time tX (Algorithm 2, lines 5-9). For implementation feasibility, the physical layer transmission time cannot be stamped on the REPLY, but it is stored by X for later use. The REPLY contains some information encrypted with S s public key (K0 ), specifically the POLL reception time and a nonce X used to tie the REPLY to the next message sent by X: we refer to these data as X’s commitment, Cj X (Algorithm 2, line 7). The hash hK0 , derived from the public key of the verifier, K0 , is also included to bind POLL and REPLY belonging to the same message exchange. Upon reception of a REPLY from a neighbor X, the verifier S stores the reception time tXS and the commitment Cj X (Algorithm 1, lines 4-5). When a different neighbor of S, e.g., Y , Y 2 INS INX , broadcasts a REPLY too, X stores the reception time tYX and the commitment Cj Y (Algorithm 2, lines 10-11). Since REPLY messages are anonymous, a node records all commitments it receives without knowing their originators. REVEAL message. After a time Tmax þ þ Tjitter , the verifier broadcasts a REVEAL message using its real MAC address (Algorithm 1, line 6). accounts for the propaga- tion and contention lag of REPLY messages scheduled at time Tmax , and Tjitter is a random time added to thwart jamming efforts on this message. The REVEAL contains: 1) a map ImS , that associates each commitment Cj X received by the verifier to a temporary identifier iX (Algorithm 1, line 7); 2) a proof that S is the author of the original POLL through the encrypted hash Ek0 fhK0 g; 3) the verifier identity, i.e., its
6. G. Satyachellayi Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 8( Version 6), August 2014, pp.20-29
www.ijera.com 25 | P a g e
certified public key and signature (Algorithm 1, line 8). Note that using certified keys curtails continuous attempts at running the protocol by an adversary who aims at learning neighbor positions (i.e., at becoming knowledge- able) or at launching a clogging attack (see Section 6.4). REPORT message. Once the REPORT message is broad-cast and the identity of the verifier is known, each neighbor X that previously received S’s POLL unicasts to S an encrypted, signed REPORT message. The REPORT carries X’s position, the transmission time of X’s REPLY, and the list of pairs of reception times and temporary identifiers referring to the REPLY broadcasts X received (Fig. 2, lines 12-14). The identifiers are obtained from the map ImS included in the REVEAL message. Also, X discloses its own identity by including in the message its digital signature and certified public key; through the nonce X , it correlates the REPORT to its previously issued REPLY. We remark that all sensitive data are encrypted using S s public key, KS , so that eavesdropping on the wireless channel is not possible. At the end of the message exchange, only the verifier knows all positions and timing information. If needed, certified keys in REPORT messages allow the matching of such data and node identities (temporary or long- term, with the help of an authority if needed [2]). 5.2 Position Verification Once the message exchange is concluded, S can decrypt the received data and acquire the position of all neighbors that participated in the protocol, i.e., fpX ; 8X 2 INS g. The verifier S also knows the transmission time tS of its POLL and learns that of all subsequent REPLY messages, i.e., ftX ; 8X 2 INS gas well as the corresponding reception times recorded by the recipients of such broadcasts, i.e., ftXY; 8X; Y 2 INS [ fSgg. Applying a ToF-based technique, S thus computes its distance from each communication neighbor, as well as the distances between all neighbor pairs sharing a link. More precisely, by denoting with c the speed of light, the verifier computes, for any communicating pair ðX; Y Þ with X; Y 2 INS [ fSg, two distances: dXY ¼ ðtXY tX Þ c, from the timing informa- tion related to the broadcast message sent by X, and dYX ¼ ðtYX tY Þ c, from the information related to the broadcast message by Y . Once such distances have been computed, S can run the following three verification tests to fill the sets IFS, jVS, and UUS with, respectively, faulty, verified and unverifiable nodes.
5.2.1 The Direct Symmetry Test (DST)
DST is the first verification performed by S and is detailed in Algorithm 3. There, j j denotes the absolute value operator and kpX pY k the euclidean distance between movements during the protocol execution. The second check verifies that the position advertised by the neighbor is consistent with such distances, within an error margin of 2 p þ r (Algorithm 3, line 5). Although trivial, this check is fundamental since it correlates positions to computed distances: without it, an attacker could fool the verifier by simply advertising an arbitrary position along with correct broadcast transmission and reception timings. Finally, as a sanity check, S verifies that dSX is not larger than R (Algorithm 3, line 6). The verifier tags a neighbor as faulty if a mismatch is found in any of these checks,4 since this implies an inconsistency between the position pX and the timings announced by the neighbor (tSX , tX ) or recorded by the verifier (tXS , tS ). Algorithm 3. Direct Symmetry Test (DST)
4. The latter two checks are performed on both dSX and dXS , however in Algorithm 3 they are done on dSX only, for clarity of presentation. 6. PERFORMANCE EVALUATION We evaluated the performance of our NPV protocol in a vehicular scenario. Results obtained in a pedestrian scenario are available as supplemental material, which can be found on the Computer Society Digital Library at http:// doi.ieeecom putersociety.org/10.1109/TMC. 2011.258. We focus on knowledgeable adversaries whose goal is to make the verifier believe their fake positions, and we describe the best attack strategy they can adopt in Section 7.1. Such a strategy, will be assumed while deriving the results shown in Section 7.2.
The results, which therefore represent a worst case analysis of the proposed NPV, are shown in terms of the probability that the tests return false positives and false negatives as well as of the probability that a (correct or adversary) node is tagged as unverifiable. In addition, we plot the average difference between the true position of a successful adversary and the fake position it advertises, as well as the overhead introduced by
7. G. Satyachellayi Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 8( Version 6), August 2014, pp.20-29
www.ijera.com 26 | P a g e
our NPV scheme. The results on attacks aimed at discrediting the position of other nodes are omitted, since they are very close to those we present later in this section. 6.1 Results We employed movement traces representing vehicle traffic over a real-world road topology. More precisely, we considered car movements within a 20 km2 portion of the Karlsruhe urban area depicted in Fig. 8, extracting 3 hours of vehicular mobility that reproduce mild to heavy traffic density conditions. These synthetic traces were generated using the IDM-LC model of the VanetMobiSim simulator, which takes into account car-to-car interactions, traffic lights, stop signs, and lane changes, and has been proven to realistically reproduce vehicular movement patters in urban scenarios [31]. In our simulations, we set Tmax ¼ 200 ms, Tjitter ¼ 50 ms, ¼ 1 ms and assume that CSMA/CA is used to access the wireless medium, hence messages can be lost due to collisions. Unless otherwise specified, we fix the proximity range, R, which is equal to the maximum nominal transmis- sion range, to 250 m (resulting in an average neighborhood size of 73.4 nodes), while r ¼ 6:8 m, p ¼ 10 m, and the tolerance value m ¼ 5 m (roughly corresponding to the case of two vehicles moving at 50 km/h in opposite directions). To evaluate the performance of our NPV, at every simulation second we randomly select 1 percent of the nodes as verifiers. Then, for each verifier, we compare the outcome of the verification tests with the actual nature of the neighbors. We consider colluding adversaries acting in groups, referred to as clusters. Note that a colluding cluster size equal to 1 corresponds to independent attacks. Also, adversaries are knowledgeable, i.e., they perfectly know the identity and location of all colluding and noncolluding neighbors, and always adopt the best attack strategy as
described in Section 7.1. In the following, unless otherwise specified, adversaries amount to 5 percent of the overall nodes and are divided into clusters of five colluders each.
In the legend of the plots, C stands for correct node (e.g., the label “C faulty” refers to the probability of false positives), while M/Bas, M/Hyp, and M/Col stand for adversaries launching, respectively, the basic, hyperbola-based and collinear attack (e.g., the label “M/Bas verified” refers to the probability of false negatives due to basic attacks). We first examine the NPV protocol performance for different values of colluding cluster sizes and R ¼ 250 m (Figs. 9a and 9b). The false negative/positive probability in Fig. 9a clearly shows that1) the chance of wrong classification reaches 0.01 only for a very large adversarial cluster size, namely 10, 2) the hyperbola- based and the collinear attacks are the most threatening and 3) an attack by the colluders is most effective in passing themselves off as verified when there are at least three of them. The cluster size also affects the colluders ability to disrupt the positioning of correct nodes, which exhibit as high as a 0.4 percent chance to be tagged as faulty. Conversely, as shown in Fig. 9b, the cluster size does not cause more correct nodes to be unverifiable, since the main reason for correct nodes to be tagged as unverifiable is the lack of noncollinear neighbors that can verify them. The chance for an adversary to be unverifiable increases with the cluster size, although it is significant only in case of collinear attacks. This is in agreement with the fact that the outcome of the collinear attack is the avoidance of a sizable number of cross-checks between the adversary and correct nodes, thus likely leading the adversary to be tagged as unverifiable. The neighborhood size proves to play an important role, as evident in Figs. 9c and 9d where we consider a 5-colluder cluster and vary the transmission range. A small R (hence few neighbors) affects the NPV capability to correctly tag a node. Widening the transmission range with a fixed colluding cluster size significantly favors the verifier, allowing it to reach a conclusive and exact verdict on either correct or adversary nodes: the larger the R, the higher the number of cross-checks involving correct nodes in the CST. We note that, for transmission ranges larger than 300 m, we obtain false positive/negative probabilities that are smaller than 0.001. Below 150-m ranges (corresponding to an average neighborhood size of 12 nodes), such probabilities are still 0.01.
8. G. Satyachellayi Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 8( Version 6), August 2014, pp.20-29
www.ijera.com 27 | P a g e
Fig. 9. Probability that a neighbor is tagged incorrectly or as unverifiable, versus the colluder cluster size (a,b), and versus R (c,d). C: correct; M/Bas,/Hyp, and M/Col: adversaries launching the basic, hyperbola-based and collinear attack, each combined with the REPLY-disregard attack.
Fig. 10. Displacement gain of adversaries running a successful attack against the NPV (a) and traffic load induced by one instance of the protocol (b).
Fig. 11. Probability that a neighbor is tagged incorrectly or as unverifiable, versus the ratio of adversaries (a,b), and position error (c,d). C: correct; M/Bas, M/Hyp, and M/Col: adversaries launching the basic, hyperbola-based, and collinear attack, each combined with the REPLY-disregard attack.
Beside the impact of the cluster size and of the transmission range, it is important to understand the effect of the percentage of adversaries in the vehicular network. Thus, in Fig. 11a we fix R to 250 m and the cluster size to 5, and we show the robustness of our NPV to the density of adversaries: the probability that adversaries are verified increases ever so slightly with their density. The highest effect is on the probability of correct nodes being tagged as faulty, which however reaches its highest value (0.1) only for 30 percent of adversaries in the network. A further effect of the growing presence of adversaries, as shown in Fig. 11b, is the unverifiable tag being slapped onto more correct nodes. A final observation can be made looking at the false positive/negative probability as the positioning error varies (Figs. 11c and 10d). Interestingly, for any positioning error different from 0, the metrics are only marginally affected.
Finally, we further increase the level of detail of our analysis and study the advantage obtained by adversaries that perform a successful attack against the NPV protocol. Such an adversarial gain is expressed in terms of spatial displacement, i.e., difference of position between the real and fraudulently advertised locations of the successful attacker: clearly, a larger displacement range implies a higher freedom of movement, which, in turn, enables potentially more dangerous actions against the system. The results in Fig. 11a are broken down based on the type of attack launched by the successful adversary, and are limited to the impact of the transmission range, since the other parameters did not show significant influence on the displacement of successful attackers.
We can observe that successful collinear attacks yield small advantage for adversaries, who are forced to announce positions quite close to their real locations. Moreover, we recall that these attacks constrain adversaries to advertise fake positions along a precise axis, thus further limiting their freedom of movement. We can conclude that collinear attacks, typically those with the highest chances of success as previously discussed, are also those resulting in the smallest gain for the adversaries. Conversely, basic attacks allow the largest average displacements, but we showed that they have extremely low success probability. The hyperbola-based attacks appear then to be the most dangerous ones, if the displacement gain is taken into consideration. However, such a gain
9. G. Satyachellayi Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 8( Version 6), August 2014, pp.20-29
www.ijera.com 28 | P a g e
becomes significant only for large transmission ranges, in presence of which we already observed that the actual success probability of the attacks becomes negligible. Finally, we comment on the overhead introduced by our scheme. The NPV protocol generates at most 2n þ 2 messages for one execution initiated by a verifier with n communication neighbors. Also, NPV messages are relatively small in size: with SHA-1 hashing and ECDSA-160 encryption , the length of signatures is 21 bytes (with coordinates compression). Assuming that messages include headers with 4- byte source and destination identifiers and 1-byte message type field, POLL, REPLY, and REVEAL are 26, 71, and 67 bytes in size, respectively. The REPORT length depends on the quantity of common neighbor data it carries, amounting to 4 bytes per shared neighbor: information on more than 360 neighbors can thus fit in a single IP packet. Fig. 11b portrays the traffic induced on the network by one instance of the NPV protocol. The plot only accounts for transmission range variations since, once more, the other parameters do not have an impact on the overhead. We can observe that security comes at a cost, since the traffic load of the NPV protocol is higher than that of a basic nonsecure neighbor position discovery, consisting of only one poll and associated position replies from neighbors. More precisely, the NPV protocol overhead is comparable to that of the nonsecure discovery for smaller transmission ranges, while the difference tends to increase for larger ranges. However, the cost of the NPV protocol is affordable in absolute terms, since one run requires just a few tens of kbytes to be exchanged among nodes, even in presence of dense networks and large transmission ranges. Note that the results above do not take into account the overhead induced by the distribution of certificates, as it is out of the scope of this work (the interested reader can refer to [26]). Summary. Given that we assumed the best possible conditions for the adversaries, the above results prove our NPV to be highly resilient to attacks. Indeed, we observed typical probabilities of false positives/negatives below 1 percent, while that of a node being tagged as unverifiable is below 5 percent. Moreover, we showed that a significant portion of the successful attacks yields small advantage to the adversaries in terms of displacement. Finally, the overhead introduced by the NPV protocol is reasonable, as it does not exceed a few tens of kbytes even in the most critical conditions. 7.CONCLUSION
We presented a distributed solution for closest node identification, which allows any node in a mobile ad hoc network to verify the position of its communication neighbors without relying on a priori trustworthy nodes. Our analysis showed that our protocol is very robust to attacks by independent as well as colluding adversaries, even when they have perfect knowledge of the neighborhood of the verifier with the concept of phantom node, closest node identification. Simulation results confirm that our solution is effective in identifying nodes advertising false positions, while keeping the probability of false positives low. Only an overwhelming presence of colluding adversaries in the neighborhood of the verifier, or the unlikely presence of fully collinear network topologies, can degrade the effectiveness of our NPV. Here message can be broadcast to closest nodes. Future work will aim at integrating the NPV protocol in higher layer protocols, as well as at extending it to a proactive paradigm, useful in presence of applications that need each node to constantly verify the position of its neighbors. REFERENCES [1] 1609.2-2006: IEEE Trial-Use Standard for Wireless Access in Vehicular Environments - Security Services for Applications and Management Messages, IEEE, 2006. [2] P. Papadimitratos, L. Buttyan, T. Holczer, E. Schoch, J. Freudiger, M. Raya, Z. Ma, F. Kargl, A. Kung, and J.-P. Hubaux, “Secure Vehicular Communications: Design and Architecture,” IEEE Comm. Magazine, vol. 46, no. 11, pp. 100-109, Nov. 2008. [3] P. Papadimitratos and A. Jovanovic, “GNSS-Based Positioning: Attacks and Countermeasures,” Proc. IEEE Military Comm. Conf. (MILCOM), Nov. 2008. [4] L. Lazos and R. Poovendran, “HiRLoc: High-Resolution Robust Localization for Wireless Sensor Networks,” IEEE J. Selected Areas in Comm., vol. 24, no. 2, pp. 233-246, Feb. 2006. [5] R. Poovendran and L. Lazos, “A Graph Theoretic Framework for Preventing the Wormhole Attack,” Wireless Networks, vol. 13, pp. 27-59, 2007. [6] S. Zhong, M. Jadliwala, S. Upadhyaya, and C. Qiao, “Towards a Theory of Robust Localization against Malicious Beacon Nodes,” Proc. IEEE INFOCOM, Apr. 2008.
[7] J. Eriksson, S. Krishnamurthy, and M. Faloutsos, “TrueLink: Practical Countermeasure to the Wormhole Attack in Wireless Networks,” Proc. IEEE 14th
10. G. Satyachellayi Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 8( Version 6), August 2014, pp.20-29
www.ijera.com 29 | P a g e
Int’l Conf. Network Protocols (ICNP), Nov. 2006. [8] R. Maheshwari, J. Gao, and S. Das, “Detecting Wormhole Attacks in Wireless Networks Using Connectivity Information,” Proc. IEEE INFOCOM, Apr. 2007. [9] R. Shokri, M. Poturalski, G. Ravot, P. Papadimitratos, and J.-P. Hubaux, “A Practical Secure Neighbor Verification Protocol for Wireless Sensor Networks,” Proc. Second ACM Conf. Wireless Network Security (WiSec), Mar. 2009. [10] M. Poturalski, P. Papadimitratos, and J.- P. Hubaux, “Secure Neighbor Discovery in Wireless Networks: Formal Investigation of Possibility,” Proc. ACM Symp. Information, Computer and Comm. Security (ASIACCS), Mar. 2008. [11] M. Poturalksi, P. Papadimitratos, and J.-P. Hubaux, “Towards Provable Secure Neighbor Discovery in Wireless Networks,” Proc. Workshop Formal Methods in Security Eng., Oct. 2008. [12] E. Ekici, S. Vural, J. McNair, and D. Al- Abri, “Secure Probabilistic Location Verification in Randomly Deployed Wireless Sensor Networks,” Elsevier Ad Hoc Networks, vol. 6, no. 2, pp. 195-209,2008. [13] J. Chiang, J. Haas, and Y. Hu, “Secure and Precise Location Verification Using Distance Bounding and Simultaneous Multi- lateration,” Proc. Second ACM Conf. Wireless Network Security (WiSec), Mar. 2009. [14] S. C apkun, K. Rasmussen, M. Cagalj, and M. Srivastava, “Secure Location Verification with Hidden and Mobile Base Stations,” IEEE Trans. Mobile Computing, vol. 7, no. 4, pp. 470-483, Apr. 2008. [15] S. C apkun and J.-P. Hubaux, “Secure Positioning inWireless Networks,” IEEE J. Selected Areas in Comm., vol. 24, no. 2, pp. 221-232, Feb. 2006. [16] A. Vora and M. Nesterenko, “Secure Location Verification Using Radio Broadcast,” IEEE Trans. Dependable and Secure Computing, vol. 3, no. 4, pp. 377- 385, Oct.-Dec. 2006. [17] J. Hwang, T. He, and Y. Kim, “Detecting Phantom Nodesin Wireless Sensor Networks,” Proc. IEEE INFOCOM, May 2007.
[18] T. Leinmu¨ ller, C. Maiho¨ fer, E. Schoch, and F. Kargl, “Improved Security in Geographic Ad Hoc Routing through Autonomous Position Verification,” Proc. ACM Third Int’l Workshop Vehicular Ad Hoc Networks (VANET), Sept. 2006.
[19] J.-H. Song, V. Wong, and V. Leung, “Secure Location Verification for Vehicular Ad-Hoc Networks,” Proc. IEEE Globecom, Dec. 2008. [20] M. Fiore, C. Casetti, C.-F. Chiasserini, and P. Papadimitratos, “Secure Neighbor Position Discovery in Vehicular Networks,” Proc. IEEE/IFIP 10th Ann. Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net), June 2011. [21] Fed. Highway Administration, “High Accuracy-Nationwide Differential Global Positioning System Test and Analysis: Phase II Report,” FHWA-HRT-05-034, July 2005. BIOGRAPHIES G. Satya Chellayi is Pursuing M.Tech in Computer Science from Sri Aditya Engineering College, Surampalem, A.P. Her area of interest includes Computer Networks, Mobile Communications, Data Base Management Systems, Data warehousing and Data Mining and Web Technologies. Mr T.Veerraju, Asoc. Prof. Computer Science and Engineering at Sri Aditya Engineering College, Surampalem, E.G.Dt. His area of interest includes Computer Networks, Mobile Communications, Cryptography, Network Security, Data warehousing and Data Mining and Web Technologies.