• 제목/요약/키워드: help nodes

검색결과 155건 처리시간 0.028초

Dynamic Threshold Method for Isolation of Worm Hole Attack in Wireless Sensor Networks

  • Surinder Singh;Hardeep Singh Saini
    • International Journal of Computer Science & Network Security
    • /
    • 제24권5호
    • /
    • pp.119-128
    • /
    • 2024
  • The moveable ad hoc networks are untrustworthy and susceptible to any intrusion because of their wireless interaction approach. Therefore the information from these networks can be stolen very easily just by introducing the attacker nodes in the system. The straight route extent is calculated with the help of hop count metric. For this purpose, routing protocols are planned. From a number of attacks, the wormhole attack is considered to be the hazardous one. This intrusion is commenced with the help of couple attacker nodes. These nodes make a channel by placing some sensor nodes between transmitter and receiver. The accessible system regards the wormhole intrusions in the absence of intermediary sensor nodes amid target. This mechanism is significant for the areas where the route distance amid transmitter and receiver is two hops merely. This mechanism is not suitable for those scenarios where multi hops are presented amid transmitter and receiver. In the projected study, a new technique is implemented for the recognition and separation of attacker sensor nodes from the network. The wormhole intrusions are triggered with the help of these attacker nodes in the network. The projected scheme is utilized in NS2 and it is depicted by the reproduction outcomes that the projected scheme shows better performance in comparison with existing approaches.

개더 조건에 따른 개더 효과에 관한 연구 (A Study on the Effect of Gathering made by Gathering Conditions)

  • 이명희;정희경
    • 한국의류학회지
    • /
    • 제28권6호
    • /
    • pp.776-783
    • /
    • 2004
  • The purpose of this study was to identify the reasonable gathering conditions as consider of effect of gathering and variation of silhouette made by gathering conditions. The experimental design consists of four factorial design: (1) three kinds of different weight and different thickness fabrics (2) three kinds of different stitch densities (3) five kinds of different ratio of gathers (4) three kinds of different angles. Therefore one hundred thirty five (135) samples were made. Data analysis utilize SPSS WIN 10.0 Package. The results of this study were as follows: 1. In the aspect of fabrics, it is shown the visual propriety that it is as thin as the small stitch, and as thick as the big stitch. 2. As stitch densities, it shows the different stabilized nodes. 3. In the aspect of ratio of gathers, it is shown the visual propriety that a few was small stitches, which help formations of nodes, and a lot were big stitches, which help increased the effect of gather. 4. In the aspect of angle of bias, the drape appearance was excellent as a sample of cutting by 0 angle(0$^{\circ}$) of bias. The big stitches that help formations of stabilized nodes, and a case of cutting by 45 angle(45$^{\circ}$) of bias was small stitch.

Wireless Ad Hoc Network에서 보안 영역과 노드 인증을 이용한 보안 라우팅 기법에 관한 연구 (A Study on Secure Routing using Secure Zone and Nodes Authentication in Wireless Ad Hoc Network)

  • 양환석
    • 디지털산업정보학회논문지
    • /
    • 제10권3호
    • /
    • pp.161-169
    • /
    • 2014
  • Wireless Ad Hoc Network is suitable for emergency situations such as and emergency, disaster recovery and war. That is, it has a characteristic that can build a network and use without help of any infrastructure. However, this characteristic is providing a cause of many security threats. In particular, routing attack is not applied the existing routing methods as it is and it is difficult to determine accurately whether nodes that participate in routing is malicious or not. The appropriate measure for this is necessary. In this paper, we propose a secure routing technique through a zone architecture-based node authentication in order to provide efficient routing between nodes. ZH node is elected for trust evaluation of the member nodes within each zone. The elected ZH node issues a certification of the member nodes and stores the information in ZMTT. The routing involvement of malicious nodes is blocked by limiting the transfer of data in the nodes which are not issued the certification. The superior performance of the proposed technique is confirmed through experiments.

