• Title/Summary/Keyword: Node Flooding

Search Result 106, Processing Time 0.026 seconds

A Study on Flooding Attack Detection and Response Technique in MANET (MANET에서 플러딩 공격 탐지 및 대응 기법에 관한 연구)

  • Yang, Hwan Seok;Yoo, Seung Jae
    • Convergence Security Journal
    • /
    • v.13 no.4
    • /
    • pp.41-46
    • /
    • 2013
  • Routing protocol using in the existing wire network cannot be used as it is for efficient data transmission in MANET. Because it consists of only mobile nodes, network topology is changing dynamically. Therefore, each mobile node must perform router functions. Variety of routing attack like DoS in MANET is present owing to these characteristic. In this paper, we proposed cooperative-based detection method to improve detection performance of flooding attack which paralyzes network by consuming resource. Accurate attack detection is done as per calculated adaptively threshold value considered the amount of all network traffic and the number of nodes. All the mobile nodes used a table called NHT to perform collaborative detection and apply cluster structure to the center surveillance of traffic.

An Efficient Data Transfer Scheme for Improved Directed Diffusion in Wireless Sensor Networks (무선 센서 네트워크상에서 Directed Diffusion 개선을 위한 효율적인 데이터 전달 방법)

  • Lee, Jung-Eun;Kim, Jong-Hun;Choe, Ji-Sool;Kim, Jong-Wan;Kim, Kee-Cheon
    • Annual Conference of KIPS
    • /
    • 2008.05a
    • /
    • pp.1031-1034
    • /
    • 2008
  • 최근 원하는 정보를 수집하기 위한 무선 센서 네트워크(WSN) 사용이 증가하고 있으며, 이때 여러개의 작은 센서들이 배터리의 용량에 한정되어 있기 때문에 가장 우선적으로 고려해야 할 부분은 에너지 효율성이다. Directed Diffusion(DD)은 데이터 중심 기반 라우팅 알고리즘으로 싱크는 모든 센서 노드에게 인터레스트(Interest)를 전송(Flooding)하면 Interest를 받은 노드들은 경사(Gradient)를 만들어서 그 경로들 중 최적화 경로를 강화(Reinforce)한다. 이 경로는 센서 네트워크 전체적으로 볼 때는 에너지를 최소화 하지만, 매 Flooding시 에너지 고갈과 시간 낭비의 문제점이 나타난다. 본 논문에서는 DD의 문제점을 개선하여 싱크가 Interest를 Flooding할 때 마다 여러 번의 Flooding으로 노드의 에너지 고갈과 시간 낭비가 심각해지는 것을 방지하기 위해 중간노드가 Interest를 기억하도록 Middle-Interest Node(MIN)를 두어 데이터를 전달하는 새로운 기법을 제안한다. 본 기법의 성능은 DD와 제안기법인 MIN에 대한 수학적 분석에 기반 하여 측정하였다.

A Study on Attack Detection using Hierarchy Architecture in Mobile Ad Hoc Network (MANET에서 계층 구조를 이용한 공격 탐지 기법 연구)

  • Yang, Hwan Seok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.2
    • /
    • pp.75-82
    • /
    • 2014
  • MANET has various types of attacks. In particular, routing attacks using characteristics of movement of nodes and wireless communication is the most threatening because all nodes which configure network perform a function of router which forwards packets. Therefore, mechanisms that detect routing attacks and defense must be applied. In this paper, we proposed hierarchical structure attack detection techniques in order to improve the detection ability against routing attacks. Black hole detection is performed using PIT for monitoring about control packets within cluster and packet information management on the cluster head. Flooding attack prevention is performed using cooperation-based distributed detection technique by member nodes. For this, member node uses NTT for information management of neighbor nodes and threshold whether attack or not receives from cluster head. The performance of attack detection could be further improved by calculating at regular intervals threshold considering the total traffic within cluster in the cluster head.

A Probabilistic Broadcasting Mechanism based on Cross Layer Model Deliberating Received Signal Strength Ratio in Mobile Ad Hoc Networks

  • Kim, Jae-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.3
    • /
    • pp.25-32
    • /
    • 2016
  • Mobile Ad Hoc Networks(MANETs) consists of mobile nodes which communicate with each other without any centralized infrastructure. Message broadcasting by flooding for route discovery in MANET can result in high redundant retransmission, contention and collision of broadcasting packet, known as the broadcast storm problem collectively. The cross-layer design is adopted in this paper, which lets routing layer share the received signal strength information at MAC layer. Also this paper proposes a new probabilistic approach that dynamically adjusts the rebroadcasting probability of a node for routing request packets (RREQs) according to the received signal strength. The simulation results show that the proposed approach demonstrates better performance than blind flooding, fixed probabilistic broadcasting approaches.

Reliability analysis of failure models in circuit-switched networks (회선교환망에서의 고장모델에 대한 신뢰도 분석)

  • 김재현;이종규
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.8
    • /
    • pp.1-10
    • /
    • 1995
  • We have analyzed the reliability of failure models in circuit-switched networks. These models are grid topology circuit-switched networks, and each node transmits a packet to a destination node using a Flooding routing method. We have assumed that the failure of each link and node is independent. We have considered two method to analyze reliability in these models : The Karnaugh Map method and joint probability method. In this two method, we have analyzed the reliability in a small grid topology circuit switched network by a joint probability method, and comared analytic results with simulated ones. For a large grid enormous. So, we have evaluated the reliability of the network by computer simulation techniques. As results, we have found that the analytic results are very close to simulated ones in a small grid topology circuit switched network. And, we have found that network reliability decreases exponentially, according to increment of link or node failure, and network reliability is almost linearly decreased according to increment of the number of links, by which call has passed. Finally, we have found an interesting result that nodes in a center of the network are superior to the other nodes from the reliability point of view.

  • PDF

