Secure data communication in mobile ad hoc networks

IRJET, 2022

Summary – Addresses the security and fault tolerance issue communication in the presence of opponents via multi-hop wireless networks with frequently changing topologies. We design and evaluate Secure Message Transfer (SMT) protocol and its alternative, the Secure Single-Path Protocol (SSP), to effectively deal with arbitrary and malicious interruptions of data transmission. One of the distinguishing features of SMT and SSP is that they can operate exclusively in an end-to-end manner without limiting assumptions about trust and security associations in the network. As a result, the protocol is applicable to a wide range network architecture. We demonstrate that reliable communication with low latency and low delay variability can be maintained even when a significant part of network nodes systematically or intermittently disrupts communication. SMT and SSP reliably detect transmission errors, avoid and tolerate data loss and continuously configure operations to ensure communication availability. This is achieved at the cost of moderation tradable transmission and routing overhead delay. Overall, the protocol's ability to mitigate both malicious and harmless errors enables fast and reliable data transmission even in highly hostile network environments

Ad Hoc Networks, 2003

The vision of nomadic computing with its ubiquitous access has stimulated much interest in the Mobile Ad Hoc Networking (MANET) technology. However, its proliferation strongly depends on the availability of security provisions, among other factors. In the open, collaborative MANET environment practically any node can maliciously or selfishly disrupt and deny communication of other nodes. In this paper, we present and evaluate the Secure Message Transmission (SMT) protocol, which safeguards the data transmission against arbitrary malicious behavior of other nodes. SMT is a lightweight, yet very effective, protocol that can operate solely in an end-to-end manner. It exploits the redundancy of multi-path routing and adapts its operation to remain efficient and effective even in highly adverse environments. SMT is capable of delivering up to 250% more data messages than a protocol that does not secure the data transmission. Moreover, SMT outperforms an alternative singlepath protocol, a secure data forwarding protocol we term Secure Single Path (SSP) protocol. SMT imposes up to 68% less routing overhead than SSP, delivers up to 22% more data packets and achieves end-to-end delays that are up to 94% lower than those of SSP. Thus, SMT is better suited to support QoS for real-time communications in the ad hoc networking environment. The security of data transmission is achieved without restrictive assumptions on the network nodes' trust and network membership, without the use of intrusion detection schemes, and at the expense of moderate multi-path transmission overhead only.

Concurrency and Computation: Practice and Experience, 2010

Ad hoc Networks (MANETs). However, existing multipath routing protocols are often practically infeasible due to its security venerability if they suffer from attacks in MANETs, such as repudiation attacks, Denial of Service attacks. In this paper we propose a novel secure multipath routing protocol, referred to as SMRP, and investigate its feasibility and performance. SMRP applies a new heuristic algorithm increasing the number of disjoint paths and a smart authentication mechanism to enhance the security against the attacks in MANETs. The performance results from extensive analysis and experiments show that SMRP can efficiently enhance the security in MANETs while preserving the low overhead of computing and communication.

IOSR Journal of Computer Engineering, 2012

The vision of nomadic computing with its ubiquitous access has stimulated much interest in the Mobile Ad Hoc Networking (MANET) technology. However, its proliferation strongly depends on the availability of security provisions, among other factors. We address the problem of secure and fault-tolerant communication in the presence of adversaries across a multi-hop wireless network with frequently changing topology. To effectively cope with arbitrary malicious disruption of data transmissions, we propose and evaluate the secure message transmission (SMT) protocol and its alternative, the secure single-path (SSP) protocol. Among the salient features of SMT and SSP is their ability to operate solely in an end-to-end manner and without restrictive assumptions on the network trust and security associations. As a result, the protocols are applicable to a wide range of network architectures. We demonstrate that highly reliable communication can be sustained with small delay and small delay variability, even when a substantial portion of the network nodes systematically or intermittently disrupt communication. SMT and SSP robustly detect transmission failures and continuously configure their operation to avoid and tolerate data loss, and to ensure the availability of communication. This is achieved at the expense of moderate transmission and routing overhead, which can be traded off for delay. Overall, the ability of the protocols to mitigate both malicious and benign faults allows fast and reliable data transport even in highly adverse network environments.

Network Theory and Applications, 2004

466 • 467 • 468 • 470 472 478 479 481 The vision of nomadic computing with its ubiquitous access has stimulated much interest in the Mobile Ad Hoc Networking (MANET) technology. Those infrastructure-less, self-organized networks that either operate autonomously or as an extension to the wired networking infrastructure, are expected to support new MANET-based applications. However, the proliferation of this networking paradigm strongly depends on the availability of security provisions, among other factors. The absence of infrastructure, the nature of the envisioned applications, and the resource-constrained environment pose some new challenges in securing the protocols in the ad hoc networking environments. Moreover, the security requirements can differ significantly from those for infrastructure-based networks, while the provision of security enhancements may take completely different directions as well. In particular, practically any node in the open, collaborative MANET environment can abuse the network operation and disrupt or deny communication. In this paper we introduce our approach to this multifaceted and intriguing problem: a set of protocols that secure the fundamental networking operations of routing and data transmission. Moreover, we survey solutions that address the management of trust in ad hoc networks. Mobile ad hoc networks comprise freely roaming wireless nodes that cooperatively make up for the absence of fixed infrastructure, with the nodes

