840 research outputs found

    A Trust Management Framework for Vehicular Ad Hoc Networks

    Get PDF
    The inception of Vehicular Ad Hoc Networks (VANETs) provides an opportunity for road users and public infrastructure to share information that improves the operation of roads and the driver experience. However, such systems can be vulnerable to malicious external entities and legitimate users. Trust management is used to address attacks from legitimate users in accordance with a user’s trust score. Trust models evaluate messages to assign rewards or punishments. This can be used to influence a driver’s future behaviour or, in extremis, block the driver. With receiver-side schemes, various methods are used to evaluate trust including, reputation computation, neighbour recommendations, and storing historical information. However, they incur overhead and add a delay when deciding whether to accept or reject messages. In this thesis, we propose a novel Tamper-Proof Device (TPD) based trust framework for managing trust of multiple drivers at the sender side vehicle that updates trust, stores, and protects information from malicious tampering. The TPD also regulates, rewards, and punishes each specific driver, as required. Furthermore, the trust score determines the classes of message that a driver can access. Dissemination of feedback is only required when there is an attack (conflicting information). A Road-Side Unit (RSU) rules on a dispute, using either the sum of products of trust and feedback or official vehicle data if available. These “untrue attacks” are resolved by an RSU using collaboration, and then providing a fixed amount of reward and punishment, as appropriate. Repeated attacks are addressed by incremental punishments and potentially driver access-blocking when conditions are met. The lack of sophistication in this fixed RSU assessment scheme is then addressed by a novel fuzzy logic-based RSU approach. This determines a fairer level of reward and punishment based on the severity of incident, driver past behaviour, and RSU confidence. The fuzzy RSU controller assesses judgements in such a way as to encourage drivers to improve their behaviour. Although any driver can lie in any situation, we believe that trustworthy drivers are more likely to remain so, and vice versa. We capture this behaviour in a Markov chain model for the sender and reporter driver behaviours where a driver’s truthfulness is influenced by their trust score and trust state. For each trust state, the driver’s likelihood of lying or honesty is set by a probability distribution which is different for each state. This framework is analysed in Veins using various classes of vehicles under different traffic conditions. Results confirm that the framework operates effectively in the presence of untrue and inconsistent attacks. The correct functioning is confirmed with the system appropriately classifying incidents when clarifier vehicles send truthful feedback. The framework is also evaluated against a centralized reputation scheme and the results demonstrate that it outperforms the reputation approach in terms of reduced communication overhead and shorter response time. Next, we perform a set of experiments to evaluate the performance of the fuzzy assessment in Veins. The fuzzy and fixed RSU assessment schemes are compared, and the results show that the fuzzy scheme provides better overall driver behaviour. The Markov chain driver behaviour model is also examined when changing the initial trust score of all drivers

    Distributed consensus in wireless network

    Get PDF
    Connected autonomous systems, which are powered by the synergistic integration of the Internet of Things (IoT), Artificial Intelligence (AI), and 5G technologies, predominantly rely on a central node for making mission-critical decisions. This reliance poses a significant challenge that the condition and capability of the central node largely determine the reliability and effectiveness of decision-making. Maintaining such a centralized system, especially in large-scale wireless networks, can be prohibitively expensive and encounters scalability challenges. In light of these limitations, there’s a compelling need for innovative methods to address the increasing demands of reliability and latency, especially in mission-critical networks where cooperative decision-making is paramount. One promising avenue lies in the distributed consensus protocol, a mechanism intrinsic to distributed computing systems. These protocols offer enhanced robustness, ensuring continued functionality and responsiveness in decision-making even in the face of potential node or communication failures. This thesis pivots on the idea of leveraging distributed consensus to bolster the reliability of mission-critical decision-making within wireless networks, which delves deep into the performance characteristics of wireless distributed consensus, analyzing and subsequently optimizing its attributes, specifically focusing on reliability and latency. The research begins with a fundamental model of consensus reliability in an crash fault tolerance protocol Raft. A novel metric termed ReliabilityGain is introduced to analyze the performance of distributed consensus in wireless network. This innovative concept elucidates the linear correlation between the reliability inherent to consensus-driven decision-making and the reliability of communication link transmission. An intriguing discovery made in my study is the inherent trade-off between the time latency of achieving consensus and its reliability. These two variables appear to be in contradiction, which brings further performance optimization issues. The performance of the Crash and Byzantine fault tolerance protocol is scrutinized and they are compared with original centralized consensus. This exploration becomes particularly pertinent when communication failures occur in wireless distributed consensus. The analytical results are juxtaposed with performance metrics derived from a centralized consensus mechanism. This comparative analysis illuminates the relative merits and demerits of these consensus strategies, evaluated from the dual perspectives of comprehensive consensus reliability and communication latency. In light of the insights gained from the detailed analysis of the Raft and Hotstuff BFT protocols, my thesis further ventures into the realm of optimization strategies for wireless distributed consensus. A central facet of this exploration is the introduction of a tailored communication resource allocation scheme. This scheme, rooted in maximizing the performance of consensus mechanisms, dynamically assesses the network conditions and allocates communication resources such as transmit power and bandwidth to ensure efficient and timely decision-making, which ensures that even in varied and unpredictable network conditions, consensus can be achieved with minimized latency and maximized reliability. The research introduces an adaptive protocol of distributed consensus in wireless network. This proposed adaptive protocol’s strength lies in its ability to autonomously construct consensus-enabled network even if node failures or communication disruptions occur, which ensures that the network’s decision-making process remains uninterrupted and efficient, irrespective of external challenges. The sharding mechanism, which is regarded as an effective solution to scalability issues in distributed system, does not only aid in managing vast networks more efficiently but also ensure that any disruption in one shard cannot compromise the functionality of the entire network. Therefore, this thesis shows the reliability and security analysis of sharding that implemented in wireless distributed system. In essence, these intertwined strategies, rooted in the intricate dance of communication resource allocation, adaptability, and sharding, together form the bedrock of my contributions to enhancing the performance of wireless distributed consensus

    Hybrid Architectures to Improve Coverage in Remote Areas and Incorporate Long-range LPWAN Multi-hop IoT Strategies

    Get PDF
    At the height of M2M communications, there are many alternatives and architectures that present solutions for each case and each environment. The interoperability strategy or the combination of different solutions with adequate flexibility can be solutions to maintain a capacity for easy incorporation of new sensor nodes depending on the coverage or not of operators. In addition to interoperability strategies, this chapter presents some alternatives that include multi-hop techniques, combining different technologies. Special emphasis will be placed on low-power wide area networks systems (LoRa, Narrow Band IoT, LTE, etc.) applied in remote environments, such as nature reserves and ocean or fluvial ecosystems. An estate of art of these areas will be presented, as well as results of different development of our group

    A Novel Energy-Efficient Reservation System for Edge Computing in 6G Vehicular Ad Hoc Network

    Get PDF
    The roadside unit (RSU) is one of the fundamental components in a vehicular ad hoc network (VANET), where a vehicle communicates in infrastructure mode. The RSU has multiple functions, including the sharing of emergency messages and the updating of vehicles about the traffic situation. Deploying and managing a static RSU (sRSU) requires considerable capital and operating expenditures (CAPEX and OPEX), leading to RSUs that are sparsely distributed, continuous handovers amongst RSUs, and, more importantly, frequent RSU interruptions. At present, researchers remain focused on multiple parameters in the sRSU to improve the vehicle-to-infrastructure (V2I) communication; however, in this research, the mobile RSU (mRSU), an emerging concept for sixth-generation (6G) edge computing vehicular ad hoc networks (VANETs), is proposed to improve the connectivity and efficiency of communication among V2I. In addition to this, the mRSU can serve as a computing resource for edge computing applications. This paper proposes a novel energy-efficient reservation technique for edge computing in 6G VANETs that provides an energy-efficient, reservation-based, cost-effective solution by introducing the concept of the mRSU. The simulation outcomes demonstrate that the mRSU exhibits superior performance compared to the sRSU in multiple aspects. The mRSU surpasses the sRSU with a packet delivery ratio improvement of 7.7%, a throughput increase of 5.1%, a reduction in end-to-end delay by 4.4%, and a decrease in hop count by 8.7%. The results are generated across diverse propagation models, employing realistic urban scenarios with varying packet sizes and numbers of vehicles. However, it is important to note that the enhanced performance parameters and improved connectivity with more nodes lead to a significant increase in energy consumption by 2%

    Resource Allocation Energy Efficient Algorithm for H-CRAN in 5G

    Get PDF
    In today's generation, the demand for data rates has also increased due to the rapid surge in the number of users. With this increasing growth, there is a need to develop the next fifth generation network keeping in mind the need to replace the current 4G cellular network. The fifth generation (5G) design in mobile communication technology has been developed keeping in mind all the communication needs of the users. Heterogeneous Cloud Radio Access Network (H-CRAN) has emerged as a capable architecture for the newly emerging network infrastructure for energy efficient networks and high data rate enablement. It is considered as the main technology. Better service quality has been achieved by developing small cells into macro cells through this type of network. In addition, the reuse of radio resources is much better than that of homogeneous networks. In the present paper, we propose the H-CRAN energy-efficient methods. This energy-efficient algorithm incorporates an energy efficient resource allocation management design to deal to heterogeneous cloud radio access networks in 5G. System throughput fulfillment is elevating by incorporating an efficient resource allocation design by the energy consumption model. The simulation results have been demonstrated by comparing the efficiency of the introduced design with the existing related design

    Routing Optimizing Decisions in MANET: The Enhanced Hybrid Routing Protocol (EHRP) with Adaptive Routing based on Network Situation

    Get PDF
    Mobile ad hoc networks (MANETs) are wireless networks that operate without a fixed infrastructure or base station. In MANETs, each node acts as a data source and a router, establishing connections with its neighboring nodes to facilitate communication. This research has introduced the Enhanced Hybrid Routing Protocol (EHRP), which combines the OLSR, AOMDV, and AODV routing protocols while considering the network situation for improved performance. The EHRP protocol begins by broadcasting a RREP (Route Reply) packet to discover a route. The selection of routing options is based on the current network situation. To determine the distance between the source and destination nodes, the proposed EHRP initiates a RREQ (Route Request) packet. In situations where network mobility exceeds the capabilities of the AODV protocol, the EHRP protocol can utilize the OLSR routing protocol for route selection and data transmission, provided that at least 70% of the network nodes remain stable. Additionally, the EHRP protocol effectively handles network load and congestion control through the utilization of the AOMDV routing protocol. Compared to the hybrid routing protocol, the enhanced hybrid routing protocol (EHRP) demonstrates superior performance. Its incorporation of the OLSR, AOMDV, and AODV protocols, along with its adaptive routing adaptation based on network conditions, allows for efficient network management and improved overall network performance. The analysis of packet delivery ratio for EHRP and ZRP reveals that EHRP achieves a packet delivery ratio of 98.01%, while ZRP achieves a packet delivery ratio of 89.99%. These results indicate that the enhanced hybrid routing protocol (EHRP) outperforms the hybrid routing protocol (ZRP) in terms of packet delivery ratio. EHRP demonstrates a higher level of success in delivering packets to their intended destinations compared to ZRP. The analysis of normal routing load for EHRP and ZRP reveals that EHRP exhibits a normal routing load of 0.13%, while ZRP exhibits a higher normal routing load of 0.50%. Based on these results, it can be concluded that the performance of the Enhanced Hybrid Routing Protocol (EHRP) is significantly better than that of the Hybrid Routing Protocol (ZRP) when considering the normal routing load. EHRP demonstrates a lower level of routing overhead and more efficient resource utilization compared to ZRP in scenarios with normal routing load. When comparing the average end-to-end delay between the Enhanced Hybrid Routing Protocol (EHRP) and ZRP, the analysis reveals that EHRP achieves an average delay of 0.06, while ZRP exhibits a higher average delay of 0.23. These findings indicate that the Enhanced Hybrid Routing Protocol (EHRP) performs better than ZRP in terms of average end-to-end delay. EHRP exhibits lower delay, resulting in faster and more efficient transmission of data packets from source to destination compared to ZRP. After considering the overall parameter matrix, which includes factors such as normal routing load, data send and receive throughput, packet delivery ratio, and average end-to-end delay, it becomes evident that the performance of the Enhanced Hybrid Routing Protocol (EHRP) surpasses that of the current hybrid routing protocol (ZRP). Across these metrics, EHRP consistently outperforms ZRP, demonstrating superior performance and efficiency. The Enhanced Hybrid Routing Protocol (EHRP) exhibits better results in terms of normal routing load, higher throughput for data transmission and reception, improved packet delivery ratio, and lower average end-to-end delay. Overall, EHRP offers enhanced performance and effectiveness compared to the existing hybrid routing protocol (ZRP)

    Secure Routing Protocol To Mitigate Attacks By Using Blockchain Technology In Manet

    Full text link
    MANET is a collection of mobile nodes that communicate through wireless networks as they move from one point to another. MANET is an infrastructure-less network with a changeable topology; as a result, it is very susceptible to attacks. MANET attack prevention represents a serious difficulty. Malicious network nodes are the source of network-based attacks. In a MANET, attacks can take various forms, and each one alters the network's operation in its unique way. In general, attacks can be separated into two categories: those that target the data traffic on a network and those that target the control traffic. This article explains the many sorts of assaults, their impact on MANET, and the MANET-based defence measures that are currently in place. The suggested SRA that employs blockchain technology (SRABC) protects MANET from attacks and authenticates nodes. The secure routing algorithm (SRA) proposed by blockchain technology safeguards control and data flow against threats. This is achieved by generating a Hash Function for every transaction. We will begin by discussing the security of the MANET. This article's second section explores the role of blockchain in MANET security. In the third section, the SRA is described in connection with blockchain. In the fourth phase, PDR and Throughput are utilised to conduct an SRA review using Blockchain employing PDR and Throughput. The results suggest that the proposed technique enhances MANET security while concurrently decreasing delay. The performance of the proposed technique is analysed and compared to the routing protocols Q-AODV and DSR.Comment: https://aircconline.com/ijcnc/V15N2/15223cnc07.pd

    A Secure and Distributed Architecture for Vehicular Cloud and Protocols for Privacy-preserving Message Dissemination in Vehicular Ad Hoc Networks

    Get PDF
    Given the enormous interest in self-driving cars, Vehicular Ad hoc NETworks (VANETs) are likely to be widely deployed in the near future. Cloud computing is also gaining widespread deployment. Marriage between cloud computing and VANETs would help solve many of the needs of drivers, law enforcement agencies, traffic management, etc. The contributions of this dissertation are summarized as follows: A Secure and Distributed Architecture for Vehicular Cloud: Ensuring security and privacy is an important issue in the vehicular cloud; if information exchanged between entities is modified by a malicious vehicle, serious consequences such as traffic congestion and accidents can occur. In addition, sensitive data could be lost, and human lives also could be in danger. Hence, messages sent by vehicles must be authenticated and securely delivered to vehicles in the appropriate regions. In this dissertation, we present a secure and distributed architecture for the vehicular cloud which uses the capabilities of vehicles to provide various services such as parking management, accident alert, traffic updates, cooperative driving, etc. Our architecture ensures the privacy of vehicles and supports secure message dissemination using the vehicular infrastructure. A Low-Overhead Message Authentication and Secure Message Dissemination Scheme for VANETs: Efficient, authenticated message dissemination in VANETs are important for the timely delivery of authentic messages to vehicles in appropriate regions in the VANET. Many of the approaches proposed in the literature use Road Side Units (RSUs) to collect events (such as accidents, weather conditions, etc.) observed by vehicles in its region, authenticate them, and disseminate them to vehicles in appropriate regions. However, as the number of messages received by RSUs increases in the network, the computation and communication overhead for RSUs related to message authentication and dissemination also increases. We address this issue and present a low-overhead message authentication and dissemination scheme in this dissertation. On-Board Hardware Implementation in VANET: Design and Experimental Evaluation: Information collected by On Board Units (OBUs) located in vehicles can help in avoiding congestion, provide useful information to drivers, etc. However, not all drivers on the roads can benefit from OBU implementation because OBU is currently not available in all car models. Therefore, in this dissertation, we designed and built a hardware implementation for OBU that allows the dissemination of messages in VANET. This OBU implementation is simple, efficient, and low-cost. In addition, we present an On-Board hardware implementation of Ad hoc On-Demand Distance Vector (AODV) routing protocol for VANETs. Privacy-preserving approach for collection and dissemination of messages in VANETs: Several existing schemes need to consider safety message collection in areas where the density of vehicles is low and roadside infrastructure is sparse. These areas could also have hazardous road conditions and may have poor connectivity. In this dissertation, we present an improved method for securely collecting and disseminating safety messages in such areas which preserves the privacy of vehicles. We propose installing fixed OBUs along the roadside of dangerous roads (i.e., roads that are likely to have more ice, accidents, etc., but have a low density of vehicles and roadside infrastructure) to help collect data about the surrounding environment. This would help vehicles to be notified about the events on such roads (such as ice, accidents, etc.).Furthermore, to enhance the privacy of vehicles, our scheme allows vehicles to change their pseudo IDs in all traffic conditions. Therefore, regardless of whether the number of vehicles is low in the RSU or Group Leader GL region, it would be hard for an attacker to know the actual number of vehicles in the RSU/GL region
    • …
    corecore