459 research outputs found

    Analysis of Behavioral Characteristics of Multiple Blackhole Attacks with TCP and UDP Connections in Mobile ADHOC Networks based on Machine Learning Algorithms

    Get PDF
    In Mobile Adhoc Networks (MANET’s), a suit of nodes which are under mobility work together to transmit data packets in a multiple-hop manner without relying on any fixed or centralized infrastructure. A significant obstacle in managing these networks is identifying malicious nodes, or "black holes". To detect black holes, we proposed a method involves broadcasting a Cseq to the neighboring nodes and awaiting the node's response is utilized. This Network is simulated with 25 number of nodes connected with TCP connection and observed the different behavioural characteristics of nodes. Then the connections are changed to UDP and observed the characteristics. Then characteristics are analyzed with different machine learning algorithms. The network is simulated in NS2 environment

    AODV-based Defense Mechanism for Mitigating Blackhole Attacks in MANET

    Get PDF
    Mobile Ad hoc Networks (MANETs) are decentralized and self-configuring networks composed of mobile devices that communicate without a fixed infrastructure. However, the open nature of MANETs makes them vulnerable to various security threats, including blackhole attacks, where malicious nodes attract and discard network traffic without forwarding it to its intended destination. Mitigating blackhole attacks is crucial to ensure the reliability and security of communication in MANETs. This paper focuses on the development and evaluation of AODV (Ad hoc On-Demand Distance Vector)-based defence mechanisms for effectively mitigating blackhole attacks in MANETs, while simultaneously addressing energy efficiency and environmental sustainability. AODV is a widely used routing protocol in MANETs due to its on-demand nature and low overhead. However, it lacks built-in security mechanisms, making it susceptible to attacks. We incorporate energyaware route selection, solar-powered routing, collaborative energy sharing, energy-efficient intrusion detection, green routing optimization, and energy harvesting from environmental sources. By considering energy consumption and environmental factors in the route selection process, our defense mechanism not only enhances the security of the network but also contributes to energy conservation and reduced environmental impact. To evaluate the effectiveness of the proposed defence mechanisms, extensive simulations and performance analyses are conducted using network simulation tools. Through simulation-based evaluations, we demonstrate the effectiveness of our approach in achieving robust blackhole attack mitigation while extending the network’s lifetime and minimizing its carbon footprint. Our research offers valuable insights into the development of energy-efficient and environmentally sustainable solutions for securing MANETs in the face of evolving security threats

    ENHANCED ON-DEMAND DISTANCE VECTOR ROUTING PROTOCOL TO PREVENT BLACKHOLE ATTACK IN MANET

    Get PDF
    Wireless networks are becoming increasingly popular. Mobile ad hoc networks are one category among the different types of wireless networks that transmit packets from the sender node to the receiver node without the use of a base station or infrastructure, as the nodes serve as both hosts and routers. These networks are referred to as mobile because they are movable. MANET is an ad-hoc network that can change positions at any time, and nodes can join or leave at any moment, making it vulnerable to attacks such as Blackhole. Existing solutions, in some ways, led to more memory space consumption, while others led to an overhead. This research proposes an Enhanced On-demand Distance Vector (AODV) routing protocol to prevent Blackhole attacks on MANETs using Diffie Hellman and Message Digest 5 (DHMD), implemented using Network Simulator 2 (NS2). The performance of the proposed protocol was evaluated using the following parameters: Packet Delivery Ratio, throughput, End to End (E2E) Delay, and routing overhead. It was concluded that DHMD has reduced network overhead as it resulted to 23% while AODV resulted at 38% and memory consumption for DHMD gave 0.52ms compared to AODV that gave 0.81ms due to Blackhole prevention. This research will help to mitigate the effect of blackhole attacks in a network and increase network performance by reducing overhead and memory consumption

    A consensus-based approach to reputational routing in multi-hop networks

    Get PDF
    International audienceWhen it comes to the security of the Internet of Things (IoT), securing their communications is paramount. In multi-hop networks, nodes relay information amongst themselves, opening the data up to tampering by an intermediate device. To detect and avoid such malicious entities, we grant nodes the ability to analyse their neighbours behaviour. Through the use of consensus-based validation, based upon blockchain's miners, all nodes can agree on the trustworthiness of all devices in the network. By expressing this through a node's reputation, it is possible to identify malicious devices and isolate them from network activities. By incorporating this metric into a multi-hop routing protocol such as AODV, we can influence the path selection process. Instead of defining the best route based upon overall length, we can chose the most reputable path available, thus traversing trustworthy devices. By performing extensive analyses through multiple simulated scenarios, we can identify a decrease in packet drop rates compared to AODV by ≈ 48% and ≈ 38% when subjected to black-hole attacks with 30 and 100 node networks respectively. Furthermore, by subjecting our system to varying degrees of grey-holes, we can confirm its adaptability to different types of threats

    Routing protocol for V2X communications for Urban VANETs

    Get PDF
    Intelligent Transportation Systems (ITSs) have been attracting tremendous attention in both academia and industry due to emerging applications that pave the way towards safer enjoyable journeys and inclusive digital partnerships. Undoubtedly, these ITS applications will demand robust routing protocols that not only focus on Inter-Vehicle Communications but also on providing fast, reliable, and secure access to the infrastructure. This thesis aims mainly to introduce the challenges of data packets routing through urban environment using the help of infrastructure. Broadcasting transmission is an essential operational technique that serves a broad range of applications which demand different restrictive QoS provisioning levels. Although broadcast communication has been investigated widely in highway vehicular networks, it is undoubtedly still a challenge in the urban environment due to the obstacles, such as high buildings. In this thesis, the Road-Topology based Broadcast Protocol (RTBP) is proposed, a distance and contention-based forwarding scheme suitable for both urban and highway vehicular environments. RTBP aims at assigning the highest forwarding priority to a vehicle, called a mobile repeater, having the greatest capability to send the packet in multiple directions. In this way, RTBP effectively reduces the number of competing vehicles and minimises the number of hops required to retransmit the broadcast packets around the intersections to cover the targeted area. By investigating the RTBP under realistic urban scenarios against well-known broadcast protocols, eMDR and TAF, that are dedicated to retransmitting the packets around intersections, the results showed the superiority of the RTBP in delivering the most critical warning information for 90% of vehicles with significantly lower delay of 58% and 70% compared to eMDR and TAF. The validation of this performance was clear when the increase in the number of vehicles. Secondly, a Fast and Reliable Hybrid routing (FRHR) protocol is introduced for efficient infrastructure access which is capable of handling efficient vehicle to vehicle communications. Interface to infrastructure is provided by carefully placed RoadSide Units (RSUs) which broadcast beacons in a multi-hop fashion in constrained areas. This enables vehicles proactively to maintain fresh minimum-delay routes to other RSUs while reactively discovering routes to nearby vehicles. The proposed protocol utilizes RSUs connected to the wired backbone network to relay packets toward remote vehicles. A vehicle selects an RSU to register with according to the expected mean delay instead of the device’s remoteness. The FRHR performance is evaluated against established infrastructure routing protocols, Trafroute, IGSR and RBVT-R that are dedicated to for urban environment, the results showed an improvement of 20% to 33% in terms of packet delivery ratio and lower latency particularly in sparse networks due to its rapid response to changes in network connectivity. Thirdly, focusing on increasing FRHR’s capability to provide more stable and durable routes to support the QoS requirements of expected wide-range ITS applications on the urban environment, a new route selection mechanism is introduced, aiming at selecting highly connected crossroads. The new protocol is called, Stable Infrastructure Routing Protocol (SIRP). Intensive simulation results showed that SIRP offers low end-to-end delay and high delivery ratio with varying traffic density, while resolving the problem of frequent link failures

    G-3MRP: a game-theoretical multimedia multimetric map-aware routing1 protocol for vehicular ad hoc networks

    Get PDF
    © 2022 Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/The particular requirements and special features of vehicular ad hoc networks (VANETs) (e.g., special mo8 bility patterns, short link lifetimes, rapid topology changes) involve challenges for the research community. 9 One of these challenges is the development of new routing protocols specially designed for VANETs. In 10 this paper, we present a novel game-theoretical approach of a multimetric geographical routing protocol for 11 VANETs to forward video-reporting messages in smart cities. Game theory is considered a very interesting 12 theoretical framework to analyze and optimize resource allocation problems in digital communication sce13 narios. Our contribution has shown to enhance the overall performance of VANETs in urban scenarios, in 14 terms of percentage of packet losses, average end-to-end packet delay and peak signal to noise ratio (PSNR).This work was supported by the Spanish Government under research project “Enhancing Communication Protocols with Machine Learning while Protecting Sensitive Data (COMPROMISE)” PID2020-113795RB-C31, funded by MCIN/AEI/10.13039/501100011033. Ahmad M. Mezher holds a McCain Postdoctoral Fellowship in Innovation with the Electrical and Computer Engineering department at the University of New Brunswick (UNB), Canada .Peer ReviewedPostprint (author's final draft

    Infrastructure-less D2D Communications through Opportunistic Networks

    Get PDF
    Mención Internacional en el título de doctorIn recent years, we have experienced several social media blackouts, which have shown how much our daily experiences depend on high-quality communication services. Blackouts have occurred because of technical problems, natural disasters, hacker attacks or even due to deliberate censorship actions undertaken by governments. In all cases, the spontaneous reaction of people consisted in finding alternative channels and media so as to reach out to their contacts and partake their experiences. Thus, it has clearly emerged that infrastructured networks—and cellular networks in particular—are well engineered and have been extremely successful so far, although other paradigms should be explored to connect people. The most promising of today’s alternative paradigms is Device-to-Device (D2D) because it allows for building networks almost freely, and because 5G standards are (for the first time) seriously addressing the possibility of using D2D communications. In this dissertation I look at opportunistic D2D networking, possibly operating in an infrastructure-less environment, and I investigate several schemes through modeling and simulation, deriving metrics that characterize their performance. In particular, I consider variations of the Floating Content (FC) paradigm, that was previously proposed in the technical literature. Using FC, it is possible to probabilistically store information over a given restricted local area of interest, by opportunistically spreading it to mobile users while in the area. In more detail, a piece of information which is injected in the area by delivering it to one or more of the mobile users, is opportunistically exchanged among mobile users whenever they come in proximity of one another, progressively reaching most (ideally all) users in the area and thus making the information dwell in the area of interest, like in a sort of distributed storage. While previous works on FC almost exclusively concentrated on the communication component, in this dissertation I look at the storage and computing components of FC, as well as its capability of transferring information from one area of interest to another. I first present background work, including a brief review of my Master Thesis activity, devoted to the design, implementation and validation of a smartphone opportunistic information sharing application. The goal of the app was to collect experimental data that permitted a detailed analysis of the occurring events, and a careful assessment of the performance of opportunistic information sharing services. Through experiments, I showed that many key assumptions commonly adopted in analytical and simulation works do not hold with current technologies. I also showed that the high density of devices and the enforcement of long transmission ranges for links at the edge might counter-intuitively impair performance. The insight obtained during my Master Thesis work was extremely useful to devise smart operating procedures for the opportunistic D2D communications considered in this dissertation. In the core of this dissertation, initially I propose and study a set of schemes to explore and combine different information dissemination paradigms along with real users mobility and predictions focused on the smart diffusion of content over disjoint areas of interest. To analyze the viability of such schemes, I have implemented a Python simulator to evaluate the average availability and lifetime of a piece of information, as well as storage usage and network utilization metrics. Comparing the performance of these predictive schemes with state-of-the-art approaches, results demonstrate the need for smart usage of communication opportunities and storage. The proposed algorithms allow for an important reduction in network activity by decreasing the number of data exchanges by up to 92%, requiring the use of up to 50% less of on-device storage, while guaranteeing the dissemination of information with performance similar to legacy epidemic dissemination protocols. In a second step, I have worked on the analysis of the storage capacity of probabilistic distributed storage systems, developing a simple yet powerful information theoretical analysis based on a mean field model of opportunistic information exchange. I have also extended the previous simulator to compare the numerical results generated by the analytical model to the predictions of realistic simulations under different setups, showing in this way the accuracy of the analytical approach, and characterizing the properties of the system storage capacity. I conclude from analysis and simulated results that when the density of contents seeded in a floating system is larger than the maximum amount which can be sustained by the system in steady state, the mean content availability decreases, and the stored information saturates due to the effects of resource contention. With the presence of static nodes, in a system with infinite host memory and at the mean field limit, there is no upper bound to the amount of injected contents which a floating system can sustain. However, as with no static nodes, by increasing the injected information, the amount of stored information eventually reaches a saturation value which corresponds to the injected information at which the mean amount of time spent exchanging content during a contact is equal to the mean duration of a contact. As a final step of my dissertation, I have also explored by simulation the computing and learning capabilities of an infrastructure-less opportunistic communication, storage and computing system, considering an environment that hosts a distributed Machine Learning (ML) paradigm that uses observations collected in the area over which the FC system operates to infer properties of the area. Results show that the ML system can operate in two regimes, depending on the load of the FC scheme. At low FC load, the ML system in each node operates on observations collected by all users and opportunistically shared among nodes. At high FC load, especially when the data to be opportunistically exchanged becomes too large to be transmitted during the average contact time between nodes, the ML system can only exploit the observations endogenous to each user, which are much less numerous. As a result, I conclude that such setups are adequate to support general instances of distributed ML algorithms with continuous learning, only under the condition of low to medium loads of the FC system. While the load of the FC system induces a sort of phase transition on the ML system performance, the effect of computing load is more progressive. When the computing capacity is not sufficient to train all observations, some will be skipped, and performance progressively declines. In summary, with respect to traditional studies of the FC opportunistic information diffusion paradigm, which only look at the communication component over one area of interest, I have considered three types of extensions by looking at the performance of FC: over several disjoint areas of interest; in terms of information storage capacity; in terms of computing capacity that supports distributed learning. The three topics are treated respectively in Chapters 3 to 5.This work has been supported by IMDEA Networks InstitutePrograma de Doctorado en Ingeniería Telemática por la Universidad Carlos III de MadridPresidente: Claudio Ettori Casetti.- Secretario: Antonio de la Oliva Delgado.- Vocal: Christoph Somme

    Location Privacy in VANETs: Improved Chaff-Based CMIX and Privacy-Preserving End-to-End Communication

    Get PDF
    VANETs communication systems are technologies and defined policies that can be formed to enable ITS applications to provide road traffic efficacy, warning about such issues as environmental dangers, journey circumstances, and in the provision of infotainment that considerably enhance transportation safety and quality. The entities in VANETs, generally vehicles, form part of a massive network known as the Internet of Vehicles (IoV). The deployment of large-scale VANETs systems is impossible without ensuring that such systems are themselves are safe and secure, protecting the privacy of their users. There is a risk that cars might be hacked, or their sensors become defective, causing inaccurate information to be sent across the network. Consequently, the activities and credentials of participating vehicles should be held responsible and quickly broadcast throughout a vast VANETs, considering the accountability in the system. The openness of wireless communication means that an observer can eavesdrop on vehicular communication and gain access or otherwise deduce users' sensitive information, and perhaps profile vehicles based on numerous factors such as tracing their travels and the identification of their home/work locations. In order to protect the system from malicious or compromised entities, as well as to preserve user privacy, the goal is to achieve communication security, i.e., keep users' identities hidden from both the outside world and the security infrastructure and service providers. Being held accountable while still maintaining one's privacy is a difficult balancing act. This thesis explores novel solution paths to the above challenges by investigating the impact of low-density messaging to improve the security of vehicle communications and accomplish unlinkability in VANETs. This is achieved by proposing an improved chaff-based CMIX protocol that uses fake messages to increase density to mitigate tracking in this scenario. Recently, Christian \etall \cite{vaas2018nowhere} proposed a Chaff-based CMIX scheme that sends fake messages under the presumption low-density conditions to enhance vehicle privacy and confuse attackers. To accomplish full unlinkability, we first show the following security and privacy vulnerabilities in the Christian \etall scheme: linkability attacks outside the CMIX may occur due to deterministic data-sharing during the authentication phase (e.g., duplicate certificates for each communication). Adversaries may inject fake certificates, which breaks Cuckoo Filters' (CFs) updates authenticity, and the injection may be deniable. CMIX symmetric key leakage outside the coverage may occur. We propose a VPKI-based protocol to mitigate these issues. First, we use a modified version of Wang \etall's \cite{wang2019practical} scheme to provide mutual authentication without revealing the real identity. To this end, a vehicle's messages are signed with a different pseudo-identity “certificate”. Furthermore, the density is increased via the sending of fake messages during low traffic periods to provide unlinkability outside the mix-zone. Second, unlike Christian \etall's scheme, we use the Adaptive Cuckoo Filter (ACF) instead of CF to overcome the effects of false positives on the whole filter. Moreover, to prevent any alteration of the ACFs, only RUSs distribute the updates, and they sign the new fingerprints. Third, mutual authentication prevents any leakage from the mix zones' symmetric keys by generating a fresh one for each communication through a Diffie–Hellman key exchange. As a second main contribution of this thesis, we focus on the V2V communication without the interference of a Trusted Third Party (TTP)s in case this has been corrupted, destroyed, or is out of range. This thesis presents a new and efficient end-to-end anonymous key exchange protocol based on Yang \etall's \cite{yang2015self} self-blindable signatures. In our protocol, vehicles first privately blind their own private certificates for each communication outside the mix-zone and then compute an anonymous shared key based on zero-knowledge proof of knowledge (PoK). The efficiency comes from the fact that once the signatures are verified, the ephemeral values in the PoK are also used to compute a shared key through an authenticated Diffie-Hellman key exchange protocol. Therefore, the protocol does not require any further external information to generate a shared key. Our protocol also does not require interfacing with the Roadside Units or Certificate Authorities, and hence can be securely run outside the mixed-zones. We demonstrate the security of our protocol in ideal/real simulation paradigms. Hence, our protocol achieves secure authentication, forward unlinkability, and accountability. Furthermore, the performance analysis shows that our protocol is more efficient in terms of computational and communications overheads compared to existing schemes.Kuwait Cultural Offic
    corecore