• Title/Summary/Keyword: False Node Problem

Search Result 8, Processing Time 0.026 seconds

Control Frame Design for Improvement Transmit Efficiency in the Wireless Networks (무선 네트워크에서 전송효율증대를 위한 제어프레임 설계)

  • Han, Jae-Kyun;Pyeon, Seok-Beom
    • 전자공학회논문지 IE
    • /
    • v.48 no.2
    • /
    • pp.61-70
    • /
    • 2011
  • IEEE 802.11 wireless network supports control frames like RTS/CTS(Request To Send / Clear To Send). Because they is defend to frame collection problems. It helps to solve the frame collection problem but decreases the throughput rate. Also, control frame makes False Node Problem. This problem is makes to other wireless nodes don't work and don't find channels in the same cell and near cells. We proposed a reformed new control frame for efficiency throughput rate and solution of False Node Problem. New control frame is to have added to 4 bytes of channel detection ability at the RTS frames. Channel detection ability supported to check channel at the wireless node start to transmit data frame, We expect that channel detection ability make prevent False Node Problem for increase to access number to channel. We perform comparative analysis in terms of delay(sec) and load(bits/sec) with reform RTS/CTS method which proves the efficiency of the proposed method.

A Control Frame Design for Delay Decrease (Delay 감소를 위한 제어프레임 디자인)

  • Han, Kyoung-heon;Lee, Sang-duck;Kim, Chul-won;Han, Seung-jo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.445-446
    • /
    • 2009
  • IEEE 802.11 환경은 RTS/CTS(Request To Send/Clear To Send)을 지원한다. TS/CTS의 사용하면 Hidden Node Problem을 해결할 수 있지만 같은 셀안에 다른 노드를 대기상태로 만드는 False Node Problem이 발생하여 전송률을 감소시킨다. 따라서 본 논문에서는 체크포인트 방식을 사용하여 매체점유시간을 줄이는 제어프레임을 설계하고자 한다. 설계한 제어프레임의 OPNET을 사용하여 시뮬레이션하며, 기존의 제어프레임과 제안하는 제어프레임의 Delay를 비교함으로써 무선네트워크 환경에서 전송 효율을 비교 분석한다.

An Intrusion Detection Technique Suitable for TICN (전술정보통신체계(TICN)에 적합한 침입탐지 기법)

  • Lee, Yun-Ho;Lee, Soo-Jin
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.6
    • /
    • pp.1097-1106
    • /
    • 2011
  • Tactical Information Communication Network(TICN), a concept-type integrated Military Communication system that enables precise command control and decision making, is designed to advance into high speed, large capacity, long distance wireless relay transmission. To support mobility in battlefield environments, the application of Ad-hoc networking technology to its wireless communication has been examined. Ad-hoc network works properly only if the participating nodes cooperate in routing and packet forwarding. However, if selfish nodes not forwarding packets of other nodes and malicious nodes making the false accusation are in the network, it is faced to many threats. Therefore, detection and management of these misbehaving nodes is necessary to make confident in Ad-hoc networks. To solve this problem, we propose an efficient intrusion detection technique to detect and manage those two types of attacks. The simulation-based performance analysis shows that our approach is highly effective and can reliably detect a multitude of misbehaving node.

A Cluster-Based Top-k Query Processing Algorithm in Wireless Sensor Networks (무선 센서 네트워크에서 클러스터 기반의 Top-k 질의 처리)

  • Yeo, Myung-Ho;Seong, Dong-Ook;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.36 no.4
    • /
    • pp.306-313
    • /
    • 2009
  • Top-k queries are issued to find out the highest (or lowest) readings in many sensor applications. Many top-k query processing algorithms are proposed to reduce energy consumption; FILA installs a filter at each sensor node and suppress unnecessary sensor updates; PRIM allots priorities to sensor nodes and collects the minimal number of sensor reading according to the priorities. However, if many sensor reading converge into the same range of sensor values, it leads to a problem that many false positives are occurred. In this paper, we propose a cluster-based approach to reduce them effectively. Our proposed algorithm operates in two phases: top-k query processing in the cluster level and top-k query processing in the tree level. False positives are effectively filtered out in each level. Performance evaluations show that our proposed algorithm reduces about 70% false positives and achieves about 105% better performance than the existing top-k algorithms in terms of the network lifetime.

