• Title/Summary/Keyword: MANET Security

Search Result 94, Processing Time 0.04 seconds

A Secure and Efficient Method for Detecting Malicious Nodes in MANET (MANET에서 악의적인 노드의 안전하고 효율적인 검출 방안)

  • Lee KangSeok;Choi JongOh;Ji JongBok;Song JooSeok
    • The KIPS Transactions:PartC
    • /
    • v.12C no.5 s.101
    • /
    • pp.617-622
    • /
    • 2005
  • Lately, the MANET research has focused on providing routing services with security and previous schemes have been proposed for detecting malicious nodes in a MANET. However, they still include some problems which malicious nodes cannot be found when they falsely report other nodes as malicious. Accordingly, we propose a novel and efficient scheme for detecting malicious nodes using report messages and a report table which is consisted of node ID both for suspecting and reporting when the malicious nodes behave normally during the route discovery, but the other hand they drop and modify packets, or falsely report other nodes as malicious during the data transmission. Our proposed scheme is applicable to not only DSR but aiso AODV. And we provide some simulation results of our proposed scheme by comparing general AODV with our proposed scheme. Simulation results show that our Proposed scheme outperforms general AODV in terms of average packet loss ratio and packet delivery ratio.

A Secure Routing Protocol in MANET based on Malicious behavior Pattern of Node and Trust Level (노드의 악의적 행위패턴 및 신뢰수준 기반의 MANET Secure 라무팅 방안)

  • Park, Seong-Seung;Park, Gun-Woo;Ryu, Keun-Ho;Lee, Sang-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.5
    • /
    • pp.103-117
    • /
    • 2009
  • In MANET(Mobile Ad-Hoc Network), providing security to routing has been a significant issue recently. Existing studies, however, focused on either of secure routing or packet itself where malicious operations occur. In this paper, we propose SRPPnT(A Secure Routing Protocol in MANET based on Malicious Pattern of Node and Trust Level) that consider both malicious behavior on packet and secure routing. SRPPnT is identify the node where malicious activities occur for a specific time to compose trust levels for each node, and then to set up a routing path according to the trust level obtained. Therefore, SRPPnT is able to make efficient countermeasures against malicious operations. SRPPnT is based on AODV(Ad-Hoc On-Demand Distance Vector Routing). The proposed SRPPnT, from results of the NS-2 network simulation. shows a more prompt and accurate finding of malicious nodes than previous protocols did, under the condition of decreased load of networks and route more securely.

Development of Protective Scheme against Collaborative Black Hole Attacks in Mobile Ad hoc Networks

  • Farooq, Muhammad Umar;Wang, Xingfu;Sajjad, Moizza;Qaisar, Sara
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.3
    • /
    • pp.1330-1347
    • /
    • 2018
  • Mobile Ad hoc Network (MANET) is a collection of nodes or communication devices that wish to communicate without any fixed infrastructure and predetermined organization of available links. The effort has been made by proposing a scheme to overcome the critical security issue in MANET. The insufficiency of security considerations in the design of Ad hoc On-Demand Distance Vector protocol makes it vulnerable to the threats of collaborative black hole attacks, where hacker nodes attack the data packets and drop them instead of forwarding. To secure mobile ad hoc networks from collaborative black hole attacks, we implement our scheme and considered sensor's energy as a key feature with a better packet delivery ratio, less delay time and high throughput. The proposed scheme has offered an improved solution to diminish collaborative black hole attacks with high performance and benchmark results as compared to the existing schemes EDRIAODV and DRIAODV respectively. This paper has shown that throughput and packet delivery ratio increase while the end to end delay decreases as compared to existing schemes. It also reduces the overall energy consumption and network traffic by maintaining accuracy and high detection rate which is more safe and reliable for future work.

