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
Robust encryption algorithm based sht in wireless sensor networksijdpsjournal
In bound applications, the locations
of events reportable by a device network have to be compelled to stay
anonymous. That is, unauthorized observers should be unable to notice the origin of such events by
analyzing the network traffic. I analyze 2 forms of downsides: Communication overhead a
nd machine load
problem. During this paper, I gift a brand new framework for modeling, analyzing, and evaluating
obscurity in device networks. The novelty of the proposed framework is twofold: initial, it introduc
es the
notion of “interval indistinguishabi
lity” and provides a quantitative live to model obscurity in wireless
device networks; second, it maps supply obscurity to the applied mathematics downside I showed that
the
present approaches for coming up with statistically anonymous systems introduce co
rrelation in real
intervals whereas faux area unit unrelated. I show however mapping supply obscurity to consecutive
hypothesis testing with nuisance Parameters ends up in changing the matter of exposing non
-
public supply
data into checking out associate d
egree applicable knowledge transformation that removes or minimize the
impact of the nuisance data victimization sturdy cryptography algorithmic rule. By doing therefore,
I
remodel the matter of analyzing real valued sample points to binary codes, that ope
ns the door for
committal to writing theory to be incorporated into the study of anonymous networks. In existing wor
k,
unable to notice unauthorized observer in network traffic. However our work in the main supported
enhances their supply obscurity against
correlation check. the most goal of supply location privacy is to
cover the existence of real events.
We are sending data from source node to destination using wireless sensor networks (WSNs), In wireless sensor networks, it is a typical threat to source privacy that an attacker performs back tracing strategy to locate source nodes by analyzing transmission paths. So there is lot of chances to lose data and information theft by network hackers. Network hackers performs eves dropping, sniffers attack, Denial of service attack. These types of attacks are achieved by negative commands generated by intermediate server maintained by hackers. With the popularity of the Internet of Things (IoTs) in recent years, source privacy protection has attracted a lot of attentions. However, they fail to get the tradeoff between multi-path transmission and transmission cost. In this project, we propose a Constrained Random Routing (CRR) mechanism and Greedy techniques, which can constantly change routing next-hop instead of a relative fixed route so that attackers cannot analyze routing and trace back to source nodes. At first we designed the randomized architecture for each sensor nodes. Then calculate the coordinates and weights of node, Finally, the selected weights help to decide which node will become the next hop. In this way, attackers would be confused by the constantly changing paths. The simulation results prove that our proposal can achieve high routing efficiency in multi-path transmission. A Prasanth | P Sankar Ganesh | S P Raja Gopalan"Data Prevention from Network Hacking" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3 , April 2018, URL: http://www.ijtsrd.com/papers/ijtsrd11035.pdf http://www.ijtsrd.com/engineering/computer-engineering/11035/data-prevention-from-network-hacking/a-prasanth
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
An Efficient Security Way of Authentication and Pair wise Key Distribution wi...IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
Robust encryption algorithm based sht in wireless sensor networksijdpsjournal
In bound applications, the locations
of events reportable by a device network have to be compelled to stay
anonymous. That is, unauthorized observers should be unable to notice the origin of such events by
analyzing the network traffic. I analyze 2 forms of downsides: Communication overhead a
nd machine load
problem. During this paper, I gift a brand new framework for modeling, analyzing, and evaluating
obscurity in device networks. The novelty of the proposed framework is twofold: initial, it introduc
es the
notion of “interval indistinguishabi
lity” and provides a quantitative live to model obscurity in wireless
device networks; second, it maps supply obscurity to the applied mathematics downside I showed that
the
present approaches for coming up with statistically anonymous systems introduce co
rrelation in real
intervals whereas faux area unit unrelated. I show however mapping supply obscurity to consecutive
hypothesis testing with nuisance Parameters ends up in changing the matter of exposing non
-
public supply
data into checking out associate d
egree applicable knowledge transformation that removes or minimize the
impact of the nuisance data victimization sturdy cryptography algorithmic rule. By doing therefore,
I
remodel the matter of analyzing real valued sample points to binary codes, that ope
ns the door for
committal to writing theory to be incorporated into the study of anonymous networks. In existing wor
k,
unable to notice unauthorized observer in network traffic. However our work in the main supported
enhances their supply obscurity against
correlation check. the most goal of supply location privacy is to
cover the existence of real events.
We are sending data from source node to destination using wireless sensor networks (WSNs), In wireless sensor networks, it is a typical threat to source privacy that an attacker performs back tracing strategy to locate source nodes by analyzing transmission paths. So there is lot of chances to lose data and information theft by network hackers. Network hackers performs eves dropping, sniffers attack, Denial of service attack. These types of attacks are achieved by negative commands generated by intermediate server maintained by hackers. With the popularity of the Internet of Things (IoTs) in recent years, source privacy protection has attracted a lot of attentions. However, they fail to get the tradeoff between multi-path transmission and transmission cost. In this project, we propose a Constrained Random Routing (CRR) mechanism and Greedy techniques, which can constantly change routing next-hop instead of a relative fixed route so that attackers cannot analyze routing and trace back to source nodes. At first we designed the randomized architecture for each sensor nodes. Then calculate the coordinates and weights of node, Finally, the selected weights help to decide which node will become the next hop. In this way, attackers would be confused by the constantly changing paths. The simulation results prove that our proposal can achieve high routing efficiency in multi-path transmission. A Prasanth | P Sankar Ganesh | S P Raja Gopalan"Data Prevention from Network Hacking" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3 , April 2018, URL: http://www.ijtsrd.com/papers/ijtsrd11035.pdf http://www.ijtsrd.com/engineering/computer-engineering/11035/data-prevention-from-network-hacking/a-prasanth
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
An Efficient Security Way of Authentication and Pair wise Key Distribution wi...IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
Hierarchical Key Agreement Protocol for Wireless Sensor Networksidescitation
Wireless sensor network promises ubiquitous data
collection and processing for variety of commercial, healthcare
and military applications. Practical realization of WSN
applications is possible only after assuring network security.
Cryptographic key distribution is an important phase in
network security which establishes initial trust in the network.
Security protocol implementation in WSN is limited by
resource constrained nature of sensor nodes. The key
distribution algorithm satisfying security requirements of
given WSN application should be implemented with minimum
communication and memory overhead. As a solution to this
problem, hierarchical key management technique is proposed
in this paper. Symmetric key pre-distribution technique with
less computational overhead and ID-based asymmetric key
(IBK) distribution technique with less communication
overhead are applied simultaneously in the network at
different levels. Resilience strength and resource overhead of
the proposed scheme is compared with both symmetric and
asymmetric techniques.
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.
MEKDA: Multi-Level ECC based Key Distribution and Authentication in Internet ...IJCNCJournal
The Internet of Things (IoT) is an extensive system of networks and connected devices with minimal human interaction and swift growth. The constraints of the System and limitations of Devices pose several challenges, including security; hence billions of devices must protect from attacks and compromises. The resource-constrained nature of IoT devices amplifies security challenges. Thus standard data communication and security measures are inefficient in the IoT environment. The ubiquity of IoT devices and their deployment in sensitive applications increase the vulnerability of any security breaches to risk lives. Hence, IoT-related security challenges are of great concern. Authentication is the solution to the vulnerability of a malicious device in the IoT environment. The proposed Multi-level Elliptic Curve Cryptography based Key Distribution and Authentication in IoT enhances the security by Multi-level Authentication when the devices enter or exit the Cluster in an IoT system. The decreased Computation Time and Energy Consumption by generating and distributing Keys using Elliptic Curve Cryptography extends the availability of the IoT devices. The Performance analysis shows the improvement over the Fast Authentication and Data Transfer method.
WSN performance based on node placement by genetic algorithm at smart home en...TELKOMNIKA JOURNAL
Wireless sensor connectivity is one of several factors that determines the communication reliability of each node. The placement of the node depends on the area that covered by wireless coverage area, so the node placement should be optimally placed. But the other aspect is the sensor coverage area. Sensor coverage area sometimes could be different with wireless sensor coverage area. Based on that situation, it needs to optimize that situation. Genetic Algorithm is an algorithm that utilizes a heuristic approach that uses biological mechanism evolution. It used to evolution the best position of Sensor Node based on Wireless and Sensor coverage area. After the position of each node generated by Genetic Algorithm, it still needs to evaluate the wireless sensor node performance. The performance indicates that the genetic algorithm can be used to determine sensor node placement in the smart home environment. The smart home environment used to monitor event at the house such as wildfire. In this research used Quality of Services (QoS) to measure wireless sensor performance. The experimental testing scenario will be used to place several nodes that generated. The QoS performed systems reliability that produced based on 3, 4 and 5 testing nodes, the minimum and maximum of each: delay is 6.21 and 8.74 milliseconds, jitter is 0.11 and 1.59 Hz and throughput is 68.83 and 90.49 bps. Based on ETSI classification, the performance of sensor node placement is Good and acceptable in real-time systems.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A NOVEL INTRUSION DETECTION MODEL FOR MOBILE AD-HOC NETWORKS USING CP-KNNIJCNCJournal
Mobile ad-hoc network security problems are the subject of in depth analysis. A group of mobile nodes area unit connected to a set wired backbone. In MANET, the node themselves implement the network management in a very cooperative fashion. All the nodes area unit accountable to create a constellation that is dynamically, modification it and conjointly the absence of any clear network boundaries. We tend to project a completely unique intrusion detection model for mobile ad-hoc network victimization. CP-KNN (Conformal Prediction K-Nearest Neighbor) algorithmic rule is to classify the audit knowledge for anomaly detection. The non-conformity score worth is employed to cut back the classification period of time for multi level iteration. It is effectively notice anomalies with high true positive rate, low false positive rate and high confidence that the progressive of assorted anomaly detection ways. Additionally it is interfered
by “noisy” knowledge (unclean data), the projected technique is strong, effective and conjointly it retains
its smart detection performance and to avoid the abnormal activity.
A Novel Solitude Conserving Location Monitoring Approach for Wireless Sensor ...IJERA Editor
Observing individual locations with a capable untrusted server impose secrecy threats to the monitored individuals. In this paper we propose “A Novel Solitude Conserving Location Monitoring approach for Wireless Sensor networks”. We design two approaches to study nondescript locations in-network approaches, namely quality-aware and resource-aware approaches, that aims to enable the system to give high end quality location monitoring services for end users, while conserving personal location privacy. Both approaches are worked based on k-anonymity solitude (i.e.,an object is indistinguishable among k objects), to enable highly trusted sensor nodes to provide the collective location data of monitored objects for our system. Each collective location is in a form of a observed area X along with the number of monitored objects reside in X. The resource-aware approach objective to optimize the computational and communication value, while quality-aware approach aims to increase the reliability of the collective location data by reducing their observing areas. We use spatial histogram methodology to estimates the distribution of observing objects based on the gathered collective location data. We evaluated these two approaches through simulated experiments. The simulation results shows that these approaches gives high quality location observing services for end users and assure the location secrecy of the monitored objects.
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETSIJCNCJournal
The Border Gateway Protocol (BGP) provides crucial routing information for the Internet infrastructure. A problem with abnormal routing behavior affects the stability and connectivity of the global Internet. The biggest hurdles in detecting BGP attacks are extremely unbalanced data set category distribution and the dynamic nature of the network. This unbalanced class distribution and dynamic nature of the network results in the classifier's inferior performance. In this paper we proposed an efficient approach to properly managing these problems, the proposed approach tackles the unbalanced classification of datasets by turning the problem of binary classification into a problem of multiclass classification. This is achieved by splitting the majority-class samples evenly into multiple segments using Affinity Propagation, where the number of segments is chosen so that the number of samples in any segment closely matches the minority-class samples. Such sections of the dataset together with the minor class are then viewed as different classes and used to train the Extreme Learning Machine (ELM). The RIPE and BCNET datasets are used to evaluate the performance of the proposed technique. When no feature selection is used, the proposed technique improves the F1 score by 1.9% compared to state-of-the-art techniques. With the Fischer feature selection algorithm, the proposed algorithm achieved the highest F1 score of 76.3%, which was a 1.7% improvement over the compared ones. Additionally, the MIQ feature selection technique improves the accuracy by 3.5%. For the BCNET dataset, the proposed technique improves the F1 score by 1.8% for the Fisher feature selection technique. The experimental findings support the substantial improvement in performance from previous approaches by the new technique.
SECURE LOCATION BASED ROUTING FOR MANETSAnkur Singhal
The video demonstrates sending the file from source to the destination by initially encrypting it using multihops and then decrypting it at the receiver's end
Enhancing the Security in WSN using Three Tier Security ArchitectureAM Publications,India
Security is the main issue while setting up the WSN network for node communication. This report describes the efficient mechanism for achieving the security between node communications by creating three tier security architecture. This system implements three tier architecture with the use of two polynomial pools having sensor nodes, mobile sinks and some access points that are also sensor nodes, to get better security. Two pools are common mobile polynomial pool and common static polynomial pool. Mobile sinks and access point carries keys from common mobile polynomial pool were as, access points and sensor nodes carries keys from common static polynomial pool. Communication gets established from mobile sink to access point then from access point to sensor node that shows three tier architecture Authentication is the main aspect of the system, that is achieved by pairwise key predistribution methods and authentication of the nodes with the use of polynomial keys. Here, Mobile sink replication attack is implemented against the network. The malicious node, it is blocked. If it wants to communicate within the network then it needs to capture large no of keys from both the pools for authentication. But as the sufficient keys are not available with it, it cannot communicate with the other nodes in the network
AN EVALUATION OF ENERGY EFFICIENT SOURCE AUTHENTICATION METHODS FOR FALSE DA...ijsptm
The false data injection attack is a major security threat in Wireless Sensor Network (WSN) since is
degrades the network capability. The bandwidth efficient cooperative authentication (BECAN) scheme is
used for filtering the false data injection attack. It is used to save energy of sensor nodes in WSN by early
detection and filtering of maximum possible injected false data. Source authentication is a critical security
requirement in wireless sensor networks to identify attacker nodes that injects false data. Solutions based
on Elliptic Curve Cryptography (ECC) have been used for source authentication, but they suffer from
severe energy depletion. This results in high computational and communication overheads. Bloom filter
based Symmetric-key source authentication scheme exhibits low authentication overhead .This avoids the
inherent problems associated with public key cryptography based schemes. The current work demonstrates
the efficiency of bloom filter based source authentication using BECAN scheme by comparing ECC and
Bloom filter based methods in terms of energy consumption
An Adaptive Mobility Based Attack Detection Mechanism to Detect Selective For...paperpublications3
Abstract: In this paper propose Mobile network based attack detection of Selective Forwarding Attacks in Wireless Sensor Networks. In existing method only used static network and mobility network require high energy and time. So these problems can be overcome by using Mobile network based attack detection. The wireless sensor network has become a hot research area due its wide range of application in military and civilian domain, but as it uses wireless media for communication these are easily prone to security attacks. Selective forwarding attacks are most effective when the attacker is explicitly included on the path of a data flow. Selective forwarding and black hole attacks are very disastrous attacks for sensor networks if used with sinkhole attack because the intruder can drop most of the important packets. Moreover, the technique involves energy efficiency, reliability and scalability. Simulation results demonstrate that our proposed method can accurately detect selective forwarding attacks and identify the compromised sensor nodes. Experimental result show analytically and through simulation experiments that our schemes achieve effective and robust detection capability with reasonable overheads.
Keywords: Wireless Sensor Network, Selective Forwarding attack, Reputation System, Packet Dropping, Channel-aware, Routing.
Title: An Adaptive Mobility Based Attack Detection Mechanism to Detect Selective Forwarding Attack in Wireless Sensor Network
Author: S.K.Shaju, R.Isaac Sajan, Bibin Christopher, Dr. A.J.Deepa
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
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
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
SEAD: Source Encrypted Authentic Data for Wireless Sensor NetworksIJERD Editor
One of the critical issues in WSNs is providing security for the secret data in military applications. It is necessary to ensure data integrity and authentication for the source data and secure end-to-end path for data transmission. Mobile sinks are suitable for data collection and localization. Mobile sinks and sensor nodes communicate with each other using their public identity, which is prone to security attacks like sink replication and node replication attack. In this work, we have proposed Source Encrypted Authentic Data algorithm (SEAD) that hides the location of mobile sink from malicious nodes. The sensed data is encrypted utilizing symmetric encryption ---Advanced Encryption Standards (AES) and tracks the location of the mobile sink. When data encounters a malicious node in a path, then data transmission path is diverted through a secure path. SEAD uses public encryption ---Elliptic Curve Cryptography (ECC) to verify the authenticity of the data. Simulation results show that the proposed algorithm ensures data integrity and node authenticity against malicious nodes. Double encryption in the proposed algorithm produces better results in comparison with the existing algorithms.
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 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 HYBRID FUZZY SYSTEM BASED COOPERATIVE SCALABLE AND SECURED LOCALIZATION SCH...ijwmn
Localization entails position estimation of sensor nodes by employing different techniques and mathematical computations. Localizable sensors also form an inherent part in the functioning of IoT devices and robotics. In this article, the author extends1 a novel scheme for node localization implemented using a hybrid fuzzy logic system to trace the node locations inside the deployment region, presented by the
Abhishek Kumar et. al. The results obtained were then optimized using Gauss Newton Optimization to improve the localization accuracy by 50% to 90% vis-à-vis weighted centroid and other fuzzy based localization algorithms. This article attempts to scale the proposed scheme for large number of sensor nodes to emulate somewhat real world scenario by introducing cooperative localization in previous presented work. The study also analyses the effectiveness of such scaling by comparing the localization accuracy. In next section, the article incorporates security in the proposed cooperative localization approach to detect malicious nodes/anchors by mutual authentication using El Gamel digital Signature scheme. A detailed study of the impact of incorporating security and scaling on average processing time and localization coverage has also been performed. The processing time increased by a factor of 2.5s for 500 nodes (can be attributed to more number of iterations and computations and large deployment area with small radio range of nodes) and coverage remained almost equal, albeit slightly low by a factor of 1% to 2%. Apart from these, the article also discusses the impact of adding extra functionalities in the proposed hybrid fuzzy system based localization scheme on processing time and localization accuracy.Lastly, this study also briefs about how the proposed scalable, cooperative and secure localization scheme tackles the type of attacks that pose threat to localization.
Hierarchical Key Agreement Protocol for Wireless Sensor Networksidescitation
Wireless sensor network promises ubiquitous data
collection and processing for variety of commercial, healthcare
and military applications. Practical realization of WSN
applications is possible only after assuring network security.
Cryptographic key distribution is an important phase in
network security which establishes initial trust in the network.
Security protocol implementation in WSN is limited by
resource constrained nature of sensor nodes. The key
distribution algorithm satisfying security requirements of
given WSN application should be implemented with minimum
communication and memory overhead. As a solution to this
problem, hierarchical key management technique is proposed
in this paper. Symmetric key pre-distribution technique with
less computational overhead and ID-based asymmetric key
(IBK) distribution technique with less communication
overhead are applied simultaneously in the network at
different levels. Resilience strength and resource overhead of
the proposed scheme is compared with both symmetric and
asymmetric techniques.
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.
MEKDA: Multi-Level ECC based Key Distribution and Authentication in Internet ...IJCNCJournal
The Internet of Things (IoT) is an extensive system of networks and connected devices with minimal human interaction and swift growth. The constraints of the System and limitations of Devices pose several challenges, including security; hence billions of devices must protect from attacks and compromises. The resource-constrained nature of IoT devices amplifies security challenges. Thus standard data communication and security measures are inefficient in the IoT environment. The ubiquity of IoT devices and their deployment in sensitive applications increase the vulnerability of any security breaches to risk lives. Hence, IoT-related security challenges are of great concern. Authentication is the solution to the vulnerability of a malicious device in the IoT environment. The proposed Multi-level Elliptic Curve Cryptography based Key Distribution and Authentication in IoT enhances the security by Multi-level Authentication when the devices enter or exit the Cluster in an IoT system. The decreased Computation Time and Energy Consumption by generating and distributing Keys using Elliptic Curve Cryptography extends the availability of the IoT devices. The Performance analysis shows the improvement over the Fast Authentication and Data Transfer method.
WSN performance based on node placement by genetic algorithm at smart home en...TELKOMNIKA JOURNAL
Wireless sensor connectivity is one of several factors that determines the communication reliability of each node. The placement of the node depends on the area that covered by wireless coverage area, so the node placement should be optimally placed. But the other aspect is the sensor coverage area. Sensor coverage area sometimes could be different with wireless sensor coverage area. Based on that situation, it needs to optimize that situation. Genetic Algorithm is an algorithm that utilizes a heuristic approach that uses biological mechanism evolution. It used to evolution the best position of Sensor Node based on Wireless and Sensor coverage area. After the position of each node generated by Genetic Algorithm, it still needs to evaluate the wireless sensor node performance. The performance indicates that the genetic algorithm can be used to determine sensor node placement in the smart home environment. The smart home environment used to monitor event at the house such as wildfire. In this research used Quality of Services (QoS) to measure wireless sensor performance. The experimental testing scenario will be used to place several nodes that generated. The QoS performed systems reliability that produced based on 3, 4 and 5 testing nodes, the minimum and maximum of each: delay is 6.21 and 8.74 milliseconds, jitter is 0.11 and 1.59 Hz and throughput is 68.83 and 90.49 bps. Based on ETSI classification, the performance of sensor node placement is Good and acceptable in real-time systems.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A NOVEL INTRUSION DETECTION MODEL FOR MOBILE AD-HOC NETWORKS USING CP-KNNIJCNCJournal
Mobile ad-hoc network security problems are the subject of in depth analysis. A group of mobile nodes area unit connected to a set wired backbone. In MANET, the node themselves implement the network management in a very cooperative fashion. All the nodes area unit accountable to create a constellation that is dynamically, modification it and conjointly the absence of any clear network boundaries. We tend to project a completely unique intrusion detection model for mobile ad-hoc network victimization. CP-KNN (Conformal Prediction K-Nearest Neighbor) algorithmic rule is to classify the audit knowledge for anomaly detection. The non-conformity score worth is employed to cut back the classification period of time for multi level iteration. It is effectively notice anomalies with high true positive rate, low false positive rate and high confidence that the progressive of assorted anomaly detection ways. Additionally it is interfered
by “noisy” knowledge (unclean data), the projected technique is strong, effective and conjointly it retains
its smart detection performance and to avoid the abnormal activity.
A Novel Solitude Conserving Location Monitoring Approach for Wireless Sensor ...IJERA Editor
Observing individual locations with a capable untrusted server impose secrecy threats to the monitored individuals. In this paper we propose “A Novel Solitude Conserving Location Monitoring approach for Wireless Sensor networks”. We design two approaches to study nondescript locations in-network approaches, namely quality-aware and resource-aware approaches, that aims to enable the system to give high end quality location monitoring services for end users, while conserving personal location privacy. Both approaches are worked based on k-anonymity solitude (i.e.,an object is indistinguishable among k objects), to enable highly trusted sensor nodes to provide the collective location data of monitored objects for our system. Each collective location is in a form of a observed area X along with the number of monitored objects reside in X. The resource-aware approach objective to optimize the computational and communication value, while quality-aware approach aims to increase the reliability of the collective location data by reducing their observing areas. We use spatial histogram methodology to estimates the distribution of observing objects based on the gathered collective location data. We evaluated these two approaches through simulated experiments. The simulation results shows that these approaches gives high quality location observing services for end users and assure the location secrecy of the monitored objects.
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETSIJCNCJournal
The Border Gateway Protocol (BGP) provides crucial routing information for the Internet infrastructure. A problem with abnormal routing behavior affects the stability and connectivity of the global Internet. The biggest hurdles in detecting BGP attacks are extremely unbalanced data set category distribution and the dynamic nature of the network. This unbalanced class distribution and dynamic nature of the network results in the classifier's inferior performance. In this paper we proposed an efficient approach to properly managing these problems, the proposed approach tackles the unbalanced classification of datasets by turning the problem of binary classification into a problem of multiclass classification. This is achieved by splitting the majority-class samples evenly into multiple segments using Affinity Propagation, where the number of segments is chosen so that the number of samples in any segment closely matches the minority-class samples. Such sections of the dataset together with the minor class are then viewed as different classes and used to train the Extreme Learning Machine (ELM). The RIPE and BCNET datasets are used to evaluate the performance of the proposed technique. When no feature selection is used, the proposed technique improves the F1 score by 1.9% compared to state-of-the-art techniques. With the Fischer feature selection algorithm, the proposed algorithm achieved the highest F1 score of 76.3%, which was a 1.7% improvement over the compared ones. Additionally, the MIQ feature selection technique improves the accuracy by 3.5%. For the BCNET dataset, the proposed technique improves the F1 score by 1.8% for the Fisher feature selection technique. The experimental findings support the substantial improvement in performance from previous approaches by the new technique.
SECURE LOCATION BASED ROUTING FOR MANETSAnkur Singhal
The video demonstrates sending the file from source to the destination by initially encrypting it using multihops and then decrypting it at the receiver's end
Enhancing the Security in WSN using Three Tier Security ArchitectureAM Publications,India
Security is the main issue while setting up the WSN network for node communication. This report describes the efficient mechanism for achieving the security between node communications by creating three tier security architecture. This system implements three tier architecture with the use of two polynomial pools having sensor nodes, mobile sinks and some access points that are also sensor nodes, to get better security. Two pools are common mobile polynomial pool and common static polynomial pool. Mobile sinks and access point carries keys from common mobile polynomial pool were as, access points and sensor nodes carries keys from common static polynomial pool. Communication gets established from mobile sink to access point then from access point to sensor node that shows three tier architecture Authentication is the main aspect of the system, that is achieved by pairwise key predistribution methods and authentication of the nodes with the use of polynomial keys. Here, Mobile sink replication attack is implemented against the network. The malicious node, it is blocked. If it wants to communicate within the network then it needs to capture large no of keys from both the pools for authentication. But as the sufficient keys are not available with it, it cannot communicate with the other nodes in the network
AN EVALUATION OF ENERGY EFFICIENT SOURCE AUTHENTICATION METHODS FOR FALSE DA...ijsptm
The false data injection attack is a major security threat in Wireless Sensor Network (WSN) since is
degrades the network capability. The bandwidth efficient cooperative authentication (BECAN) scheme is
used for filtering the false data injection attack. It is used to save energy of sensor nodes in WSN by early
detection and filtering of maximum possible injected false data. Source authentication is a critical security
requirement in wireless sensor networks to identify attacker nodes that injects false data. Solutions based
on Elliptic Curve Cryptography (ECC) have been used for source authentication, but they suffer from
severe energy depletion. This results in high computational and communication overheads. Bloom filter
based Symmetric-key source authentication scheme exhibits low authentication overhead .This avoids the
inherent problems associated with public key cryptography based schemes. The current work demonstrates
the efficiency of bloom filter based source authentication using BECAN scheme by comparing ECC and
Bloom filter based methods in terms of energy consumption
An Adaptive Mobility Based Attack Detection Mechanism to Detect Selective For...paperpublications3
Abstract: In this paper propose Mobile network based attack detection of Selective Forwarding Attacks in Wireless Sensor Networks. In existing method only used static network and mobility network require high energy and time. So these problems can be overcome by using Mobile network based attack detection. The wireless sensor network has become a hot research area due its wide range of application in military and civilian domain, but as it uses wireless media for communication these are easily prone to security attacks. Selective forwarding attacks are most effective when the attacker is explicitly included on the path of a data flow. Selective forwarding and black hole attacks are very disastrous attacks for sensor networks if used with sinkhole attack because the intruder can drop most of the important packets. Moreover, the technique involves energy efficiency, reliability and scalability. Simulation results demonstrate that our proposed method can accurately detect selective forwarding attacks and identify the compromised sensor nodes. Experimental result show analytically and through simulation experiments that our schemes achieve effective and robust detection capability with reasonable overheads.
Keywords: Wireless Sensor Network, Selective Forwarding attack, Reputation System, Packet Dropping, Channel-aware, Routing.
Title: An Adaptive Mobility Based Attack Detection Mechanism to Detect Selective Forwarding Attack in Wireless Sensor Network
Author: S.K.Shaju, R.Isaac Sajan, Bibin Christopher, Dr. A.J.Deepa
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
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
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
SEAD: Source Encrypted Authentic Data for Wireless Sensor NetworksIJERD Editor
One of the critical issues in WSNs is providing security for the secret data in military applications. It is necessary to ensure data integrity and authentication for the source data and secure end-to-end path for data transmission. Mobile sinks are suitable for data collection and localization. Mobile sinks and sensor nodes communicate with each other using their public identity, which is prone to security attacks like sink replication and node replication attack. In this work, we have proposed Source Encrypted Authentic Data algorithm (SEAD) that hides the location of mobile sink from malicious nodes. The sensed data is encrypted utilizing symmetric encryption ---Advanced Encryption Standards (AES) and tracks the location of the mobile sink. When data encounters a malicious node in a path, then data transmission path is diverted through a secure path. SEAD uses public encryption ---Elliptic Curve Cryptography (ECC) to verify the authenticity of the data. Simulation results show that the proposed algorithm ensures data integrity and node authenticity against malicious nodes. Double encryption in the proposed algorithm produces better results in comparison with the existing algorithms.
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 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 HYBRID FUZZY SYSTEM BASED COOPERATIVE SCALABLE AND SECURED LOCALIZATION SCH...ijwmn
Localization entails position estimation of sensor nodes by employing different techniques and mathematical computations. Localizable sensors also form an inherent part in the functioning of IoT devices and robotics. In this article, the author extends1 a novel scheme for node localization implemented using a hybrid fuzzy logic system to trace the node locations inside the deployment region, presented by the
Abhishek Kumar et. al. The results obtained were then optimized using Gauss Newton Optimization to improve the localization accuracy by 50% to 90% vis-à-vis weighted centroid and other fuzzy based localization algorithms. This article attempts to scale the proposed scheme for large number of sensor nodes to emulate somewhat real world scenario by introducing cooperative localization in previous presented work. The study also analyses the effectiveness of such scaling by comparing the localization accuracy. In next section, the article incorporates security in the proposed cooperative localization approach to detect malicious nodes/anchors by mutual authentication using El Gamel digital Signature scheme. A detailed study of the impact of incorporating security and scaling on average processing time and localization coverage has also been performed. The processing time increased by a factor of 2.5s for 500 nodes (can be attributed to more number of iterations and computations and large deployment area with small radio range of nodes) and coverage remained almost equal, albeit slightly low by a factor of 1% to 2%. Apart from these, the article also discusses the impact of adding extra functionalities in the proposed hybrid fuzzy system based localization scheme on processing time and localization accuracy.Lastly, this study also briefs about how the proposed scalable, cooperative and secure localization scheme tackles the type of attacks that pose threat to localization.
DATA TRANSMISSION IN WIRELESS SENSOR NETWORKS FOR EFFECTIVE AND SECURE COMMUN...IJEEE
Data transmission occurs from transmitting node to sink node, which communicate each other via large number of intermediate nodes or directly to an external base station. A network consists of numbers of nodes with one as a source and one or more as a destination node.
DATA AGGREGATION AND PRIVACY FOR POLICE PATROLSijasuc
With a widespread growth in the potential applications of Wireless Sensor Networks, the need for reliable
security mechanisms for them has increased manifold. This paper proposes a scheme, Privacy for Police
Patrols (PPP), to provide secure data aggregation that relies on multilevel routing. Privacy factors have
been identified and implemented. Aggregates are prepared and the summary of information is gathered
and stored in a repository. The above defined approaches are integrated in police patrol applications and
preliminary results are obtained.
List of Parallel and Distributed System IEEE 2014 Projects. It Contains the IEEE Projects in the Domain Parallel and Distributed System for the year 2014
Parallel and Distributed System IEEE 2014 ProjectsVijay Karan
List of Parallel and Distributed System IEEE 2014 Projects. It Contains the IEEE Projects in the Domain Parallel and Distributed System for the year 2014
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
A Novel Three-Dimensional Adaptive Localization (T-Dial) Algorithm for Wirele...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Securing Data Communication for Node Anonymization Using Location InformationIJMER
MANET is a type of wireless ad-hoc network that usually has a routable networking
environment. Mobile Ad Hoc Networks use unidentified routing protocols that hide node identities and
routes from outside observers to provide anonymity protection. Our existing anonymous routing
protocols depending on either hop-by-hop encryption, redundant traffic either produce high cost or it
cannot provide privacy protection to data sources, destinations, and routes. We propose a new location
based routing protocol which offers high privacy protection at low cost to sources, destinations, and
routes. It also has approaches to effectively counter intersection and timing attacks. The proposed plan
ensures the privacy of both route and nodes which westudy and simulate the result. This existing
protocol achieves better route privacy protection and its lower cost compared to other unidentified
routing protocols, and also improving the routing efficiency compared to other geographical routing
protocol.
For further details contact:
N.RAJASEKARAN B.E M.S 9841091117,9840103301.
IMPULSE TECHNOLOGIES,
Old No 251, New No 304,
2nd Floor,
Arcot road ,
Vadapalani ,
Chennai-26.
www.impulse.net.in
Email: ieeeprojects@yahoo.com/ imbpulse@gmail.com
A Novel Method for Prevention of Bandwidth Distributed Denial of Service AttacksIJERD Editor
Distributed Denial of Service (DDoS) Attacks became a massive threat to the Internet. Traditional
Architecture of internet is vulnerable to the attacks like DDoS. Attacker primarily acquire his army of Zombies,
then that army will be instructed by the Attacker that when to start an attack and on whom the attack should be
done. In this paper, different techniques which are used to perform DDoS Attacks, Tools that were used to
perform Attacks and Countermeasures in order to detect the attackers and eliminate the Bandwidth Distributed
Denial of Service attacks (B-DDoS) are reviewed. DDoS Attacks were done by using various Flooding
techniques which are used in DDoS attack.
The main purpose of this paper is to design an architecture which can reduce the Bandwidth
Distributed Denial of service Attack and make the victim site or server available for the normal users by
eliminating the zombie machines. Our Primary focus of this paper is to dispute how normal machines are
turning into zombies (Bots), how attack is been initiated, DDoS attack procedure and how an organization can
save their server from being a DDoS victim. In order to present this we implemented a simulated environment
with Cisco switches, Routers, Firewall, some virtual machines and some Attack tools to display a real DDoS
attack. By using Time scheduling, Resource Limiting, System log, Access Control List and some Modular
policy Framework we stopped the attack and identified the Attacker (Bot) machines
Hearing loss is one of the most common human impairments. It is estimated that by year 2015 more
than 700 million people will suffer mild deafness. Most can be helped by hearing aid devices depending on the
severity of their hearing loss. This paper describes the implementation and characterization details of a dual
channel transmitter front end (TFE) for digital hearing aid (DHA) applications that use novel micro
electromechanical- systems (MEMS) audio transducers and ultra-low power-scalable analog-to-digital
converters (ADCs), which enable a very-low form factor, energy-efficient implementation for next-generation
DHA. The contribution of the design is the implementation of the dual channel MEMS microphones and powerscalable
ADC system.
Influence of tensile behaviour of slab on the structural Behaviour of shear c...IJERD Editor
-A composite beam is composed of a steel beam and a slab connected by means of shear connectors
like studs installed on the top flange of the steel beam to form a structure behaving monolithically. This study
analyzes the effects of the tensile behavior of the slab on the structural behavior of the shear connection like slip
stiffness and maximum shear force in composite beams subjected to hogging moment. The results show that the
shear studs located in the crack-concentration zones due to large hogging moments sustain significantly smaller
shear force and slip stiffness than the other zones. Moreover, the reduction of the slip stiffness in the shear
connection appears also to be closely related to the change in the tensile strain of rebar according to the increase
of the load. Further experimental and analytical studies shall be conducted considering variables such as the
reinforcement ratio and the arrangement of shear connectors to achieve efficient design of the shear connection
in composite beams subjected to hogging moment.
Gold prospecting using Remote Sensing ‘A case study of Sudan’IJERD Editor
Gold has been extracted from northeast Africa for more than 5000 years, and this may be the first
place where the metal was extracted. The Arabian-Nubian Shield (ANS) is an exposure of Precambrian
crystalline rocks on the flanks of the Red Sea. The crystalline rocks are mostly Neoproterozoic in age. ANS
includes the nations of Israel, Jordan. Egypt, Saudi Arabia, Sudan, Eritrea, Ethiopia, Yemen, and Somalia.
Arabian Nubian Shield Consists of juvenile continental crest that formed between 900 550 Ma, when intra
oceanic arc welded together along ophiolite decorated arc. Primary Au mineralization probably developed in
association with the growth of intra oceanic arc and evolution of back arc. Multiple episodes of deformation
have obscured the primary metallogenic setting, but at least some of the deposits preserve evidence that they
originate as sea floor massive sulphide deposits.
The Red Sea Hills Region is a vast span of rugged, harsh and inhospitable sector of the Earth with
inimical moon-like terrain, nevertheless since ancient times it is famed to be an abode of gold and was a major
source of wealth for the Pharaohs of ancient Egypt. The Pharaohs old workings have been periodically
rediscovered through time. Recent endeavours by the Geological Research Authority of Sudan led to the
discovery of a score of occurrences with gold and massive sulphide mineralizations. In the nineties of the
previous century the Geological Research Authority of Sudan (GRAS) in cooperation with BRGM utilized
satellite data of Landsat TM using spectral ratio technique to map possible mineralized zones in the Red Sea
Hills of Sudan. The outcome of the study mapped a gossan type gold mineralization. Band ratio technique was
applied to Arbaat area and a signature of alteration zone was detected. The alteration zones are commonly
associated with mineralization. The alteration zones are commonly associated with mineralization. A filed check
confirmed the existence of stock work of gold bearing quartz in the alteration zone. Another type of gold
mineralization that was discovered using remote sensing is the gold associated with metachert in the Atmur
Desert.
Reducing Corrosion Rate by Welding DesignIJERD Editor
The paper addresses the importance of welding design to prevent corrosion at steel. Welding is
used to join pipe, profiles at bridges, spindle, and a lot more part of engineering construction. The
problems happened associated with welding are common issues in these fields, especially corrosion.
Corrosion can be reduced with many methods, they are painting, controlling humidity, and also good
welding design. In the research, it can be found that reducing residual stress on the welding can be
solved in corrosion rate reduction problem.
Preheating on 500oC and 600oC give better condition to reduce corosion rate than condition after
preheating 400oC. For all welding groove type, material with 500oC and 600oC preheating after 14 days
corrosion test is 0,5%-0,69% lost. Material with 400oC preheating after 14 days corrosion test is 0,57%-0,76%
lost.
Welding groove also influence corrosion rate. X and V type welding groove give better condition to reduce
corrosion rate than use 1/2V and 1/2 X welding groove. After 14 days corrosion test, the samples with
X welding groove type is 0,5%-0,57% lost. The samples with V welding groove after 14 days corrosion test is
0,51%-0,59% lost. The samples with 1/2V and 1/2X welding groove after 14 days corrosion test is 0,58%-
0,71% lost.
Router 1X3 – RTL Design and VerificationIJERD Editor
Routing is the process of moving a packet of data from source to destination and enables messages
to pass from one computer to another and eventually reach the target machine. A router is a networking device
that forwards data packets between computer networks. It is connected to two or more data lines from different
networks (as opposed to a network switch, which connects data lines from one single network). This paper,
mainly emphasizes upon the study of router device, it‟s top level architecture, and how various sub-modules of
router i.e. Register, FIFO, FSM and Synchronizer are synthesized, and simulated and finally connected to its top
module.
Active Power Exchange in Distributed Power-Flow Controller (DPFC) At Third Ha...IJERD Editor
This paper presents a component within the flexible ac-transmission system (FACTS) family, called
distributed power-flow controller (DPFC). The DPFC is derived from the unified power-flow controller (UPFC)
with an eliminated common dc link. The DPFC has the same control capabilities as the UPFC, which comprise
the adjustment of the line impedance, the transmission angle, and the bus voltage. The active power exchange
between the shunt and series converters, which is through the common dc link in the UPFC, is now through the
transmission lines at the third-harmonic frequency. DPFC multiple small-size single-phase converters which
reduces the cost of equipment, no voltage isolation between phases, increases redundancy and there by
reliability increases. The principle and analysis of the DPFC are presented in this paper and the corresponding
simulation results that are carried out on a scaled prototype are also shown.
Mitigation of Voltage Sag/Swell with Fuzzy Control Reduced Rating DVRIJERD Editor
Power quality has been an issue that is becoming increasingly pivotal in industrial electricity
consumers point of view in recent times. Modern industries employ Sensitive power electronic equipments,
control devices and non-linear loads as part of automated processes to increase energy efficiency and
productivity. Voltage disturbances are the most common power quality problem due to this the use of a large
numbers of sophisticated and sensitive electronic equipment in industrial systems is increased. This paper
discusses the design and simulation of dynamic voltage restorer for improvement of power quality and
reduce the harmonics distortion of sensitive loads. Power quality problem is occurring at non-standard
voltage, current and frequency. Electronic devices are very sensitive loads. In power system voltage sag,
swell, flicker and harmonics are some of the problem to the sensitive load. The compensation capability
of a DVR depends primarily on the maximum voltage injection ability and the amount of stored
energy available within the restorer. This device is connected in series with the distribution feeder at
medium voltage. A fuzzy logic control is used to produce the gate pulses for control circuit of DVR and the
circuit is simulated by using MATLAB/SIMULINK software.
Study on the Fused Deposition Modelling In Additive ManufacturingIJERD Editor
Additive manufacturing process, also popularly known as 3-D printing, is a process where a product
is created in a succession of layers. It is based on a novel materials incremental manufacturing philosophy.
Unlike conventional manufacturing processes where material is removed from a given work price to derive the
final shape of a product, 3-D printing develops the product from scratch thus obviating the necessity to cut away
materials. This prevents wastage of raw materials. Commonly used raw materials for the process are ABS
plastic, PLA and nylon. Recently the use of gold, bronze and wood has also been implemented. The complexity
factor of this process is 0% as in any object of any shape and size can be manufactured.
Spyware triggering system by particular string valueIJERD Editor
This computer programme can be used for good and bad purpose in hacking or in any general
purpose. We can say it is next step for hacking techniques such as keylogger and spyware. Once in this system if
user or hacker store particular string as a input after that software continually compare typing activity of user
with that stored string and if it is match then launch spyware programme.
A Blind Steganalysis on JPEG Gray Level Image Based on Statistical Features a...IJERD Editor
This paper presents a blind steganalysis technique to effectively attack the JPEG steganographic
schemes i.e. Jsteg, F5, Outguess and DWT Based. The proposed method exploits the correlations between
block-DCTcoefficients from intra-block and inter-block relation and the statistical moments of characteristic
functions of the test image is selected as features. The features are extracted from the BDCT JPEG 2-array.
Support Vector Machine with cross-validation is implemented for the classification.The proposed scheme gives
improved outcome in attacking.
Secure Image Transmission for Cloud Storage System Using Hybrid SchemeIJERD Editor
- Data over the cloud is transferred or transmitted between servers and users. Privacy of that
data is very important as it belongs to personal information. If data get hacked by the hacker, can be
used to defame a person’s social data. Sometimes delay are held during data transmission. i.e. Mobile
communication, bandwidth is low. Hence compression algorithms are proposed for fast and efficient
transmission, encryption is used for security purposes and blurring is used by providing additional
layers of security. These algorithms are hybridized for having a robust and efficient security and
transmission over cloud storage system.
Application of Buckley-Leverett Equation in Modeling the Radius of Invasion i...IJERD Editor
A thorough review of existing literature indicates that the Buckley-Leverett equation only analyzes
waterflood practices directly without any adjustments on real reservoir scenarios. By doing so, quite a number
of errors are introduced into these analyses. Also, for most waterflood scenarios, a radial investigation is more
appropriate than a simplified linear system. This study investigates the adoption of the Buckley-Leverett
equation to estimate the radius invasion of the displacing fluid during waterflooding. The model is also adopted
for a Microbial flood and a comparative analysis is conducted for both waterflooding and microbial flooding.
Results shown from the analysis doesn’t only records a success in determining the radial distance of the leading
edge of water during the flooding process, but also gives a clearer understanding of the applicability of
microbes to enhance oil production through in-situ production of bio-products like bio surfactans, biogenic
gases, bio acids etc.
Gesture Gaming on the World Wide Web Using an Ordinary Web CameraIJERD Editor
- Gesture gaming is a method by which users having a laptop/pc/x-box play games using natural or
bodily gestures. This paper presents a way of playing free flash games on the internet using an ordinary webcam
with the help of open source technologies. Emphasis in human activity recognition is given on the pose
estimation and the consistency in the pose of the player. These are estimated with the help of an ordinary web
camera having different resolutions from VGA to 20mps. Our work involved giving a 10 second documentary to
the user on how to play a particular game using gestures and what are the various kinds of gestures that can be
performed in front of the system. The initial inputs of the RGB values for the gesture component is obtained by
instructing the user to place his component in a red box in about 10 seconds after the short documentary before
the game is finished. Later the system opens the concerned game on the internet on popular flash game sites like
miniclip, games arcade, GameStop etc and loads the game clicking at various places and brings the state to a
place where the user is to perform only gestures to start playing the game. At any point of time the user can call
off the game by hitting the esc key and the program will release all of the controls and return to the desktop. It
was noted that the results obtained using an ordinary webcam matched that of the Kinect and the users could
relive the gaming experience of the free flash games on the net. Therefore effective in game advertising could
also be achieved thus resulting in a disruptive growth to the advertising firms.
Hardware Analysis of Resonant Frequency Converter Using Isolated Circuits And...IJERD Editor
-LLC resonant frequency converter is basically a combo of series as well as parallel resonant ckt. For
LCC resonant converter it is associated with a disadvantage that, though it has two resonant frequencies, the
lower resonant frequency is in ZCS region[5]. For this application, we are not able to design the converter
working at this resonant frequency. LLC resonant converter existed for a very long time but because of
unknown characteristic of this converter it was used as a series resonant converter with basically a passive
(resistive) load. . Here, it was designed to operate in switching frequency higher than resonant frequency of the
series resonant tank of Lr and Cr converter acts very similar to Series Resonant Converter. The benefit of LLC
resonant converter is narrow switching frequency range with light load[6] . Basically, the control ckt plays a
very imp. role and hence 555 Timer used here provides a perfect square wave as the control ckt provides no
slew rate which makes the square wave really strong and impenetrable. The dead band circuit provides the
exclusive dead band in micro seconds so as to avoid the simultaneous firing of two pairs of IGBT’s where one
pair switches off and the other on for a slightest period of time. Hence, the isolator ckt here is associated with
each and every ckt used because it acts as a driver and an isolation to each of the IGBT is provided with one
exclusive transformer supply[3]. The IGBT’s are fired using the appropriate signal using the previous boards
and hence at last a high frequency rectifier ckt with a filtering capacitor is used to get an exact dc
waveform .The basic goal of this particular analysis is to observe the wave forms and characteristics of
converters with differently positioned passive elements in the form of tank circuits.
Simulated Analysis of Resonant Frequency Converter Using Different Tank Circu...IJERD Editor
LLC resonant frequency converter is basically a combo of series as well as parallel resonant ckt. For
LCC resonant converter it is associated with a disadvantage that, though it has two resonant frequencies, the
lower resonant frequency is in ZCS region [5]. For this application, we are not able to design the converter
working at this resonant frequency. LLC resonant converter existed for a very long time but because of
unknown characteristic of this converter it was used as a series resonant converter with basically a passive
(resistive) load. . Here, it was designed to operate in switching frequency higher than resonant frequency of the
series resonant tank of Lr and Cr converter acts very similar to Series Resonant Converter. The benefit of LLC
resonant converter is narrow switching frequency range with light load[6] . Basically, the control ckt plays a
very imp. role and hence 555 Timer used here provides a perfect square wave as the control ckt provides no
slew rate which makes the square wave really strong and impenetrable. The dead band circuit provides the
exclusive dead band in micro seconds so as to avoid the simultaneous firing of two pairs of IGBT’s where one
pair switches off and the other on for a slightest period of time. Hence, the isolator ckt here is associated with
each and every ckt used because it acts as a driver and an isolation to each of the IGBT is provided with one
exclusive transformer supply[3]. The IGBT’s are fired using the appropriate signal using the previous boards
and hence at last a high frequency rectifier ckt with a filtering capacitor is used to get an exact dc
waveform .The basic goal of this particular analysis is to observe the wave forms and characteristics of
converters with differently positioned passive elements in the form of tank circuits. The supported simulation
is done through PSIM 6.0 software tool
Amateurs Radio operator, also known as HAM communicates with other HAMs through Radio
waves. Wireless communication in which Moon is used as natural satellite is called Moon-bounce or EME
(Earth -Moon-Earth) technique. Long distance communication (DXing) using Very High Frequency (VHF)
operated amateur HAM radio was difficult. Even with the modest setup having good transceiver, power
amplifier and high gain antenna with high directivity, VHF DXing is possible. Generally 2X11 YAGI antenna
along with rotor to set horizontal and vertical angle is used. Moon tracking software gives exact location,
visibility of Moon at both the stations and other vital data to acquire real time position of moon.
“MS-Extractor: An Innovative Approach to Extract Microsatellites on „Y‟ Chrom...IJERD Editor
Simple Sequence Repeats (SSR), also known as Microsatellites, have been extensively used as
molecular markers due to their abundance and high degree of polymorphism. The nucleotide sequences of
polymorphic forms of the same gene should be 99.9% identical. So, Microsatellites extraction from the Gene is
crucial. However, Microsatellites repeat count is compared, if they differ largely, he has some disorder. The Y
chromosome likely contains 50 to 60 genes that provide instructions for making proteins. Because only males
have the Y chromosome, the genes on this chromosome tend to be involved in male sex determination and
development. Several Microsatellite Extractors exist and they fail to extract microsatellites on large data sets of
giga bytes and tera bytes in size. The proposed tool “MS-Extractor: An Innovative Approach to extract
Microsatellites on „Y‟ Chromosome” can extract both Perfect as well as Imperfect Microsatellites from large
data sets of human genome „Y‟. The proposed system uses string matching with sliding window approach to
locate Microsatellites and extracts them.
Importance of Measurements in Smart GridIJERD Editor
- The need to get reliable supply, independence from fossil fuels, and capability to provide clean
energy at a fixed and lower cost, the existing power grid structure is transforming into Smart Grid. The
development of a smart energy distribution grid is a current goal of many nations. A Smart Grid should have
new capabilities such as self-healing, high reliability, energy management, and real-time pricing. This new era
of smart future grid will lead to major changes in existing technologies at generation, transmission and
distribution levels. The incorporation of renewable energy resources and distribution generators in the existing
grid will increase the complexity, optimization problems and instability of the system. This will lead to a
paradigm shift in the instrumentation and control requirements for Smart Grids for high quality, stable and
reliable electricity supply of power. The monitoring of the grid system state and stability relies on the
availability of reliable measurement of data. In this paper the measurement areas that highlight new
measurement challenges, development of the Smart Meters and the critical parameters of electric energy to be
monitored for improving the reliability of power systems has been discussed.
Study of Macro level Properties of SCC using GGBS and Lime stone powderIJERD Editor
One of the major environmental concerns is the disposal of the waste materials and utilization of
industrial by products. Lime stone quarries will produce millions of tons waste dust powder every year. Having
considerable high degree of fineness in comparision to cement this material may be utilized as a partial
replacement to cement. For this purpose an experiment is conducted to investigate the possibility of using lime
stone powder in the production of SCC with combined use GGBS and how it affects the fresh and mechanical
properties of SCC. First SCC is made by replacing cement with GGBS in percentages like 10, 20, 30, 40, 50 and
by taking the optimum mix with GGBS lime stone powder is blended to mix in percentages like 5, 10, 15, 20 as
a partial replacement to cement. Test results shows that the SCC mix with combination of 30% GGBS and 15%
limestone powder gives maximum compressive strength and fresh properties are also in the limits prescribed by
the EFNARC.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
To Graph or Not to Graph Knowledge Graph Architectures and LLMs
International Journal of Engineering Research and Development (IJERD)
1. International Journal of Engineering Research and Development
e-ISSN: 2278-067X, p-ISSN: 2278-800X, www.ijerd.com
Volume 9, Issue 5 (December 2013), PP. 27-32
A Preserving Location Privacy of Mobile Network
P.Sakthi priyanka M.E(cse).1, M.Ganthimathi M.E(cse).2, M.Dhivya M.E(cse).3,
S.Surya M.E(cse)4
Abstract:- Mobile network consists of number of mobile nodes moving in the network randomly, In mobile
networks, authentication is a required primitive for most security protocols. Unfortunately, an adversary can monitor
pseudonyms used for authentication to track the location of mobile nodes. A frequently proposed solution to protect
location privacy suggests that mobile nodes collectively change their pseudonyms in regions called mix zones. This
approach is costly. Self interested mobile nodes might, thus, decide not to cooperate and jeopardize the achievable
location privacy. To analyze non-cooperative behavior of mobile nodes by using a game-theoretic model, where
each player aims at maximizing its location privacy at a minimum cost. We obtain Nash equilibria in static n-player
complete information games. As in practice mobile nodes do not know their opponents’ payoffs, we then consider
static incomplete information games.To establish that symmetric Bayesian-Nash equilibria exist with simple
threshold strategies. By means of numerical results, we predict behavior of selfish mobile nodes. We then
investigate dynamic games where players decide to change their pseudonym one after the other and show how this
affects strategies at equilibrium. Finally, we design protocols—Pseudo Game protocols—based on the results of our
analysis and simulate their performance in vehicular network scenarios,The pseudonyms key changes mainly used in
many areas such as peer to peer communication and wireless network, because this network only each time change
the location .Public and private key is used for transferring the information ,number of routing algorithm is used for
route the information.
Index Terms:- Security and privacy protection, mobile computing, network protocols.
I.
INTRODUCTION
The mobile nodes are frequently change their location, while change the location privacy of the mobile
node is very important. The growing popularity of Bluetooth, WiFi in ad hoc mode, and other similar techniques is
likely to fuel the adoption of peer-to-peer wireless communications. Corporations are developing wireless peer-topeer technologies. The integration of peer-to-peer wireless communications into mobile devices brings new security
challenges, due to their mobile and ad hoc nature. Wireless communications are inherently dependent on geographic
proximity: Mobile devices detect each other’s presence by periodically broadcasting beacon messages. These
messages include pseudonyms such as public keys in order to identify communicating parties, route communications
and secure communications. A change of pseudonym by an isolated device in a wireless network can be trivially
identified by an external party observing transmitted messages. Hence, a change of pseudonym should be spatially
and temporally coordinated among mobile devices , i.e., a collective effort. One solution consists in changing
pseudonyms periodically, at a predetermined frequency. This works if at least two mobile nodes change their
pseudonyms in proximity, a rarely met condition. Base stations can be used as coordinators to synchronize
pseudonym changes but this solution requires help from the infrastructure. The approach in enables mobile nodes to
change their pseudonyms at specific time instances (e.g., before associating with wireless base stations). However,
this solution achieves location privacy only with respect to the infrastructure. Another approach coordinates
pseudonym changes by forcing mobile nodes to change their pseudonyms within predetermined regions called mix
zones. This approach lacks flexibility and is prone to attacks because a central authority fixes mix zone locations and
must share them with mobile nodes.The integration of peer-to-peer wireless communications into mobile devices
brings new security challenges, due to their mobile and ad hoc nature. Wireless communications are inherently
dependent on geographic proximity mobile devices detect each other’s presence by periodically broadcasting beacon
messages. These messages include pseudonyms such as public keys in order to identify communicating parties,
route communications and secure communications. Much to the detriment of privacy, external parties can monitor
pseudonyms in broadcasted messages in order to track the locations of mobile devices.
27
2. A Preserving Location Privacy of Mobile Network
II.
RELATED WORK
2.1Mix Zones: User Privacy in Location-aware Services
Privacy of personal location information is becoming an increasingly important issue. This paper a method,
called the mix zone, developed to enhance user privacy in location-based services. We improve the mathematical
model, examine and minimize computational complexity and develop a method of providing feedback to users.
Traditionally, privacy of personal location information has not been a critical issue but, with the development of
location tracking systems capable of following user movement twenty-four hours a day and seven days a week,
location privacy becomes important: records of everything from the shelves you visit in the library to the clinics you
visit in a hospital can represent a very intrusive catalogue of data. Location privacy is an important new issue and
several strategies have been suggested to protect personal location information. The access Geographic
Location/Privacy (Geopriv) Working Group have outlined architecture to allow users to control delivery and
accuracy of location information through rule-based policies. Hengartner and Steenkiste describe a method of using
digital certificates combined with rule-based policies to protect location information. The attacker can observe the
times, coordinates and pseudonyms of all these ingress and egress events. His ideal goal is to reconstruct the correct
mapping between all the ingress events and the egress events. This is equivalent to discovering the mapping between
new and old pseudonyms.During the period of observation, assume there are n ingress events and n egress events.4
The attacker observes n old pseudonyms going in, and n new pseudonyms coming out, most likely with some
interleaving. Each permutation of the set of n new pseudonyms gives a new mapping, so there is a total of n!
Mappings. Many of the mappings can be ruled out because we have mix zone model, describing a quantifiable
metric of location privacy from the point of view of the attacker. Analysis is computationally expensive and may
require partial evaluation of the problem.we have described a method of achieving this. Furthermore, given Fixed
computational power there exists a trade-of between the tractability of the problem and the accuracy in which the
real world is modeled.
2.2. On Neighbor Discovery in Wireless Networks With Directional Antennas
Several probabilistic algorithms in which nodes perform random, independent transmissions to discover
their one-hop neighbors. Our neighbor discovery algorithms are classified into two groups, viz. Direct- Discovery
Algorithms in which nodes discover their neighbors only upon receiving a transmission from their neighbors and
Gossip-Based Algorithms in which nodes gossip about their neighbors' location information to enable faster
discovery. consider the operation of these algorithms in a slotted, synchronous system and mathematically derive
their optimal parameter settings. We show how to extend these algorithms for an asynchronous system and describe
their optimal design. Analysis and simulation of the algorithms show that nodes discover their neighbors much faster
using gossip-based algorithms than using direct-discovery algorithms. Furthermore, the performance of gossip-based
algorithms is insensitive to an increase in node density. The effciency of a neighbor discovery algorithm also
depends on the choice of antenna bandwidth. Direct discovery algorithm is used for determining neighbor only hear
the when they hear transmission from neighbors.Gossip based algorithm are insensitive . Discovery Algorithms in
which nodes gossip about each others' location information to speed up discovery. Some of the important
contributions of our work are:
1. A simple mathematical model to derive the optimal parameter settings for synchronous direct-discovery and
gossip-based algorithms.
2. A simulation-based performance comparison of the gossip-based and the direct-discovery algorithms,
demonstrating that nodes discover their neighbors significantly faster using the gossip-based algorithm than using
the direct-discovery algorithm. Interestingly, we also see that while the performance of direct-discovery algorithm
degrades as node density increases, the gossip-based algorithm remains insensitive to an increase in node density
2.3FlashLinQ: A Synchronous Distributed Scheduler for Peer-to-Peer Ad Hoc Networks
Channel allocation. By leveraging the fine-grained parallel channel access of OFDM, FlashLinQ develops
an analog energy-level based signaling scheme that enables SIR (Signal to Interference Ratio) based distributed
scheduling. This new signaling mechanism and the corresponding allocation algorithms permit efficient channelaware spatial resource allocation, leading to significant gains over a CSMA/CA system with RTS/CTS. FlashLinQ is
a complete system architecture including (i) timing and frequency synchronization derived from cellular spectrum,
(ii) peer discovery, (iii) link management, and (iv) channel aware distributed power, data-rate and link scheduling.
implement FlashLinQ over licensed spectrum on a DSP/FPGA platform. To collect the data, the modem reports its
current link scheduling status to the Linux based host every second
28
3. A Preserving Location Privacy of Mobile Network
We prove the existence of one pure-strategy Bayesian Nash equilibrium in the single road intersection
game and extend the result to a network of intersections. Finally, we test our model using real road Lausanne,
Switzerland, and obtain two important results. First, in complete information scenarios, mobile users and the
adversary tend to adopt complementary strategies: users place mix zones where there is no eavesdropping station,
and the adversary deploys eavesdropping stations where there In wireless networks, the location tracking of devices
and vehicles (nodes) based on their identifiable and locatable broadcasts, presents potential threats to the location
privacy of their users. While the tracking of nodes can be mitigated to an extent by updating their identifiers to
decorrelate their traversed locations, such an approach is still vulnerable to tracking methods that utilize the
predictability of node movement to limit the location privacy provided by the identifier updates. On the other hand,
since each user may need privacy at different locations and times, a user-centric approach is needed to enable the
nodes to independently determine where/when to update their identifiers. However, mitigation of tracking with a
user-centric approach is difficult due to the lack of synchronization between updating nodes. addresses the
challenges to providing location privacy by identifier updates due to the predictability of node locations and the
asynchronous updates, and proposes a user-centric scheme called Swing that increases location privacy by enabling
the nodes to loosely synchronize updates when changing their velocity. Further, since each identifier update
inherently trades off network service for privacy, the paper also introduces an approach called Swap, which is an
extension of Swing, that enables the nodes to exchange their identifiers to potentially. maximize the location privacy
provided by each update, hence reducing the number of updates needed to meet the desired privacy levels. The
performance of the proposed schemes is evaluated under random and restricted pedestrian mobility.
III.
EXISTING SYSTEM
The promise of vehicular communications is to make road traffic safer and more efficient. however,
besides the expected benefits, vehicular communications also introduce some privacy risk by making it easier to
track the physical location of vehicles. One approach to solve this problem is that the vehicles use pseudonyms that
they change with some frequency. In this paper, we study the effectiveness of this approach. We define a model
based on the concept of the mix zone, characterize the tracking strategy of the adversary in this model, and introduce
a metric to quantify the level of privacy enjoyed by the vehicles. We also report on the results of an extensive
simulation where we used our model to determine the level of privacy achieved in realistic scenarios.
In particular, in our simulation, we used a rather complex road map, generated traffic with realistic
parameters, and varied the strength of the adversary by varying the number of her monitoring points. Our simulation
results provide detailed information about the relationship between the strength of the adversary and the level of
privacy achieved by changing pseudonyms.In particular, many envisioned safety related applications require that the
vehicles continuously broadcast their current position and speed in so called heart beat messages .We consider a
continuous part of a road network, such as a whole city or a district of a city. We assume that the adversary installed
some radio receivers at certain points of the road network with which she can eavesdrop the communications of the
vehicles, including their heart beat messages, in a limited range. On the other hand, outside the range of her radio
receivers, the adversary cannot hear the communications of the vehicles .Thus, we divide the road network into two
distinct regions: the observed zone and the unobserved zone. Physically, these zones may be scattered, possibly
consisting of many observing spots and a large unobserved area, but logically, the scattered observing spots can be
considered together as a single observed zone. illustrates how a road network is divided into an observed and an
unobserved zone in our model. In the figure, the observed zone is grey, and the unobserved zone is white. The
unobserved zone functions as a mix zone, because the vehicles change pseudonyms and mix within this zone making
it difficult for the adversary to track them.Advances in mobile networks and positioning technologies have made
location information a valuable asset in vehicular ad-hoc networks (VANETs). However, the availability of such
information must be weighed against the potential for abuse. In this paper, we investigate the problem of alleviating
unauthorized tracking of target vehicles by adversaries in VANETs propose a vehicle density-based location privacy
(DLP) scheme which can provide location privacy by utilizing the neighboring vehicle density as a threshold to
change the pseudonyms. We derive the delay distribution and the average total delay of a vehicle within a density
zone. Given the delay information, an adversary may still be available to track the target vehicle by a selection rule.
We investigate the effectiveness of DLP based on extensive simulation study. Simulation results show that the
probability of successful location tracking of a target vehicle by an adversary is inversely proportional to both the
traffic arrival rate and the variance of vehicles’ speed. Our proposed DLP scheme also has a better performance than
both Mix-Zone scheme and AMOEBA with random silent period. We propose the vehicle density-based location
privacy(DLP) scheme, which can mitigate the location tracking of vehicles by changing pseudonyms based on a
threshold in neighboring vehicle count within a density zone.2) We derive the delay distribution and the expected
29
4. A Preserving Location Privacy of Mobile Network
total delay of a vehicle within the density zone. Given the delay information, an adversary may still be available to
track the target vehicle based on a selection rule. 3) Simulation results show that the probability of successful
location tracking by an adversary is inversely proportional to the intensity of the traffic and the variance of the
vehicles’ speed. Our proposed DLP scheme outperforms both AMOEBA (with random silent period) and Mix-Zone
Schemes in reducing the probability of successful tracking by an adversary. The effectiveness of changing
pseudonyms to provide location privacy in VANETs. The approach of changing pseudonyms to make location
tracking more difficult was proposed in prior work, but its effectiveness has not been investigated in either an
analytical or numerical manner. In order to tackle this issue, we derived a delay model of vehicles in the density
zone. We assumed that the adversary has sufficient knowledge (i.e., the delay distribution of the vehicles) in density
zone. Based on this information, an adversary may try to select a vehicle which exits the density zone to the target
vehicle that entered it earlier. We proposed the vehicle density-based location privacy (DLP) scheme, which can
mitigate the location tracking of vehicles by changing pseudonyms based on a threshold in neighboring vehicle
count within a density zone.
IV.
PROPOSED SYSTEM
Protecting the location the location of mobile nodes from preventing third parties learning mobile node past
and present location.To avoid the attack the pseudonym changes delete from present and past memory.The user
centric model is proposed for enhance the privacy for particular threshold value.Each node in the network decide to
take the decision about to change their position or not.During the silent period the node cannot take the position
about the psedunoym Changes.psedunoym game protocol is proposed for take descision about position changes in
mix zone.This protocol is based on the coordinate the pseudonym changes. 1) An initiation phase, in which nodes
request pseudonym changes, and 2) a decision phase, in Which nodes decide upon receiving a request whether to
change pseudonyms or not. Different type of equation is used for psedunoym changes. Dynamic games of
incomplete information can be solved using the concept of perfect Bayesian equilibrium (PBE).In the network each
player connected in the network.Each node know the tree of all other nodes in the network.In user centric model
node give the request to the other nodes in their proximity.user centric model update the changes of mobile node
location.Initiation protocol and psednouym change protocol.
V.
PROPOSED SYSTEM ARCHITECTURE
Fig 1: proposed system architecture
We present the game-theoretic aspects of achieving location privacy with multiple pseudonyms in a
rational environment. We refer to the game-theoretic model as the pseudonym change game G. The key aspect of
the game-theoretic analysis is to consider costs and the potential location privacy gain when making a pseudonym
change decision Considering the cost of pseudonyms an the available location privacy gain (upperbounded by the
density of nodes and their locations unpredictability), the user-centric
location privacy level might encourage selfish mobile nodes to change pseudonym and obtain a satisfactory
location privacy level, as long as other nodes are also changing. Nodes may also delay their decision in order to try
to find better conditions that increase the effectiveness of pseudonym changes.
30
5. A Preserving Location Privacy of Mobile Network
Therefore, we investigate whether location privacy can emerge in a non-cooperative system despite the
cost of changing pseudonym, differentiated privacy levels, and the need for coordination. Game theory allows for
modeling situations of conflict and for predicting the behavior of participants deciding whether or not to change
their pseudonym, e.g., during the sile period, nodes cannot observe each other messages.
At the end of the silent period, it appears that all pseudonym changes occur simultaneously. Mobile nodes
must thus decide to change pseudonyms without knowing the decision of other nodes in proximity. The dynamic
version of the game models protocols in which nodes do not start/stop transmitting at the same time, and may thus
observe each others messages before making their decision. The game G is defined as a triplet ðP; S; UÞ, where P is
the set of players, S is the set of strategies, and U is the set of payoff functions. At any time t, several games are
played in parallel (but nodes participate in a single game at a time).
4.1 Players
The set of players corresponds to the set of mobile nodes in transmission range of each other at time t. For a
valid game we require no > 1. We assume that each node knows the number of other nodes in the mix zone. To
achieve a consensus on this number, each node can adopt a neighbor discovery protocol
4.2 Strategy
Each player has two moves si: Cooperate (C) or Defect (D). By cooperating, a mobile node changes its
pseudonym.
4.3 Payoff Function
We model the payoff function of every node level of location privacy of node i at time t, whereas the cost
depends on the privacy loss function and the cost of
changing pseudonym at time t. If at least two nodes change pseudonyms, then each participating node
improves its location privacy for the cost of a pseudonym change. If a node is alone in changing its pseudonym, then
it still pays the cost and, in addition, its location privacy continues to decrease according to the location privacy loss
function. If a node defects, its location privacy continues to decrease according to its location privacy loss function.
Formally:
31
6. A Preserving Location Privacy of Mobile Network
4.4 Register with public key
Wireless communications are inherently dependent on geographic proximity: mobile devices detect each
other’s presence by periodically broadcasting beacon messages .A aims to track the location of mobile nodes. We
consider that A can have the same credentials as mobile nodes and is equipped to eaves drop communications. In the
worst case, a global adversary A obtains complete coverage and tracks nodes throughout the entire network, by
placing. For example, if a node decides to defect, then it continues broadcasting messages that can be observed by
other nodes in the mix zone. In other words, nodes participating in a mix zone can use defection as a signal to avoid
the cost of being silent. Any of these solutions can be used, but we consider the latter because it requires less
network resources.
VI.
CONCLUSION
The problem of rationality in location privacy schemes based on pseudonym changes. We Introduced a
user-centric model of location privacy to measure the evolution of location privacy over time and evaluated the
strategic behavior of mobile nodes with a game-theoretic model, the pseudonym change game. We analyzed the nplayer scenario with complete and incomplete Information and derived the equilibrium strategies for each node for
both static and dynamic games. The obtained equilibriums allow us to predict the strategy of rational mobile nodes
seeking to achieve location privacy in a non cooperative environment. This analysis results in the design of new
protocols, the Pseudo Game protocols, which coordinate pseudonym changes. An intriguing result is that when
uncertainty about others’ strategies is high (i.e., static games), rational nodes care more about the successful
unfolding of the game if the cost of pseudonyms is also high. cost, usually a negative parameter, can positively
affect the game by increasing the success of pseudonym change coordination. By means of simulations, we showed
that dynamic games dramatically increase the coordination success of pseudonym changes.
REFERNCES
[1].
[2].
[3].
[4].
[5].
[6].
1.G. Myles, A. Friday, and N. Davies, ―Preserving privacy in environments with location-based
applications,‖ IEEE Pervasive Computing, vol. 2, no. 1, pp. 56–64, Mar. 2003.
2. M. Gruteser and D. Grunwald, ―Anonymous usage of location-based services through spatial and
temporal cloaking,‖ in Proc. of ACM Int’l Conf. Mobile Systems, Applications, and Services (MobiSys),
San Francisco, CA, May 2003.
3.E. Schoch, F. Kargl, T. Leinmuller, S. Schlott, and P. Papadimitratos, Impact of pseudonym changes on
geographic routing in VANETs,‖ Lecture Notes in Computer Science (LNCS), vol. 4357, pp. 43–57, Mar.
2007.
4. E. Fonseca, A. Festag, R. Baldessari, and R. Aguiar, ―Support of anonymity in VANETs - Putting
pseudonymity into practice,‖ in Proc. Of IEEE WCNC, Hong Kong, China, Mar. 2007.
5.. M. Lei, X. Hong, and S. V. Vrbsky, ―Protecting location privacy with dynamic MAC address changing
in wireless networks,‖ in Proc. Of IEEE Globecom, Washington, DC, Nov. 2007.
6. M. Garlach and F. Guttler, ―Privacy in VANETs using changing pseudonyms - Ideal and real,‖ in Proc.
of IEEE VTC-Spring, Dublin, Ireland.
32