• Title/Summary/Keyword: Wireless Jamming

Search Result 59, Processing Time 0.019 seconds

A Study on OSPF for Active Routing in Wireless Tactical Communication Network (전술통신망에서 능동적 라우팅을 위한 OSPF에 대한 연구)

  • Lee, Seung-Hwan;Lee, Jong-Heon;Lee, Hoon-Seop;Rhee, Seung-Hyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12B
    • /
    • pp.1211-1218
    • /
    • 2010
  • OSPF is the optimized routing protocol in wired network and considered as a tactical routing protocol in wireless tactical communication network. However because it is designed basically based on wired environment, it runs inadequately in wireless tactical environment: noise and jamming signal. So, we proposed new OSPF cost function to develop active routing protocol in wireless tactical communication network. In redefined cost function, there are four parameters that are relative transmission speed, link weight, router utilization, link average BER(Bit Error Rate). These parameters reflect wireless tactical characters. Also, we remodel the option field in Hello packet. It can help user to periodically check the link state. From the simulation result, it is shown that proposed OSPF is better than OSPF in jamming situation and has accumulative delay gain with dispersion of traffic load in entire network.

A Fast Anti-jamming Decision Method Based on the Rule-Reduced Genetic Algorithm

  • Hui, Jin;Xiaoqin, Song;Miao, Wang;Yingtao, Niu;Ke, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4549-4567
    • /
    • 2016
  • To cope with the complex electromagnetic environment of wireless communication systems, anti-jamming decision methods are necessary to keep the reliability of communication. Basing on the rule-reduced genetic algorithm (RRGA), an anti-jamming decision method is proposed in this paper to adapt to the fast channel variations. Firstly, the reduced decision rules are obtained according to the rough set (RS) theory. Secondly, the randomly generated initial population of the genetic algorithm (GA) is screened and the individuals are preserved in accordance with the reduced decision rules. Finally, the initial population after screening is utilized in the genetic algorithm to optimize the communication parameters. In order to remove the dependency on the weights, this paper deploys an anti-jamming decision objective function, which aims at maximizing the normalized transmission rate under the constraints of minimizing the normalized transmitting power with the pre-defined bit error rate (BER). Simulations are carried out to verify the performance of both the traditional genetic algorithm and the adaptive genetic algorithm. Simulation results show that the convergence rates of the two algorithms increase significantly thanks to the initial population determined by the reduced-rules, without losing the accuracy of the decision-making. Meanwhile, the weight-independent objective function makes the algorithm more practical than the traditional methods.

Dynamic Spectrum Access기반 국방통신기술

  • Kim, Chang-Ju
    • Information and Communications Magazine
    • /
    • v.30 no.1
    • /
    • pp.67-76
    • /
    • 2012
  • 본고에서는 jamming 이나 은폐 등으로 인하여 통신 채널이 동적으로 변화하는 전장환경에서 dynamic spectrum access(DSA) 기술을 토대로 보다 안정된 통신을 하는 기술을 알아본다. DSA 통신의 핵심기술을 설명하고, 미국의 DARPA에서 수행한 neXt Generation(XG) 프로젝트와 Wireless Network after Next(WNaN) 국방통신 프로젝트를 소개한 후에 결론에서 시사점을 다룬다.

Survey on IEEE 802.11 DCF Game Theoretic Approaches (IEEE 802.11 DCF에서의 게임 이론적 접근방법 소개)

  • Choi, Byeong-Cheol;Kim, Jung-Nyeo;Ryu, Jae-Cheol
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.240-242
    • /
    • 2007
  • The game theoretic analysis in wireless networks can be classified into the jamming game of the physical layer, the multiple access game of the medium access layer, the forwarder's dilemma and joint packet forwarding game of the network layer, and etc. In this paper, the game theoretic analysis about the multiple access game that selfish nodes exist in the IEEE 802.11 DCF(Distributed Coordination Function) wireless networks is addressed. In this' wireless networks, the modeling of the CSMA/CA protocol based DCF, the utility or payoff function calculation of the game, the system optimization (using optimization theory or convex optimization), and selection of Pareto-optimality and Nash Equilibrium in game strategies are the important elements for analyzing how nodes are operated in the steady state of system. Finally, the main issues about the game theory in the wireless network are introduced.

  • PDF

Ranging the Distance Between Wireless Sensor Nodes Using the Deviation Correction Method of Received Signal Strength (수신신호세기의 편차 보정법을 이용한 무선센서노드 간의 거리 추정)

  • Lee, Jin-Young;Kim, Jung-Gyu
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.7 no.2
    • /
    • pp.71-78
    • /
    • 2012
  • Based on the Zigbee-based wireless sensor network, I suggest the way to reduce errors between the short distance, improving the accuracy of the presumed distance by revising the deviation of RSSI(Received Signal Strength Indication) values is to estimate the distance using only the RF signal power without the additional hardware. In general, the graph measured by RSSI values shows the proximity values which are ideally reduced in proportion to the distance under the free outdoor space in which LOS(Line-Of-Sight) is guaranteed. However, if the result of the received RSSI values are each substituted to the formula, it can produce a larger margin of error and less accurate measurement since it is based upon the premise that this free space is not affected by reflected waves or obstacles caused by the ground and electronic jamming engendered by the environment. Therefore, the purpose of this study is to reduce the margin of errors between the distances and to measure the proximity values with the ideal type of graph by suggesting the way to revise the received RSSI values in the light of these reflected waves or obstacles and the electronic jamming. In conclusion, this study proves that errors are reduced by comparing the proposed deviation correction method to the revised RSSI value.