Key Re-distribution Scheme of Dynamic Filtering Utilizing Attack Information for Improving Energy Efficiency in WSNs (무선 센서 네트워크에서 에너지 효율성 향상을 위해 공격정보를 활용한 동적 여과 기법의 키 재분배 기법)

  • Park, Dong-Jin;Cho, Tae-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.26 no.2
    • /
    • pp.113-119
    • /
    • 2016
  • Wireless sensor networks are vulnerable to an adversary due to scarce resources and wireless communication. An adversary can compromise a sensor node and launch a variety of attacks such as false report injection attacks. This attack may cause monetary damage resulting in energy drain by forwarding the false reports and false alarms at the base station. In order to address this problem, a number of en-route filtering schemes has been proposed. Notably, a dynamic en-route filtering scheme can save energy by filtering of the false report. In the key dissemination phase of the existing scheme, the nodes closer to the source node may not have matching keys to detect the false report. Therefore, continuous attacks may result in unnecessary energy wastage. In this paper, we propose a key re-distribution scheme to solve this issue. The proposed scheme early detects the false report injection attacks using initially assigned secret keys in the phase of the key pre-distribution. The experimental results demonstrate the validity of our scheme with energy efficiency of up to 26.63% and filtering capacity up to 15.92% as compared to the existing scheme.

Probabilistic Filtering Method for Efficient Sensor Network Security (효율적인 센서 네트워크 보안을 위한 확률적인 필터링 기법)

  • Kim, Jin-Su;Shin, Seung-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.1
    • /
    • pp.382-389
    • /
    • 2012
  • The fabricated report attack will not only cause false alarms that waste real-world response efforts such as sending response teams to the event location, but also drains the finite amount of energy in a wireless sensor network. In this paper, we propose a probabilistic filtering method for sensor network security (PFSS) to deal with filtering for the fabricated report. On the basis of filtering scheme, PFSS combines cluster-based organization and probabilistic verification node assignment using distance of from cluster head to base station for energy efficiency and hot spot problem. Through both analysis and simulation, we demonstrate that PFSS could achieve efficient protection against fabricated report attack while maintaining a sufficiently high filtering power.

Dynamic States Consideration for Next Hop Nodes Selection Method to Improve Energy Efficiency in LEAP based Wireless Sensor Networks (LEAP기반의 무선 센서 네트워크에서 가변적 상태를 고려한 에너지 효율적 다음 홉 노드 선택 기법)

  • Nam, Su-Man;Cho, Tae-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.6
    • /
    • pp.558-564
    • /
    • 2013
  • Wireless sensor networks (WSNs) contain limited energy resources and are left in open environments. Since these sensor nodes are self-operated, attacks such as sinkhole attacks are possible as they can be compromised by an adversary. The sinkhole attack may cause to change initially constructed routing paths, and capture of significant information at the compromised node. A localized encryption and authentication protocol (LEAP) has been proposed to authenticate packets and node states by using four types of keys against the sinkhole attack. Even though this novel approach can securely transmits the packets to a base station, the packets are forwarded along the constructed paths without checking the next hop node states. In this paper, we propose the next hop node selection method to cater this problem. Our proposed method evaluates the next hop node considering three factors (i.e., remaining energy level, number of shared keys, and number of filtered false packets). When the suitability criterion for next hop node selection is satisfied against a fix threshold value, the packet is forwarded to the next hop node. We aim to enhance energy efficiency and a detour of attacked areas to be effectively selected Experimental results demonstrate validity of the proposed method with up to 6% energy saving against the sinkhole attack as compared to the LEAP.

Detection and Trust Evaluation of the SGN Malicious node

  • Al Yahmadi, Faisal;Ahmed, Muhammad R
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.6
    • /
    • pp.89-100
    • /
    • 2021
  • Smart Grid Network (SGN) is a next generation electrical power network which digitizes the power distribution grid and achieves smart, efficient, safe and secure operations of the electricity. The backbone of the SGN is information communication technology that enables the SGN to get full control of network station monitoring and analysis. In any network where communication is involved security is essential. It has been observed from several recent incidents that an adversary causes an interruption to the operation of the networks which lead to the electricity theft. In order to reduce the number of electricity theft cases, companies need to develop preventive and protective methods to minimize the losses from this issue. In this paper, we have introduced a machine learning based SVM method that detects malicious nodes in a smart grid network. The algorithm collects data (electricity consumption/electric bill) from the nodes and compares it with previously obtained data. Support Vector Machine (SVM) classifies nodes into Normal or malicious nodes giving the statues of 1 for normal nodes and status of -1 for malicious -abnormal-nodes. Once the malicious nodes have been detected, we have done a trust evaluation based on the nodes history and recorded data. In the simulation, we have observed that our detection rate is almost 98% where the false alarm rate is only 2%. Moreover, a Trust value of 50 was achieved. As a future work, countermeasures based on the trust value will be developed to solve the problem remotely.