Intrusion Detection System based on Cluster (클러스터를 기반으로 한 침입탐지시스템)

  • Yang, Hwan-Seok
    • Journal of Digital Contents Society
    • /
    • v.10 no.3
    • /
    • pp.479-484
    • /
    • 2009
  • Security system of wireless network take on importance as use of wireless network increases. Detection and opposition about that is difficult even if attack happens because MANET is composed of only moving node. And it is difficult that existing security system is applied as it is because of migratory nodes. Therefore, system is protected from malicious attack of intruder in this environment and it has to correspond to attack immediately. In this paper, we propose intrusion detection system using cluster head in order to detect malicious attack and use resources efficiently. we used method that gathering of rules is defined and it judges whether it corresponds or not to detect intrusion more exactly. In order to evaluate performance of proposed method, we used blackhole, message negligence, jamming attack.

  • PDF

Traceback Technique using Table-based Route Management under Mobile Ad Hoc Network Environment (Mobile Ad Hoc Network에서 테이블 기반 경로 관리를 이용한 역추적 기법)

  • Yang, Hwan Seok;Yoo, Seung Jae
    • Convergence Security Journal
    • /
    • v.13 no.1
    • /
    • pp.19-24
    • /
    • 2013
  • MANET has a highly dynamic topology because it consists of only mobile nodes. Various attacks using these characteristics exist. Among them, damage of the attacks based flooding such as DoS or DDos is large and traceback of the attack node is not easy. It is because route information by moving of intermediate nodes which pass the data changes frequently. In this paper, we propose table-based traceback technique to perform efficient traceback although route information by moving of nodes changes frequently. Cluster head manages route management table in order to form cluster status table and network topology snapshot for storing the location information of mobile nodes when cluster member nodes change. Also, bloom filter is used to reduce the amount of storing route information. The performance of the proposed technique is confirmed through experiment.

Efficient Authentication for Mobile Nodes in Mobile Ad Hoc Network (Mobile Ad Hoc Network에서 이동 노드에 대한 효율적인 인증 메커니즘)

  • Lee Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.11
    • /
    • pp.27-34
    • /
    • 2005
  • Mobile Ad Hoc Networks (MANETs) are self-organized networks that do not rely in their operation on wired infrastructure. As in any networking technology, security is an essential element in MANET as well, for proliferation of this type of networks. But supporting secure communication in MANETs proved to be a significant challenge, mainly due to the fact that the set of nodes in the network can change frequently and rapidly and due to the lack of access to the wired infrastructure. In particular, the trust model and the authentication protocols, which were developed for wired and infrastructure-based networks, cannot be used in MANETs. In this paper, we address the problem of efficient authentication of distributed mobile users in geographically large networks. In particular, we propose a new authentication scheme for this case of MANETs. The proposed scheme exploits Randomized Groups to efficiently share authentication information among nodes that together implement the function of a distributive Certification Authority (CA). We then evaluate the performance of authentication using Randomized Groups.

Impact of Trust-based Security Association and Mobility on the Delay Metric in MANET

  • Nguyen, Dang Quan;Toulgoat, Mylene;Lamont, Louise
    • Journal of Communications and Networks
    • /
    • v.18 no.1
    • /
    • pp.105-111
    • /
    • 2016
  • Trust models in the literature of MANETs commonly assume that packets have different security requirements. Before a node forwards a packet, if the recipient's trust level does not meet the packet's requirement level, then the recipient must perform certain security association procedures, such as re-authentication. We present in this paper an analysis of the epidemic broadcast delay in such context. The network, mobility and trust models presented in this paper are quite generic and allow us to obtain the delay component induced only by the security associations along a path. Numerical results obtained by simulations also confirm the accuracy of the analysis. In particular, we can observe from both simulation's and analysis results that, for large and sparsely connected networks, the delay caused by security associations is very small compared to the total delay of a packet. This also means that parameters like network density and nodes' velocity, rather than any trust model parameter, have more impact on the overall delay.

