30 research outputs found

    Secure Data Transmission in Mobile Ad Hoc Networks

    Get PDF
    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 multipath 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 single-path 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

    A FRAMEWORK FOR CONSERVING POWER IN MANETS

    Get PDF
    The idea of using controllable relay nodes for designing mobile systems has been explored by several researchers. The main objective of this paper is to design a framework for deploying relay nodes with controlled mobility to conserve power in MANET. To meet out this proposal, a heterogeneous network consisting of traditional nodes with limited energy and relay nodes with more energy resources are considered. The deployment of relay nodes are based on the following two methods: 1. Min-Total, aims to minimize the total energy consumption of all the traditional nodes in the network. 2. Min-Max, aims to minimize the energy consumed by a traditional node in the network. The solution of these two methods can be used to prioritize each individual node in the network. The trade-offs involved in deploying an increasing/decreasing fraction of relay nodes, varying node weights, varying epoch duration is analyzed. This framework aims at dynamically combining both Min-Total and Min-Max based on the characteristics and requirements of the network

    A new multipath routing approach to enhancing TCP security in ad hoc wireless networks

    Get PDF
    In a typical mobile ad hoc network, mobile computing devices wander autonomously and communicate via temporary links in a self-organized computing system without any central administrator or infrastructure support. To support truly ad hoc impromptu communication among such uncoordinated devices, a data multipath routing algorithm can be used because there is no need to rely on a centralized encryption facility (e.g., a PKI server) or complicated distributed keying protocols. In this paper, we propose a data multipath routing algorithm called Multipath TCP Security (MTS) to enhance the data security. In MTS, the source node adaptively chooses the available routes rather than exhaustively testing the "stored routes" one by one. Simulation results show that our algorithm provides a reasonably good level of security and performance. © 2005 IEEE.published_or_final_versio

    An Empirical Critique of On-Demand Routing Protocols against Rushing Attack in MANET

    Get PDF
    Over the last decade, researchers had  proposed numerous  mobile ad hoc routing protocols for which are operate in an on-demand way, as standard on-demand routing protocols such as AODV, DSR and TORA, etc., have been shown to often have faster reaction time and  lower overhead than proactive protocols. However, the openness of the routing environment and the absence of centralized system and infrastructure make them exposed to security attacks in large extent.  In particular, one such kind of attacks is rushing attack, which is mostly hard to detect due to their inherited properties, that alters the network statistics radically. In this paper, we modeled a rushing attack which is a powerful attack that exploits the weaknesses of the secure routing protocols. Moreover, to know the weakness and strength of these protocols, it is necessary to test their performance in hostile environments. Subsequently, the performance is measured with the various metrics, some ot them are average throughput, packet delivery ratio, average end-to-end delay and etc., to compare and evaluate their performance

    A Novel Hybrid Authentication Model for Geo Location Oriented Routing in Dynamic Wireless Mesh Networks

    Get PDF
    Authentication is an essential part of any network and plays a pivotal role in ensuring the security of a network by preventing unauthorised devices/users access to the network. As dynamic wireless mesh networks are evolving and being accepted in various fields, there is a strong need to improve the security of the network. It’s features like self-organizing and self-healing make it great but get undermined when rigid authentication schemes are used. We propose a hybrid authentication scheme for such dynamic mesh networks under three specified scenarios; full authentication, quick authentication and new node authentication. The proposed schemes are applied on our previous works on dynamic mesh routing protocol, Geo location Oriented Routing Protocol (GLOR Simulation results show our proposed scheme is efficient in terms of resource utilization as well as defending against security threats

    Various Security Attacks and Trust Based Security Architecture for MANET

    Get PDF
    A Mobile Ad hoc Network is a group of wireless mobile computers in which nodes cooperate by forwarding packets to each other allowing them to communicate beyond direct wireless transmission range. Mobile Ad hoc Networks (MANET) has become an exciting and important technology in recent years because of the rapid proliferation of wireless devices. Security is an important issue for all kinds of networks including the Wireless Ad Hoc Networks. In this paper, we are presenting some of the reasons that have made MANETs more vulnerable to attacks than the traditional wired network. This paper also covers the security attributes and the various challenges to security design. This paper shreds light on some of the security attacks that exists in MANETs. This Paper also proposes Trust Based Security Architecture for MANET

    Multipath Key Establishment for Wireless Sensor Networks Using Just-Enough Redundancy Transmission

    Get PDF
    In random key predistribution techniques for wireless sensor networks, a relatively small number of keys are randomly chosen from a large key pool and are loaded on the sensors prior to deployment. After deployment, each sensor tries finding a common key shared by itself and each of its neighbors to establish a link key to protect the wireless communication between themselves. One intrinsic disadvantage of such techniques is that some neighboring sensors do not share any common key. In order to establish a link key among these neighbors, a multihop secure path may be used to deliver the secret. Unfortunately, the possibility of sensors being compromised on the path may render such an establishment process insecure. In this work, we propose and analyze the Just-Enough Redundancy Transmission (JERT) scheme that uses the powerful Maximum-Distance Separable (MDS) codes to address the problem. In the JERT scheme, the secret link key is encoded in (n, k) MDS code and transmitted through multiple multihop paths. To reduce the total information that needs to be transmitted, the redundant symbols of the MDS codes are transmitted only if the destination fails to decode the secret. The JERT scheme is demonstrated to be efficient and resilient against node capture. One salient feature of the JERT scheme is its flexibility of trading transmission for lower information disclosure
    corecore