• Title/Summary/Keyword: Ad-hoc Security

Search Result 297, Processing Time 0.025 seconds

A Vehicular Authentication Security Mechanism Modeling using Petri Net (Petri Net을 이용한 차량 인증 보안 메커니즘 모델링)

  • Song, Yu-Jin;Lee, Jong-Kun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.04a
    • /
    • pp.364-367
    • /
    • 2014
  • 차량 애드혹 네트워크(VANET : Vehicular Ad-Hoc Network) 환경에서 차량들은 네트워크 인프라를 바탕으로 한 통신들을 통하여 서로의 안전이나 편리성을 도모하고자 많은 관심을 가지고 지금까지 연구되어 왔으며 앞으로도 활발히 연구될 것이다. 그러나 안전성이나 편리성을 도모하고자 연구되어왔던 여러 부분들이 보안문제에 직면하면서 새로운 국면으로 접어들고 있다. 이에 본 논문에서는 차량 애드혹 네트워크에서 차량 간 통신을 효율적이고 안전하게 전송하기 위해 우선되어야 하는 차량의 인증을 위한 보안 메커니즘을 제안하고 이를 패트리넷 모델링 기법을 통해 검증하고자 한다. 본 논문에서 제안하는 차량 인증 보안 메커니즘(VASM : Vehicular Authentication Security Mechanism)은 차량 인증 기능과 함께 패트리넷으로 모델링 함으로써 차량들의 많은 변화로 복잡할 수밖에 없는 VANET에서의 보안요구들을 정의하여 수행하는데 유연하게 대처할 수 있다.

A Study on Secure Cluster Based Routing Protocol considering Distributed PKI Mechanisms (분산 PKI 메커니즘을 고려한 안전한 클러스터 기반 라우팅 프로토콜에 관한 연구)

  • Hahn, Gene-Beck;Nyang, Dae-Hun;Kim, Sin-Kyu;Seo, Sung-Hoon;Song, Joo-Seok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.05a
    • /
    • pp.1299-1302
    • /
    • 2004
  • 본 연구에서는 MANET(Mobile Ad Hoc Network)에서 분산 PKI(Public Key Infrastructure) 메커니즘을 라우팅 프로토콜에 적용하기 위한 방법을 제안한다. 이를 위해 MANET이 사용하는 라우팅 프로토콜로 CBRP(Cluster Based Routing Protocol)를 고려한다. 제안하는 프로토콜은 CBRP의 기능과 분산 PKI 메커니즘을 활용하여 효율적으로 인증서 체인을 찾을 수 있고, 이를 통해 통신노드 상호간의 세션키 설정과 송수신하고자 하는 데이터에 대한 암호화를 지원한다. 또한, 라우팅 프로토콜의 안전한 동작을 위해 제안하는 프로토콜은 전자서명된 HELLO 메시지를 교환하여 악의적인 공격자들에 대해 신뢰성을 제공하고, 안전한 라우팅을 가능하게 한다.

  • PDF

Modeling in System Engineering: Conceptual Time Representation

  • Al-Fedaghi, Sabah
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.3
    • /
    • pp.153-164
    • /
    • 2021
  • The increasing importance of such fields as embedded systems, pervasive computing, and hybrid systems control is increasing attention to the time-dependent aspects of system modeling. In this paper, we focus on modeling conceptual time. Conceptual time is time represented in conceptual modeling, where the notion of time does not always play a major role. Time modeling in computing is far from exhibiting a unified and comprehensive framework, and is often handled in an ad hoc manner. This paper contributes to the establishment of a broader understanding of time in conceptual modeling based on a software and system engineering model denoted thinging machine (TM). TM modeling is founded on a one-category ontology called a thimac (thing/machine) that is used to elaborate the design and analysis of ontological presumptions. The issue under study is a sample of abstract modeling domains as exemplified by time. The goal is to provide better understanding of the TM model by supplementing it with a conceptualization of time aspects. The results reveal new characteristics of time and related notions such as space, events, and system behavior.

