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.
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
PERFORMANCE ANALYSIS OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
PERFORMANCE ANALYSIS OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
Reducing Packet Transmission Delay in Vehicular Ad Hoc Networks using Edge No...CSCJournals
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a greedy position based routing approach to forward packets to the node present in the edge of the limited transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that end to end delay in packet transmission is minimized considerably compared to current routing protocols of VANET.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
Performance evaluation of interference aware topology power and flow control ...IJECEIAES
Multi-Radio Multi-Channel Wireless Mesh Network (MRMC-WMN) has been considered as one of the key technology for the enhancement of network performance. It is used in a number of real-time applications such as disaster management system, transportation system and health care system. MRMC-WMN is a multi-hop network and allows simultaneous data transfer by using multiple radio interfaces. All the radio interfaces are typically assigned with different channels to reduce the effect of co-channel interference. In MRMC-WMN, when two nodes transmit at the same channel in the range of each other, generates co-channel interference and degrades the network throughput. Co-channel interference badly affects the capacity of each link that reduces the overall network performance. Thus, the important task of channel assignment algorithm is to reduce the co-channel interference and enhance the network performance. In this paper, the problem of channel assignment has been addressed for MRMC-WMN. We have proposed an Interference Aware, Topology, Power and Flow Control (ITPFC) Channel Assignment algorithm for MRMC-WMN. This algorithm assignes the suitable channels to nodes, which provides better link capacity and reduces the co-channel interference. In the previous work performance of the proposed algorithm has been evaluated for a network of 30 nodes. The aim of this paper is to further evaluate the performance of proposed channel assignment algorithm for 40 and 50 nodes network. The results obtained from these networks show the consistent performance in terms of throughput, delay, packet loss and number of channels used per node as compared to LACA, FCPRA and IATC Channel Assignment algorithms.
Joint Routing and Congestion Control in Multipath Channel based on Signal to ...IJECEIAES
Routing protocol and congestion control in Transmission Control Protocol (TCP) have important roles in wireless mobile network performance. In wireless communication, the stability of the path and successful data transmission will be influenced by the channel condition. This channel condition constraints come from path loss and the multipath channel fading. With these constraints, the algorithm in the routing protocol and congestion control is confronted with the uncertainty of connection quality and probability of successful packet transmission, respectively. It is important to investigate the reliability and robustness of routing protocol and congestion control algorithms in dealing with such situation. In this paper, we develop a detailed approach and analytical throughput performance with a cross layer scheme (CLS) between routing and congestion control mechanism based on signal to noise ratio (SNR) in Rician and Rayleigh as multipath fading channel. We proposed joint routing and congestion control TCP with a cross layer scheme model based on SNR (RTCP-SNR). We compare the performance of RTCP-SNR with conventional routing-TCP and routing-TCP that used CLS with routing aware (RTCP-RA) model. The analyses and the simulation results showed that RTCP-SNR in a multipath channel outperforms conventional routing-TCP and RTCP-RA.
A CELLULAR BONDING AND ADAPTIVE LOAD BALANCING BASED MULTI-SIM GATEWAY FOR MO...pijans
As it is well known, the QoS(quality of service) provided by mobile Internet access point devices is far from
the QoS level offered by the common ADSL modem-router due to several reasons: in fact, mobile Internet
access networks are not designed to support real-time data traffic because of several drawbacks
concerning the wireless medium such as resource sharing, traffic congestion, radio link coverage etc.,
which impact directly such parameters as delay, jitter, and packet loss rate that are strictly connected to
the quality of user experience. The main scope of the present paper is to introduce a dual USIM HSPA
gateway for ad hoc and sensors networks thanks to which it will be possible to guarantee a QoS suitable
for a series of network-centric application such as real-time communications and monitoring, video
surveillance, real-time sensor networks, telemedicine, vehicular and mobile sensor networks and so on. The
main idea is to exploit multiple radio access networks in order to enhance the available end-to-end
bandwidth and the perceived quality of experience. The scope has been reached by combining multiple
radio access with dynamic load balancing and the VPN (virtual private network) bond technique.
BIO-INSPIRED SEAMLESS VERTICAL HANDOVER ALGORITHM FOR VEHICULAR AD HOC NETWORKSijwmn
One of the most important factors to implement VANET is by considering the variety of wireless networks available around the city as well as the vehicles traffic scenarios. However, by providing a diverse range of wireless access technologies, it is necessary to provide continuous network connectivity as well as selecting the most suitable network technology and performance. Many researchers have worked on building algorithms for selecting the best network to improve the handover process. However, with high-speed vehicles mobility, the vertical handover process became the most challenging task in order to achieve realtime network selection. This paper proposes a bio-inspired network selection algorithm influenced by insect's behaviour which combines Artificial Bee Colony (ABC) and Particle Swarm Optimization (PSO). The proposed algorithm is applied to process multi-criteria parameters to evaluate the best available network and then execute the handover process seamlessly. The results demonstrate the benefits of the proposed Multi-Criteria ABC-PSO method by reducing the handover decision delays by 25%. It gives the optimum performance in terms of network selections and reduces the handover latency by 14.5%. The proposed algorithm also reduces the number of unnecessary handovers by 48% for three different mobility scenarios based on traffic environments (highway, urban and traffic jam).
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
Evaluation The Performance of MAODV and AODV Protocols In VANETs ModelsCSCJournals
This paper to study, analyse the performance of multicast technology using the MAODV (Multicast On-demand Distance Vector Routing Protocol) in the VANETs (Vehicle Ad-Hoc Networks), this protocol using widely in MANETs (Mobile Ad-Hoc Network). The wireless nodes in the wireless vehicle networks are the same wireless devices, which are integrated with a sensor and designed specifically for the design of safety, privacy and security applications. Researchers are interested in developing and enhancing the number of service quality parameters (packets received, delay, productivity, node power consumption, etc.). The aim of this paper is to introduce and optimize VANETS multi-cast transmission technology to reduce delay, increase throughput and reduce packet loss. Although, presents an analytical study of the Enhanced Protocol (MAODV) Protocol (AODV) and compares it to AODV performance in VANETs.
STUDY OF THE EFFECT OF VELOCITY ON END-TOEND DELAY FOR V2V COMMUNICATION IN ITSijngnjournal
This paper focuses on vehicle to vehicle (V2V) communications in VANET. With the development of vehicles and mobile Ad Hoc network technology, the Vehicle Ad hoc Network (VANET) has become an emerging field of study. VANET is a special case of MANET, and will play an important role in city road traffic control. It is a challenging problem for searching and maintaining an effective route for transporting data information. Vehicular Ad Hoc network (VANET), is a hot topic applying mobile Ad Hoc network (MANET) to ITS in recent years. In the era of wireless computing, VANET communications are gaining a lot of attention. In this paper we provide a simulation and study of the effect of velocity on end-to-end delay for v2v communication in intelligent transportation Systems
GLOBAL FRONTRUNNER ROUTING ALGORITHM (GFRA) FOR V2V COMMUNICATION IN VANETS cscpconf
VANET (Vehicular Ad hoc NETwork) is the emerging research area that making the phrase
“Network on Wheel” true. In this new age network the basic WLAN (IEEE 802.11) standard is
used. As the necessity of such network increases the implementation challenges are being taken
into account. They are broadcasting, routing, priority scheduling and security and privacy. In
this paper the routing is considered as the research factor. A proposal for routing with
frequently changing topology to avoid disconnection of network on road and for the routing
among overlapping networks in flyovers with multiple ramps and stack to avoid wrong
messaging is given.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
JCWAEED: JOINT CHANNEL ASSIGNMENT AND WEIGHTED AVERAGE EXPECTED END-TO-END DE...csandit
In recent years, multi-channel multi-radio Wireless Mesh network has become one of the most important technologies in the evolution of next-generation networks. Its multi-hop, selforganization,self-healing and simple deployment is an effective way to solve the bottleneck problem of last mile. In this paper, we propose a new routing metric called WAEED, deployed in JCWAEED protocol, a joint channel assignment and weighted average expected end-to-end delay routing protocol which considers both interference suppression with factor IF and end-toend delay. Additionally, we give the exact calculation formula of transmission delay and queuing delay. Simulations results demonstrate that JCWAEED outperforms other joint design routing protocols in terms of throughput, end-to-end delay and packet loss rate.
Performance Analysis of Energy Optimized LTE-V2X Networks for Delay Sensitive...IJCNCJournal
Energy-efficient relaying technology in multi-hop data transmission can help the challenges faced in cellular Vehicle-to-Everything (cellular-V2X) communication. However, due to high demand of emergency service requirements of the systems such as Public Protection and Disaster Relief (PPDR), National Security and Public Safety (NSPS), Intelligent Transport System (ITS) etc., least energy consumed user equipment (UEs)/Vehicular-UEs are required which can either run real-time applications or relay the application data. To support these scenarios, we present a high way based system model in rural area and enhance its scope for applying single-hop direct, relay assisted multi-hop cellular-V2X and Store-CarryForward (SCF) modes of uplink data transmission. We compare the performance of three modes of transmissions in terms of overall energy consumption and overall transmission delay with specific delay constraints of VoIP and video applications. With the varying cell radius and irrespective type of applications, our numerical results, validated with ns-3 show that, least energy is always consumed in SCF mode due to its inherent property but applications suffer a lot due to high delay incurred whereas singlehop direct mode shows the reverse. When compared with cellular-V2X mode, overall transmission delay for single-hop direct mode is acceptable within cell radius 600m but beyond that, relay assisted multi-hop cellular-V2X mode always outperforms (with low latency and moderate energy consumption).
VANET SECURITY AND PRIVACY – AN OVERVIEWIJNSA Journal
Even though vehicular ad-hoc networks (VANETs) bring tremendous benefits to society, yet they raise
many challenges where the security and privacy concerns are the most critical ones. In this paper, we
provide a detailed overview of the state-of-the-art security and privacy requirements in VANET. Also, a
brief of the approachesthat are proposed in the literature to fulfil these requirements is given in this paper.
Besides that, a classification of the various VANET attacks based on the communication system
layersisprovided in this paper. In addition, the different types of VANET adversaries and attackers
arepresented here.In general, this paper aims to provide a good piece of information about VANET
security and privacy, in order to be used as a tool to help researchers in this field in developing secure
privacy-preserving approaches for VANET.
VANET SECURITY AND PRIVACY – AN OVERVIEWIJNSA Journal
Even though vehicular ad-hoc networks (VANETs) bring tremendous benefits to society, yet they raise
many challenges where the security and privacy concerns are the most critical ones. In this paper, we
provide a detailed overview of the state-of-the-art security and privacy requirements in VANET. Also, a
brief of the approachesthat are proposed in the literature to fulfil these requirements is given in this paper.
Besides that, a classification of the various VANET attacks based on the communication system
layersisprovided in this paper. In addition, the different types of VANET adversaries and attackers
arepresented here.In general, this paper aims to provide a good piece of information about VANET
security and privacy, in order to be used as a tool to help researchers in this field in developing secure
privacy-preserving approaches for VANET.
Security schemes based on conditional privacy-preserving vehicular ad hoc net...nooriasukmaningtyas
Recently, vehicular ad hoc networks (VANETs) have been garnering
significant inter-est from the people involved in transportation field.
Nowadays automotive manufactur-ers have already supplying vehicles with
multitude of road sensors that provides many useful characteristics. VANET
communication not only offers the drivers and passen-gers with the various
safety related services but also provides a wide range of valuable
applications. However, the inherent openness of the wireless communication
medium used by VANETs exposes vehicles to various security and privacy
issues. Researchers have proposed many security schemes to solve the issues
mentioned above for the widespread deployment of VANETs. However,
these schemes failed to fulfill all as-pects of security and privacy
requirements. Besides, these schemes have not provided the performance
parameters such as computation and communication costs. The pri-mary
emphasis of this paper is on the taxonomy of security schemes based
conditional privacy-preserving with respect to strengths and limitations.
Besides, a comparison be-tween these schemes related to the model of
security and privacy requirements, attacks, and performance parameters is
provided. Finally, this paper critically reviews the re-lated works by taking
into consideration the design and development of all VANETs security and
privacy schemes, this paper could serve as a guide and reference.
Reducing Packet Transmission Delay in Vehicular Ad Hoc Networks using Edge No...CSCJournals
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a greedy position based routing approach to forward packets to the node present in the edge of the limited transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that end to end delay in packet transmission is minimized considerably compared to current routing protocols of VANET.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
Performance evaluation of interference aware topology power and flow control ...IJECEIAES
Multi-Radio Multi-Channel Wireless Mesh Network (MRMC-WMN) has been considered as one of the key technology for the enhancement of network performance. It is used in a number of real-time applications such as disaster management system, transportation system and health care system. MRMC-WMN is a multi-hop network and allows simultaneous data transfer by using multiple radio interfaces. All the radio interfaces are typically assigned with different channels to reduce the effect of co-channel interference. In MRMC-WMN, when two nodes transmit at the same channel in the range of each other, generates co-channel interference and degrades the network throughput. Co-channel interference badly affects the capacity of each link that reduces the overall network performance. Thus, the important task of channel assignment algorithm is to reduce the co-channel interference and enhance the network performance. In this paper, the problem of channel assignment has been addressed for MRMC-WMN. We have proposed an Interference Aware, Topology, Power and Flow Control (ITPFC) Channel Assignment algorithm for MRMC-WMN. This algorithm assignes the suitable channels to nodes, which provides better link capacity and reduces the co-channel interference. In the previous work performance of the proposed algorithm has been evaluated for a network of 30 nodes. The aim of this paper is to further evaluate the performance of proposed channel assignment algorithm for 40 and 50 nodes network. The results obtained from these networks show the consistent performance in terms of throughput, delay, packet loss and number of channels used per node as compared to LACA, FCPRA and IATC Channel Assignment algorithms.
Joint Routing and Congestion Control in Multipath Channel based on Signal to ...IJECEIAES
Routing protocol and congestion control in Transmission Control Protocol (TCP) have important roles in wireless mobile network performance. In wireless communication, the stability of the path and successful data transmission will be influenced by the channel condition. This channel condition constraints come from path loss and the multipath channel fading. With these constraints, the algorithm in the routing protocol and congestion control is confronted with the uncertainty of connection quality and probability of successful packet transmission, respectively. It is important to investigate the reliability and robustness of routing protocol and congestion control algorithms in dealing with such situation. In this paper, we develop a detailed approach and analytical throughput performance with a cross layer scheme (CLS) between routing and congestion control mechanism based on signal to noise ratio (SNR) in Rician and Rayleigh as multipath fading channel. We proposed joint routing and congestion control TCP with a cross layer scheme model based on SNR (RTCP-SNR). We compare the performance of RTCP-SNR with conventional routing-TCP and routing-TCP that used CLS with routing aware (RTCP-RA) model. The analyses and the simulation results showed that RTCP-SNR in a multipath channel outperforms conventional routing-TCP and RTCP-RA.
A CELLULAR BONDING AND ADAPTIVE LOAD BALANCING BASED MULTI-SIM GATEWAY FOR MO...pijans
As it is well known, the QoS(quality of service) provided by mobile Internet access point devices is far from
the QoS level offered by the common ADSL modem-router due to several reasons: in fact, mobile Internet
access networks are not designed to support real-time data traffic because of several drawbacks
concerning the wireless medium such as resource sharing, traffic congestion, radio link coverage etc.,
which impact directly such parameters as delay, jitter, and packet loss rate that are strictly connected to
the quality of user experience. The main scope of the present paper is to introduce a dual USIM HSPA
gateway for ad hoc and sensors networks thanks to which it will be possible to guarantee a QoS suitable
for a series of network-centric application such as real-time communications and monitoring, video
surveillance, real-time sensor networks, telemedicine, vehicular and mobile sensor networks and so on. The
main idea is to exploit multiple radio access networks in order to enhance the available end-to-end
bandwidth and the perceived quality of experience. The scope has been reached by combining multiple
radio access with dynamic load balancing and the VPN (virtual private network) bond technique.
BIO-INSPIRED SEAMLESS VERTICAL HANDOVER ALGORITHM FOR VEHICULAR AD HOC NETWORKSijwmn
One of the most important factors to implement VANET is by considering the variety of wireless networks available around the city as well as the vehicles traffic scenarios. However, by providing a diverse range of wireless access technologies, it is necessary to provide continuous network connectivity as well as selecting the most suitable network technology and performance. Many researchers have worked on building algorithms for selecting the best network to improve the handover process. However, with high-speed vehicles mobility, the vertical handover process became the most challenging task in order to achieve realtime network selection. This paper proposes a bio-inspired network selection algorithm influenced by insect's behaviour which combines Artificial Bee Colony (ABC) and Particle Swarm Optimization (PSO). The proposed algorithm is applied to process multi-criteria parameters to evaluate the best available network and then execute the handover process seamlessly. The results demonstrate the benefits of the proposed Multi-Criteria ABC-PSO method by reducing the handover decision delays by 25%. It gives the optimum performance in terms of network selections and reduces the handover latency by 14.5%. The proposed algorithm also reduces the number of unnecessary handovers by 48% for three different mobility scenarios based on traffic environments (highway, urban and traffic jam).
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
Evaluation The Performance of MAODV and AODV Protocols In VANETs ModelsCSCJournals
This paper to study, analyse the performance of multicast technology using the MAODV (Multicast On-demand Distance Vector Routing Protocol) in the VANETs (Vehicle Ad-Hoc Networks), this protocol using widely in MANETs (Mobile Ad-Hoc Network). The wireless nodes in the wireless vehicle networks are the same wireless devices, which are integrated with a sensor and designed specifically for the design of safety, privacy and security applications. Researchers are interested in developing and enhancing the number of service quality parameters (packets received, delay, productivity, node power consumption, etc.). The aim of this paper is to introduce and optimize VANETS multi-cast transmission technology to reduce delay, increase throughput and reduce packet loss. Although, presents an analytical study of the Enhanced Protocol (MAODV) Protocol (AODV) and compares it to AODV performance in VANETs.
STUDY OF THE EFFECT OF VELOCITY ON END-TOEND DELAY FOR V2V COMMUNICATION IN ITSijngnjournal
This paper focuses on vehicle to vehicle (V2V) communications in VANET. With the development of vehicles and mobile Ad Hoc network technology, the Vehicle Ad hoc Network (VANET) has become an emerging field of study. VANET is a special case of MANET, and will play an important role in city road traffic control. It is a challenging problem for searching and maintaining an effective route for transporting data information. Vehicular Ad Hoc network (VANET), is a hot topic applying mobile Ad Hoc network (MANET) to ITS in recent years. In the era of wireless computing, VANET communications are gaining a lot of attention. In this paper we provide a simulation and study of the effect of velocity on end-to-end delay for v2v communication in intelligent transportation Systems
GLOBAL FRONTRUNNER ROUTING ALGORITHM (GFRA) FOR V2V COMMUNICATION IN VANETS cscpconf
VANET (Vehicular Ad hoc NETwork) is the emerging research area that making the phrase
“Network on Wheel” true. In this new age network the basic WLAN (IEEE 802.11) standard is
used. As the necessity of such network increases the implementation challenges are being taken
into account. They are broadcasting, routing, priority scheduling and security and privacy. In
this paper the routing is considered as the research factor. A proposal for routing with
frequently changing topology to avoid disconnection of network on road and for the routing
among overlapping networks in flyovers with multiple ramps and stack to avoid wrong
messaging is given.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
JCWAEED: JOINT CHANNEL ASSIGNMENT AND WEIGHTED AVERAGE EXPECTED END-TO-END DE...csandit
In recent years, multi-channel multi-radio Wireless Mesh network has become one of the most important technologies in the evolution of next-generation networks. Its multi-hop, selforganization,self-healing and simple deployment is an effective way to solve the bottleneck problem of last mile. In this paper, we propose a new routing metric called WAEED, deployed in JCWAEED protocol, a joint channel assignment and weighted average expected end-to-end delay routing protocol which considers both interference suppression with factor IF and end-toend delay. Additionally, we give the exact calculation formula of transmission delay and queuing delay. Simulations results demonstrate that JCWAEED outperforms other joint design routing protocols in terms of throughput, end-to-end delay and packet loss rate.
Performance Analysis of Energy Optimized LTE-V2X Networks for Delay Sensitive...IJCNCJournal
Energy-efficient relaying technology in multi-hop data transmission can help the challenges faced in cellular Vehicle-to-Everything (cellular-V2X) communication. However, due to high demand of emergency service requirements of the systems such as Public Protection and Disaster Relief (PPDR), National Security and Public Safety (NSPS), Intelligent Transport System (ITS) etc., least energy consumed user equipment (UEs)/Vehicular-UEs are required which can either run real-time applications or relay the application data. To support these scenarios, we present a high way based system model in rural area and enhance its scope for applying single-hop direct, relay assisted multi-hop cellular-V2X and Store-CarryForward (SCF) modes of uplink data transmission. We compare the performance of three modes of transmissions in terms of overall energy consumption and overall transmission delay with specific delay constraints of VoIP and video applications. With the varying cell radius and irrespective type of applications, our numerical results, validated with ns-3 show that, least energy is always consumed in SCF mode due to its inherent property but applications suffer a lot due to high delay incurred whereas singlehop direct mode shows the reverse. When compared with cellular-V2X mode, overall transmission delay for single-hop direct mode is acceptable within cell radius 600m but beyond that, relay assisted multi-hop cellular-V2X mode always outperforms (with low latency and moderate energy consumption).
VANET SECURITY AND PRIVACY – AN OVERVIEWIJNSA Journal
Even though vehicular ad-hoc networks (VANETs) bring tremendous benefits to society, yet they raise
many challenges where the security and privacy concerns are the most critical ones. In this paper, we
provide a detailed overview of the state-of-the-art security and privacy requirements in VANET. Also, a
brief of the approachesthat are proposed in the literature to fulfil these requirements is given in this paper.
Besides that, a classification of the various VANET attacks based on the communication system
layersisprovided in this paper. In addition, the different types of VANET adversaries and attackers
arepresented here.In general, this paper aims to provide a good piece of information about VANET
security and privacy, in order to be used as a tool to help researchers in this field in developing secure
privacy-preserving approaches for VANET.
VANET SECURITY AND PRIVACY – AN OVERVIEWIJNSA Journal
Even though vehicular ad-hoc networks (VANETs) bring tremendous benefits to society, yet they raise
many challenges where the security and privacy concerns are the most critical ones. In this paper, we
provide a detailed overview of the state-of-the-art security and privacy requirements in VANET. Also, a
brief of the approachesthat are proposed in the literature to fulfil these requirements is given in this paper.
Besides that, a classification of the various VANET attacks based on the communication system
layersisprovided in this paper. In addition, the different types of VANET adversaries and attackers
arepresented here.In general, this paper aims to provide a good piece of information about VANET
security and privacy, in order to be used as a tool to help researchers in this field in developing secure
privacy-preserving approaches for VANET.
Security schemes based on conditional privacy-preserving vehicular ad hoc net...nooriasukmaningtyas
Recently, vehicular ad hoc networks (VANETs) have been garnering
significant inter-est from the people involved in transportation field.
Nowadays automotive manufactur-ers have already supplying vehicles with
multitude of road sensors that provides many useful characteristics. VANET
communication not only offers the drivers and passen-gers with the various
safety related services but also provides a wide range of valuable
applications. However, the inherent openness of the wireless communication
medium used by VANETs exposes vehicles to various security and privacy
issues. Researchers have proposed many security schemes to solve the issues
mentioned above for the widespread deployment of VANETs. However,
these schemes failed to fulfill all as-pects of security and privacy
requirements. Besides, these schemes have not provided the performance
parameters such as computation and communication costs. The pri-mary
emphasis of this paper is on the taxonomy of security schemes based
conditional privacy-preserving with respect to strengths and limitations.
Besides, a comparison be-tween these schemes related to the model of
security and privacy requirements, attacks, and performance parameters is
provided. Finally, this paper critically reviews the re-lated works by taking
into consideration the design and development of all VANETs security and
privacy schemes, this paper could serve as a guide and reference.
A review on various security attacks in vehicular ad hoc networksjournalBEEI
Ad hoc vehicle networks (VANET) are being established as a primary form of mobile ad hoc networks (MANET) and a critical infrastructure to provide vehicle passengers with a wide range of safety applications. VANETs are increasingly common nowadays because it is connecting to a wide range of invisible services. The security of VANETs is paramount as their future use must not jeopardize their users' safety and privacy. The security of these VANETs is essential for the benefit of secure and effective security solutions and facilities, and uncertainty remains, and research in this field remains fast increasing. We discussed the challenges in VANET in this survey. Were vehicles and communication in VANET are efficient to ensure communication between vehicles to vehicles (V2V), vehicles to infrastructures (V2I). Clarified security concerns have been discussed, including confidentiality, authentication, integrity, availableness, and non-repudiation. We have also discussed the potential attacks on security services. According to analysis and performance evaluations, this paper shows that the ACPN is both feasible and appropriate for effective authentication in the VANET. Finally, the article found that in VANETs, encryption and authentication are critical.
Towards design strong emergency and COVID-19 authentication scheme in VANETnooriasukmaningtyas
The wide use of vehicular ad hoc networks (VANETs) in the last decade has led many researchers to find efficient and reliable methods to obtain the desired benefits and offer services, such as healthcare and traffic management. However, VANETs suffer from security issues represented by authentication and data integrity. In this paper, we propose a robust mutual authentication scheme based on elliptic curve cryptography (ECC), cryptography Hash Function, and a pseudonym. The proposed work was twofold in focus: first, on healthcare in emergency cars which use VANETs, and second, on overcoming security issues, such as resisting familiar attacks (e.g. insider attacks and reply attacks). Because of the serious situation generated by the worldwide outbreak of the Covid-19 epidemic, we also found this research valuable in supporting global efforts to combat the rapid spread of this virus, by finding the safest and fastest routes to epidemic treatment centres for medical staff, assistance teams in medical operations, fumigation control, and all work teams associated with disease control. This research attempts to contribute by proposing a special signal used to define epidemic teams. The best route, fast route can be chosen by using VANETs infrastructure. This scheme also deals with metric security features, such as key management, data integrity, and data privacy. In the communication and computation cost, we noticed that our proposed scheme achieved good results compared with the related works
Today, a growing number of vehicles are equipped with communication devices to facilitate vehicle to vehicle and vehicle to infrastructure communication and increase the safety of passengers. A new type of network called Vehicular Network VANET provides us with the infrastructure for developing new systems to enhance drivers' and passengers' safety and comfort. Vehicular networks are special types of mobile ad hoc networks that are used to help drivers access necessary information. This paper provides an introduction to vehicular networks. Matthew N. O. Sadiku | Uwakwe C. Chukwu | Abayomi Ajayi-Majebi | Sarhan M. Musa "Vehicular Networking" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-6 , October 2021, URL: https://www.ijtsrd.com/papers/ijtsrd46451.pdf Paper URL : https://www.ijtsrd.com/engineering/electrical-engineering/46451/vehicular-networking/matthew-n-o-sadiku
A survey on security and privacy issues in IoV IJECEIAES
As an up-and-coming branch of the Internet of things, internet of vehicles (IoV) is imagined to fill in as a fundamental information detecting and processing platform for astute transportation frameworks. Today, vehicles are progressively being associated with the Internet of Things which empower them to give pervasive access to data to drivers and travelers while moving. Be that as it may, as the quantity of associated vehicles continues expanding, new prerequisites, (for example, consistent, secure, vigorous, versatile data trade among vehicles, people, and side of the road frameworks) of vehicular systems are developing. Right now, the unique idea of vehicular specially appointed systems is being changed into another idea called the internet of vehicles (IoV). We talk about the issues faced in implementing a secure IoV architecture. We examine the various challenges in implementing security and privacy in IoV by reviewing past papers along with pointing out research gaps and possible future work and putting forth our on inferences relating to each paper.
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.
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.
Software engineering based self-checking process for cyber security system in...IJECEIAES
Newly, the cyber security of vehicle ad hoc network (VANET) includes two practicable: vehicle to vehicle (V2V) and Vehicle to Infrastructure (V2I) that have been considered due to importance. It has become possible to keep pace with the development in the world. The people safety is a priority in the development of technology in general and particular in of VANET for police vehicles. In this paper, we propose a software engineering based self-checking process to ensure the high redundancy of the generated keys. These keys are used in underlying cyber security system for VANET. The proposed self-checking process emploies a set of NIST tests including frequency, block and runs as a threshold for accepting the generated keys. The introduced cyber security system includes three levels: Firstly, the registration phase that asks vehicles to register in the system, in which the network excludes the unregistered ones. In this phase, the proposed software engineeringbased self-checking process is adopted. Secondly, the authentication phase that checks of the vehicles after the registration phase. Thirdly, the proposed system that is able to detect the DOS attack. The obtained results show the efficient performance of the proposed system in managing the security of the VANET network. The self-checking process increased the randomness of the generated keys, in which the security factor is increased.
VANET is next generation vehicular network and
its applications will be play key to safe human life while journey
on highway. Security is one of the key prominent factors for
implement VANET in real environment.In this survey paper, discuss in detail the various computing methods and illustrate the relationship with vehicular network. Using these computing
methods to secure the vehicular network from attackers and
attacks.
LSKA-ID: A lightweight security and key agreement protocol based on an identi...TELKOMNIKA JOURNAL
Recently, a huge effort has been pushed to the wireless broadcasting nature in the open area. However, the vehicular ad hoc network (VANET) is disposed to various kinds of attacks. Hence, keeping the security in VANET is the most critical issue because of the VANET network related to human life. Thus, we propose a robust and lightweight security and key agreement-based identity protocol LSKA-ID for vehicular communication. Our protocol utilizes the elliptic curve cryptography, Chinese reminder theorem, and identity (ID)-based cryptosystem to resolve the issues found in the previously proposed schemes, in which our protocol can resolve the key escrow issues accompanied in most ID-based schemes. Also, it does not need batch verification operations, which cause some problems to the verifier in case the batch beacons have one or more illegal beacons. Moreover, the LSKA-ID protocol addresses the dependency on the trusted authority (TA) during the high frequent handover between the groups that may cause a bottleneck problem on the TA. The security analysis proves the correctness of the LSKA-ID protocol by using the random oracle model and has shown to be effective in a performance evaluation.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...IJCNCJournal
The Optimal Link State Routing (OLSR) protocol employs multipoint relay (MPR) nodes to disseminate topology control (TC) messages, enabling network topology discovery and maintenance. However, this approach increases control overhead and leads to wasted network bandwidth in stable topology scenarios due to fixed flooding periods. To address these challenges, this paper presents an Efficient Topology Maintenance Algorithm (ETM-OLSR) for Enhanced Link-State Routing Protocols. By reducing the number of MPR nodes, TC message generation and forwarding frequency are minimized. Furthermore, the algorithm selects a smaller subset of TC messages based on the changes in the MPR selection set from the previous cycle, adapting to stable and fluctuating network conditions. Additionally, the sending cycle of TC messages is dynamically adjusted in response to network topology changes. Simulation results demonstrate that the ETM-OLSR algorithm effectively reduces network control overhead, minimizes end-to-end delay, and improves network throughput compared to traditional OLSR and HTR-OLSR algorithms.
March 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Understanding Inductive Bias in Machine LearningSUTEJAS
This presentation explores the concept of inductive bias in machine learning. It explains how algorithms come with built-in assumptions and preferences that guide the learning process. You'll learn about the different types of inductive bias and how they can impact the performance and generalizability of machine learning models.
The presentation also covers the positive and negative aspects of inductive bias, along with strategies for mitigating potential drawbacks. We'll explore examples of how bias manifests in algorithms like neural networks and decision trees.
By understanding inductive bias, you can gain valuable insights into how machine learning models work and make informed decisions when building and deploying them.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Water billing management system project report.pdfKamal Acharya
Our project entitled “Water Billing Management System” aims is to generate Water bill with all the charges and penalty. Manual system that is employed is extremely laborious and quite inadequate. It only makes the process more difficult and hard.
The aim of our project is to develop a system that is meant to partially computerize the work performed in the Water Board like generating monthly Water bill, record of consuming unit of water, store record of the customer and previous unpaid record.
We used HTML/PHP as front end and MYSQL as back end for developing our project. HTML is primarily a visual design environment. We can create a android application by designing the form and that make up the user interface. Adding android application code to the form and the objects such as buttons and text boxes on them and adding any required support code in additional modular.
MySQL is free open source database that facilitates the effective management of the databases by connecting them to the software. It is a stable ,reliable and the powerful solution with the advanced features and advantages which are as follows: Data Security.MySQL is free open source database that facilitates the effective management of the databases by connecting them to the software.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
Gen AI Study Jams _ For the GDSC Leads in India.pdf
MAR SECURITY: IMPROVED SECURITY MECHANISM FOR EMERGENCY MESSAGES OF VANET USING GROUP KEY MANAGEMENT &CRYPTOGRAPHY SCHEMES (GKMC)
1. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
DOI: 10.5121/ijcnc.2021.13407 101
MAR SECURITY: IMPROVED SECURITY
MECHANISM FOR EMERGENCY MESSAGES
OF VANET USING GROUP KEY MANAGEMENT
&CRYPTOGRAPHY SCHEMES (GKMC)
Mahabaleshwar Kabbur, Anand R and Arul Kumar V
School of Computer Science & Applications,
REVA University, Bengaluru-64, Karnataka, India
ABSTRACT
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.
KEYWORDS
Network Protocols, Wireless Network, Mobile Network, Virus, Worms & Trojan.
1. INTRODUCTION
The transportation system plays an important role in the development of any country’s economic
growth. Thus, the demand for vehicles increases. This increased utilization of vehicles has
several advantages such as better and efficient transportation, and also it has several
disadvantages related to road safety and other issues such as accidents. A recent study revealed
that, a total of 232 billion accidents are reported in the United States and 100 thousand deaths are
reported every year in China, and it is still increasing [1]. In these accidents, more than 57% of
accidents are caused due to human error such as lack of attention, poor cooperation among
vehicle drivers and poor decisions. The frequent exchange of accident alarm between vehicles
can help to avoid these incidents. This communication between vehicles can be performed using
wireless communication. Recently, increased growth of wireless communication has gained huge
attraction in various real-time applications such as mobile communication, wireless sensor
networks and satellite communications, etc.
2. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
102
The technological growth in networking, embedded technology has enabled various development
opportunities for the automobile industry due to that vehicles are equipped with various types of
smart devices such as Wi-Fi, GPS and other smart devices. Due to these smart devices, vehicles
can communicate each other through wireless network and facilitates the formation of Vehicular
Ad Hoc Network (VANET) where vehicles can communicate to avoid congestion and accidents.
Recently, numerous researches are conducted to the establishment of reliable Intelligent
Transport System (ITS) which has several facilities such as traffic monitoring, collision control,
traffic flow control, nearby location information services, and internet availability in vehicles.
Generally, VANETs are characterized by the following factors such as dynamic network
topology, on-board sensors, unlimited power, and storage, etc. Similarly, the VANET
communication systems can be classified based on the communication types which are: Intra-
Vehicular communication inside the vehicle, vehicle to vehicle communication (V2V), vehicle to
infrastructure (V2I) and hybrid communication (V2X) where a vehicle can communicate to the
vehicle and road-side units (RSU) [2].
During the last decade, the development of ITS and VANET have gained attention by research,
industrial and academic field due to its promising nature of reliable transportation system.
Several types of research have focused on this field and developed various approaches to improve
the performance of VANETs. However, this communication is performed using wireless
communication architecture where routing is considered a challenging task. VANETs have
several applications which are mainly categorized into two categories like, safety and non-safety
applications. The safety applications perform transmitting safety messages and warning messages
for assisting the road to prevent accidents. These messages can include various types of
information such as road accidents, traffic jams, emergency vehicles, and road construction, etc.
Figure 1 shows actual research scenario of VANET and how emergency messages are unsafe in
data transmission process.
Fig. 1. Research scenario of VANET
These safety messages urges for high security and low latency. On the other hand, non-safety
applications include traffic management tasks and infotainment. However, infotainment
applications do not require higher security. The safety messages need to be transmitted quickly
and reliably. The dynamic network topology becomes a tedious task in VANET to deliver the
safety message.
Despite several advantages of VANET in safety and information application, these networks
require high security which is considered a challenging task.
3. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
103
Vehicles exchange secret information which can attract attackers to steal and misuse the
information hence, a reliable security model is required.
Due to high dynamic network topology, no authentication is performed due to this, the
illegitimate nodes participate in the Security is a prime concern due to following reasons:
communication to harm the VANET communication.
The VANET architecture is infrastructure-less which is easy to attack by outsider
attackers hence providing security is important to the users.
Privacy preservation is an important factor of VANET.
Transmitting and receiving accurate information without any tampering or spoofing for
secure communication.
Data reliability, confidentiality and user anonymity provides enhanced security to the
network.
Due to the aforementioned reasons, VANET security is widely studied. These attacks include
availability attacks such as denial of service (DoS) and black hole attach, authenticity attacks
such as Sybil attack and GPS attack, data confidentiality such as eavesdropping and data trust,
non-repudiation such as loss of event traceability. Figure 2 shows a classification of various
attacks on VANET.
Fig 2. Examples of VANET threats and attacks
These attacks can lead the development of a poor ITS. Hence, security becomes the prime
concern for these applications. Several routing approaches have been introduced which include
AODV [3], DSDV [4], DSR [5] and OLSR [6] for efficient data delivery and communication.
Moreover, heuristic optimization algorithms are also introduced such as Heuristic algorithm
using Ant Colony Optimization [7], Meta-heuristic [8], CACONET [9], and improved hybrid ant
particle optimization (IHAPO) [10], etc. Similarly, artificial intelligence schemes are also
introduced such as Fuzzy Logic based routing [11], and neural networks [12]. Several techniques
are introduced to overcome the security related issues in VANET. Recently, CARAVAN [13],
AMOEBA [14], REP [15], VSPN [16] and many more approaches have been developed to
facilitate location privacy. Similarly, cryptography based schemes are also introduced to secure
the message. [17] Introduced cryptography approach to deal with the Sybil attacks. Some of the
security schemes are introduced based on the key-management protocol such as [18] presented
Diffie-Hellman key generation scheme. Key management and key generation are the crucial
stages of authentication. [19] Presented ID-based authentication protocol. Furthermore, the
4. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
104
cryptographic schemes are expanded based on the symmetric and asymmetric cryptography
schemes [7]. However, achieving security in these types of dynamic networks is always
considered a challenging task and various researches are still in progress to provide more security
in VANETs. This work focuses on security requirements of VANET and introduces a novel
approach for secure communication in VANETs.
The main contributions of the work are as follows:
Development of a novel approach for group key distribution which includes
authentication process to improve the network security.
Incorporating novel data encryption and decryption process based on the Elliptic Curve
Cryptography (ECC) scheme.
The rest of the manuscript is organized as literature review study, which is presented in section 2.
The proposed solution for the security and QoS enhancement in the VANET is presented in
section 3 and section 4 presents the experimental study. The comparative analysis shows robust
performance of the proposed model. Finally, section 5 presents concluding remarks.
2. LITERATURE SURVEY
This section represents brief discussion about recent techniques of secure communication in
VANETs. This section includes various schemes such as authentication, key generation, key
exchange, hash function and cryptography schemes. Ref. by [20] presented a robust approach
for secure and QoS aware routing approach for VANET. According to this approach, Ant
colony optimization scheme is used to find the optimal route based on the data traffic type.
The ACO scheme helps to achieve the best fit solution for the given problem. Later,
VANET-oriented Evolving Graph (VoEG) model is developed to measure the likelihood
among vehicles. Ref. by [21] introduced 2FLIP approach to maintain the location privacy.
This process uses message authentication code (MAC) and hash operations to induce two
factor authentications. This approach uses biometric system for each driver to collect the
traces of each driver where this biometric is verified using the tamper-proof device (TPD) is
embedded in onboard unit (OBU). The one-way hash function is generating to secure the
V2V and V2R communication. This mechanism secures the message using MAC generation
and a hash function is re-generated for verification. Ref. by [22] introduced an authentication
model for anonymous users based on the signature and message recovery. This approach uses
batch operations to authenticate the multiple signatures, which help to reduce the
authentication time. The main contributions of this approach are as follows: The ID based
anonymous signature scheme is developed for authentication where, length of the packet will
be shorter, resulting in reduced communication overhead. In the next stage, the message is
recovered using signature which reduces the computation overhead by neglecting invalid
signature messages. Finally, batch authentication is used where all the messages can be
authentication at the same time. Bad mouthing and providing false information are serious
issues in VANETs. Generally, reputation management schemes are used for this purpose but,
they cannot handle the self-promoting attack and it may violate location privacy. To deal
with these issues, Ref. by [23] presented privacy preserving and reputation management
model to mitigate bad mouthing attacks. This work presents a service reputation to compute
QoS of the user, if any user provides low QoS then it is identified as malicious node.
Furthermore, this work focuses on location privacy by presenting the hidden-zone and k-
anonymity scheme. Ref. by [24] discussed that the current routing scheme will not ensure the
on-time packet delivery due to, high dynamic nature of VANETs which affects the process of
safety alert message. These safety messages require security to maintain the hassle free traffic
5. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
105
hence in this work a secure routing scheme VANSecis presented to avoid threats to the
network. This approach is based on trust management which identifies the false and
malicious nodes. Ref. by [25] presented Ad hoc On-demand Multipath Distance Vector
(AOMDV) routing algorithm. This algorithm provides minimum of three paths to route the
packets. However, AOMDV suffers from the lack of security schemes, cryptography and
intrusion detection schemes because of these issues this protocol is vulnerable to various
threats such as black holes and man-in-the-middle attack. Hence, this scheme introduces
secure and efficient AOMDV protocol for VANETs. The security is enabled by detecting the
malicious vehicles which are not authenticated and pose malicious behaviour. Furthermore,
best path is obtained using Route Reply (RREP) packet. Ref. by [26] focused on the data
security in VANETs and suggested that the secured data can be delivered using LEACH
protocol. Hence, in this work, authors considered the combination of LEACH protocol and
lightweight cryptographic model. For increasing security, the Random Firefly is used for
identifying the trustworthy vehicles in the considered network topology. After identifying the
reliable vehicles, the lightweight security and Hash function methods are used for securing
the information for transmission. Ref. by [27] presented Security Aware Fuzzy Enhanced
Reliable Ant Colony Optimization (SAFERACO) routing protocol to distinguish the
malicious and trustworthy nodes during communication. The misbehaving nodes are
discarded from the routing process. The user authentication plays an important role to
improve the security of VANETs. Several approaches are developed based on authentication.
Tan et al. [28] authentication based approach for increasing the security in VANETs. In this
work, authors introduced elliptic curve cryptography which is further improved by using
bilinear pairing. The vehicles which are in the defined range are selected and assigned a
group key for authentication. Later, the encrypted message is delivered to the corresponding
RSU which provides the vehicle priority and assessment information which helps to arrange
the route for the vehicles to deliver the message in the optimal period of time. Lu et al. [30]
introduced a trust and privacy model for improving the security in VANETs. This work
presents block chain based anonymous reputation system (BARS) for trust management. In
this work, certificate and revocation schemes are used based on the extended block chain
technology. Furthermore, a reputation management scheme is presented which uses historical
interaction of the vehicle and indirect opinions of other vehicles.
3. PROPOSED MODEL
This section presents the proposed model for secure and efficient communication in vehicular
Ad-Hoc networks. The significant amounts of works have been carried out to improve
communication performance but security remains a challenging task. Moreover, the dynamic
network topology creates several challenging issues. Thus, user authentication and key
management will be a tedious task to maintain the cure communication. This research work is
focusing on key management and data security. The proposed model of GKMC organized as
follows:
A. First of all, we deploy a Vehicular Ad-Hoc network and define the preliminary and initial
assumptions related to the network.
B. In the next phase, V2V, V2 and V2X communication protocol is presented where key
management, authentication, key exchange modules are presented.
C. Finally, the cryptography scheme is presented to secure the data packets.
6. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
106
A. Preliminaries and Network Modelling
The VANET architecture contains several components such as trusted authority (TA), road side
units (RSUs), service provider (SP), and onboard unit (OBU) mounted vehicles as shown in
figure 2. Each entity of network has assigned specific tasks. Generally, TA is considered as car
manufacturer or transport management department. Trust authority is responsible for registering
the RSUs and to generate public and private keys to authenticate each user. TA performs several
computations hence we assume that enough storage is provided to TA along with adequate
computation capability. Road Side Units (RSUs) are the infrastructures, which are deployed at
the road intersection and road side which act as relays for V2I communication. Figure 3 shows
required architecture of VANET for proposed system.
Fig 3: VANET Model
The communication between RSU and vehicle is performed using dedicated short-range
communications (DSRC) protocol. The main task of RSU is to verify the legitimacy of the
received message from vehicles [8].The service provider provides different types of application
to all vehicles. To provide an application services, the RSU receives the message from vehicles,
verifies its legitimacy and if the message is valid then forwarded to the application server for
providing the required service. The SA, TA and RSU can communicate through a safety cable
channel. Similarly, OBU is a wireless unit, which is installed on the vehicle with GPS and a small
device for short range communications.
B. Security Requirements
In VAETs, data security and privacy are considered as an important factor to develop the secure
VANET model. This work focuses on the following security requirements [28][29][30]:
User authentication and message integrity: in this architecture, once the message is
transmitted to the receiver, then the receiver must ensure the message integrity and
validity by verifying the signatures.
Vehicle identity protection: the actual vehicle identity is only known by the trusted
authority and the vehicles. This helps to maintain anonymity from other vehicles in the
network.
7. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
107
Message traceability: during communication, if any bogus message is received by the
receiver, then TA should be able to track the original identity of the vehicle.
Message stealing: during data communication of message transmission phase, the
protocol should be able the secure the high confidentiality message by avoiding message
stealing by attackers.
Fake Message attack: the fake messages are disseminated to harm the network entities
hence the protocol should restrict the fake message circulation in the network.
Fake identity: according to this attack the real identity of vehicle is forged and used for
concealing the information. Hence, the identity of vehicles should be anonymized to
prevent this attack.
Similarly, here it focus on achieving the solution for non-repudiation attack, replay attack and
DOS attack to develop a more robust and secure network architecture.
Hence, this work introduced a combined novel key management and data security approach for
VANETs. The proposed model is implemented in two fold manner where first of all key
management is performed and later, data encryption is applied. The proposed approach is denoted
as GKMC (Group Key Management & Cryptography Schemes).
Table 1. Mathematical Properties
𝒢𝑜, 𝒢𝑁 Additive cyclic group
𝓅 Large prime order for additive cyclic group
Ϝ Bilinear map function
ℛ𝑅𝑆𝑈 Random key for RSU
𝐾𝑅𝑆𝑈 Public key of RSU
ℍ Hash function
C. GKMC(Group Key Management & Cryptography Schemes)
(I) Group Key Management
This work first describes the bilinear map generation to incorporate the security functionality in
the network. Let us consider that 𝒢𝑜 and 𝒢𝑁 are the additive cyclic group with the large prime
order 𝓅. A map function Ϝ is computed as in equation 1.
Ϝ
̂: 𝒢𝑜 × 𝒢𝑁 → 𝒢𝑁 (1)
In which it should satisfy the following conditions to generate the bilinear pairing.
Bilinear: for all 𝑀, 𝑁 ∈ 𝒢𝑜 and for all 𝑎, 𝑏 ∈ 𝒵𝓅
∗
, the function is Ϝ
̂(𝑎𝑀, 𝑏𝑁) =
Ϝ
̂(𝑎𝑀, 𝑏𝑁)𝑎𝑏
. Similarly, for all 𝑀, 𝑁, 𝑌 ∈ 𝒢𝑜 the bilinear map as in equation 2 and 3.
Ϝ
̂(𝑀 + 𝑁 , 𝑌) = Ϝ
̂(𝑀, 𝑌)Ϝ
̂(𝑁, 𝑌) (2)
Ϝ
̂(𝑀 , 𝑁 + 𝑌) = Ϝ
̂(𝑀, 𝑁)Ϝ
̂(𝑀, 𝑌) (3)
8. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
108
Non-degenerate: there exists that the 𝑀, 𝑁 ∈ 𝒢𝑜, there is Ϝ
̂(𝑀 + 𝑁 , 𝑌) ≠ 1
Computability: for all 𝑀, 𝑁 ∈ 𝒢𝑜efficient approach is present to compute the Ϝ
̂(𝑀, 𝑁)
Symmetric: As per equation C4 for all 𝑀, 𝑁 ∈ 𝒢𝑜
Ϝ
̂(𝑀, 𝑁) = Ϝ
̂(𝑁, 𝑀) (4)
According to the proposed approach first, it represents the authentication process between RSU
and vehicle. The complete authentication process is divided into three phases as initialization,
authentication and distribution of group keys. The working process of these stages is described in
the following subsections.
I.a. Initialization
In the first step of proposed GKMC approach, we perform user registration and key allocation for
each vehicle in the network. In VANET architecture, a vehicle must be registered with the TA
then TA assigns secret information to the corresponding vehicle. During this process, the TA
stores driver information such as contact information, address and license plate number. Let us
consider that the 𝐺ℋ as cyclic additive group, 𝒬ℋ is the generator and unique vehicle id is
denoted as 𝑖𝑑. Here, we adopt the Hash function as 𝓀: {0,1}∗
× 𝐺ℋ → 𝒵𝓅
∗
where 𝒵𝓅
∗
denotes the
nonnegative integer set which is less than the prime number 𝓅. Based on these assumptions, the
TA generates a secret key 𝑆𝑖𝑑 for each vehicle in the network. The key is given as in equation 5.
𝑆𝑖𝑑 = 𝒽(𝑖𝑑, 𝒬ℋ) (5)
The generated key is assigned to the appropriate vehicle after registration. The secret key for each
user/vehicle is stored in the TA’s key storage dataset. Simultaneously, the TA selects a random
integer to assign the private key for RSU. This random number is selected as ℛ𝑅𝑆𝑈 ∈ 𝒵𝓅
∗
. Let 𝐺1
be an additive cyclic group of order 𝑞 generated by 𝑃. Thus, the RSU public key can be
computed as in equation 6.
𝐾𝑅𝑆𝑈 = ℛ𝑅𝑆𝑈𝑃 (6)
Here, RSU public key, generator 𝑃, hash function 𝓀 and 𝐺1 will be published to all devices
whereas the RSU private secret key ℛ𝑅𝑆𝑈 is kept secret during this process. This process is used
for registering the vehicle. Let us assume that the registered vehicle is entering the range of RSU.
If that vehicle demands for any service from the VANET, then key assignment is the necessary
task. This vehicle 𝑣 selects a partial private key as 𝑅𝑣 ∈ 𝒵𝓅
∗
, and the corresponding partial public
key is given as in equation 7.
𝑄𝑣 = ℛ𝑣𝑃 (7)
Where 𝑃 is the generator, using these parameters service request, public key and vehicle id are
delivered to the corresponding RSU which are arranged as 〈𝑆𝑒𝑟𝑣𝑖𝑐𝑒𝑅𝑒𝑞𝑢𝑒𝑠𝑡, 𝑄𝑣,𝑖𝑑〉. Once the
partial public key 𝑄𝑣 is generated, the RSU request to TA for providing the secret key 𝑆 for
vehicle 𝑖𝑑 i.e. RSU request to TA for 𝑆𝑖𝑑. At this stage, we generate a secure hash function as
ℍ: {0,1}∗
× 𝐺1 → 𝐺1. With the help of this, the partial keys can be generated as in equation 8.
𝑄𝑖𝑑 = ℍ(𝑖𝑑, 𝑄𝑅𝑆𝑈) (8)
Based on the secret key, partial public key and secret key of RSU, a certificate is delivered to the
vehicle as in equation 9.
9. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
109
𝐶 = 𝑄𝑖𝑑𝑆𝑖𝑑ℛ𝑅𝑆𝑈 (9)
Thus, the partial private key can be derived as in equation 10.
𝑅𝑢 = 𝑅𝑅𝑆𝑈𝑄𝑖𝑑 (10)
Now, the public key can be presented as 〈𝑄𝑣,𝑖𝑑〉 and the private key set is given as 〈ℛ𝑣,ℛ𝑢〉
I.b. Authentication
In this process, we present authentication process for the vehicle. We assume that at a time 𝑡, the
vehicle starts using the road message service. The partial public key and time combine as in
equation 11.
𝑄1 = 𝑄𝑣𝑡 = ℛ𝑣𝑃𝑡 (11)
Moreover, a cyclic group 𝐺2 is generated with the prime order 𝑠 and the bilinear operator is given
as Ϝ
̂:𝐺1 × 𝐺1 → 𝐺2. Here, the intermediate value of partial public key can be obtained as in
equation 12.
𝑄𝑖𝑑 = ℍ(𝑖𝑑, 𝑄𝑅𝑆𝑈) (12)
Where 𝑖𝑑 is the vehicle id, and 𝑄𝑅𝑆𝑈 is the public key of RSU which are already known to the
vehicle. Along with this, we generate two important parameters 𝛼 and 𝛽for authentication as in
equation 13.
𝛼 = Ϝ
̂(𝑄𝑅𝑆𝑈,𝑄𝑖𝑑)
𝛽 = ℎ(𝑡 ∥ 𝛼, ℛ𝑖𝑑)
(13)
Where ℛ𝑖𝑑 is the secret key of vehicle which is allocated during initialization phase. Based on
these parameters, we generate the final signature as in equation 14.
𝑈 = ℛ𝑢 + 𝑄𝑖𝑑ℛ𝑣𝑡𝑣 (14)
From here, the vehicle sends the authentication request as 〈𝑈, 𝑖𝑑, 𝑡, 𝑣〉 and RSU performs the
verification process whether 𝛼 =
Ϝ
̂(𝑃,𝑈)
Ϝ
̂(𝑄1,𝑄𝑖𝑑)𝑣. In order to deliver the message, the following
verification condition must be satisfied as in equation 15.
Ϝ
̂(𝑃, 𝑈)
Ϝ
̂(𝑄1, 𝑄𝑖𝑑)𝑣
= Ϝ
̂(𝑃, 𝑄𝑖𝑑, ℛ𝑅𝑆𝑈) = Ϝ
̂(ℛ𝑅𝑆𝑈, 𝑃, 𝑄𝑖𝑑) = Ϝ
̂(ℛ𝑅𝑆𝑈, 𝑄𝑖𝑑) (15)
After satisfying this condition, the authentication phase is completed.
I.c. Key Distribution
In this phase, the generated group keys are distributed to each legitimate vehicle. This key
assignment is done by TA. Let us assume that the secret ℰ ∈ 𝒵𝓅
∗
is randomly selected by TA, and
then RSU computes as in equation 16.
𝕎 = ℰ𝑄𝑣𝑇 (16)
10. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
110
𝔽 = ℎ(𝕎 ∥ 𝑣, ℛ𝑢)
Here RSU is capable to generate the partial public ℛ𝑢as described before. Now,the 〈𝕎,𝔽, 𝑇〉
iscomputed by RSU and transmitted to vehicle. Here our aim is to combine the secret key with
the current time stamp 𝑇. In this process, the vehicle compares the value of 𝐹 with stored values
and if it is found valid then secret is derived as in equation 17.
𝑁 = 𝕎𝑇−1
ℛ𝑣
−1
= 𝑄𝑣𝑇ℰ𝑇−1
ℛ𝑣
−1
= ℰ𝑃
(17)
Hence, the final group can be achieved as in equation 18.
𝐺𝑘 = ℎ(𝑁) = ℎ(ℰ𝑝) (18)
(II) Data encryption and decryption
This phase presents the data encryption and decryption approach to provide secure data
exchange. According to this process, the first task is to secure the data using encryption key
which is used by receiver to encrypt and decrypt the data by sender and receiver. This phase uses
the state value(𝑠𝑡𝑎𝑡𝑒) of receiver vehicle as an encryption key. To maintain the location privacy,
this methodology uses hash state value before transmitting to the corresponding vehicle.
II.a. Key Generation
This complete process of data encryption and process of key generation is shown in figure 4.
Fig 4: Data encryption process and key generation
As shown in Figure 4, complete process of key generation is completed by using following steps:
(a) The sending vehicle 𝑣𝑠 sends the message request (𝑀𝑒𝑠𝑠𝑎𝑔𝑒𝑟𝑒𝑞) of receiver vehicle
𝑣𝑟request to the trusted authority where public key is used for encrypting the message
request. This is expressed as in equation 19.
𝐶𝑖𝑝ℎ𝑒𝑟𝑉𝑠𝑇𝐴 = 𝐸𝑛𝑐𝑟𝑇𝐴𝑝𝑘
(𝕊𝐼𝑑 + ℝ𝐼𝐷) (19)
11. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
111
As given in eq. 15, the public key of TA is used for encrypting the sender vehicle id 𝕊𝐼𝑑
and receiver vehicle ℝ𝐼𝐷
(b) The trusted authority decrypts the cipher text of eq. (15) using its own secret key as in
equation 20.
𝐷𝑒𝑐𝑀𝑒𝑠𝑠𝑎𝑔𝑒 = 𝐷𝑒𝑐𝑟𝑇𝐴𝑠𝑘
(𝐶𝑖𝑝ℎ𝑒𝑟𝑉𝑠𝑇𝐴) (20)
(c) This decryption process provides the state values of receiver vehicle and hashes these
values. Hash values are considered as the key for sender vehicle to encrypt the data. This
is denoted as in equation 21.
𝑘𝑒𝑦 = 𝐻𝑎𝑠ℎ(𝑠𝑡𝑎𝑡𝑒𝑟1, 𝑠𝑡𝑎𝑡𝑒𝑟2, … . 𝑠𝑡𝑎𝑡𝑒𝑟𝑁) (21)
(d) TA uses sender public key to encrypt the key, the encrypted data and time stamps are
send to the sender vehicles from TA. The final received message from TA is denoted as
in equation 22.
𝐶𝑖𝑝ℎ𝑒𝑟𝑇𝐴𝑉𝑠
= 𝐸𝑛𝑐𝑟𝑉𝑠𝑝𝑘
(𝐼𝐷 + 𝑘𝑒𝑦 + 𝑇𝑖𝑚𝑒𝑠𝑡𝑎𝑚𝑝) (22)
(e) After receiving the data from (18) sender vehicle uses own private key to decrypt this
data and gets the real key for further encryption along with the time stamps. This is
computed as in equation 23.
𝑇𝑖𝑚𝑒𝑠𝑡𝑎𝑚𝑝 + 𝑘𝑒𝑦 = 𝐷𝑒𝑐𝑟𝑉𝑠𝑝𝑘
(𝐶𝑖𝑝ℎ𝑒𝑟𝑇𝐴𝑉𝑠
) (23)
II.b. Data encryption
Before transmitting the data from sender vehicle to receiver vehicle we encrypt the data using
time stamp and secret key to provide the data security during transmission. This encryption
format is given as in equation 24.
𝑀𝑒𝑠𝑠𝑎𝑔𝑒 = 𝑇𝑖𝑚𝑒𝑠𝑡𝑎𝑚𝑝 + ℝ𝐼𝐷 + 𝐸𝑛𝑐𝑟𝑘𝑒𝑦(𝐼𝐷 + 𝑑𝑎𝑡𝑎) (24)
This encrypted data is transmitted to the receiver vehicle where data decryption is performed
through repeal mechanism.
II.c. Data Decryption
The receiver vehicle receives the encrypted data packet as cipher text along with the time stamp.
At the receiver end, we perform the data decryption to achieve the original data. The actual
process of data decryption is shown in figure 5.
12. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
112
Fig 5. Data decryption process
The current time stamp is greater than the previous time stamp hence we use decryption key as its
previous time stamp history. Figure 4 shows the decryption process with required parameters.
This decryption is performed using following steps:
(a) Receiver vehicle (𝑣𝑟) sends the received cipher text to TA about status value from where
it receives the cipher text as in equation 25.
𝐶𝑖𝑝ℎ𝑒𝑟𝑉𝑟𝑇𝐴 = 𝐸𝑛𝑐𝑟𝑇𝐴𝑝𝑘
(ℝ𝐼𝐷 + 𝑇𝑖𝑚𝑒𝑠𝑡𝑎𝑚𝑝) (25)
(b) After receiving the cipher text, the TA decrypts the data using its own secret key and the
decrypted message is achieved as in equation 26.
𝐷𝑒𝑐𝑀𝑒𝑠𝑠𝑎𝑔𝑒 = 𝐷𝑒𝑐𝑟𝑇𝐴𝑠𝑘
(𝐶𝑖𝑝ℎ𝑒𝑟𝑉𝑠𝑇𝐴) (26)
(c) In the next step, historical state values are achieved and hashed to generate the key for
further encryption as
𝑘𝑒𝑦 = 𝐻𝑎𝑠ℎ(𝑠𝑡𝑎𝑡𝑒𝑟1, 𝑠𝑡𝑎𝑡𝑒𝑟2, … . 𝑠𝑡𝑎𝑡𝑒𝑟𝑁) . (27)
(d) Now the pubic key of receiver vehicle is used to encrypt the receiver ID, key and its time
stamps as in equation 28.
𝐶𝑖𝑝ℎ𝑒𝑟𝑇𝐴𝑉𝑟
= 𝐸𝑛𝑐𝑟𝑉𝑟𝑝𝑘
(ℝ𝐼𝐷 + 𝑘𝑒𝑦 + 𝑇𝑖𝑚𝑒𝑠𝑡𝑎𝑚𝑝) (28)
(e) In next step, the 𝑣𝑟 uses private key to decrypt the cipher text and achieves the real key
for decryption as in equation 29.
𝑇𝑖𝑚𝑒𝑠𝑡𝑎𝑚𝑝 + 𝑘𝑒𝑦 = 𝐷𝑒𝑐𝑟𝑉𝑟𝑝𝑘
(𝐶𝑖𝑝ℎ𝑒𝑟𝑇𝐴𝑉𝑟
) (29)
(f) Finally, this key is used for decrypting the cipher text and original message is received as
in equation 30.
𝐷𝑒𝑐𝐷𝑎𝑡𝑎 = 𝐷𝑒𝑐𝑘𝑒𝑦(𝑀𝑒𝑠𝑠𝑎𝑔𝑒) (30)
13. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
113
4. RESULTS AND DISCUSSION
This section shows the experimental analysis using proposed approach. The obtained
performance is compared with the existing techniques. This research work is mainly focused to
ensure the security of VANET.
4.1. Achieved Security Issues
These proposed works achieve the following security issues such as:
Authentication: in this work, authentication is an important task to avoid the attacker
nodes to join the network. Later, Hash values are obtained from the key and an
authentication process is performed after achieving the RREP message from the
communicating node.
Message confidentiality: this work applies symmetric cryptography where public and
private secrete keys are generated from the RSA key generation method.
Location privacy and anonymity: this security aspect is obtained by generating the
Hash of the location of the vehicle and vehicle ID.
4.2. Performance Measurement Parameters
This section presents the experimental analysis using proposed approach. The performance of
proposed approach is measured in terms of packet loss, throughput, packet delivery, end-to-end
delay, average message delay and message loss ratio. The simulation parameters are given in
table 2.
Table 2. Simulation Parameters
Simulation Parameter Used Value
Simulation Area 1500m x1500m
Simulation Time 100s
Data Traffic CBR
Route protocol AODV
Mobility Random Waypoint
Channel bandwidth 6 Mbps
According to table 2, proposed approach is considered total of 100 nodes which are deployed in
the 1500m x1500m area. The vehicles follow the Random Waypoint model with the constant bit
rate data traffic. Total 10 nodes are considered as faulty node which is responsible for various
attacks such as Denial-of-service, black hole and badmouthing etc. In this work, we measure the
performance of proposed approach under various attacks to show the robust performance. The
obtained performance is measured using following performance metrics:
(a) Packet Loss Ratio: is measured by taking the ratio of the dropped packets which are
generated from the source but not delivered to the destination as in equation 31.
𝑃𝐿𝑅 =
𝑃𝑆𝑒𝑛𝑡 − 𝑃𝑟𝑒𝑐𝑒𝑖𝑣𝑒𝑑
𝑃𝑆𝑒𝑛𝑡
× 100 (31)
14. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
114
Where 𝑃𝑆𝑒𝑛𝑡 denotes the number of sent data packets, 𝑃𝑟𝑒𝑐𝑒𝑖𝑣𝑒𝑑 denotes the received
number of data packets.
(b) Throughput: is measured by computing the total of bytes received successfully in one
communication session. This is computed as in equation 32.
𝑇ℎ𝑟𝑜𝑢𝑔ℎ𝑝𝑢𝑡 =
𝑃𝑆𝑒𝑛𝑡 − 𝑃𝑟𝑒𝑐𝑒𝑖𝑣𝑒𝑑
𝑃𝑆𝑒𝑛𝑡
× 100 (32)
(c) Packet delivery ratio: this is measured by taking the ratio of delivered packet to the
destination which are generated from source nodes. It can be calculated as in equation 33.
𝑃𝐷𝑅 =
𝑃𝑟𝑒𝑐𝑒𝑖𝑣𝑒𝑑
𝑃𝑆𝑒𝑛𝑡
× 100 (33)
(d) Average end-to-end delay: this is the time take by the data packet to reach to the
destination. During this phase, the route discovery, data retransmission and propagation
time etc. are considered. This is computed as in equation 34.
𝐷𝑒𝑙𝑎𝑦 =
∑ (𝐷𝑖 − 𝑠𝑖)
𝑃𝑠𝑢𝑐𝑐𝑒𝑠
𝑖=1
𝑃𝑆𝑢𝑐𝑐𝑒𝑠
× 100 (34)
Where 𝐷𝑖 denotes the 𝑖𝑡ℎ
packet receiving time, 𝑠𝑖 denotes the sending time for 𝑖𝑡ℎ
packet
and 𝑃𝑠𝑢𝑐𝑐𝑒𝑠 denotes the number of successfully transmitted packets.
(e) Average message delay: this is the measurement of total delay occurred to deliver the
message from one source to destination. This can be computed as in equation 35.
𝐴𝑣𝑒𝑟𝑎𝑔𝑒𝐷𝑒𝑙𝑎𝑦 =
∑ ∑ (𝑇𝑠𝑖𝑔𝑛
𝑖_𝑚
+ 𝑇𝑡𝑟𝑎𝑛𝑠
𝑖_𝑚_𝑅𝑆𝑈
+ 𝑇𝑣𝑒𝑟𝑖𝑓𝑦
𝑖_𝑚_𝑅𝑆𝑈
)
𝑀_𝑠𝑒𝑛𝑡
𝑚=1
𝑁𝑣
𝑖
∑ 𝑀𝑠𝑒𝑛𝑡
𝑖
𝑁𝑣
𝑖=1
(35)
Where 𝑁𝑣 is the total number of vehicles, 𝑀𝑠𝑒𝑛𝑡
𝑖
is the total number of packet sent by vehicle
𝑖,𝑇𝑠𝑖𝑔𝑛
𝑖_𝑚
is the time required to sign a message by vehicle, 𝑇𝑡𝑟𝑎𝑛𝑠
𝑖_𝑚_𝑅𝑆𝑈
is the time require to transmit
the message 𝑚 to RSU and 𝑇𝑣𝑒𝑟𝑖𝑓𝑦
𝑖_𝑚_𝑅𝑆𝑈
is the time required for authentication. Similarly, we
measure the message loss ratio as in equation 36.
𝑀𝑒𝑠𝑠𝑎𝑔𝑒𝑙𝑜𝑠𝑠𝑟𝑎𝑡𝑖𝑜 =
∑ 𝑀𝑠𝑒𝑛𝑡
𝑖
𝑁𝑣
𝑖=1 − ∑ 𝑀𝑟𝑒𝑐
𝑟
𝑅𝑆𝑈𝑛
𝑟=1
𝑅𝑆𝑈𝑛 ∗ ∑ 𝑀𝑠𝑒𝑛𝑡
𝑖
𝑁𝑣
𝑖=1
(36)
4.3. Comparative Performance Analysis
This section shows the comparative experimental analysis where, performance of the proposed
approach is compared with the existing techniques by varying the number of vehicles, speed and
malicious nodes in the network.
15. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
115
4.3.1 Varying vehicles with fixed Speed
In this phase, performance is evaluated by varying the number of vehicles ranging from 20 to 100
with 10 numbers of malicious nodes present in the network and the speed of vehicles is fixed in
the range of 70-72kmph. First, it computes the packet loss ratio for this experimental setup and
compared the performance with AOMDV [25] and SE-AOMDV [25] protocols.
a. Packet loss ratio: the comparative performance in terms of packet loss ratio is shown in
figure6. According to this experiment, the existing protocols AOMDV [25] and SE-
AOMDV [25] [25] drop the packet due to malicious nodes in the network. However, the
existing protocols suffer from the malicious nodes and drop the packets, whereas,
proposed approach shows robust performance.
Fig 6. Packet Loss ratio performance
The average packet loss rate is obtained as 1.26%, 1.68% and 0.84% using AOMDV [25],
SE-AOMDV [25], and Proposed approach. This experiment shows that the proposed approach
achieves 0.66% and 0.49% improvement when compared with the AOMDV [25] and
SE-AOMDV [25] methods.
b. Throughput performance: in the next phase of the proposed approach, it measures the
throughput performance for same experiment setup. The obtained performance is
depicted in figure 7. The more number of vehicles creates issues in link stability and
frequent selection of relay nodes creates a complex environment for communication
leading towards the decreased throughput, whereas, proposed approach helps to main the
network reliability and reduces packet drops.
16. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
116
Fig 7. Througput performance
The average network throughput performance is reported as 341, 338.875 and 353.375 using
AOMDV [25], SE-AOMDV [25] and proposed approach.
c. End-to-End Delay: the comparative performance in terms of end-to-end ratio is shown
in figure8. Similarly, we compute the end-to-end delay performance for varied number of
vehicles for the considered experimental scenario.
Fig 8. End-to-End delay performance
This experiment shows that the average end-to-end delay is obtained as 4.28ms, 1.56ms, and
1.1ms using AOMDV [25], SE-AOMDV [25] and proposed approach.
4.3.2 Varying speed with fixed vehicles
In this sub-section, experimental analysis considers 40 vehicles with a varied speed ranging from
5-30ms. The experimental study presented in AOMDV [25], SE-AOMDV [25]. This experiment
shows that the increased vehicle speed causes packet loss.
17. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
117
a. Packet loss ratio: first, it computes the packet loss ratio and compares the achieved
performance with existing techniques. The obtained packet loss performance is depicted
in figure 9.
Fig 9. Packet Loss Performance
The proposed approach takes advantage of link connectivity and efficient relay node
selection to reduce the packet loss. According to this experiment the average packet loss
is obtained as 1.51%, 1.42% and 0.83% using AOMDV, SE-AOMDV and proposed
approach,
b. Throughput performance: similarly, it measures the system throughput for varied
speed of vehicle and compared the obtained performance with existing technique. The
achieved performance is depicted in figure 10.
Fig 10. Network Throughput Performance
According to this experiment the average Network Throughput Performance is obtained
as 1.27%, 1.38% and 1.62% using AOMDV, SE-AOMDV and proposed approach,
c. End-to-End delay: later, experimental analysis has been done for end-to-end delay
computation. The proposed approach uses light weight computations and less
18. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
118
computational cost helps to achieve the less delay. The obtained performance is
compared as depicted in figure 11.
Fig 11. End-to-End delay performance
According to this experiment, the average end-to-end delay performance is obtained as 4.11ms,
0.71ms, and 0.36ms using AOMDV, SE-AOMDV, and proposed approach.
d. Packet delivery rate: in order to show the robust performance of proposed approach we
extend the experimental study with SUMO mobility model where 100-900 vehicles are
considered. The performance is measured in terms of average packet delivery and
average delay for varied number of vehicles. Figure 12 shows a comparative performance
in terms of packet delivery. As discussed before, the proposed approach archives better
throughput due to link connectivity and optimal relay selection.
Fig 12. Packet delivery performance
Figure 11 shows a comparative performance where the packet delivery performance is
obtained as 0.64, 0.71, 0.81, 0.86, and 0.91 using AMDF [32], PPRR [33], DAPP [31],
SASMF [34] and Proposed approaches.
19. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
119
5. CONCLUSION
This proposed approach focused on improving the VANET by incorporating key management
and data cryptography process. According to the proposed approach first, it introduces a novel
key management scheme where any new upcoming vehicle is registered with Trusted Authority
(TA) and authenticated to perform the communication. This helps to maintain security and
reduces outsider attacks. In the next phase, introduced Elliptic curve cryptography scheme to
encrypt and decrypt the data during vehicle communication. Hence, the proposed approach
provides better security. Moreover, the proposed approach uses lightweight computations which
help to reduce the computational overhead of the network. The comparative study is carried out
which shows the improved performance using proposed approach.
CONFLICTS OF INTEREST
The authors declare no conflict of interest.
REFERENCES
[01] Liu, J., Wan, J., Wang, Q., Deng, P., Zhou, K., &Qiao, Y. (2015). A survey on position-based routing
for vehicular ad hoc networks. Telecommunication Systems, 62(1), 15–30. doi:10.1007/s11235-015-
9979-7.
[02] Tomar, R., Prateek, M., &Sastry, G. H. (2016). Vehicular adhoc network (VANET)-an
introduction. International Journal of Control Theory and Applications, 9(18), 8883-8888.
[03] Zhang, W., Xiao, X., Wang, J., & Lu, P. (2018, November). An improved AODV routing protocol
based on social relationship mining for VANET. In Proceedings of the 4th International Conference
on Communication and Information Processing(pp. 217-221). ACM.
[04] Yang, X., Sun, Z., Miao, Y., Wang, N., Kang, S., Wang, Y., & Yang, Y. (2015, March). Performance
Optimisation for DSDV in VANETs. In 2015 17th UKSim-AMSS International Conference on
Modelling and Simulation (UKSim) (pp. 514-519). IEEE.
[05] Abdelgadir, M., Saeed, R. A., &Babiker, A. (2017). Mobility routing model for vehicular Ad-Hoc
networks (VANETS), smart city scenarios. Vehicular Communications, 9, 154-161.
[06] Kadadha, M., Otrok, H., Barada, H., Al-Qutayri, M., & Al-Hammadi, Y. (2017, June). A street-
centric QoS-OLSR protocol for urban vehicular ad hoc networks. In 2017 13th International Wireless
Communications and Mobile Computing Conference (IWCMC) (pp. 1477-1482). IEEE.
[07] Silva, R., Lopes, H. S., & Godoy, W. (2013, September). A heuristic algorithm based on ant colony
optimization for multi-objective routing in vehicle ad hoc networks. In 2013 BRICS Congress on
Computational Intelligence and 11th Brazilian Congress on Computational Intelligence (pp. 435-
440). IEEE.
[08] Taherkhani, N., & Pierre, S. (2012, October). Congestion control in vehicular ad hoc networks using
meta-heuristic techniques. In Proceedings of the second ACM international symposium on Design
and analysis of intelligent vehicular networks and applications (pp. 47-54). ACM.
[09] Aadil, F., Bajwa, K. B., Khan, S., Chaudary, N. M., &Akram, A. (2016). CACONET: ant colony
optimization (ACO) based clustering algorithm for VANET. PloS one, 11(5), e0154080.
[10] Jindal, V., &Bedi, P. (2018). An improved hybrid ant particle optimization (IHAPO) algorithm for
reducing travel time in VANETs. Applied Soft Computing, 64, 526-535.
[11] Li, G., Ma, M., Liu, C., &Shu, Y. (2017). Adaptive fuzzy multiple attribute decision routing in
VANETs. International Journal of Communication Systems, 30(4), e3014.
[12] Bagherlou, H., &Ghaffari, A. (2018). A routing protocol for vehicular ad hoc networks using
simulated annealing algorithm and neural networks. The Journal of Supercomputing, 1-25.
[13] Sampigethaya, K., Huang, L., Li, M., Poovendran, R., Matsuura, K., &Sezaki, K. (2005).
CARAVAN: Providing location privacy for VANET. Washington Univ Seattle Dept of Electrical
Engineering.
[14] Sampigethaya, K., Li, M., Huang, L., &Poovendran, R. (2007). AMOEBA: Robust location privacy
scheme for VANET. IEEE Journal on Selected Areas in communications, 25(8), 1569-1589.
20. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
120
[15] Wasef, A., &Shen, X. S. (2010). REP: Location privacy for VANETs using random encryption
periods. Mobile Networks and Applications, 15(1), 172-185.
[16] Chim, T. W., Yiu, S. M., Hui, L. C., & Li, V. O. (2012). VSPN: VANET-based secure and privacy-
preserving navigation. IEEE transactions on computers, 63(2), 510-524.
[17] Rahbari, M., &Jamali, M. A. J. (2011). Efficient detection of Sybil attack based on cryptography in
VANET. arXiv preprint arXiv:1112.2257.
[18] Mejri, M. N., Achir, N., &Hamdi, M. (2016, January). A new group Diffie-Hellman key generation
proposal for secure VANET communications. In 2016 13th IEEE Annual Consumer Communications
& Networking Conference (CCNC) (pp. 992-995). IEEE.
[19] Lu, H., Li, J., &Guizani, M. (2012, January). A novel ID-based authentication framework with
adaptive privacy preservation for VANETs. In 2012 Computing, Communications and Applications
Conference (pp. 345-350). IEEE.
[20] Eiza, M. H., Owens, T., & Ni, Q. (2015). Secure and robust multi-constrained QoS aware routing
algorithm for VANETs. IEEE Transactions on Dependable and Secure Computing, 13(1), 32-45.
[21] Wang, F., Xu, Y., Zhang, H., Zhang, Y., & Zhu, L. (2015). 2FLIP: A two-factor lightweight privacy-
preserving authentication scheme for VANET. IEEE Transactions on Vehicular Technology, 65(2),
896-911.
[22] Liu, Y., He, Z., Zhao, S., & Wang, L. (2016). An efficient anonymous authentication protocol using
batch operations for VANETs. Multimedia Tools and Applications, 75(24), 17689-17709.
[23] Wang, J., Zhang, Y., Wang, Y., &Gu, X. (2016). RPRep: A robust and privacy-preserving reputation
management scheme for pseudonym-enabled VANETs. International Journal of Distributed Sensor
Networks, 12(3), 6138251.
[24] Ahmed, S., Rehman, M. U., Ishtiaq, A., Khan, S., Ali, A., & Begum, S. (2018). VANSec: Attack-
resistant VANET security algorithm in terms of trust computation error and normalized routing
overhead. Journal of Sensors, 2018.
[25] Makhlouf, A. M., &Guizani, M. (2019). SE-AOMDV: secure and efficient AOMDV routing protocol
for vehicular communications. International Journal of Information Security, 1-12.
[26] Manickam, P., Shankar, K., Perumal, E., Ilayaraja, M., & Kumar, K. S. (2019). Secure Data
Transmission Through Reliable Vehicles in VANET Using Optimal Lightweight Cryptography.
In Cybersecurity and Secure Information Systems (pp. 193-204). Springer, Cham.
[27] Zhang, H., Bochem, A., Sun, X., &Hogrefe, D. (2018, June). A security aware fuzzy enhanced
reliable ant colony optimization routing in vehicular ad hoc networks. In 2018 IEEE Intelligent
Vehicles Symposium (IV) (pp. 1071-1078). IEEE.
[28] Tan, H., Choi, D., Kim, P., Pan, S., & Chung, I. (2018). Secure certificateless authentication and road
message dissemination protocol in VANETs. Wireless Communications and Mobile
Computing, 2018.
[29] Islam, S. H., Obaidat, M. S., Vijayakumar, P., Abdulhay, E., Li, F., & Reddy, M. K. C. (2018). A
robust and efficient password-based conditional privacy preserving authentication and group-key
agreement protocol for VANETs. Future Generation Computer Systems, 84, 216-227.
[30] Lu, Z., Liu, W., Wang, Q., Qu, G., & Liu, Z. (2018). A privacy-preserving trust model based on
blockchain for vanets. IEEE Access, 6, 45655-45664.
[31] Tang D, Ren J (2016) A novel delay-aware and privacy-preserving data-forwarding scheme for urban
sensing network. IEEE TransVehTechnol 65(4):2578–2588
[32] Xia Y, Chen W, Liu X, Zhang L, Li X, Xiang Y (2017) Adaptive multimedia data forwarding for
privacy preservation in vehicular ad-hoc networks. IEEE Trans IntellTranspSyst 18(10):2629– 2641
[33] Rabieh K, Mahmoud MMEA, Younis M (2017) Privacy preserving route reporting schemes for
traffic management systems. In: IEEE international conference on communications, pp 7286–7291.
[34] Yang, P., Deng, L., Yang, J., & Yan, J. (2019). SASMF: Socially Aware Security Message
Forwarding Mechanism in VANETs. Mobile Networks and Applications.
21. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
121
AUTHORS
Mr. Mahabaleshwar Kabbur, research scholar of REVA University. He has obtained his Master’s degree
in Computer Applications (MCA) and research degree in Master of Philosophy in
computer science (M.Phil). He has 14 years of experience in teaching and 03 years of
experience in research. He is pursuing his doctoral research on “Security on Wireless
networking for VANET”. He is published 12 research articles in UGC approved
international journals and presented 15 articles in various National and International
conferences. His specializations and research interests include Network Security,
Content-Based Image Retrieval Techniques & IoT.
Dr. Anand R, Assistant Professor in School of Computer Science & Applications REVA University holds
doctoral degree in Computer Science from SCSVMV University, Tamil Nadu. He has
completed B. Sc (Computer Science) from Madurai Kamaraj University, Tamil Nadu
and M.Sc (Computer Science) from Manonmanium Sundarnar University, Tamil Nadu.
He has 18 Years of experience in teaching and 10 years of experience in research. He has
published 11 research articles in various International / National Journals and
conferences and also his 02 Patents got published on topic “Anti-Intrusion Device for
Computer Network” Application No: 201941013025 and “Vital Sign Monitoring
System” Application Number Application No: 201941030703. His research areas include Data mining,
Software engineering, Cloud security and Cryptography.
Dr. V. ARUL KUMAR, Assistant Professor in School of Computer Science &
Applications REVA University holds doctoral degree in Computer Science from
Bharathidasan University-Tamil Nadu. He has completed B. Sc (Applied Sciences –
Computer Technology), M.Sc (Applied Sciences – Information Technology) from
K.S.R College of Technology and M.Phil in Computer Science from Bharathidasan
University, Tamil Nadu. He has 6 Years of experience in teaching and 8 years of
experience in research. He has qualified in State Eligibility Test (SET) conducted by
Mother Teresa Women's University. He has published 24 research articles in various
International / National Journals and conferences. His research areas includes data Mining, cloud security
and cryptography.