Secure Routing for Mobile Ad hoc Networks

• URL: http://arxiv.org/abs/2403.00404v1
• Date: Fri, 1 Mar 2024 09:50:00 GMT
• Title: Secure Routing for Mobile Ad hoc Networks
• Authors: Panagiotis Papadimitratos, Zygmunt J. Haas,
• Abstract summary: We present a route discovery protocol that mitigates the effects of malicious behavior in MANET networks. Our protocol guarantees that fabricated, compromised, or replayed route replies would either be rejected or never reach back the querying node. The scheme is robust in the presence of a number of non-colluding nodes.
• Score: 2.965855310793378
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The emergence of the Mobile Ad Hoc Networking (MANET) technology advocates self-organized wireless interconnection of communication devices that would either extend or operate in concert with the wired networking infrastructure or, possibly, evolve to autonomous networks. In either case, the proliferation of MANET-based applications depends on a multitude of factors, with trustworthiness being one of the primary challenges to be met. Despite the existence of well-known security mechanisms, additional vulnerabilities and features pertinent to this new networking paradigm might render such traditional solutions inapplicable. In particular, the absence of a central authorization facility in an open and distributed communication environment is a major challenge, especially due to the need for cooperative network operation. In particular, in MANET, any node may compromise the routing protocol functionality by disrupting the route discovery process. In this paper, we present a route discovery protocol that mitigates the detrimental effects of such malicious behavior, as to provide correct connectivity information. Our protocol guarantees that fabricated, compromised, or replayed route replies would either be rejected or never reach back the querying node. Furthermore, the protocol responsiveness is safeguarded under different types of attacks that exploit the routing protocol itself. The sole requirement of the proposed scheme is the existence of a security association between the node initiating the query and the sought destination. Specifically, no assumption is made regarding the intermediate nodes, which may exhibit arbitrary and malicious behavior. The scheme is robust in the presence of a number of non-colluding nodes, and provides accurate routing information in a timely manner.

Related papers

• Collaborative Inference over Wireless Channels with Feature Differential Privacy [57.68286389879283]
  Collaborative inference among multiple wireless edge devices has the potential to significantly enhance Artificial Intelligence (AI) applications. transmitting extracted features poses a significant privacy risk, as sensitive personal data can be exposed during the process. We propose a novel privacy-preserving collaborative inference mechanism, wherein each edge device in the network secures the privacy of extracted features before transmitting them to a central server for inference.
  arXiv  Detail & Related papers  (2024-10-25T18:11:02Z)
• Unique ID based Trust Scheme for Improved IoV Wireless Sensor Network Security Against Power Controlled Sybil Attacks [1.906179410714637]
  Wireless sensor networks (WSNs) are widely used in vehicular networks to support Vehicle-to-Everything (V2X) communications. WSNs face security challenges due to their distributed nature and resource limited modules. This paper proposes a unique identification based trust path routing scheme (UITrust) to avoid Sybil attacks.
  arXiv  Detail & Related papers  (2024-10-05T07:20:55Z)
• Toward Mixture-of-Experts Enabled Trustworthy Semantic Communication for 6G Networks [82.3753728955968]
  We introduce a novel Mixture-of-Experts (MoE)-based SemCom system. This system comprises a gating network and multiple experts, each specializing in different security challenges. The gating network adaptively selects suitable experts to counter heterogeneous attacks based on user-defined security requirements. A case study in vehicular networks demonstrates the efficacy of the MoE-based SemCom system.
  arXiv  Detail & Related papers  (2024-09-24T03:17:51Z)
• Privacy Preserving Semi-Decentralized Mean Estimation over Intermittently-Connected Networks [59.43433767253956]
  We consider the problem of privately estimating the mean of vectors distributed across different nodes of an unreliable wireless network. In a semi-decentralized setup, nodes can collaborate with their neighbors to compute a local consensus, which they relay to a central server. We study the tradeoff between collaborative relaying and privacy leakage due to the data sharing among nodes.
  arXiv  Detail & Related papers  (2024-06-06T06:12:15Z)
• Secure Link State Routing for Mobile Ad Hoc Networks [2.965855310793378]
  The proposed here Secure Link State Routing Protocol (SLSP) provides secure proactive topology discovery. SLSP can be employed as a stand-alone protocol, or fit naturally into a hybrid routing framework.
  arXiv  Detail & Related papers  (2024-03-28T22:10:40Z)
• Seagull: Privacy preserving network verification system [0.0]
  This paper introduces a novel approach to verify the correctness of configurations in the internet backbone governed by the BGP protocol. Not only does our proposed solution effectively address scalability concerns, but it also establishes a robust privacy framework.
  arXiv  Detail & Related papers  (2024-02-14T05:56:51Z)
• A Survey and Comparative Analysis of Security Properties of CAN Authentication Protocols [92.81385447582882]
  The Controller Area Network (CAN) bus leaves in-vehicle communications inherently non-secure. This paper reviews and compares the 15 most prominent authentication protocols for the CAN bus. We evaluate protocols based on essential operational criteria that contribute to ease of implementation.
  arXiv  Detail & Related papers  (2024-01-19T14:52:04Z)
• A Neural Radiance Field-Based Architecture for Intelligent Multilayered View Synthesis [0.0]
  A mobile ad hoc network (MANET) is made up of a sizable and reasonably dense community of mobile nodes. Finding the best packet routing from across infrastructure is the major issue. This study suggests the Optimized Route Selection via Red Imported Fire Ants (RIFA) Strategy as a way to improve on-demand source routing systems.
  arXiv  Detail & Related papers  (2023-11-03T11:05:51Z)
• Generative AI-aided Joint Training-free Secure Semantic Communications via Multi-modal Prompts [89.04751776308656]
  This paper proposes a GAI-aided SemCom system with multi-model prompts for accurate content decoding. In response to security concerns, we introduce the application of covert communications aided by a friendly jammer.
  arXiv  Detail & Related papers  (2023-09-05T23:24:56Z)
• SemProtector: A Unified Framework for Semantic Protection in Deep Learning-based Semantic Communication Systems [51.97204522852634]
  We present a unified framework that aims to secure an online semantic communications system with three semantic protection modules. Specifically, these protection modules are able to encrypt semantics to be transmitted by an encryption method, mitigate privacy risks from wireless channels by a perturbation mechanism, and calibrate distorted semantics at the destination. Our framework enables an existing online SC system to dynamically assemble the above three pluggable modules to meet customized semantic protection requirements.
  arXiv  Detail & Related papers  (2023-09-04T06:34:43Z)
• Practical quantum multiparty signatures using quantum-key-distribution networks [0.0]
  We develop an unconditionally secure signature scheme that guarantees authenticity and transferability of arbitrary length messages in a quantum key distribution network. We provide a comprehensive security analysis of the developed scheme, perform an optimization of the scheme parameters with respect to the secret key consumption, and demonstrate that the developed scheme is compatible with the capabilities of currently available QKD devices.
  arXiv  Detail & Related papers  (2021-07-27T17:41:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.