Ad-hoc Security Research Articles

Design of Secure Ad Hoc Network Using Three Dimensional Discrete Wavelet Transformation Based on Performance Enhancement

This work shows new and efficient algorithm of cryptographic purpose based symmetric and conventional techniques that considers the representation of the cipher text by using the three dimensional Discrete Wavelet Transform to find the wavelet decomposition vector containing the approximation and the detail coefficients then build the three dimensional data structure approach. The decryption is done by extracting the encrypted data from the wavelet decomposition vector using the algorithm of inverse Discrete Wavelet Transformation. The encrypted message consists the wavelet decomposition vector. The key is used for authorization purpose to access the network. Results shows great data security and BER over wireless channels based Ad Hoc network.

A Prevention Scheme for Black Hole Attack Based on NS2

Mobile Ad Hoc network is a self-composing network with a highly dynamic network topology. Although it has many advantages, there are still some safety problems in it. One of these problems is the black hole attack. The black hole attack is a typical attack to the Ad Hoc network and is also the main threat facing it. In this paper, the safety problems exist in the AODV protocol, which is a kind of routing protocol in the Ad Hoc, has been analyzed in detail. In the meanwhile, an improved Secure Ad Hoc On-Demand Distance Vector Routing called OSAODV has been proposed and realized based on the NS2. Finally, three set of experiments have been made, the results have shown that the OSADOV can avoid the black hole attack very well.

A Review Paper on Comparative Study of FPGA Implemented AES, Rijndael AES and Pipelined AES Algorithms for Secure Adhoc Networks

Cryptographic techniques are necessary for the security of Adhoc Network. These cryptographic Algorithms are obligatory for protection of the user data so that only the permitted user are allowed to access it. This review paper outlines the comparison of various algorithms i.e AES, Rijndael AES and Pipelined AES. These algorithms estimate the performance on the basis of data throughput and clock frequency.

A Review Paper on Comparative Study of FPGA Implementation of Adhoc Security Algorithms

Nowadays data security is an important issue for decentralized networks like Adhoc Network. In this paper, we have proposed the study of five FPGA implementated data security algorithms specially designed for adhoc network. We have proposed the role of FPGAs within a security system and provided the solutions to security challenges. The result shows that FPGA implementation outperforms software and processors implementation by 20 and 140 times respectively.

Multi Hop Secure Adhoc Network to Eradicate Cooperative Diversity

The concept of peer to peer mobile networks reflects on tactical network. This approach helps mobile nodes to scatter anywhere in the network and it also provide additional support for the MANET in terms of data distribution. This paper provides the result of such approach in terms of network cluster formation with secure node proximity within the boundary. This proximity paradigm will enhance the performance of network by avoid wide scattering of mobile nodes beyond the networks zone. The results shown in this paper were the work done in ns2 mobility package. The result also incorporates AODV routing protocol with IEEE 802.11 MAC for wireless network to improve network performance using mobile node proximity in conjunction with the previous work indicating the network performance degradation with these configuration. To device proximity among mobile nodes were done along with secure mechanism, such that every nodes data transmission was done only on the basis of IDS implementation with PSO fitness value. This will invoke security for every data transmission done on this network. This work has significant effect by improving network performance by 50%. Keywords: Multi Hop Cellular Network, Mobile Node Proximity, Tactical Mobile Network

AODVSEC: A Novel Approach to Secure Ad Hoc on-Demand Distance Vector (AODV) Routing Protocol from Insider Attacks in MANETs

Mobile Ad hoc Network (MANET) is a collection of mobile nodes that can communicate with each other using multihop wireless links without requiring any fixed based-station infrastructure and centralized management. Each node in the network acts as both a host and a router. In such scenario, designing of an efficient, reliable and secure routing protocol has been a major challenging issue over the last many years. Numerous schemes have been proposed for secure routing protocols and most of the research work has so far focused on providing security for routing using cryptography. In this paper, we propose a novel approach to secure Ad hoc On-demand Distance Vector (AODV) routing protocol from the insider attacks launched through active forging of its Route Reply (RREP) control message. AODV routing protocol does not have any security provision that makes it less reliable in publicly open ad hoc network. To deal with the concerned security attacks, we have proposed AODV Security Extension (AODVSEC) which enhances the scope of AODV for the security provision. We have compared AODVSEC with AODV and Secure AODV (SAODV) in normal situation as well as in presence of the three concerned attacks viz. Resource Consumption (RC) attack, Route Disturb (RD) attack, Route Invasion (RI) attack and Blackhole (BH) attack. To evaluate the performances, we have considered Packet Delivery Fraction (PDF), Average End-to-End Delay (AED), Average Throughput (AT), Normalized Routing Load (NRL) and Average Jitter and Accumulated Average Processing Time.

