This document summarizes and reviews several techniques for secure clustering in vehicular ad hoc networks (VANETs). It first provides background on VANETs and discusses why secure clustering is important. It then reviews five specific secure clustering techniques that have been proposed: 1) using public key infrastructure for key management between cluster heads, 2) Shamir's secret sharing scheme for data authentication, 3) using threshold cryptography for decentralized certificate authorities, 4) establishing trust through physical/logical domain grouping, and 5) methods for secure message aggregation and using onion signatures. The document aims to provide a comprehensive understanding and comparison of these different secure clustering techniques to help guide further research.
Security Technique and Congestion Avoidance in Mesh Network
Security in wireless network is one of the prime concern in todays Information Age, where information is an asset not only to an organisation but also to an individual. Security to a great extent is able to protect the network from various unauthorized attacks. On the other side implementation of security mechanisms also causes an overhead in terms of increased load in the network. Further the increased load in the network paves path to congestion which degrades the performance of the wireless network. In this paper we try to highlight various challenges pertaining to security in mesh networks and the ways of reducing security threats. We propose an improved version of AODV which has a congestion avoidance mechanism. We also use a security technique called PGP for enhanced security of Mesh network. Mankiran Kaur | Jagjit Kaur"Security Technique and Congestion Avoidance in Mesh Network" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-6 , October 2017, URL: http://www.ijtsrd.com/papers/ijtsrd4690.pdf http://www.ijtsrd.com/engineering/computer-engineering/4690/security-technique-and-congestion-avoidance-in-mesh-network/mankiran-kaur
This document summarizes security issues in mobile ad hoc networks (MANETs). It discusses that MANETs rely on wireless communication, which is more vulnerable to security attacks than wired networks. Key characteristics of MANETs like lack of infrastructure, open connectivity, and dynamic topology make them susceptible targets. The document provides taxonomy of network attacks and analyzes attacks at different layers. It proposes solutions to address MANET security challenges according to criteria like availability, integrity, and confidentiality.
This document summarizes a research paper that classifies different types of networks and discusses their associated security issues. It categorizes networks based on size (LAN, MAN, WAN), design (peer-to-peer, client-server, standalone), layering (layered, non-layered), and provides examples such as Ethernet, Wi-Fi, VPNs. It also discusses common security threats for different network types like viruses, denial of service attacks, and evaluates security measures including encryption, firewalls, access control. The paper aims to provide a comprehensive classification of networks and analyze how security needs vary depending on the network and software development stages.
A DISTRIBUTED TRUST MANAGEMENT FRAMEWORK FOR DETECTING MALICIOUS PACKET DROPP...IJNSA Journal
In a multi-hop mobile ad hoc network (MANET) mobile nodes communicate with each other forming a cooperative radio network. Security remains a major challenge for these networks due to their features of open medium, dynamically changing topologies, reliance on cooperative algorithms, absence of centralized monitoring points, and lack of any clear lines of defense. Most of the currently existingsecurity algorithms designed for these networks are insecure, in efficient, and have low detection accuracy for nodes’ misbehaviour. In this paper, a new approach has been proposed to bring out the complementary relationship between key distribution and misbehaviour detection for developing an integrated security solution for MANETs. The redundancy of routing inform ation in ad hoc networks is utilized to develop a highly reliable protocol that works even in presence of transient network
partitioning and Byzantine failure of nodes. The proposed mechanism is fully co-operative, and thus it is more robust as the vulnerabilities of the election algorithms used for choosing the subset of nodes for cooperation are absent. Simulation results show the effectiveness of the proposed protocol.
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.
Security Technique and Congestion Avoidance in Mesh Networkijtsrd
Security in wireless network is one of the prime concern in todays Information Age, where information is an asset not only to an organisation but also to an individual. Security to a great extent is able to protect the network from various unauthorized attacks. On the other side implementation of security mechanisms also causes an overhead in terms of increased load in the network. Further the increased load in the network paves path to congestion which degrades the performance of the wireless network. In this paper we try to highlight various challenges pertaining to security in mesh networks and the ways of reducing security threats. We propose an improved version of AODV which has a congestion avoidance mechanism. We also use a security technique called PGP for enhanced security of Mesh network. Mankiran Kaur | Jagjit Kaur"Security Technique and Congestion Avoidance in Mesh Network" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-6 , October 2017, URL: http://www.ijtsrd.com/papers/ijtsrd4690.pdf http://www.ijtsrd.com/engineering/computer-engineering/4690/security-technique-and-congestion-avoidance-in-mesh-network/mankiran-kaur
This document summarizes security issues in mobile ad hoc networks (MANETs). It discusses that MANETs rely on wireless communication, which is more vulnerable to security attacks than wired networks. Key characteristics of MANETs like lack of infrastructure, open connectivity, and dynamic topology make them susceptible targets. The document provides taxonomy of network attacks and analyzes attacks at different layers. It proposes solutions to address MANET security challenges according to criteria like availability, integrity, and confidentiality.
A NEW GENERATION OF DRIVER ASSISTANCE AND SECURITYIJCI JOURNAL
Vehicular ad hoc networks are tremendously and very effectively used for safety related applications. Especially
for driver assistance and when it comes to safety of either from an accident or stealing of data VANET is the future of the all such problems.”A New Generation of Driver Assistance and Security” gives a idea about VANET and also provide solutions to various problems comes in this. Authentication will be provided by Group signature and Identity based (ID- based) Signature scheme. The scheme Provides cost effective, highly privacy
preserving of user, efficient message authentication and verification than existing system for VANETs. This
required CA (Central Authority) and LA (Local Authority) where LA is group leader and which has to concern with CA. This safety technique is efficient, robust, and scalable for VANET’s authentication and provide reallife solution match with the standard.
Security in MANET based on PKI using fuzzy functionIOSR Journals
This document discusses security issues in mobile ad hoc networks (MANETs) and proposes a security model based on public key infrastructure (PKI) using fuzzy logic. Specifically, it first provides background on MANETs and discusses their key characteristics and security challenges due to their dynamic topology and lack of infrastructure. It then introduces the concept of using PKI and asymmetric encryption with public/private key pairs to distribute session keys between nodes. The proposed algorithm uses fuzzy logic to determine the appropriate length of session keys based on discrimination of different attack types on the network. Experimental results show that the fuzzy-based security approach can enhance MANET security.
This document proposes a trust count based validation method to lessen internal attacks in mobile ad hoc networks. The key aspects of the proposed method are:
1. The network is divided into hierarchical clusters, each with a fully trusted cluster head.
2. Each node holds a certificate from an offline certificate authority that includes the node's access policy and expiration time.
3. A trust count is periodically calculated for each node based on its access policy evaluations.
4. Cluster heads renew or reject member nodes' certificates based on their trust count values, aiming to mitigate internal attacks like node capture attacks.
Co-operative Wireless Intrusion Detection System Using MIBs From SNMPIJNSA Journal
In emerging technology of Internet, security issues are becoming more challenging. In case of wired LAN it is somewhat in control, but in case of wireless networks due to exponential growth in attacks, it has made difficult to detect such security loopholes. Wireless network security is being addressed using firewalls, encryption techniques and wired IDS (Intrusion Detection System) methods. But the approaches which were used in wired network were not successful in producing effective results for wireless networks. It is so because of features of wireless network such as open medium, dynamic changing topology, cooperative algorithms, lack of centralized monitoring and management point, and lack of a clear line of defense etc. So, there is need for new approach which will efficiently detect intrusion in wireless network. Efficiency can be achieved by implementing distributive, co-operative based, multi-agent IDS. The proposed system supports all these three features. It includes mobile agents for intrusion detection which uses SNMP (Simple network Management Protocol) and MIB (Management Information Base) variables for mobile wireless networks.
This document discusses security issues with the Ad Hoc On-Demand Distance Vector (AODV) routing protocol for mobile ad hoc networks. It first provides background on AODV and security challenges in mobile ad hoc networks. It then analyzes specific attacks on AODV like traffic redirection, replay attacks, and loop formation. The document presents simulation results for a 5 node network that show that insecure AODV has good throughput but higher packet dropping and delay. It concludes that providing security for AODV is needed to address these issues.
Due to inherent limitations in wireless sensor networks, security is a crucial issue. While research in WSN security is progressing at tremendous pace, no comprehensive document lists the security issues and the threat models which pose unique threats to the wireless sensor networks. In this paper we have made an effort to document all the known security issues in wireless sensor networks and have provided the research direction towards countermeasures against the threats posed by these issues
This document proposes an optimized algorithm for securely integrating wireless sensor networks (WSNs) into enterprise information systems. It discusses the security requirements for WSNs, including data confidentiality, authenticity, integrity, availability, freshness, and robustness. It also analyzes threats to WSN security like spoofing, selective forwarding, sinkhole, Sybil, wormhole, and hello flood attacks. The document suggests using Internet of Things principles to authenticate sensor data senders independently of network location, improving security and efficiency.
A trust-based authentication framework for security of WPAN using network sli...IJECEIAES
This document proposes a lightweight trust-based authentication framework for security in wireless personal area networks (WPANs). The framework divides nodes into primary and secondary groups through network slicing. It calculates trust values for nodes based on direct, indirect, and integrated trust models. The trust values are used to authenticate nodes' requests to access WPAN resources. The framework aims to distinguish valid requests from untrustworthy nodes to enhance security while maintaining energy efficiency in WPANs.
An overview of contemporary security problems in wireless mesh networksiosrjce
Wireless mesh network (WMN) is a new wireless networking concept. Unlike traditional
wireless networks, Wireless Mesh Networks do not rely on any fixed communications. As an
alternative, hosts rely on each other to keep the network connected. Wireless Internet service
providers are choosing WMNs to offer Internet connectivity, as it allows a fast, simple and
inexpensive network use. One major challenge in design of these networks is their vulnerability to
security attacks. In this paper, principal contemporary security issues for wireless mesh networks
have been investigated. Identification of the threats a Wireless mesh network faces and the security
goals to be realized are described. The new challenges and opportunities posed by this new
networking environment are dealt with and explored approaches to secure its communication.
This document discusses security threats and attacks in wireless ad hoc networks. It begins by introducing ad hoc networks and some of the challenges in providing security in these networks due to their dynamic nature and lack of centralized authority. It then categorizes attacks as either passive or active, with passive attacks including eavesdropping and traffic analysis, and active attacks including masquerading, replay attacks, message modification, and denial-of-service attacks. The document reviews several security requirements and proposes hashing techniques as a potential solution to help secure routing protocols against various attacks. Specifically, it suggests using hash functions and hash chains to authenticate routing information and detect unauthorized modifications. The goal is to develop an efficient security approach that addresses issues like authentication, integrity
A novel approach for a secured intrusion detection system in maneteSAT Publishing House
This document proposes a novel intrusion detection system (IDS) for mobile ad hoc networks (MANETs) that promotes complete unlinkability and conceals packet contents to add privacy preservation. The proposed scheme uses a combination of group IDs and digital signatures for encrypted route discovery. This allows malicious nodes to be detected during route discovery and avoided for data transmission. Compared to existing approaches, the proposed scheme has lower end-to-end delay and improved packet delivery ratio.
2.espk external agent authentication and session key establishment using publ...EditorJST
Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications. Due to distributed and deployed in a un attend environment, these are vulnerable to numerous security threats. In this paper, describe the design and implementation of public-key-(PK)-based protocols that allow authentication and session key establishment between a sensor network and a third party. WSN have limitations on computational capacity, battery etc which provides scope for challenging problems. We fundamentally focused on the security issue of WSNs The proposed protocol is efficient and secure in compared to other public key based protocols in WSNs.
This document summarizes and evaluates techniques for identifying adversary attacks in wireless sensor networks. It begins by describing common types of attacks and issues with cryptographic identification methods. It then evaluates existing localization techniques like Received Signal Strength (RSS) and spatial correlation analysis. Specifically, it proposes the Generalized Model for Attack Detection (GMFAD) which uses Partitioning Around Medoids (PaM) clustering on RSS readings to detect multiple attackers. It also presents the Coherent Detection and Localization Model (CDAL-M) which integrates PaM with localization algorithms like RADAR and Bayesian networks to determine attacker locations. The document analyzes these techniques' effectiveness at detecting and localizing multiple adversary attackers in wireless sensor networks.
Ubiquitous computing aims to embed computers into everyday objects to make them invisible. It was envisioned by Mark Weiser as computers spreading into everything around us. Key aspects are devices interacting and coordinating without needing direct human interaction. Challenges include retrofitting environments for ubiquitous computing and ensuring impromptu interoperability and privacy between connected devices.
Ubiquitous computing is one of the most prodiously growing topic which will be covering all facets of life.In the course of ordinary activities, someone "using" ubiquitous computing engages many computational devices and systems simultaneously, and may not necessarily even be aware that they are doing so. This model is considered an advancement from the older desktop paradigm. More formally, ubiquitous computing is defined as "machines that fit the human environment instead of forcing humans to enter theirs".
ieee projects 2014-15 for cse with abstract and base paper vsanthosh05
Siddhi Soft Solutions is a software development company that offers customized business and software solutions. It has expertise in developing complex software solutions. The company aims to exceed client expectations with innovative IT services, applications, and support solutions delivered on time. Siddhi Soft is experienced in software and web application development, and builds long-term relationships with clients by ensuring high quality and customer service.
Ubiquitous computing (ubicomp) refers to computers integrated into everyday objects and activities. The goal is to create an environment where connectivity between devices is always available but unobtrusive. Examples of ubicomp devices include digital audio players, RFID tags, smartphones, and interactive whiteboards. Mark Weiser is considered the father of ubiquitous computing and coined the term in the 1980s.
The document discusses pervasive computing, which refers to microprocessors being embedded everywhere and computing being available anywhere. It is enabled by technologies like mobile internet access, wireless communication, and Bluetooth. Pervasive computing allows access from any device, on any network, with any data. It aims to spread intelligence and connectivity to more or less everything, from ships and aircrafts to coffee mugs and the human body. Some principles of pervasive computing include anytime/anywhere access, physical integration between computing nodes and the physical world, and instantaneous interoperation between devices. Examples of applications include smart clothing, interactive flexible posters, and pill cameras.
This document proposes a secure communication protocol (SCP) for ad hoc networks using clustering techniques and Kerberos authentication. Key points:
M = {Nid, Knch, CHid}
- The network is divided into clusters, each with a cluster head (CH) node responsible for authentication.
Is encrypted by using public key of new node
Kun and send to new node. The new node
decrypts the message and stores Nid, Knch, CHid
information. Now the new node is authenticated
node of that cluster. The CH updates its
database with new node information.
- CHs use Kerberos authentication to generate IDs and passwords for nodes to authenticate each
An Encryption Algorithm To Evaluate Performance Of V2v Communication In Vanetijcisjournal
1) The document discusses an encryption algorithm to evaluate the performance of vehicle-to-vehicle (V2V) communication in vehicular ad hoc networks (VANETs).
2) The algorithm uses private key encryption for V2V communication between two vehicles. The vehicles agree on random numbers and perform calculations to derive a shared secret key.
3) The performance of the encryption algorithm is evaluated using the QualNet network simulator.
Blockchain-Based Secure and Scalable Routing Mechanisms for VANETs ApplicationsIJCNCJournal
The VANET has seen a boom in the distribution of significant source data,enabling connected vehicle communications to enhance roadway safety.Despite the potential for interesting applications invehicle networks,thereare still unresolved issues that have the potential to hinder bandwidth utilization once deployed. Specifically, insider assaults on VANET platforms such as Blackhole attemptscan completely stop vehicle-to-vehicle communications and impair the networks' performance level. In this study, we provide the blockchain-based decentralized trust scoring architecture for the participants in the network to identify existing and blacklisted insider adversaries in VANET. To address this concern, we suggest a two-level detection technique, in the first level neighboring nodes determine theirtrustworthiness and in the second level it aggregates trust scores for vehicle nodes using a consortium blockchain-based mechanism that uses authorized Road Side Units (RSUs) as consensus mechanism. The blacklisted node records are then periodically changed based on the trust scores supplied by the nearby nodes. In regards to the practical scope of the network, the experimental study demonstrates that the suggested solution is effective and sustainable. To improve packet delivery ratio and vehicle node security in the VANET, the blockchain-based Trust-LEACH routing technique has also been created. The performance analysis has been carried out for Computational cost analysis, Computational time for block creation, Network analysis, SecurityAnalysis, and MITM attack analysis. Additionally, we provide proof that the suggested approach enhances VANET reliability by thwarting and removing insider threat initiation nodes from its blacklist.
BLOCKCHAIN-BASED SECURE AND SCALABLE ROUTING MECHANISMS FOR VANETS APPLICATIONSIJCNCJournal
The VANET has seen a boom in the distribution of significant source data,enabling connected vehicle
communications to enhance roadway safety.Despite the potential for interesting applications invehicle
networks,thereare still unresolved issues that have the potential to hinder bandwidth utilization once
deployed. Specifically, insider assaults on VANET platforms such as Blackhole attemptscan completely
stop vehicle-to-vehicle communications and impair the networks' performance level. In this study, we
provide the blockchain-based decentralized trust scoring architecture for the participants in the network to
identify existing and blacklisted insider adversaries in VANET. To address this concern, we suggest a twolevel detection technique, in the first level neighboring nodes determine theirtrustworthiness and in the
second level it aggregates trust scores for vehicle nodes using a consortium blockchain-based mechanism
that uses authorized Road Side Units (RSUs) as consensus mechanism. The blacklisted node records are
then periodically changed based on the trust scores supplied by the nearby nodes. In regards to the
practical scope of the network, the experimental study demonstrates that the suggested solution is effective
and sustainable. To improve packet delivery ratio and vehicle node security in the VANET, the blockchainbased Trust-LEACH routing technique has also been created. The performance analysis has been carried
out for Computational cost analysis, Computational time for block creation, Network analysis,
SecurityAnalysis, and MITM attack analysis. Additionally, we provide proof that the suggested approach
enhances VANET reliability by thwarting and removing insider threat initiation nodes from its blacklist.
MAR SECURITY: IMPROVED SECURITY MECHANISM FOR EMERGENCY MESSAGES OF VANET USI...IJCNCJournal
Vehicular Ad-hoc network (VANET) is one of the emerging technologies for research community to get various research challenges to construct secured framework for autonomous vehicular communication. The prime concern of this technology is to provide efficient data communication among registered vehicle nodes. The several research ideas are implemented practically to improve overall communication in VANETs by considering security and privacy as major aspects of VANETs. Several mechanisms have been implemented using cryptography algorithms and methodologies. However, these mechanisms provide a solution only for some restricted environments and to limited security threats. Hence, the proposed novel mechanism has been introduced, implemented and tested using key management technique. It provides secured network environment for VANET and its components. Later, this mechanism provides security for data packets of emergency messages using cryptography mechanism. Hence, the proposed novel mechanism is named Group Key Management & Cryptography Schemes (GKMC). The experimental analysis shows significant improvements in the network performance to provide security and privacy for emergency messages. This GKMC mechanism will help the VANET user’s to perform secured emergency message communication in network environment.
Optimizing On Demand Weight -Based Clustering Using Trust Model for Mobile Ad...ijasuc
Mobile ad hoc networks are growing in popularity due to the explosive growth of modern
devices with wireless capability such as laptop, mobile phones, PDA, etc., makes the application more
challenging. The mobile nodes are vulnerable to security attacks. To protect the ad hoc network it is
essential to evaluate the trust worthiness. The proposed TWCA is similar to WCA in terms of cluster
formation and cluster head election. However, in WCA security features are not included. The proposed
TWCA is a cluster based trust evaluation, in which the mobile nodes are grouped into clusters with one
cluster head. It establishes trust relationship for the cluster based on the previous transaction result. The
simulation result confirms the efficiency of our scheme than the WCA and SEMC.
Mobile adhoc networks eliminate the need for pre-existing infrastructure by relying on the
nodes to carry all network activities.
The mobile ad hoc networks are more prone to suffer from malicious behaviors than the
traditional wired networks. Therefore, there is a need to pay more attention to the security issues in
the mobile ad hoc networks. Clustered Manets is a very promising area of research due to its
infrastructure less capability. They have many advantages such as improved bandwidth, power
consumption and QoS of the network but one disadvantage is security. This paper has been prepared
keeping in mind that it needs to prove itself to be a valuable resource dealing with both the important
core and the specialized security issues in this area.
A secure trust-based protocol for hierarchical routing in wireless sensor ne...IJECEIAES
Wireless sensor networks (WSNs) became the backbone of the internet of things (IoT). IoT applications are vital and demand specific quality of service (QoS) requirements. In addition, security has become a primary concern to provide secure communication between wireless nodes, with additional challenges related to the node’s computational resources. Particular, the design of secure and resource efficient routing protocol is a critical issue in the current deployment of WSNs. Therefore, this paper proposes a novel secure-trust aware routing protocol (ST2A) that provides secure and reliable routing. The proposed protocol establishes communication routes based on calculated trust value in joint with a novel cluster head selection algorithm in the hierarchical routing process. The proposed trust-aware routing algorithm improves the routing security in WSN and optimizes many performance metrics related to WSNs unique characteristics. The results of simulation validate the feasibility of the proposed algorithm for enhancing the network lifetime up to 18% and data delivery by 17% as compared with some state-of-the-art routing algorithms.
This document discusses secure data aggregation in vehicular ad-hoc networks (VANETs). It proposes a scheme called Secure Dynamic Aggregation (SeDyA) that has three phases: 1) an aggregation phase where vehicles compute functions over data to generate aggregate values, 2) a finalization phase where vehicles verify messages and generate multisignatures for security, and 3) a dissemination phase where finalized messages are distributed to vehicles outside the aggregation area. The goal is to efficiently aggregate and securely share information like traffic speed and density while addressing security issues like Sybil, inflation, and impersonation attacks.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
Cluster Based Misbehaviour Detection and Authentication Using Threshold Crypt...CSCJournals
In mobile ad hoc networks, the misbehaving nodes can cause dysfunction in the network resulting in damage of other nodes. In order to establish secure communication with the group members of a network, use of a shared group key for confidentiality and authentication is required. Distributing the shares of secret group key to the group members securely is another challenging task in MANET. In this paper, we propose a Cluster Based Misbehavior Detection and Authentication scheme using threshold cryptography in MANET. For secure data transmission, when any node requests a certificate from a cluster head (CH), it utilizes a threshold cryptographic technique to issue the certificate to the requested node for authentication. The certificate of a node is renewed or rejected by CH, based on its trust counter value. An acknowledgement scheme is also included to detect and isolate the misbehaving nodes. By simulation results, we show that the proposed approach reduces the overhead.
A Wireless Sensor Network is a multiple collection of large number of sensor nodes. These sensor nodes are used to collect the information from the surroundings and pass it to the base station. Data Aggregation is an important technique to achieve power resource effectively in the sensor network. Because sensor node has limited battery power so data aggregation techniques have been proposed for WSN. The data from the multiple sensor nodes are aggregated is usually performed by averaging method. The aggregated data are stored into header aggregator node and it is highly susceptible to attacks. To address this security issue, Iterative Filtering algorithms are used to monitor sensor nodes and provide great promise by detecting vulnerable errors. For transferring aggregator data from aggregated node to base station, this paper introduces Cryptography and Random Key Generation technique. We use encryption technique for original message and simultaneously create a key for that encrypted message. That generated key and encrypted message will be sent to the receiver through the possible paths where the hackers cannot hack the original message.
https://www.ijmst.com/
IJMST Volume 1 Issue 1, Manuscript 4
As the popularity of mobile devices and wireless networks significantly increased over the
past years. The wireless adhoc network has now become one of the most vibrant and active
fields of communication and networking research. These networks are a new generation of
networks offering unrestricted mobility without any underlying infrastructure. As their
principle application is in disastrous environments, security is critical. Various challenges are
faced in the adhoc environment, mostly due to the resource poorness of these networks. One
man confront in the design of these networks is their vulnerability to security attacks. The
solutions for conventional networks are usually not sufficient to provide efficient adhoc
operations. Just because of its wireless nature of communication and lack of any security
infrastructure raise several security problems and threats.
In this paper, we briefly review the threats an adhoc network faces and the security goals to
be achieved. Moreover, it also presents existing security schemes used in wireless adhoc
networks in order to handle security threats.
Performance and Simulation Study of TheProposed Direct, Indirect Trust Distri...CSEIJJournal
In this paper, we propose a routing protocol that is based on securing the routing information from
unauthorized users. Even though routing protocols of this category are already proposed, they are not
efficient, in the sense that, they use the same kind of encryption algorithms (mostly high level) for every
Bit of routing information they pass from one intermediate node to another in the routing path. The
proposed mechanism is evaluated against selected alternative trust schemes, with the results showing that
our proposal achieves its goals.Our research aims at providing a secure and distributed
authentication service in the ad hoc networks.
For enhancing VANET security, an autonomic trust and reputation monitoring scheme is proposed which uses a trust based data transfer protocol based on reputation and plausibility checks. The proposed framework uses autonomic principles and trust monitoring scheme to provide uniform trust information throughout the network with minimum overhead. It aims to reduce the impact of double-face attacks by isolating selfish and malicious nodes. The scheme generates local and global trust tables to evaluate node trustworthiness and identify malicious nodes for isolation from the network.
Performance and Simulation Study of TheProposed Direct, Indirect Trust Distri...cseij
ABSTRACT
In this paper, we propose a routing protocol that is based on securing the routing information from
unauthorized users. Even though routing protocols of this category are already proposed, they are not
efficient, in the sense that, they use the same kind of encryption algorithms (mostly high level) for every
Bit of routing information they pass from one intermediate node to another in the routing path. The
proposed mechanism is evaluated against selected alternative trust schemes, with the results showing that
our proposal achieves its goals.Our research aims at providing a secure and distributed
authentication service in the ad hoc networks.
In our research work we are improving the performance of mobile ad hoc networks under jamming attack by using an integrated approach. The proposed work includes a network with high mobility, using IEEE Along g standard jamming attacks and countermeasures in wireless sensor networks
Data Transfer Security solution for Wireless Sensor NetworkEditor IJCATR
WSN is a wide growth area for specific resource limited application. Factor associated with technology like, the encryption
security, operating speed and power consumption for network. Here, we introduce a mechanism for secure transferring of data is WSN
and various security related issues. This energy-efficient encryption is a secure communication framework in which an algorithm is
used to encode the sensed data using like, RC5, AES and CAST Algorithm. The proposed scheme is most suitable for wireless sensor
networks that incorporate data centric routing protocols. An algorithm in sensor network is help to designers predict security
performance under a set of constraints for WSNs. This symmetric key function is used to guarantee secure communications between
in-network nodes and reliable operation cost. RC5 is good on the code point of view, but the key schedule consumes more resource
time for efficient security aspects.
IRJET- Detection and Prevention Methodology for Dos Attack in Mobile Ad-Hoc N...IRJET Journal
1) The document discusses detection and prevention of denial of service (DoS) attacks in mobile ad-hoc networks.
2) It focuses on identifying malicious nodes that conduct traffic jamming attacks by disrupting communication.
3) The proposed approach detects malicious nodes using a reliability value determined by broadcast reliability packets, where nodes that don't respond in a set time have their reliability value decreased until it reaches below zero, identifying them as malicious.
Similar to Paper_38-Secure_Clustering_in_Vehicular_Ad_Hoc_Networks (20)
1. (IJACSA) International Journal of Advanced Computer Science and Applications,
Vol. 6, No. 9, 2015
285 | P a g e
www.ijacsa.thesai.org
Secure Clustering in Vehicular Ad Hoc Networks
Zainab Nayyar
Department of Computer Software Engineering, College of
Electrical and Mechanical Engineering NUST, Islamabad
Pakistan
Dr. Muazzam Ali Khan Khattak
Department of Computer Software Engineering, College of
Electrical and Mechanical Engineering NUST, Islamabad
Pakistan
Dr. Nazar Abass Saqib
Department of Computer Software Engineering, College of
Electrical and Mechanical Engineering NUST, Islamabad
Pakistan
Nazish Rafique
Department of Computer Software Engineering, College of
Electrical and Mechanical Engineering NUST, Islamabad
Pakistan
Abstract—A vehicular Ad-hoc network is composed of
moving cars as nodes without any infrastructure. Nodes self-
organize to form a network over radio links. Security issues are
commonly observed in vehicular ad hoc networks; like
authentication and authorization issues. Secure Clustering plays
a significant role in VANETs. In recent years, various secure
clustering techniques with distinguishing feature have been
newly proposed. In order to provide a comprehensive
understanding of these techniques are designed for VANETs and
pave the way for the further research, a survey of the secure
clustering techniques is discussed in detail in this paper.
Qualitatively, as a result of highlighting various techniques of
secure clustering certain conclusions are drawn which will
enhance the availability and security of vehicular ad hoc
networks. Nodes present in the clusters will work more efficiently
and the message passing within the nodes will also get more
authenticated from the cluster heads.
Keywords—Vehicular ad hoc networks; secure clustering;
wireless technologies; certification authority; cluster heads
I. INTRODUCTION
With The growth of wireless communication technology,
two elementary wireless network models have been
established for the wireless communication system [1] [2].
The fixed infrastructure wireless model consists of a large
number of Mobile Nodes and relatively fewer, but more
powerful, fixed nodes. The communication between a fixed
node and a MN within its range occurs via the wireless
medium. However, this requires a fixed infrastructure.
Another system model, an Ad-hoc Network, it is a self-
organizing collection of Mobile Nodes that form an
infrastructure less wireless network on a shared wireless
channel. Nodes which lie in the range of each other can easily
communicate, while those which are far apart from each other
communicate over the routers. Their deploying cost is
relatively low as compared to other wireless networks because
there is no necessity of a proper fixed infrastructure. Security
is an important issue which is faced while deploying the ad
hoc networks; the security issues under consideration are
availability, confidentiality, integrity, authentication and non-
repudiation [3] [4]. Availability refers that the system must
survive in critical conditions such as denial of service and
worm attacks. The attackers also try to create hindrance in the
communication between the nodes and also try to interrupt the
routing protocols. Confidentiality is the secret information
requires safety so it cannot be disclosed to the unauthorized
users. Integrity is that data should not be corrupted and the
original information should remain original. Authentication is
achieved by not to permitting those entities within the network
which can harm the network and only register the trusted
entities. In non-repudiation the source of the data should be
safe and secure [6]. The concept of Vehicular Ad Hoc
networks is derived from mobile ad hoc networks. The reason
for deploying vehicular ad hoc networks was that over the
years many motor accidents were observed leading to critical
injuries, fatalities, and excessive cost on vehicle repairs. Since
a proper solution was not efficiently worked out, therefore just
like Mobile Ad Hoc Networks (MANETS); Vehicular Ad Hoc
Networks (VANETS) were introduced in the cars for the sake
of additional safety and comfort for vehicle drivers [2].
A VANET turns every participating car into a wireless
router or node, allowing cars approximately 100 to 300
meters of each other to connect and, in turn, create a network
with a wide range [5]. There are two main types of
communications discussed under the section of VANETs:
Vehicle to Vehicle communication (V2V) and Vehicle to
Infrastructure communication (V2I). The former protocol is
necessary to be applied on the vehicles for proper
communication, Road safety and collision avoidance which
are necessary for avoiding accidents. The later includes the
provisioning of safety related, real time, local and situation
based services such as speed limit information, safe distance
and warning, lane keeping support, intersection safety, traffic
jam warning and accident warning. All accidents are aimed to
be saved by providing timely information related to the safety
of cars and drivers [9].
Clustering means that different nodes in the system act as a
whole system, securing a cluster means that to apply such
protocols and actions on the clusters that it is not exposed to
any attacker, malware etc. Securing actually belongs to the
robustness of the system to certain attacks. The other issue due
to which secure clustering is necessary is when there is a time
of collecting and aggregating data from the nodes. At that time
there are more chances of attacks for accessing the data by the
attackers. Due to this reason secure clustering protocols are
2. (IJACSA) International Journal of Advanced Computer Science and Applications,
Vol. 6, No. 9, 2015
286 | P a g e
www.ijacsa.thesai.org
used for preventing and securing the clusters from various
attacks [10].
In secure clustering there are symmetric as well as
asymmetric algorithms used. In a symmetric algorithm there is
often a shared key whereas in an asymmetric algorithm there
is a requirement of secure mapping of public keys with the
user’s identities using public key infrastructure. PKI is often
used in certification authority where a digitally signed
certificate is issued to every registered user so that they can
get their public key [11].
This paper gives the state-of-the-art review of typical
secure clustering techniques for vehicular ad hoc networks. It
is impossible to say which technique is better for a given
condition. Hence, the motivation is to compare these strategies
this paper includes new technical trends such as public key
infrastructure, Shamir secret key algorithm, dynamic
demilitarized zone etc. The rest of the paper comprises of II
literature review, III comparative analysis, IV conclusion and
future work and V references.
II. LITRATURE REVIEW
A. Key Management in Ad hoc Networks
In [5] key management in ad hoc networks was addressed,
where in ad hoc networks the old methods to achieve security
were not adaptable. Due to these factors key management was
very difficult in ad hoc networks. In key management
technique the public key infrastructure used a centralized
approach in similar clusters and a distributed key was used
between the cluster heads. It resulted in suitable, economical,
scalable and autonomous key management.
B. Shamir’s Secret Scheme
It is observed in [6] that in ad hoc networks it was easy to
launch worm, man in the middle, denial of service attacks and
to inoculate a malicious node, this was all done due to the lack
of data integrity. The Shamir’s secret scheme along with data
redundancy mechanism of certificate revocation and renewal
was applied. It was a hop by hop protocol. On every hop the
data got authentication from certificate authority. Each node
had the authority of checking the behavior of its previous node
and on the basis of that behavior it could declare that node as
malicious or trustworthy. The detection of malicious node
became easy. During packet delivery less overhead and delay
occurred.
C. Threshold Cryptography
In the [11] architecture was proposed for securing the
clusters in ad hoc networks. A network was divided into
clusters and a decentralized certification of authority was
implemented. Decentralization was achieved using threshold
cryptography and a network secret. The reason for deploying
decentralized approach of distributing a certification authority
on the nodes was that the ad hoc entities were vulnerable to
several attacks and their reachability was not possible for all
the nodes of the network. In the intra cluster security
asymmetric key distribution was used. These keys used to
protect all the traffic nodes. The attackers could not break the
secrets even if they got some data it was of no use to them.
Scalability and availability was achieved by dividing the
network into small clusters. Availability was enhanced
because certificates can be issued even if some nodes were out
of reach. The asymmetric key distribution was useful in a way
that there were no other means needed to secure the
communication.
D. Trust Based Physical Logical Domains
The aim of [12] was to achieve trust on the basis of keys in
mobile ad hoc networks. The trust based physical logical
domains was introduced for grouping nodes and getting
distributed control over the network.
E. Secure Message Aggregation & Onion Signature
In [13] two methods were introduced – first was the
approach of secure message aggregation, and second was
onion signature which was declared as a part of onion routing.
The highlighted problem was that asymmetric solutions were
resource hungry in the case of communication and
computation. The accuracy in aggregation of vehicles depends
upon the density of vehicles, the higher the density the greater
the accurate aggregation. The grouping of vehicles was set
geographically normally the range set is 300m. When the
vehicle (leader) moves out of range, the election procedure
takes place and the vehicle having lowest ID is declared as a
leader. For security purposes the IDs which vehicles generate
were not their actual IDs instead they were pseudonyms.
Grouping of several messages provide the receiver with more
information regarding the specified event. Simplicity and
robustness was achieved by dividing the roads into cells.
Using PKI and digital signatures authentication was achieved.
Reduction in the network traffic due to aggregation of
messages and achieved availability. Efficiency and routing
benefits are achieved due to election of leaders. Data
verification is escaped due to the aggregation of messages.
The division of roads into cells can cause an overhead and
thus this aspect needs to be improved. Due to aggregation
false data can be inserted by the attackers into the network that
is why only honest nodes could apply this algorithm.
Combining signatures could create security overhead and
delay.
F. Secure Clustering Algorithm
Mobile ad hoc networks are increasing in size day by day
so in [14] a problem aroused in which due to the growth of
nodes in number it became difficult to handle them. So a
secure method was to divide the nodes in an hierarchal way
which was known as secure clustering algorithm that provided
more effectiveness, protection and trust in increasing the size
of the cluster. It also defined how much a node could be
trusted and by allocating certificates protecting the nodes from
certain attacks. The algorithms which were previously defined
for managing clusters were not helpful for managing big
clusters. Secure clustering algorithms proposed a weight based
algorithm which includes the certain parameters for electing
the algorithm.
G. Position Based Prioritized Clustering
In [15] due to rapid change in the positions of cars during
long journeys, change of direction and network topologies
some information may be lost. So for solving that issue,
position based prioritized clustering was implemented and for
3. (IJACSA) International Journal of Advanced Computer Science and Applications,
Vol. 6, No. 9, 2015
287 | P a g e
www.ijacsa.thesai.org
that CORSIM and NS-2 simulators were used. The radius
regarding each cluster was taken under consideration as any
node could be a part of the cluster until it gets out of the range
of radio frequency. So if the radius of any node considers
being the greater than the specified radius than that vehicle
was no more than the part of that cluster. If the threshold
between two clusters was less than that which was set, then
the cluster with lesser nodes became a part of another cluster.
The MDS election algorithm is followed in which the election
of cluster heads is defined; this algorithm was the solution of
the problem which was created due to the presence of many
cluster heads formation which was caused due to other cluster
head election algorithms. Using MDS technique stability in
the performance of cluster heads was increased. Position
based prioritized clustering was helpful in decreasing the
cluster overheads.
H. Fully Distributed Trust Based Model
In [16] the problem identified was the creation of the
trusted environment by applying the techniques applied on
fixed networks security and trust could not be achieved
therefore a fully distributed trust based model was proposed in
which ad hoc networks generate and distribute a public key
without any fixed mode of transmission. A threshold was also
included in the public model so that the malicious nodes
cannot get the authorized key from the certification authority.
I. Dynamic Demilitarized Zone Technique
In [17] the problem identified was that many anonymous
nodes sometimes become successful in getting signed
certificates, so the dynamic demilitarized zone technique was
introduced in which the unknown nodes were not authorized
to communicate with the certificate authority nodes. All the
nodes have to pass through the dynamic demilitarized zone to
request the certificate from the certificate authority node.
There were multiple certificate authorities involved in that
algorithm each of which was responsible for its own
geographical area. The road side units were also combined
with the central certificate authorities who worked as an
intermediate between the central certificate authorities and
dynamic certification authorities on the road. Along with
dynamic certification registration authorities and sub cluster
heads were also involved in this mechanism. Reference [21]
was the extension of [17] as in [17] the issue was detected
during the election of certification authorities in which denial
of service was occurring. The issue was solved in [21] using
VANET dynamic demilitarized zone that would handle the
certificate request from the unknown vehicles and prohibit
malicious communication between certification authority and
nodes. Its additional feature was that each vehicle which was
at 1-hop from other vehicles sent hello messages, as result the
nodes which received that message saved the each and every
record of the vehicle and thus response with a joint message to
that node. Detection of malicious nodes became more
efficient. Confidentiality increased, overhead decreased.
Shifting from one cluster to another enhanced due to the
presence of sub cluster heads. It removed the issues of denial
of services.
J. Distributed Algorithm:
In the [18] the distributed algorithm was used in the
protocol for the security and formation of the cluster, the
system also checked that if the claimed data was reliable and
authentic. The cost delivery protocol, cluster head designation
protocol and cluster management protocol are used for cluster
formation. It provided the reliability and authenticity of data.
The biggest risk of deploying this technique is that according
to the supposition all the data is considered to be correct and
authenticated.
K. Vehicular Clustering Based On Weighted Clustering
Technique:
In [19] three suitable scenarios that are mainly for highway
traffic were discussed. The first was that was used for
choosing the cluster heads giving different parameters which
could improve stability, connectivity and security of
VANETS. The second technique was the Adapter allocation
of transmission range which used hello messages and ensured
connectivity among the vehicles. The third scenario was
Monitoring of malicious vehicles to detect abnormal vehicles
in the system. The re-affiliation issue in which the swapping
of clusters occurred caused the great overhead, so this problem
was also resolved by reducing the swapping of clusters. In
[22] secure and stable vehicular clustering based on weighted
clustering algorithm was proposed in which secure and stable
cluster formation along with malicious node detection was
done. The issue which was resolved due to its deployment was
that if a cluster was very large then the Cluster head could not
deliver the messages efficiently and if it was very small then
the clusters may not be stable and thus re-affiliation took
place. Secure and stable vehicular clustering based on
weighted clustering algorithm worked on cluster creation and
cluster maintenance. Communication cost for joining the
cluster increased. It provided better ways of creating and
maintaining clusters.
L. Virtual Forces Virtual Clustering:
The algorithm which was mentioned in [20] was virtual
forces virtual clustering which was used to create stable
clusters in an urban environment. Virtual clustering virtual
forces not only took care of current positions but future
positions also and their relative velocities also but only for
those vehicles which keep their lane.
III. COMPARATIVE ANALYSIS
In [5] clustering consisted of grouping of nodes whereas
every cluster had a cluster head. The proposed solution i.e key
management in ad hoc networks split the nodes into groups
known as clusters. It used a threshold scheme to distribute the
key in the cluster to achieve security of the cluster, and
protection of the key against denial of service attacks. By
applying this technique not only the certificates for the cluster
heads are generated but also the nodes can join the new cluster
heads by getting certificates from them. Inter and intra cluster
authentication, integrity, confidentiality and non repudiation
were achieved.
The aim of [6] was to achieve data integrity using three
components which were monitoring routing cum forwarding,
certificate renewal and certificate revocation. The routing cum
forwarding scheme detected the problems with the routing
4. (IJACSA) International Journal of Advanced Computer Science and Applications,
Vol. 6, No. 9, 2015
288 | P a g e
www.ijacsa.thesai.org
protocols and data; whereas, certificate renewal method by
sending more than one shared key to the node guarantees the
presence of original nodes in the network. Certificate
revocation assured the removal of malicious nodes from the
network. The certificate authority while approving certificates
to the nodes mentions the node ID, initiation time and expiry
time. These approaches altogether deployed in Shamir’s
Secret Sharing Model. Thus the integrity of data is achieved.
The problem highlighted in [11] due to the usage of
centralized certification authority was solved by using
decentralized scheme and thus a secret sharing scheme known
as proactive secret sharing is used in ad hoc networks. In this
technique secret keys changed periodically without changing
the secrets, so it is difficult for the attacker to break the secret
keys. A clustering technique was also mentioned in which all
the nodes (cars) were divided into small clusters there were
cluster heads and gateways. Gateways were also cluster heads
but they were helpful in communicating between different
clusters, where as cluster heads were only responsible of
maintaining communication among the nodes of the cluster.
Cluster Heads had information regarding the different nodes
and their actions within the clusters where as Gateways also
had information of other clusters too. To make clustering
secure a private key was distributed among all the cluster
heads by the certification authority and from cluster heads a
public key was distributed among the nodes of the cluster. If a
node found no cluster to be attached with it, it declares itself
as a cluster. There was an inter network communication which
is between different clusters and intra network communication
which was among the network. In an intra network, an
asymmetric communication is observed at cluster heads level
but symmetric level communication was held between nodes
of a cluster for making communication smoother and better.
Apart from these the ways of merging the clusters, logging on
of the nodes and routing strategies are also discussed. The
advantages which were observed in this method were that the
merging techniques of clusters were elaborated in a cost
effective way. Secondly availability was enhanced because
certificates could be issued even if some nodes were out of
reach. The security infrastructure was more resistant to the
intruders so integrity was achieved.
In [12] the author derived the trust formalization from
watch dog and path rater used for grouping the nodes in ad
hoc networks. In the evaluation of trust model the approaches
used were namely, optimistic or greedy approach, simple
average weighted products, weighted average and double
weighted approach.
In [13] the resource hungry solutions of cryptography were
eliminated by introducing the concept of secure message
aggregation and onion signature. The technique for the
symmetric group key distribution was secure VANETs Group
Protocol. In this technique roads were divided into cells
having a leader which distributes a public key to the nodes.
The basic advantage of this was simplicity and robustness but
the overhead that was produced left the large space for
improvement. The grouping of vehicles was set
geographically normally the range set was 300m when the
vehicle (leader) moved out of the range, the election took
place in the vehicle having lowest ID was declared as a leader,
for the security purposes the IDs which vehicles generate were
not their actual IDs instead they were pseudonyms. In the
secure message aggregation technique several sort of signature
methodologies were observed which includes combine
signatures, concatenate signatures, onion signatures and
hybrid signatures. In combine signatures to save time of data
verification and cheated messages, the entire distributed
signature from the group were combined to check the validity
of the message and then sent to the group so that the
combining of signatures was evidence that the message was
verified and correct. In concatenated signatures a vehicle that
received a correct message appended its signature with the
already existing signatures and rebroadcasted the message.
The message was then distributed over the group with the
appended new signature with the already existing signature of
each node that also eliminated data verification but could
cause overhead. Another difficulty was to reduce the size of
signature as the signature size was considered as constant.
Therefore, the Onion signature strategy was deployed in
which the vehicle only kept the signature of the last one which
sent a message and on the next hop sent the message with its
signature so the new vehicle which would receive its message
would overwrite the message signature with its own and the
process continued.
In [14] the basic parameters which were derived for
deploying secure clustering algorithm were max value, min
value, d-hop clusters, identity ID and weight these parameters
were also involved in the election criteria. To elect the cluster
heads several criteria were defined in secure clustering
algorithm such as trust value in which it was analyzed how
much any node could be trusted by its neighbors. Degree was
another criteria which was defined in terms of specified
radius, it was checked that whether a node with in a given
radius servers maximum nodes or not. In battery power it was
observed that for how much time a node could serve and the
max value determined the cluster head which could handle
more neighbors. Stability was decided on the basis of distance
and average distance, distance between the two nodes tell the
hops between the nodes and average distance checked the
mean distance so by checking these parameters the most stable
node as cluster head could be decided. Clusters heads
regularly sent beacons to the nodes where the structure of
beacon composed of cluster head certificate and the command
which was assigned to the node by the cluster head. The
election algorithm invoked when the nodes of a cluster needed
to maintain their architecture so it required several stages such
as discovery stage for selecting a node to participate in the
election algorithm and the computed weight on the basis of
which the node could be selected as a cluster head.
In the position based prioritized scheme [15], each node
and cluster head was assigned a unique ID, node geographical
location, and the ID of next node to whom it would
communicate and the priority number of the node. So in that
way a stable cluster structure came to its existence. If a cluster
got out of the radio frequency area, it could join the new
cluster on the basis of the attributes given to it. A special
cluster head election algorithm was designed which told about
the selection of new cluster heads under different situations. In
MDS clustering algorithm the node which had a longer trip or
5. (IJACSA) International Journal of Advanced Computer Science and Applications,
Vol. 6, No. 9, 2015
289 | P a g e
www.ijacsa.thesai.org
remained in travel longer could be declared as the cluster
heads and that vehicle assigned the higher priority. To avoid
the cluster heads loosing connectivity the cluster head had the
authority to work as the cluster head until its velocity
remained within the average speed otherwise the cluster would
again calculate the priorities and chose a new cluster head.
In [16] a fully distributed public secret sharing key trusted
model was applied which aimed to maintain a trust
relationship in mobile ad hoc networks and prevented the
network from the authorization of a malicious nodes without
the involvement of any third party. For achieving the objective
threshold cryptography was also included in the network. This
technique generally included four basic operations namely
initialization phase, joining the system, partial certificates
creation and exchange and public key authentication. In the
initialization phase the nodes get initialized with the inclusion
of threshold cryptography. In the joining phase each node
could enter or leave the system without any restriction. In the
certification creation and exchange a private and public key
was issued to the user if the public key belonged to the user,
the user signed a certificate. In the public key authentication
phase when the nodes needed to authenticate a public key of
another node they merged their partial trust graphs according
to the trust model.
In [17] dynamic demilitarized zone technique was a one
hop from the certificate authority. Its goal was to register only
known and trusted nodes whereas all the other nodes which
were unknown and untrusted nodes would not be registered.
So all the nodes which wanted to get registered would pass
from dynamic demilitarized zone. All the trusted nodes would
maintain a trust table in which the record of each trusted node
would be maintained along with its public key. There were
multiple certificate authorities involved in this algorithm each
of which was responsible for its own geographical area. The
road side units were also combined with the central
certification authorities that worked as an intermediate
between the central certification authorities and dynamic
certification authority on the road. There was a trust matrix
defined in which for untrusted node the value of Tm=0.1 and
for trusted node = 1. Registration Authority was responsible to
act as a Dynamic demilitarized zone as it checked the level of
trust of each node and then moved that node to get signed
certificate. A Sub cluster head was responsible to create
communication between many clusters. If a node left a cluster,
the Sub cluster head was responsible for adding that node into
another cluster on the basis of its trust level. In [21] a concept
of dynamic key distribution was observed in which there were
multiple central certificate authorities present at their
respective geographical areas and an asymmetric key
distribution algorithm was used. All the vehicles had to pass
from VANET dynamic demilitarized zone to request a
certificate from a certificate authority. Its additional feature
was that each vehicle which was at 1-hop from other vehicles
sent hello messages as result the nodes which received this
message saved each and every record of the vehicle and thus
respond with a joint message to that node. Hello messages
were also used during election algorithm.
In [18] there was a global Certificate authority and a local
Certificate authority. The global Certificate authority was
responsible for issuing certificates if different clusters wanted
to communicate with each other whereas local Certificate
authority was responsible for issuing certificates with in the
cluster for proper communication. They used symmetric key
distribution algorithm along with many protocols such as
cluster management protocol, cluster head designation
protocol and cost delivery protocol. However, the biggest risk
of deploying this technique was that according to this
supposition all the data was considered to be correct and
authenticated.
In [19] three algorithms were introduced; the first one was
the vehicular clustering based on weighted clustering. Some
parameters were needed to be set while deploying this
technique. Td was set as distrust value and sigma was the
threshold. Two lists were maintained by the vehicles if the Td
value of the vehicles was less than the threshold then they
were maintained in the white list and if Td value was greater
than they were sent in black list. The copy of black list was
sent to all the nodes and clusters that came under the area of
particular Certificate authority. For each vehicle setting itself
as a cluster head sent its user name and ID to all the nodes. On
the basis of certain criteria the node could declare itself as a
Cluster head. The criteria could be decided by performing five
steps mentioned in [19]. Another algorithm was the adaptive
allocation of transmission range algorithm which catered to
the problem where sometimes messages cannot transfer to
their neighbors on time due to topology changes or variable
frequency. Thus through the application of this algorithm, the
vehicles could find their neighbors dynamically. This
algorithm also involved three steps mentioned in [22].
The
third and last algorithm was monitoring of malicious vehicles.
This algorithm would simply monitor the abnormal vehicle
and cater out its abnormality factor. The algorithm mentioned
in [22] named as Secure and stable vehicular clustering based
on weighted clustering algorithm was similar to that
mentioned in [19]. But the issue which was resolved due to its
deployment was that if a cluster is very large then the Cluster
head could not deliver the messages efficiently and if it was
very small then the clusters might not be stable and thus re-
affiliation took place. Secure and stable vehicular clustering
based on weighted clustering algorithm worked on cluster
creation and cluster maintenance.
The Virtual clustering vehicle forces [20] applied
Coulomb’s law to assign the virtual forces to the network;
vehicles were considered as charged particles, and force was
applied on the vehicles which needed to be communicating on
the basis of relative velocity and distances. When vehicles
moved away from each other, they gave negative force and
vice versa. ―Frel=k qiqj/r2
ij”, the charge of every vehicle was
proportional to many parameters of that vehicle. ‘r’ was the
distance, qi qj are the vehicles at certain directions and k
depends on the factors present in the equation.
Table 1 mentioned below shows the brief comparison of
the related works and comparative analysis.
6. (IJACSA) International Journal of Advanced Computer Science and Applications,
Vol. 6, No. 9, 2015
290 | P a g e
www.ijacsa.thesai.org
TABLE I. COMPARATIVE ANALYSIS OF VANET TECHNIQUES
IV. CONCLUSION & FUTURE WORK
A. Conclusion
In summary, secure clustering can efficiently support a
wide variety of applications that are characterized by a close
degree of collaboration, typical for many VANETs. And the
design of the secure clustering algorithms are driven by
specific goals and requirements based on respective
assumptions about the network properties or application areas.
In this paper, I present a comprehensive survey of the secure
clustering techniques for VANETs. The purpose of this paper
is to survey the secure clustering techniques and study their
primary principles. I discuss the characteristics, security
properties of each of these clusters selected from the class of
similar approaches, which can reflect the state of- the-art
research work on secure clustering techniques. The
classifications of the primary secure clustering principles can
simplify the task of a network designer in deciding the
clustering strategies to be adopted at a given condition. Then, I
believe my survey will be very useful to the research
community and also serve as a great introductory material for
someone embarking on VANETs.
B. Future Proposition
As mentioned earlier, research in the area of secure
clustering algorithms over VANETs is far from
comprehensive. Much of the effort so far has been on devising
secure clustering techniques to support effective and efficient
communication between nodes that are part of a same group.
However, there are still many topics that deserve related to
security while clustering the VANETs.
REFERENCES
[1] Christian Lochert, Hannes Hartenstein, Jing Tian, Holger Füßler,
Dagmar Hermann and Martin Mauve: A Routing Strategy for Vehicular
Ad Hoc Networks in City Environments Traffic Assistance Systems,
Intelligent Vehicles Symposium, 2003, Proceedings. IEEE, pages 156 –
161, 2003
[2] Syed R. Rizvi, Stephan Olariu, Cristina M. Pinotti, Shaharuddin Salleh,
Mona E. Rizvi and Zainab Zaidi: Vehicular Ad Hoc Networks,
International Journal of Vehicular Technology, Volume 2011, 2 pages,
2011
[3] Lidong Zhou, Zygmunt J. Haas and Cornell: Securing Ad Hoc
Networks, Network, IEEE, Volume 13, pages 24 – 30, 1999
R. No Technique Availability Confidentiality Integrity Non repudiation Authentication
[7]
Public key
Infrastructure &
threshold
cryptography
Decrease Increase Increase Increase Increase
[8]
Shamir’s secret
scheme
Increase Medium Increase Increase Increase
[13]
Proactive Secret
sharing
Increase Increase Increase Medium Increase
[14] Trust based model Decrease Medium Medium Increase Increase
[15]
Secure VANET
group protocol
Decrease Medium Increase Increase Increase
[16]
Secure clustering
algorithm
Increase Medium Medium Increase Medium
[17]
Position based
prioritized
clustering, MDS
Increase Decrease Decrease Decrease Decrease
[18]
Fully distributed
trust based model
Decrease Medium Medium Increase Increase
[19]
Dynamic
demilitarized zone
Decrease Medium Medium Increase Increase
[20]
Distribution
algorithm
Decrease Medium Increase Medium Increase
[21]
Vehicular clustering
based on weighted
clustering
Increase Increase Decrease Increase Increase
[22] Coulomb’s Law Increase Decrease Decrease Decrease Decrease
[23]
VANET dynamic
demilitarized zone
Increase Increase Medium Medium Increase
[24]
Secure and stable
vehicular clustering
based on weighted
clustering algorithm
Increase Medium Medium Medium Increase
7. (IJACSA) International Journal of Advanced Computer Science and Applications,
Vol. 6, No. 9, 2015
291 | P a g e
www.ijacsa.thesai.org
[4] Drs. Baruch Awerbuch and Amitabh Mishra: Introduction to Ad hoc
Networks, CS-647: Advanced Topics in Wireless Networks, 2008
[5] Mohamed Elhoucine Elhdhili, Lamia Ben Azzouz and Farouk Kamoun:
A Totally Distributed Cluster Based Key Management Model for Ad
hoc Networks
[6] Rajaram Ayyasamy and Palaniswami Subramani: An Enhanced
Distributed Certificate Authority Scheme for Authentication in Mobile
Ad-hoc Networks, The International Arab Journal of Information
Technology, Volume 9, pages 291-298, 2012
[7] Xue Yang, Jie Liu, Feng Zhao and Nitin H. Vaidya: A Vehicle-to-
Vehicle Communication Protocol for Cooperative Collision Warning.
Mobile and Ubiquitous Systems: Networking and Services, 2004,
MOBIQUITOUS 2004, The First Annual International Conference,
pages 114 – 123, 2004
[8] Marc Torrent-Moreno, Jens Mittag, Paolo Santi, and Hannes
Hartenstein: Vehicle-to-Vehicle Communication FairTransmit Power
Control, Vehicular Technology, IEEE Transactions, Volume:58, pages
3684 – 3703, 2009
[9] Pavle Belanovi´c, Danilo Valerio, Alexander Paier, Thomas Zemen, ,
Fabio Ricciato and Christoph Mecklenbr¨auker: On Wireless Links for
Vehicle-to-Infrastructure Communications, Vehicular Technology, IEEE
Transactions, Volume 59, pages 269 – 282, 2010
[10] Sanaz Sadeghi and Behrouz Sadeghi: Designing Secure Clustering
Protocol With The Approach Of Reducing Energy Consumption In
Wireless Sensor Networks, The International Journal of Computer
Networks & Communications (IJCNC), Volume 5, 2013
[11] M. Bechler, H.-J. Hofi, D. Kraftt, E Pmket and L. Wolf: A Cluster-
Based Security Architecture for Ad Hoc Networks, Twenty-third
AnnualJoint Conference of the IEEE Computer and Communications
Societies, Volume 4, pages 2393 – 2403, 2004
[12] Mohit Virendra, Murtuza Jadliwala, Madhusudhanan Chandrasekaran
and Shambhu Upadhyaya: Quantifying Trust in Mobile Ad-Hoc
Networks, Integration of Knowledge Intensive Multi-Agent Systems,
2005, International Conference, pages 65-70, 2005
[13] Maxim Raya, Adel Aziz and Jean-Pierre: Efficient Secure Aggregation
in VANETs, Proceedings of the 3rd international workshop on
Vehicular ad hoc networks, Pages 67-75, 2006
[14] B. Kadri, A. M’hamed, M. Feham: Secured Clustering Algorithm for
Mobile Ad Hoc Networks, IJCSNS International Journal of Computer
Science and Network Security, volume 7, pages 27-34, 2007
[15] Zhigang Wang, Lichuan Liu, MengChu Zhou and Nirwan Ansari: A
Position-Based Clustering Technique for Ad Hoc Intervehicle
Communication, Systems, Man, and Cybernetics, Part C: Applications
and Reviews, IEEE Transactions, Volume 38, pages 201 – 208, 2008
[16] Mawloud Omar, Yacine Challal, and Abdelmadjid Bouabdallah: Fully
Distributed Trust Model based on Trust Graph for Mobile Ad hoc
Networks, Published in Computers & Security, 2009
[17] Tahani Gazdar, Abdelfettah Belghith and Abderrahim Benslimane: A
cluster based secure architecture for vehicular ad hoc networks,
Computer Systems and Applications (AICCSA), 2010 IEEE/ACS
International Conference, pages 1 – 8, 2010
[18] Helena Rifà-Pous, Jordi Herrera-Joancomartí: A Fair and Secure
Cluster Formation Process for Ad Hoc Networks, Journal Wireless
Personal Communications, volume 56, pages 625-636, 2011
[19] Ameneh Daeinabi, Akbar Ghaffar Pour Rahbar and Ahmad
Khademzadeh: VWCA: An efficient clustering algorithm in vehicular ad
hoc networks, Journal of Network and Computer Applications, Volume
34, Pages 207–222, 2011
[20] Leandros A. Maglaras: Clustering in Urban environments, Virtual forces
applied to vehicles. Communications Workshops (ICC), 2013 IEEE
International Conference, pages 484 – 488, 2013
[21] Tahani Gazdar, Abderrahim Benslimane, Abdelfettah Belghith and
Abderrezak Rachedi: A secure cluster-based architecture for certificates
management in vehicular networks, 2013.
[22] Ankit Temurnikar, Dr.Sanjeev Sharma and RGPV Bhopal: Secure and
Stable VANET Architecture, Journal IJCSN publisher, volume 2, pages
37-43, 2013.