MAC layer based cross-layer solutions for VANET routing: A review

  • Nigam, Ujjwal;Silakari, Sanjay
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12spc
    • /
    • pp.636-642
    • /
    • 2021
  • Vehicular Ad hoc Networks (VANET's) are gaining popularity in research community with every passing year due to the key role they play in Intelligent Transportation System. Their primary objective is to provide safety, but their potential to offer a variety of user-oriented services makes them more attractive. The biggest challenge in providing all these services is the inherent characteristics of VANET itself such as highly dynamic topology due to which maintaining continuous communication among vehicles is extremely difficult. Here comes the importance of routing solutions which traditionally are designed using strict layered architecture but fail to address stringent QoS requirements. The paradigm of cross-layer design for routing has shown remarkable performance improvements. This paper aims to highlight routing challenges in VANET, limitations of single-layer solutions and presents a survey of cross-layer routing solutions that utilize the information from the MAC layer to improve routing performance in VANET.

Enhancement OLSR Routing Protocol using Particle Swarm Optimization (PSO) and Genrtic Algorithm (GA) in MANETS

  • Addanki, Udaya Kumar;Kumar, B. Hemantha
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.4
    • /
    • pp.131-138
    • /
    • 2022
  • A Mobile Ad-hoc Network (MANET) is a collection of moving nodes that communicate and collaborate without relying on a pre-existing infrastructure. In this type of network, nodes can freely move in any direction. Routing in this sort of network has always been problematic because of the mobility of nodes. Most existing protocols use simple routing algorithms and criteria, while another important criterion is path selection. The existing protocols should be optimized to resolve these deficiencies. 'Particle Swarm Optimization (PSO)' is an influenced method as it resembles the social behavior of a flock of birds. Genetic algorithms (GA) are search algorithms that use natural selection and genetic principles. This paper applies these optimization models to the OLSR routing protocol and compares their performances across different metrics and varying node sizes. The experimental analysis shows that the Genetic Algorithm is better compared to PSO. The comparison was carried out with the help of the simulation tool NS2, NAM (Network Animator), and xgraph, which was used to create the graphs from the trace files.

A Diversified Message Type Forwarding Strategy Based on Reinforcement Learning in VANET

  • Xu, Guoai;Liu, Boya;Xu, Guosheng;Zuo, Peiliang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.3104-3123
    • /
    • 2022
  • The development of Vehicular Ad hoc Network (VANET) has greatly improved the efficiency and safety of social transportation, and the routing strategy for VANET has also received high attention from both academia and industry. However, studies on dynamic matching of routing policies with the message types of VANET are in short supply, which affects the operational efficiency and security of VANET to a certain extent. This paper studies the message types in VANET and fully considers the urgency and reliability requirements of message forwarding under various types. Based on the diversified types of messages to be transmitted, and taking the diversified message forwarding strategies suitable for VANET scenarios as behavioral candidates, an adaptive routing method for the VANET message types based on reinforcement learning (RL) is proposed. The key parameters of the method, such as state, action and reward, are reasonably designed. Simulation and analysis show that the proposed method could converge quickly, and the comprehensive performance of the proposed method is obviously better than the comparison methods in terms of timeliness and reliability.

A Study on DDoS Detection Technique based on Cluster in Mobile Ad-hoc Network (무선 애드혹 망에서 클러스터 기반 DDoS 탐지 기법에 관한 연구)

  • Yang, Hwan-Seok;Yoo, Seung-Jae
    • Convergence Security Journal
    • /
    • v.11 no.6
    • /
    • pp.25-30
    • /
    • 2011
  • MANET has a weak construction in security more because it is consisted of only moving nodes and doesn't have central management system. The DDoS attack is a serious attack among these attacks which threaten wireless network. The DDoS attack has various object and trick and become intelligent. In this paper, we propose the technique to raise DDoS detection rate by classifying abnormal traffic pattern. Cluster head performs sentinel agent after nodes which compose MANET are made into cluster. The decision tree is applied to detect abnormal traffic pattern after the sentinel agent collects all traffics and it judges traffic pattern and detects attack also. We confirm high attack detection rate of proposed detection technique in this study through experimentation.

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

Survivability Analysis of MANET Routing Protocols under DOS Attacks

  • Abbas, Sohail;Haqdad, Muhammad;Khan, Muhammad Zahid;Rehman, Haseeb Ur;Khan, Ajab;Khan, Atta ur Rehman
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.9
    • /
    • pp.3639-3662
    • /
    • 2020
  • The network capability to accomplish its functions in a timely fashion under failures and attacks is known as survivability. Ad hoc routing protocols have been studied and extended to various domains, such as Intelligent Transport Systems (ITSs), Unmanned Aerial Vehicles (UAVs), underwater acoustic networks, and Internet of Things (IoT) focusing on different aspects, such as security, QoS, energy. The existing solutions proposed in this domain incur substantial overhead and eventually become burden on the network, especially when there are fewer attacks or no attack at all. There is a need that the effectiveness of these routing protocols be analyzed in the presence of Denial of Service (DoS) attacks without any intrusion detection or prevention system. This will enable us to establish and identify the inherently stable routing protocols that are capable to survive longer in the presence of these attacks. This work presents a DoS attack case study to perform theoretical analysis of survivability on node and network level in the presence of DoS attacks. We evaluate the performance of reactive and proactive routing protocols and analyse their survivability. For experimentation, we use NS-2 simulator without detection or prevention capabilities. Results show that proactive protocols perform better in terms of throughput, overhead and packet drop.

Development of a Secure Routing Protocol using Game Theory Model in Mobile Ad Hoc Networks

  • Paramasivan, Balasubramanian;Viju Prakash, Maria Johan;Kaliappan, Madasamy
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.75-83
    • /
    • 2015
  • In mobile ad-hoc networks (MANETs), nodes are mobile in nature. Collaboration between mobile nodes is more significant in MANETs, which have as their greatest challenges vulnerabilities to various security attacks and an inability to operate securely while preserving its resources and performing secure routing among nodes. Therefore, it is essential to develop an effective secure routing protocol to protect the nodes from anonymous behaviors. Currently, game theory is a tool that analyzes, formulates and solves selfishness issues. It is seldom applied to detect malicious behavior in networks. It deals, instead, with the strategic and rational behavior of each node. In our study,we used the dynamic Bayesian signaling game to analyze the strategy profile for regular and malicious nodes. This game also revealed the best actions of individual strategies for each node. Perfect Bayesian equilibrium (PBE) provides a prominent solution for signaling games to solve incomplete information by combining strategies and payoff of players that constitute equilibrium. Using PBE strategies of nodes are private information of regular and malicious nodes. Regular nodes should be cooperative during routing and update their payoff, while malicious nodes take sophisticated risks by evaluating their risk of being identified to decide when to decline. This approach minimizes the utility of malicious nodes and it motivates better cooperation between nodes by using the reputation system. Regular nodes monitor continuously to evaluate their neighbors using belief updating systems of the Bayes rule.