MANET에서 협업기반의 악의적인 노드 행위 식별기법

MANET은 유선 기반망이 구축되어 있지 않은 곳에서 운용되기 때문에 노출된 매체와 동적인 토폴로지, 중앙의 감시와 관리 결여 등으로 보안 측면에서 취약하다. 특히, 중앙에서 네트워크를 제어해 주는 중재자가 없기 때문에 악의적인 노드가 발생해도 그에 대한 탐지나 조치가 어렵다. 이와 같은 악의적인 노드는 Ad-hoc 관련 보안 연구 분야중 라우팅에 밀접하게 연관되어 있다. 따라서, 본 논문에서는 안전하고 효율적인 라우팅을 위해 악의적으로 행동하는 노드를 효과적으로 탐지하여 보안성을 더욱 높일 수 있는 기법을 제안한다. 이를 위해 일정기간 악의적인 행위를 수행하는 노드를 개개의 노드 및 이웃간의 협업을 통해 이중화하여 탐지하고, 각 노드에 대한 신뢰지수를 부여하여 관리함으로써 악의적인 노드 행위에 효과적으로 대응 할 수 있는 기법인 MBC(Identification technition of Malicious Behavior node based on Collaboration in MANET)을 제안한다. 제안한 방법의 효율성을 검증하기 위해 우리는 네트워크 시뮬레이션을 수행하였다. 이 시뮬레이션 수행결과는 제안한 방법이 기존 방법보다 악의적인 노드를 더 정확하고 신속하게 식별 가능함으로써 보다 효율적인 라우팅이 이루어짐을 보였다. MANET(Mobile Ad-Hoc Network) has a weakness from a security aspect because it operates where no wired network is built, which causes the exposed media, dynamic topology, and the lack of both central monitoring and management. It is especially difficult to detect and mitigate a malicious node because there is not a mediator which controls the network. This kind of malicious node is closely connected to the routing in the field of study of Ad-Hoc security. Accordingly this paper proposes the method on how to enhance the security for the safe and effective routing by detecting the malicious node. We propose MBC(Identification technition of Malicious Behavior node based on Collaboration in MANET) that can effectively cope with malicious behavior though double detecting the node executing the malicious behavior by the collaboration between individual node and the neighbor, and also managing the individual nodes in accordance with the trust level obtained. The simulation test results show that MBC can find the malicious nodes more accurately and promptly that leads to the more effectively secure routing than the existing method.

Special issue on “Security in Wireless Ad Hoc and Sensor Networks with Advanced QoS Provisioning”

Special issue on “Security in Wireless Ad Hoc and Sensor Networks with Advanced QoS Provisioning”

Attack Analysis Model on Ad Hoc Security Routing Protocol Based on Strand Space Model

Attack Analysis Model on Ad Hoc Security Routing Protocol Based on Strand Space Model

The Study on AD HOC Networks Security Solution

In this paper, we elaborated on preventive mechanisms either based on cryptographic solutions or trust based infrastructure Moreover, both the localized and ACK-based detection techniques were discussed. Global and local end node reaction mechanisms against ongoing intrusions and threads in order to avoid persistent adverse effects were further discussed. Finally, this paper highlighted open challenges which need to be addressed to secure Ad Hoc networks of the future.

Cloud Security Engineering

Information security is a key challenge in the Cloud because the data will be virtualized across different host machines, hosted on the Web. Cloud provides a channel to the service or platform in which it operates. However, the owners of data will be worried because their data and software are not under their control. In addition, the data owner may not recognize where data is geographically located at any particular time. So there is still a question mark over how data will be more secure if the owner does not control its data and software. Indeed, due to shortage of control over the Cloud infrastructure, use of ad-hoc security tools is not sufficient to protect the data in the Cloud; this paper discusses this security. Furthermore, a vision and strategy is proposed to mitigate or avoid the security threats in the Cloud. This broad vision is based on software engineering principles to secure the Cloud applications and services. In this vision, security is built into all phases of Service Development Life Cycle (SDLC), Platform Development Life Cycle (PDLC) or Infrastructure Development Life Cycle (IDLC).

Verifying Mobile Ad-Hoc Security Routing Protocols with Type Inference