Mobile Ad Hoc Network에서 분산 모니터링을 이용한 향상된 침입탐지 기법 연구 (A Study on Improved Intrusion Detection Technique Using Distributed Monitoring in Mobile Ad Hoc Network)

  • 양환석
    • 디지털산업정보학회논문지
    • /
    • 제14권1호
    • /
    • pp.35-43
    • /
    • 2018
  • MANET composed of only wireless nodes is increasingly utilized in various fields. However, it is exposed to many security vulnerabilities because it doesn't have any infrastructure and transmits data by using multi-hop method. Therefore, MANET should be applied the intrusion detection technique that can detect efficiently malicious nodes and decrease impacts of various attacks. In this paper, we propose a distributed intrusion detection technique that can detect the various attacks while improving the efficiency of attack detection and reducing the false positive rate. The proposed technique uses the cluster structure to manage the information in the center and monitor the traffic of their neighbor nodes directly in all nodes. We use three parameters for attack detection. We also applied an efficient authentication technique using only key exchange without the help of CA in order to provide integrity when exchanging information between cluster heads. This makes it possible to free the forgery of information about trust information of the nodes and attack nodes. The superiority of the proposed technique can be confirmed through comparative experiments with existing intrusion detection techniques.

Wireless Mobile Sensor Networks with Cognitive Radio Based FPGA for Disaster Management

  • Ananthachari, G.A. Preethi
    • Journal of Information Processing Systems
    • /
    • 제17권6호
    • /
    • pp.1097-1114
    • /
    • 2021
  • The primary objective of this work was to discover a solution for the survival of people in an emergency flood. The geographical information was obtained from remote sensing techniques. Through helpline numbers, people who are in need request support. Although, it cannot be ensured that all the people will acquire the facility. A proper link is required to communicate with people who are at risk in affected areas. Mobile sensor networks with field-programmable gate array (FPGA) self-configurable radios were deployed in damaged areas for communication. Ad-hoc networks do not have a centralized structure. All the mobile nodes deploy a temporary structure and they act as a base station. The mobile nodes are involved in searching the spectrum for channel utilization for better communication. FPGA-based techniques ensure seamless communication for the survivors. Timely help will increase the survival rate. The received signal strength is a vital factor for communication. Cognitive radio ensures channel utilization in an effective manner which results in better signal strength reception. Frequency band selection was carried out with the help of the GRA-MADM method. In this study, an analysis of signal strength for different mobile sensor nodes was performed. FPGA-based implementation showed enhanced outcomes compared to software-based algorithms.

Shalt-Term Hydrological forecasting using Recurrent Neural Networks Model

  • Kim, Sungwon
    • 한국수자원학회:학술대회논문집
    • /
    • 한국수자원학회 2004년도 학술발표회
    • /
    • pp.1285-1289
    • /
    • 2004
  • Elman Discrete Recurrent Neural Networks Model(EDRNNM) was used to be a suitable short-term hydrological forecasting tool yielding a very high degree of flood stage forecasting accuracy at Musung station of Wi-stream one of IHP representative basins in South Korea. A relative new approach method has recurrent feedback nodes and virtual small memory in the structure. EDRNNM was trained by using two algorithms, namely, LMBP and RBP The model parameters, optimal connection weights and biases, were estimated during training procedure. They were applied to evaluate model validation. Sensitivity analysis test was also performed to account for the uncertainty of input nodes information. The sensitivity analysis approach could suggest a reduction of one from five initially chosen input nodes. Because the uncertainty of input nodes information always result in uncertainty in model results, it can help to reduce the uncertainty of EDRNNM application and management in small catchment.

  • PDF