Implementation and Performance of Energy-efficient Node Management in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적 노드 관리 기능 구현 및 성능평가)

  • Ji, Kyoung-Bok;Kim, Sang-Kyung;Kim, Chang-Hwa
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.4
    • /
    • pp.123-131
    • /
    • 2008
  • Many researches have been actively performed to increase energy efficiency in wireless sensor networks. In these researches communication has been the most important target for reducing energy consumption. In fact, in most cases, the frequencies of communication and sensing in a sensor node affect its energy consumption. Therefore, sensing period and transmission period need to be controlled to increase energy efficiency. This paper proposes on energy efficient and restricted query flooding mechanism using service discovery. Further, we implement node management system based on the mechanism and evaluate its performance.

  • PDF

PERFORMANCE ANALYSES OF PATH RECOVERY ROUTING PROTOCOLS IN AD HOC NETWORKS

  • Wu, Mary;Kim, Chong-Gun
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.1_2
    • /
    • pp.235-249
    • /
    • 2008
  • On-demand routing protocol in ad hoc network is that establishes a route to a destination node only when it is required by a source node. But, it is necessary to reestablish a new route when an active route breaks down. The reconstruction process establishes another route by flooding messages from the source to the destination, cause not only heavy traffic but also long delays in route discovery. A good method for analyzing performance of protocols is important for deriving better systems. In this paper, we suggest the numerical formulas of a representative on-demand routing protocol AODV, ARMP, and RRAODV to estimate the performance of these routing protocols for analyzing the performance of these protocols. The proposed analytical models are very simple and straightforward. The results of analysis show good agreement with the results of computer simulations.

  • PDF

A Study on Efficient Routing Protocol for Ad-Hoc Network (Ad-hoc network에서의 효율적인 라우팅에 관한 연구)

  • Yang, Hwan-Seok;Sung, Eun-Sun;Lee, Woong-Ki
    • Annual Conference of KIPS
    • /
    • 2002.11b
    • /
    • pp.1583-1586
    • /
    • 2002
  • 본 논문에서는 ad hoc 네트워크에서 사용되는 proactive 라우팅 프로토콜과 reactive 라우팅 프로토콜의 혼합인 hybrid 라우팅 프로토콜에 대해 제안하였다. 본 논문에서는 기존의 hybrid 라우팅 프로토콜이 ZRP와는 달리 Ad hoc 네트워크를 구성하는 노드들 중에 네트워크 서비스를 제공해주는 특별한 노드를 설정하여 라우팅 하는 방법을 제안한다. 이러한 역할을 해주는 특별한 노드를 본 논문에서는 C-Node라 부른다. C-Node를 이용한 라우팅으로 기존의 라우팅 프로토콜보다 경로 실정 시간과 flooding 시간을 줄이므로서 효율적인 라우팅을 수행할 수 있게된다.

  • PDF

Reducing Flooding Latency in Power Save Mode of IEEE 802.11-based Mobile Ad hoc Networks (IEEE 802.11 기반 이동 애드혹 망의 전력 절감 모드에서 플러딩 지연의 개선)

  • 윤현주;서명환;마중수
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.5
    • /
    • pp.532-543
    • /
    • 2004
  • Mobile Ad hoc NETworks (MANET) consist of mobile nodes which are usually powered by battery Approaches for minimizing power consumption have been proposed for all network layers and devices. IEEE 802.11 DCF (Distributed Coordination Function), a well-known medium access control protocol for MANETS, also defines a power save mode operation. The nodes in power save mode periodically repeat the awake state and the doze state in synchronized fashion. When all nodes are in the awake state, the exchange the announcements for the subsequent message transmission with neighbors. The nodes that send or receive the announcements stay awake for data transmission, and others go into the dole state. The previous works for enhancing the power save mode operation have focused on shortening the duration of the awake state. We observed that the longer sleeping period results in seriously long delivery latency and the consequent unnecessary power consumption as well, because the packets can move forward only one hop for a fixed interval. In this paper, we propose an improved protocol for the power save mode of IEEE 802.11 DCF, which allows the flooding packets to be forwarded several hops in a transmission period. Our approach does not reduce the duration of compulsory awake period, but maximizes its utilization. Each node propagates the announcements for next flooding to nodes of several hops away, thus the packets can travel multiple hops during one interval. Simulation results of comparison between our scheme and the standard show a reduction in flooding delay maximum 80%, and the unicasting latency with accompanying flooding flows near 50%, with slight increase of energy consumption.

A Data Gathering Scheme using Dynamic Branch of Mobile Sink in Wireless Sensor Networks (무선 센서망에서 이동 싱크의 동적 브랜치를 통한 데이터 수집 방안)

  • Lee, Kil-Hung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.1
    • /
    • pp.92-97
    • /
    • 2012
  • This paper suggests a data gathering scheme using dynamic branch tree in wireless sensor networks. A mobile sink gathers data from each sensor node using a dynamic data gathering tree rooted at the mobile sink node. As the sink moves, a tree that has multiple branch is formed and changed dynamically as with the position of the sink node. A hop-based scope filter and a restricted flooding scheme of the tree are also suggested. Simulation results show that the proposed data gathering scheme has better results in data arrival rate, the end-to-end delay and energy saving characteristics compared with the previous scheme.