提出一种基于类型推理的移动Ad-Hoc网络安全路由协议的形式化验证方法.定义了一种邻域限制通信演算NCCC(neighborhood-constrained communication calculus),包括演算的语法和基于规约的操作语义,在类型系统中描述了移动Ad-Hoc网络路由协议的安全属性,定义了近似攻击消息集用以精简Dolev-Yao攻击模型.还给出了该方法的一个协议验证实例.基于类型推理,该方法不仅能够验证协议的安全性,也可以得出针对协议的攻击手段.因为攻击集的精简,有效地缩减了推理空间.;A type-inference-based formal method is proposed for verifying an ad-hoc security routing protocol in this paper. A calculus, called NCCC (neighborhood-constraint communication calculus), is defined to specify the protocol. The security property of the protocol is described with typing rules in a type system. Based on the Dolev-Yao model, an attacker model, called the message set of protocol format, is refined. At last, the simplified version of SAODV (secure ad hoc on-demand routing protocol) is verified with this method. With the type- inference-based formal method, not only is the security of protocols verified, but also the attacke examples are predicted. The complexity of inference is reduced significantly for refining the message set of protocol.

Laminar

Decentralized information flow control (DIFC) is a promising model for writing programs with powerful, end-to-end security guarantees. Current DIFC systems that run on commodity hardware can be broadly categorized into two types: language-level and operating system-level DIFC. Language level solutions provide no guarantees against security violations on system resources, like files and sockets. Operating system solutions can mediate accesses to system resources, but are inefficient at monitoring the flow of information through fine-grained program data structures. This paper describes Laminar, the first system to implement decentralized information flow control using a single set of abstractions for OS resources and heap-allocated objects. Programmers express security policies by labeling data with secrecy and integrity labels, and then access the labeled data in lexically scoped security regions. Laminar enforces the security policies specified by the labels at runtime. Laminar is implemented using a modified Java virtual machine and a new Linux security module. This paper shows that security regions ease incremental deployment and limit dynamic security checks, allowing us to retrofit DIFC policies on four application case studies. Replacing the applications' ad-hoc security policies changes less than 10% of the code, and incurs performance overheads from 1% to 56%. Whereas prior DIFC systems only support limited types of multithreaded programs, Laminar supports a more general class of multithreaded DIFC programs that can access heterogeneously labeled data.

Security-Aware Optimized Link Routing Protocol for Mobile Ad-Hoc Networks

In this technical report, we have examined the basic building blocks of mobile ad-hoc networks. The paper discusses various security requirements of ad-hoc networks, attacks in ad-hoc networks, Security Implementation and Routing Protocols. The primary purpose of the paper is to address the Optimized Link State Routing (OLSR) protocol in detail, along with the various possible attacks. Finally, algorithms for securing OLSR are proposed, via the addition of digital signatures, as well as more advanced techniques such as cross checking of advertised routing control data with the node’s geographical position. The main aim of this research work is the addition of security features to the existing OLSR protocol. In order to effectively design a secure routing protocol, we present a detailed literature survey of existing protocols, along with the various attacks. Based on the information gathered from the literature survey, a secure routing protocol for OLSR is proposed. The proposed secure routing protocol involves the addition of a digital signature as well as more advanced techniques such as the reuse of previous topology information to validate the actual link state. Thus, the main objective of this work is to provide secure routing and secure data transmission.

Secure ad hoc networks [Message from the Editor-in-Chief

This issue consists of two special topic sections and two articles accepted from open call. The first special topic section focuses on Security in Ad Hoc and Sensor Networks, and includes five articles. The second special topic section focuses on Wireless Sensor Networking and includes five articles. The two articles accepted from open call submissions both are related to session continuity during handoffs in heterogeneous mobile networks.

Intrusion detection for secure clustering and routing in Mobile Multi-hop Wireless Networks

Intrusion detection and secure routing schemes have been proposed for increasing security and reliability in critical wireless scenarios. In this paper we present an integrated secure routing system based on Intrusion Detection Systems (IDS) and Statistically Unique and Cryptographically Verifiable (SUCV) identifiers. The proposed IDS has been used for the support of secure Ad Hoc On Demand Distance Vector (AODV) routing, named IDS-based Secure AODV (IS-AODV), in wireless ad hoc and vehicular network scenarios. Our IDS is based on the detection of behavior anomalies on behalf of neighbor hosts, with passive reactions, aiming to create a cluster whose route paths will include only safe nodes, eventually. Simulation results show that the proposed IDS is effective in isolating misbehaving hosts, and it assists the AODV secure routing scheme to converge in finding safe end-to-end routes.

A Trustworthiness Based Ad-Hoc Secure Interoperation Method

A trustworthiness-based ad-hoc secure interoperation method is proposed, in which the concept of trustworthiness is introduced to describe the probability of proper collaboration. The trustworthiness of an autonomic domain on a user is decided jointly by direct experiences of interactions and other domains' assessments on the user. Only the users who satisfy the requirements of target domains' trust policies have the privileges to access entry roles. Records of a user's malicious actions will decrease his trustworthiness and then accordingly reduce his privileges. Target domain uses weighted majority algorithm to update recommender's trustworthiness, which is reduced by unfair ratings. Experimental results show that this method can effectively resist cheating and malicious actions.