Energy Saving in Cluster-Based Wireless Sensor Networks through Cooperative MIMO with Idle-Node Participation

  • Fei, Li;Gao, Qiang;Zhang, Jun;Wang, Gang
    • Journal of Communications and Networks
    • /
    • 제12권3호
    • /
    • pp.231-239
    • /
    • 2010
  • In cluster-based wireless sensor networks, the energy could be saved when the nodes that have data to transmit participate in cooperative multiple-input multiple-output (MIMO). In this paper, by making the idle nodes that have no data to transmit participate in the cooperative MIMO, it is found that much more energy could be saved. The number of the idle nodes that participate in the cooperative MIMO is optimized to minimize the total energy consumption. It is also found that the optimal number of all the nodes participating in cooperative communication does not vary with the number of nodes that have data to transmit. The proposition is proved mathematically. The influence of long-haul distance and modulation constellation size on the total energy consumption is investigated. A cooperative MIMO scheme with help-node participation is proposed and the simulation results show that the proposed scheme achieves significant energy saving.

무선 인지 애드 혹 네트워크를 위한 휴지 노드를 활용하는 효율적인 다중 채널 MAC 프로토콜 (An Efficient Multi-Channel MAC Protocol for Cognitive Ad-hoc Networks with Idle Nodes Assistance)

  • 디니쉬 고텀;구인수
    • 한국인터넷방송통신학회논문지
    • /
    • 제11권4호
    • /
    • pp.39-45
    • /
    • 2011
  • 본 논문에서는 무선 인지 애드 혹 네트워크에서 다중 채널 숨겨진 지국 문제(hidden terminal problem)를 해결하고 네트워크 성능을 향상시키기 위하여, 이웃 휴지 노드(idle node)들을 활용하는 효율적인 다중 채널 MAC 프로토콜을 제안한다. 제안된 알고리즘은 각 노드가 단일 송수신기를 갖고, 제어 메시지 교환을 위한 공동 제어 채널을 활용하는 무선 인지 애드 혹 네트워크에 활용될 수 있다. 특히, 제안된 알고리즘에서는 데이터를 교환하고자 하는 통신 노드들이 한 홉(hop) 밖에서 사용되고 있는 데이터 채널에 대한 정보를 가지고 있는 이웃 휴지 노드들을 활용하여 데이터 채널을 선택함으로써 다중 채널 숨겨진 지국 문제를 효율적으로 해결할 수 있다. 시뮬레이션을 통해, 제안된 알고리즘이 중 채널 숨겨진 지국 문제를 최소화하고 2차 사용자간의 데이터 채널 선택시 발생하는 출돌(collision)을 줄임으로써 네트워크의 처리율을 증가시킬 수 있음을 보였다.

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
    • /
    • 제22권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.

다양한 도움 노드의 수를 가지는 재생 부호의 설계 (The Design of Regenerating Codes with a Varying Number of Helper Nodes)

  • 이혁;이정우
    • 한국통신학회논문지
    • /
    • 제41권12호
    • /
    • pp.1684-1691
    • /
    • 2016
  • 최근 분산 저장 시스템에 erasure code를 활용하여 저장소 효율성을 높이려는 연구가 활발히 진행되고 있다. 재생 부호(regenerating codes)는 erasure code의 일종으로, 높은 저장소 효율성과 네트워크 효율성을 가지는 코드이다. (n,k,d)-재생 부호는 n개의 저장소 노드를 가지며, 손실된 노드가 발생하였을 때, 해당 노드는 d개의 살아남은 노드로부터 정보를 다운로드받아 복구될 수 있다. 하지만 일반적인 재생 부호는 노드 복구 시 정확히 d개의 도움 노드들을 사용해야 하며, 노드 손실이 빈번하거나, 노드 간 접속이 불안정한 환경에서, d개 이하의 노드들에만 접속 가능할 경우에 유연하게 대처할 수 없다. 본 논문에서는 약간의 복구 대역폭의 희생을 통하여, $$k{\leq_-}{\bar{d}}{\leq_-}d$$의 다양한 도움 노드의 수 ${\bar{d}}$개로 노드를 복구할 수 있는 유연한 코드 운용 방식을 제안하였다.