— In multi-hop wireless networks, the mobile nodes usually act as routers to relay packets generated from other nodes. However, selfish nodes do not cooperate but make use of the honest ones to relay their packets, which has negative effect on fairness, security and performance of the network. In propose a novel incentive mechanism to stimulate cooperation in multi-hop wireless networks. Fairness is achieved by using credits to reward the cooperative nodes. The overhead is significantly reduced by using a cheating detection system (CDS) to secure the payment. Extensive security analysis demonstrates that the CDS can identify the cheating nodes effectively under different cheating strategies. Simulation results show that the overhead of the proposed incentive mechanism is incomparable with the existing ones. The circulated design makes it difficult to build a exceedingly secure and dependable yet insubstantial data storage scheme. on top of the one dispense, sensor information are subject to not only Byzantine failures, but also lively pollution attacks, as along the time the adversary may modify pollute the stored data by compromise individual sensors. On the erstwhile hand, the resource-constrain environment of WSNs precludes the applicability of overload for security designs. To address the challenge, in this object propose framework based integrated dynamic data storage scheme with dynamic reliability guarantee.

IJEER, 2013

An ad-hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. The primary goal of such an ad-hoc network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. LAR is an on-demand protocol who is based on the DSR (Dynamic Source Routing). The Location Aided Routing protocol uses location information to reduce routing overhead of the ad-hoc network! Normally the LAR protocol uses the GPS (Global Positioning System) to get these location information's. With the availability of GPS, the mobile hosts knows there physical location. Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. The military tactical and other security-sensitive operations are still the main applications of ad hoc networks, although there is a trend to adopt ad hoc networks for commercial uses due to their unique properties. One main challenge in design of these networks is their vulnerability to security attacks. In this paper, we study the threats an ad hoc network faces and the security goals to be achieved. We identify the new challenges and opportunities posed by this new networking environment and explore new approaches to secure its communication. In particular, we take advantage of the inherent redundancy in ad hoc networks-multiple routes between nodes to defend routing against denial of service attacks.

IEEE Communications Surveys & Tutorials, 2005

In this article we present a survey of secure ad hoc routing protocols for mobile wireless networks. A mobile ad hoc network is a collection of nodes that is connected through a wireless medium forming rapidly changing topologies. The widely accepted existing routing protocols designed to accommodate the needs of such self-organized networks do not address possible threats aiming at the disruption of the protocol itself. The assumption of a trusted environment is not one that can be realistically expected; hence, several efforts have been made toward the design of a secure and robust routing protocol for ad hoc networks. We briefly present the most popular protocols that follow the table-driven and the source-initiated on-demand approaches. Based on this discussion we then formulate the threat model for ad hoc routing and present several specific attacks that can target the operation of a protocol. In order to analyze the proposed secure ad hoc routing protocols in a structured way we have classified them into five categories: solutions based on asymmetric cryptography; solutions based on symmetric cryptography; hybrid solutions; reputation-based solutions; and a category of add-on mechanisms that satisfy specific security requirements. A comparison between these solutions can provide the basis for future research in this rapidly evolving area.

Lecture Notes in Computer Science, 2004

Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threats. Flooding is a robust algorithm but, because of its extreme redundancy, it is impractical in dense networks. Indeed in large wireless networks, the use of flooding algorithms may lead to a broadcast storm in which the number of collisions is so large that we get system failure. Further reducing unnecessary transmissions greatly improves energy efficiency of such networks. Several variants have been proposed to reduce the relay overhead either deterministically or probabilistically. Gossip is a probabilistic algorithm, in which packet relaying is based on the outcome of coin tosses. The relay probability can be fixed, dynamic or adaptive. With dynamic Gossip, local information (local connectivity) is used. With adaptive Gossip, the decision to relay is adjusted adaptively based on the outcome of coin tosses, the local network structure and the local response to the flooding call. The goal of gossiping is to minimize the number of relays, while retaining the main benefits of flooding, i.e., effective distance. In this paper we consider ways to reduce the number of redundant transmissions in broadcast flooding while guaranteeing security. We present several gossip type protocols, which exploit local connectivity and adaptively correct local relay failures. These use a (geodesic) cell based approach and preserve cell-distance. Our last two protocols are non probabilistic and guarantee delivery, the first such protocols to the best of our knowledge.

Telecommunication Systems, 2013

Routing protocols in mobile ad hoc and sensor networks discover a multi-hop route between source and destination nodes. A highly reliable path is an important component for enhancing the security of communication. This paper presents RAS: a Reliable routing protocol for enhanced reliability and security of communication in mobile Ad hoc and Sensor networks. Enhanced reliability and security are achieved by the maintenance of a reliability factor by the nodes, which is increased when nodes participate successfully in data transmissions. This is determined through the use of positive and passive acknowledgements. Additional optimizations are included in order to increase the efficiency and performance of the network. Simulation experiments are performed in order to verify the operation of the proposed protocol and evaluate its performance. The results show an improvement in the reliability of the discovered path with the proper choice of certain important reliability parameters.