Joint Beamforming and Power Splitting Design for Physical Layer Security in Cognitive SWIPT Decode-and-Forward Relay Networks

  • Xu, Xiaorong;Hu, Andi;Yao, Yingbiao;Feng, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.1
    • /
    • pp.1-19
    • /
    • 2020
  • In an underlay cognitive simultaneous wireless information and power transfer (SWIPT) network, communication from secondary user (SU) to secondary destination (SD) is accomplished with decode-and-forward (DF) relays. Multiple energy-constrained relays are assumed to harvest energy from SU via power splitting (PS) protocol and complete SU secure information transmission with beamforming. Hence, physical layer security (PLS) is investigated in cognitive SWIPT network. In order to interfere with eavesdropper and improve relay's energy efficiency, a destination-assisted jamming scheme is proposed. Namely, SD transmits artificial noise (AN) to interfere with eavesdropping, while jamming signal can also provide harvested energy to relays. Beamforming vector and power splitting ratio are jointly optimized with the objective of SU secrecy capacity maximization. We solve this non-convex optimization problem via a general two-stage procedure. Firstly, we obtain the optimal beamforming vector through semi-definite relaxation (SDR) method with a fixed power splitting ratio. Secondly, the best power splitting ratio can be obtained by one-dimensional search. We provide simulation results to verify the proposed solution. Simulation results show that the scheme achieves the maximum SD secrecy rate with appropriate selection of power splitting ratio, and the proposed scheme guarantees security in cognitive SWIPT networks.

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

AJ Performance of the FH-CSS(Frequency Hopped - Chirp Spread Spectrum) Communication Systems (NED를 사용하는 FH-CSS(Frequency Hopped - Chirp Spread Spectrum)의 항 재밍 성능 분석)

  • Kim, Sung-Ho;Kim, Young-Jae;Hwang, Seok-Gu;Jo, Byoung-Gak;Shin, Kwan-Ho;Kim, Nam
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.1
    • /
    • pp.69-73
    • /
    • 2011
  • In the defence wireless communications, conventional Anti-Jamming techniques(Frequency Hopping/Spread Spectrum or Direct Sequence/Spread Spectrum) are used to overcome a intentional interfering signals which are single/multitone or partial band jammer etc. DS/SS techniques is very strong on tone jamming signal but not to be on a partial band jammer. So FH/SS AJ performances are expected method of an substitution of DS/SS, however FH/SS could not have good performance on some BMTJ(Band Multi-tone Jammer). So this paper proposes FH-CSS (Frequency Hopped - Chirp Spread Spectrum) to get more robustness against jammers(BMTJ, PBNJ) and analyze the AJ performances.

A Cooperative Navigation for UAVs with Inertial Sensors and Passive Sensor Using Wireless Communication (무선통신을 이용한 관성센서 및 수동센서 장착 무인기들의 협력 항법)

  • Seong, Sang Man
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.2
    • /
    • pp.102-106
    • /
    • 2013
  • A cooperative navigation method for cooperative flight of UAVs is proposed. The commonly used navigation method for UAVs is based on GNSS measurements. However, when it is not available by jamming or other causes, an alternative method is needed. In this paper, it is shown that UAVs equipped with inertial sensors, passive sensor and wireless communication link can perform accurate navigation through sharing information with each other. Firstly, the appropriate roles for sensors and wireless communication link are assigned. Secondly, a filter to perform navigation cooperative is constructed. Finally, the boundedness of estimation error of the filter under small initial estimation error is analyzed. The simulation results show that the proposed method can reduce navigation errors effectively.

Malicious Attack Success Probability on the Change of Vulnerable Surfaces in MTD-SDR System (MTD-SDR 시스템의 취약요소 변경에 따른 악의적 공격 성공 확률)

  • Ki, Jang-Geun;Lee, Kyu-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.5
    • /
    • pp.55-62
    • /
    • 2018
  • The MTD-based approach changes various operating parameters dynamically so that the vulnerability of the system can be protected from the malicious attack. In this paper, random/serial scanning/jamming attack success probabilities have been mathematically analyzed and verified through simulation to improve the security of the wireless communication systems in which the MTD-SDR technologies are applied. As a result, for random scanning attacks, attack success probability increases as the change period of transmission channel increases, while for random jamming attacks there is no change. The attack success probability patterns for serial attacks are similar to those of random attacks, but when the change period of transmission channel approaches to the total number of transmission channels, the success probability of serial attack is getting greater than that of random attack, up to twice in jamming attacks and up to 36% in scanning attacks.