Data Origin Authentication Scheme for Wireless Mesh Networks (무선 메쉬 네트워크를 위한 데이터 송신 인증 기술)

  • Kang, Nam-Hi
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.7
    • /
    • pp.135-142
    • /
    • 2010
  • Wireless mesh network, which is an access network technology, adopts ubiquitous features of ad-hoc network that includes capabilities of self-configuration and self-management. This paper proposes a scheme which enables nodes along route in wireless mesh network to authenticate data and verify data integrity. The scheme distinguishes infra-node, which is a network device used to form mesh network, and user node in ad-hoc network, which operates functions as a sender, receiver or relayer, to deploy different authentication scheme. That is, hop-based authentication scheme along route forming wireless backbone differs from authentication scheme for user nodes in route over MANET. The proposed scheme is less complex than previously proposed schemes from the repects of security setup procedures and managements. In addition, the scheme is able to reduce transmission delay from a source to a destination owing to fast authentication over wireless backbone.

Neighbor-Based Probabilistic Rebroadcast Routing Protocol for Reducing Routing Overhead in Mobile Ad Hoc Networks

  • Harum, Norharyati;Hamid, Erman;Bahaman, Nazrulazhar;Ariff, Nor Azman Mat;Mas'ud, Mohd Zaki
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12
    • /
    • pp.1-8
    • /
    • 2021
  • In Mobile Ad-Hoc Network (MANET) Application, routing protocol is essential to ensure successful data transmission to all nodes. Ad-hoc On-demand Distance Vector (AODV) Protocol is a reactive routing protocol that is mostly used in MANET applications. However, the protocol causes Route Request (RREQ) message flooding issue due to the broadcasting method at the route request stage to find a path to a particular destination, where the RREQ will be rebroadcast if no Request Response (RREP) message is received. A scalable neighbor-based routing (SNBR) protocol was then proposed to overcome the issue. In the SNBR protocol, the RREQ message is only rebroadcast if the number of neighbor nodes less than a certain fix number, known as drop factor. However, since a network always have a dynamic characteristic with a dynamic number of neighbor nodes, the fix drop factor in SNBR protocol could not provide an optimal flooding problem solution in a low dense network environment, where the RREQ message is continuously rebroadcast RREQ message until reach the fix drop factor. To overcome this problem, a new broadcasting method as Dynamic SNBR (DSNBR) is proposed, where the drop factor is determined based on current number of neighbor nodes. This method rebroadcast the extra RREQ messages based on the determined dynamic drop factor. The performance of the proposed DSNBR is evaluated using NS2 and compared with the performance of the existing protocol; AODV and SNBR. Simulation results show that the new routing protocol reduces the routing request overhead, energy consumption, MAC Collision and enhances end-to-end delay, network coverage ratio as a result of reducing the extra route request messages.

A Study on Efficient Multicast Technique using Virtual Group based on Geographic Information in MANET (위치정보 기반 가상 그룹을 활용한 효율적인 멀티캐스트 기법 연구)

  • Yang, Hwan Seok
    • Convergence Security Journal
    • /
    • v.17 no.5
    • /
    • pp.87-92
    • /
    • 2017
  • MANET is a network composed itself because mobile nodes are connected wirelessly. It has been applied to various fields for group communication. However, the dynamic topology by the movement of the nodes causes routing failure frequently because it is difficult to maintain the position information of the nodes participating in the group communication. Also, it has a problem that network performance is decreased due to high overhead for managing information of member nodes. In this paper, we propose a multicast technique using location-based 2-tier virtual group that is flexible and reliable in management of member nodes. The network is composed of cellular zones and the virtual group is constructed using the location information of the nodes in the proposed technique. The virtual group management node is selected to minimize the overhead of location information management for member nodes in the virtual group. In order to improve the reliability for management of member nodes and multicast data transmission, it excludes the gateway node with low transfer rate when setting the route after the packet transmission rate of the member nodes is measured. The excellent performance of the proposed technique can be confirmed through comparative experiments with AMroute method and PAST-DM method.