WO2013176439A1 - Procédé de brouillage de communications efficace basé sur le routage dans un réseau sans fil et dispositif afférent - Google Patents

Procédé de brouillage de communications efficace basé sur le routage dans un réseau sans fil et dispositif afférent Download PDF

Info

Publication number
WO2013176439A1
WO2013176439A1 PCT/KR2013/004347 KR2013004347W WO2013176439A1 WO 2013176439 A1 WO2013176439 A1 WO 2013176439A1 KR 2013004347 W KR2013004347 W KR 2013004347W WO 2013176439 A1 WO2013176439 A1 WO 2013176439A1
Authority
WO
WIPO (PCT)
Prior art keywords
neighbor node
period
neighbor
pulse period
communication
Prior art date
Application number
PCT/KR2013/004347
Other languages
English (en)
Korean (ko)
Inventor
이재준
임재성
Original Assignee
아주대학교산학협력단
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 아주대학교산학협력단 filed Critical 아주대학교산학협력단
Publication of WO2013176439A1 publication Critical patent/WO2013176439A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04K—SECRET COMMUNICATION; JAMMING OF COMMUNICATION
    • H04K3/00—Jamming of communication; Counter-measures
    • H04K3/20—Countermeasures against jamming
    • H04K3/22—Countermeasures against jamming including jamming detection and monitoring
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04K—SECRET COMMUNICATION; JAMMING OF COMMUNICATION
    • H04K3/00—Jamming of communication; Counter-measures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/246—Connectivity information discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04K—SECRET COMMUNICATION; JAMMING OF COMMUNICATION
    • H04K2203/00—Jamming of communication; Countermeasures
    • H04K2203/10—Jamming or countermeasure used for a particular application
    • H04K2203/18—Jamming or countermeasure used for a particular application for wireless local area networks or WLAN

Definitions

  • the present invention relates to a communication disturbance method using a routing protocol in a communication network, and more particularly, to a communication disturbance method and apparatus in which a communication disturbance occurs at a network layer or a routing layer in a multihop network composed of nodes.
  • the present invention is derived from the research conducted as part of the support project for the development of university IT research centers of the Information and Communications Industry Promotion Agency and the Information and Communications Industry Promotion Agency, the Ministry of Education, Science and Technology and the Korea Research Foundation. 2012- (H0301-12-2003)), Task Name: Defense IT Tactical Communication Technology Research, Task Unique Number: 2011-0026433, Task Name: Reliable Routing Scheme in Ad-hoc Network].
  • Jamming is a military term that refers to the act of confusing or obstructing the communication system by detecting the radio waves and frequencies of an enemy. It refers to electronic or mechanical interference that interferes with the display of aircraft on the radar, radio communication, radio navigation, etc. Primarily used to reduce the effectiveness of enemy long-range sensors or search equipment.
  • noise jamming radiates high-power noise within a certain frequency range, preventing time and frequency analysis of the target signal, thereby preventing position and velocity detection.
  • Conventional military or commercial communication disturbance devices transmit communication disturbance signals other than signals to be disturbed using the communication layer physical characteristics in a communication network, and normally receive a desired signal at a receiving end of the communication device within the communication disturbance range. It does not allow extraction. At this time, the existing communication disturbance signal has been using a continuous signal generation or a pulse signal.
  • Korean Patent Registration No. 10-0887767 “Frequency-sensitive radio wave disturbance device” has been proposed.
  • a disturbance apparatus technology is disclosed in which a plurality of antennas transmitting and receiving a signal having a set frequency band detect a signal and generate an efficient disturbance radio wave in response to the detected frequency band.
  • Korean Patent No. 10-1045344 has been proposed "an apparatus and method for jamming a GPS signal."
  • a disturbing technique for generating a jamming signal by mixing a C / A code of a GPS signal and jamming data has been disclosed.
  • Such a communication disturbance technique in the physical layer has a problem in that a corresponding process for each signal to be disturbed is required and a disturbance signal is continuously generated. That is, since the disturbance signal must be generated continuously or almost continuously in order to achieve a desired level of disturbance effect, there is a problem in that energy consumption for communication disturbance is large.
  • a communication disturbance method for transmitting a communication disturbance signal and preventing normal data transmission when a specific control message is transmitted in the link layer has been proposed.
  • the transmitting node does not detect the data and send data, thereby avoiding the communication disturbance operation.
  • the efficiency of the communication disturbance method of the link layer is degraded by this avoiding operation.
  • the present invention is derived to solve the problems of the prior art, it is possible to increase the effect of communication disturbance while reducing the consumption of resources required for communication disturbance, new communication for obtaining a long-lasting communication disturbance effect rather than one-time
  • the objective is to propose disturbing techniques.
  • an object of the present invention is to maximize the effect of communication disturbance while using less energy resources by utilizing the operation of a routing protocol in a multihop network composed of a plurality of communication devices, that is, nodes.
  • the present invention monitors the communication process of each neighbor node on the communication network (listening, listening or eavesdropping broadcast message) to determine the period value and state validity period of the neighbor node discovery message of the neighbor nodes, and the determined neighbor node discovery. Using the period value and the validity period of the message, the optimal pulse period can be derived to maximize the data transmission loss. Then, a method and apparatus for generating and disturbing a pulsed disturbance signal such that a first neighbor node in a communication disturbance zone is continuously or intermittently included in a data transmission path using the derived optimal pulse period is provided. It is done.
  • the sender does not detect the communication disturbance and continuously transmits data to the nodes in the communication failure range, thereby achieving the purpose of communication disturbance even though using less resources. It aims to induce continuous waste of communication resources.
  • the communication network includes a neighbor node status discriminating unit, a pulse period deriving unit, and a disturbing signal generating unit.
  • the neighbor node status discrimination unit monitors the communication process of each neighbor node in the communication network (listening, listening or eavesdropping a broadcast message) to determine the period value and the state validity period of the neighbor node discovery message of the neighbor nodes.
  • the neighbor node status determiner may receive the routing protocol control message in the communication network to determine information on the period value and the state validity period of the neighbor node discovery message of the neighbor nodes.
  • the pulse period derivation unit derives an optimal pulse period for maximizing data transmission loss between neighboring nodes using the neighbor node discovery message period value and the state validity period determined by the neighbor node status discriminating unit.
  • the pulse period derivation unit may derive an optimal pulse period by modeling an average time interval in which the neighbor node discovery message is successfully transmitted, and calculates the size between the average time interval and state validity period successfully transmitted. By comparing the data loss rate according to the comparison result, the pulse period value can be derived.
  • the disturbance signal generator generates and disturbs a pulsed disturbance signal such that the first neighbor node in the communication disturbance area is continuously or intermittently included in the data transmission path using the optimal pulse period derived from the pulse period derivation unit.
  • the neighboring nodes are misrecognized as a node capable of normal communication by neighboring nodes belonging to the communication disturbance range in the routing protocol by the pulsed disturbing signal to transmit data to the first neighboring node, and the signal is continuously transmitted.
  • the disturbance effect can be achieved while using energy resources efficiently.
  • the present invention has the effect of maximizing data loss with a small energy source by transmitting an intermittent pulse type disturbance signal instead of generating a continuous signal from the communication disturbance device.
  • the present invention causes the neighboring nodes to mistake the nodes in the communication disturbance area for normal communication, thereby increasing the resource consumption of the disturbed target network.
  • the present invention can be greatly utilized as a breakthrough communication disturbance technique not only in the domestic defense industry but also in the foreign defense industry as a core technology related to national defense, and reversely used in the process of analyzing the error of reliable path recovery of the existing routing protocol.
  • This can be widely used not only in the defense industry but also in the network equipment and data communication device industries.
  • FIG. 1 is a diagram illustrating a communication disturbance method in a network layer or a routing layer according to an embodiment of the present invention.
  • FIG. 2 is a diagram illustrating a system system of a communication network in which a communication disturbance method is performed according to an embodiment of the present invention.
  • FIG. 3 illustrates an operation flowchart for a communication disturbance method according to an embodiment of the present invention.
  • step S320 of FIG. 3 is a flowchart illustrating an embodiment of step S320 of FIG. 3 in more detail.
  • FIG. 5 is an operation flowchart showing an embodiment of step S420 of FIG. 4 in more detail.
  • FIG. 6 is an operational flowchart illustrating an embodiment of step S310 of FIG. 3 in more detail.
  • FIG. 7 is a block diagram illustrating a communication disturbance apparatus according to an embodiment of the present invention.
  • the communication network includes a neighbor node status discriminating unit, a pulse period deriving unit, and a disturbing signal generating unit.
  • the neighbor node status discrimination unit monitors the communication process of each neighbor node in the communication network (listening, listening or eavesdropping a broadcast message) to determine the period value and the state validity period of the neighbor node discovery message of the neighbor nodes.
  • the neighbor node status determiner may receive the routing protocol control message in the communication network to determine information on the period value and the state validity period of the neighbor node discovery message of the neighbor nodes.
  • the pulse period derivation unit derives an optimal pulse period for maximizing data transmission loss between neighboring nodes using the neighbor node discovery message period value and the state validity period determined by the neighbor node status discriminating unit.
  • the pulse period derivation unit may derive an optimal pulse period by modeling an average time interval in which the neighbor node discovery message is successfully transmitted, and calculates the size between the average time interval and state validity period successfully transmitted. By comparing the data loss rate according to the comparison result, the pulse period value can be derived.
  • the disturbance signal generator generates and disturbs a pulsed disturbance signal such that the first neighbor node in the communication disturbance area is continuously or intermittently included in the data transmission path using the optimal pulse period derived from the pulse period derivation unit.
  • the neighboring nodes are misrecognized as a node capable of normal communication by neighboring nodes belonging to the communication disturbance range in the routing protocol by the pulsed disturbing signal to transmit data to the first neighboring node, and the signal is continuously transmitted.
  • the disturbance effect can be achieved while using energy resources efficiently.
  • FIG. 1 is a diagram illustrating a communication disturbance method in a network layer or a routing layer according to an embodiment of the present invention.
  • Each node (or routing server) can establish a routing path for transmitting data.
  • the protocol that acts on the routing path is called a routing protocol.
  • the routing protocol in order to establish a routing path, it is necessary to understand the existence of nodes that can directly communicate in a single hop without passing through each node in each node.
  • each node periodically or when there is data to be transmitted, exchanges messages with neighboring nodes to identify a single hop node.
  • This acknowledgment message is also referred to as a neighbor discovery message (Hello message).
  • the state information of these neighbor nodes also has a validity period, which is called a state validity period. That is, when the neighbor discovery message is successfully transmitted and the reply message is successfully transmitted, each node assumes that neighboring neighbor nodes are in a normal communication state for a predetermined period therefrom.
  • a communication disturbance device 131 having a communication disturbance zone 130 as a disturbable area range. It may be assumed that jammers of the communication disturbance device 131 extend within the communication disturbance area 130.
  • the present invention may affect routing path setting of the peripheral nodes 120 around the communication disturbance area 130. That is, although the first neighbor node 110 in the communication disturbance area 130 is not actually capable of normal communication due to the jammer of the communication disturbance device 131, the neighboring node is not affected by the pulse disturb signal of the communication disturbance device 131. 120 may induce the first neighbor node 110 to misunderstand that normal communication is possible.
  • the first neighbor node 110 is shown as one node for convenience of description, but according to the embodiment may be any node belonging to the communication disturbance area 130, the number may also be a plurality It is obvious to those skilled in the art.
  • Peripheral nodes located within a single hop distance from the first neighbor node 110 will be referred to as a second neighbor node 120 for convenience of description. If communication disturbance occurs in the link layer, the second neighbor node 120 recognizes that the first neighbor node 110 is in an incapable communication state, thereby excluding the first neighbor node 110 from the routing protocol. Data may be transmitted through a reliable transmission path that is not affected by the communication disturbance device 131. In this case, the communication disturbance function of the communication disturbance device 131 returns to blister.
  • a periodic pulsed disturbance signal is generated to induce the second neighbor node 120 to misinterpret the state of the first neighbor node 110 as a steady state, thereby making it reliable.
  • the disturbing target network may have an effect of wasting resources by transmitting data through a lossy transmission path (actually data is lost). That is, in the present invention, the disturbing effect may be further improved by inducing the network layer or the routing layer to obtain the disturbing effect.
  • FIG. 2 is a diagram illustrating a system system of a communication network in which a communication disturbance method is performed according to an embodiment of the present invention.
  • the communication network 100 includes a first neighbor node (Node B, 110) and a second neighbor node (Node A, 120) among neighboring nodes.
  • the second neighbor node 120 transmits the neighbor discovery message 121 to the first neighbor node 110, and the first neighbor node 110 sends a response message corresponding to the received neighbor discovery message 121. Transmit to the second neighbor node 120.
  • the neighbor discovery message 121 and the response message are transmitted between the first neighbor node 110 and the second neighbor node 120 through the communication disturbance zone 130 from which the communication disturbance signal 132 is transmitted.
  • each node In order to continuously monitor the presence of neighbor nodes on a routing protocol with dynamically changing network conditions, each node periodically sends a neighbor discovery message 121 and receives a response.
  • the communication disturbance device 131 may continuously receive the neighbor discovery message 121 to determine the period, or the neighbor discovery message 121 or routing It can also be determined by receiving and decrypting protocol control messages. This is because the period information of the neighbor discovery message 121 may be included in the neighbor discovery message 121 or may be included in the routing protocol control message.
  • the periods H and 122 of the neighbor node discovery message 121 are conceptually illustrated.
  • the routing protocol invalidates the state if the status update message does not periodically refresh the state for the sake of robust system operation. That is, when the second neighbor node 120 transmits the neighbor discovery message 121 to the first neighbor node 110 and receives a response thereto, the second neighbor node 120 during the state validity period (V, 123). Assume that the first neighboring node 110 is in a normal state. In general, the period 122 is set smaller than the state validity period 123. If the second neighbor node 120 does not receive a response from the first neighbor node 110 or receives a response to a reception error during the state validity period 123, the second neighbor node 120 receives the first neighbor node. Update 110 to an abnormal state and exclude the first neighbor node 110 from routing.
  • the communication disturbance device 131 In order to determine the validity period 123, the communication disturbance device 131 needs to receive and decrypt the neighbor discovery message 121 or the routing protocol control message. At this time, the communication disturbance device 131 may receive and decrypt the broadcast message, or may intercept or eavesdrop the message.
  • the state validity period 123 information can not be detected only by the periodic reception of the neighbor node discovery message 121, and a predetermined reception and decryption process is required.
  • the message 121 is successfully transmitted from the second neighbor node (node A, 120) to the first neighbor node (node B, 110), and the response message from the first neighbor node 110 is also transmitted to the second neighbor node 120. Assume that the transmission was successful.
  • the second neighbor node 120 regards the state of the first neighbor node 110 as a normal state during the state validity period (V, 123).
  • the second neighbor node 120 may return a message indicating that the message 121 has not arrived for a predetermined time (H, 122) to the second neighbor node (120).
  • the second neighbor node 120 has updated information about the communication state of the first neighbor node 110.
  • the second neighbor node 120 excludes the first neighbor node 110 from the communication path. Send data by path.
  • the second neighbor node 120 includes the first neighbor node 110 in the routing path to transmit data again during the state validity period (V, 123). do. If the neighbor discovery message 121 and its response message succeed in transmission, the state validity period (V, 123) is initialized and the first neighbor node 110 is included in the routing path during the state validity period (V. 123). do.
  • the average period of the intermittent transmission success event of the message 121 (indicated by T for convenience of description) is greater than the state validity periods V and 123, but according to the embodiment, the message ( The transmission successful average period T of 121) may be less than or equal to the state validity periods (V, 123). If T is less than the validity periods (V, 123), the first neighbor node (110) is considered to be in a normal communication state on average, and is continuously included in the routing path.
  • the second neighbor node 120 transmits data to the first neighbor node 110, the first neighbor node 110 is located in the communication disturbance zone 130, so the first neighbor The data transmitted for node 110 is very likely to be lost. Therefore, according to the communication disturbance technique of the present invention, the second neighbor node 120 is induced to continuously or intermittently transmit data to the first neighbor node 110 in the communication disturbance area 130, thereby belonging to the node to be disturbed. It may also bring an effect of causing resource consumption of the (110, 120).
  • the pulsed disturbance signal 132 of the present invention does not have a period enough to completely disturb the reception of all data, but the first neighbor node 110 that is a communication disturbance is continuously or periodically in the data transmission path. It is characterized by having a period enough to be included intermittently.
  • FIG. 7 is a block diagram illustrating a communication disturbance apparatus 700 according to an embodiment of the present invention.
  • the function of the communication disturbance device 700 of FIG. 7 is the same as or similar to that of the communication disturbance device 131 of FIG. 1.
  • the neighbor node status determiner 710 monitors, eavesdrops, or listens to a communication process of each of the neighbor nodes so that a periodic value of the neighbor node discovery message 121 of the neighbor nodes 110 and 120 is detected. (H, 122) and the state validity period (V, 123) is determined (S310).
  • the pulse period derivation unit 720 uses the period values (H, 122) and the state validity periods (V, 123) of the neighbor node discovery message 121 determined by the neighbor node state discrimination unit 710 to calculate a data transmission loss.
  • An optimal pulse period that can be maximized is derived (S320).
  • the disturbance signal generator 730 uses the optimal pulse period derived from the pulse period derivation unit 720 so that the first neighbor node 110 in the communication disturbance region is continuously or intermittently included in the data transmission path.
  • a pulse type disturbance signal is generated and disturbed around the neighboring node 110 (S330).
  • step S410 is a flowchart illustrating an embodiment of step S320 of FIG. 3 in more detail.
  • the pulse period derivation unit 720 successfully converts the neighbor discovery message 121 determined by the neighbor state determining unit 710 from the second neighbor node 120 to the first neighbor node 110.
  • T average time interval
  • the disturbing pulse signal 132 is In an environment that is transmitted at a transmission rate of, the probability that a disturbance occurs in the transmission of the neighbor node discovery message 121 may be represented by Equation 1 below.
  • H indicates the transmission period 122 of the neighbor node discovery message 121 as described above.
  • Equation 2 From the probability that the transmission of the neighbor node discovery message 121 obtained in Equation 1 fails, it is possible to calculate the probability that the transmission of the neighbor node discovery message 121 succeeds.
  • the probability that the transmission of the neighbor node discovery message 121 succeeds is obtained as shown in Equation 2 below.
  • the value obtained by dividing 1 by the probability of Equation 2 becomes an expected value of the neighbor discovery message 121 transmitted until the transmission of the neighbor discovery message 121 is successful.
  • the expected value is represented by the following equation.
  • Equation 4 Multiplying the expected value of Equation 3 by the transmission period 122 H of the neighbor node discovery message 121 yields an average time interval T for successfully transmitting the neighbor node discovery message 121.
  • the time interval T is expressed as in Equation 4 below.
  • an optimal pulse period for maximizing data transmission loss is derived (S420).
  • FIG. 5 is an operation flowchart showing an embodiment of step S420 of FIG. 4 in more detail. Referring to FIG. 5, the size between the average transmission success time interval T of the message 121 and the state validity periods V and 123 are compared (S510).
  • a pulse period value is derived by probabilistically modeling the data loss rate (S520).
  • the loss rate and success rate of data transfer are two sides of the same coin.
  • a process of deriving an optimal pulse period value for minimizing the success rate of data transmission is presented.
  • the first neighbor node 110 will continue to be included in the data routing path. This is because the response message from the first neighbor node 110 will reach the second neighbor node 120 before the state validity period V elapses.
  • the probability of successful packet transmission between the neighbor nodes 120 is determined depending on whether the routing path is reliable.
  • the packet transmission success rate S is represented by Equation 5 below including the influence of the disturbing pulse signal 132.
  • the data transmission succeeds with the probability of Equation 5 since the disturbance pulse signal 132 is affected during the time V, and during the time TV Data transmission can continue to succeed without being affected by the disturbing pulse signal 132.
  • the second neighbor node 120 located outside the disturbance area 130 recognizes the state of the first neighbor node 110 as a normal state for a time V, and the first neighbor node 110 for the remaining time (TV). Recognize the state of as abnormal.
  • T is greater than V
  • the second neighboring node 120 is induced to alternately recognize the state of the first neighboring node 110 as a normal state and an abnormal state.
  • the data transmission success rate S according to the size comparison between T and V may be modeled as in Equation 6 below.
  • Equation 9 an optimal data rate of the disturbing pulse signal 132 may be obtained as shown in Equation 9 below.
  • the optimal pulse period of the disturbing pulse signal 132 can be obtained from Equation 9 above.
  • the optimum pulse period is obtained from the condition of minimizing the success rate S of data transmission. In other words, it can be seen that obtained from a condition that maximizes the data loss rate or disturbance success rate.
  • the optimum pulse period is obtained from the condition of minimizing the success rate S of data transmission, and due to the optimum pulse period obtained, a case where T is larger than V may be obtained, and a case where T is smaller than V or equal to V may be obtained. have. If the T value due to the optimal pulse period is greater than V, the first neighbor node 110 will be recognized by the second neighbor node 120 alternately between the normal state and the abnormal state, and the first neighbor node 110 It will be intermittently included in the routing path of the second neighbor node 120. When the T value due to the optimal pulse period is equal to or less than V, the first neighbor node 110 will be continuously included in the routing path of the second neighbor node 120.
  • FIG. 6 is an operational flowchart illustrating an embodiment of step S310 of FIG. 3 in more detail.
  • the neighbor node status discriminating unit 710 receives a routing protocol control message in the communication network (S610).
  • the neighbor node status discriminating unit 710 identifies and discriminates information on the period value (H, 122) and the state validity period (V, 123) of the neighbor node discovery message 121 by receiving and decrypting a routing protocol control message. can do.
  • Communication disturbance method using a routing protocol may be implemented in the form of program instructions that can be executed by various computer means may be recorded on a computer readable medium.
  • the computer readable medium may include program instructions, data files, data structures, etc. alone or in combination.
  • Program instructions recorded on the media may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind well-known and available to those having skill in the computer software arts.
  • Examples of computer readable recording media include magnetic media such as hard disks, floppy disks and magnetic tape, optical media such as CD-ROMs, DVDs, and magnetic disks such as floppy disks.
  • Examples of program instructions include not only machine code generated by a compiler, but also high-level language code that can be executed by a computer using an interpreter or the like.
  • the hardware device described above may be configured to operate as one or more software modules to perform the operations of the present invention, and vice versa.
  • the present invention can be utilized in the defense industry, security industry, communication industry and the like.
  • the techniques of the present invention can be utilized to bypass data transmission paths to protect specific nodes.
  • the telecommunications industry could also be used as a way to block the transmission of spam or unwanted data.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention concerne un procédé de brouillage de communications utilisant un protocole de routage dans un réseau de communication, et plus précisément un procédé de brouillage de communications et un dispositif de brouillage de communications consistant en ce que le brouillage de communications se produit au niveau d'une couche de réseau ou d'une couche de routage dans un réseau multi-sauts présentant des nœuds. Selon la présente invention, il est possible de dériver une période d'impulsion optimale qui permet à un premier nœud voisin dans une zone de brouillage de communications d'être considéré à tort comme étant dans un état normal de communication. Dans cette situation, la présente invention permet de dériver la période d'impulsion optimale en utilisant les informations sur une période d'un état de disponibilité et une période d'un message de découverte d'un nœud voisin pour confirmer un nœud voisin dans un protocole de routage.
PCT/KR2013/004347 2012-05-22 2013-05-16 Procédé de brouillage de communications efficace basé sur le routage dans un réseau sans fil et dispositif afférent WO2013176439A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR10-2012-0054059 2012-05-22
KR1020120054059A KR101374061B1 (ko) 2012-05-22 2012-05-22 무선 네트워크에서의 라우팅 기반 효율적 통신 교란 방법 및 그 장치

Publications (1)

Publication Number Publication Date
WO2013176439A1 true WO2013176439A1 (fr) 2013-11-28

Family

ID=49624067

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2013/004347 WO2013176439A1 (fr) 2012-05-22 2013-05-16 Procédé de brouillage de communications efficace basé sur le routage dans un réseau sans fil et dispositif afférent

Country Status (2)

Country Link
KR (1) KR101374061B1 (fr)
WO (1) WO2013176439A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016148440A3 (fr) * 2015-03-13 2016-11-10 서울대학교산학협력단 Procédé de distribution d'une puissance de transmission dans un réseau sans fil, et nœud de transmission correspondant
EP3381211A4 (fr) * 2016-02-26 2019-07-24 Hewlett-Packard Enterprise Development LP Protection de la confidentialité d'un dispositif

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102078359B1 (ko) 2018-01-26 2020-02-17 국방과학연구소 거짓 확인 응답 프레임을 이용한 은닉 재밍 공격 장치 및 방법
KR102621443B1 (ko) * 2023-08-04 2024-01-04 김상환 음성 녹음 방지 방법 및 시스템

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20090090388A (ko) * 2006-12-15 2009-08-25 모토로라 인코포레이티드 주기적 간헐적 간섭을 검출하는 방법 및 시스템

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20090090388A (ko) * 2006-12-15 2009-08-25 모토로라 인코포레이티드 주기적 간헐적 간섭을 검출하는 방법 및 시스템

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
ENNS, ROB ET AL.: "Device Discovery Protocol (DDP) draft-marques-ddp-OO.txt", NETWORK WORKING GROUP, May 2003 (2003-05-01), Retrieved from the Internet <URL:http://tools.ietf.org/html/draft-marques-ddp-00> *
WOOD, ANTHONY D. ET AL.: "DEEJAM: Defeating Energy-Efficient Jamming in IEEE 802.15.4-based Wireless Networks", 4TH ANNUAL IEEE COMMUNICATIONS SOCIETY CONFERENCE ON SECON 2007, 18 June 2007 (2007-06-18) - 21 June 2007 (2007-06-21), pages 4 - 6 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016148440A3 (fr) * 2015-03-13 2016-11-10 서울대학교산학협력단 Procédé de distribution d'une puissance de transmission dans un réseau sans fil, et nœud de transmission correspondant
EP3381211A4 (fr) * 2016-02-26 2019-07-24 Hewlett-Packard Enterprise Development LP Protection de la confidentialité d'un dispositif
US10587360B2 (en) 2016-02-26 2020-03-10 Hewlett Packard Enterprise Development Lp Device privacy protection

Also Published As

Publication number Publication date
KR101374061B1 (ko) 2014-03-13
KR20130130335A (ko) 2013-12-02

Similar Documents

Publication Publication Date Title
Bhargava et al. Security enhancements in AODV protocol for wireless ad hoc networks
Singh et al. Hello flood attack and its countermeasures in wireless sensor networks
Wu et al. Label-based DV-Hop localization against wormhole attacks in wireless sensor networks
Sarma et al. Security threats in wireless sensor networks
WO2013176439A1 (fr) Procédé de brouillage de communications efficace basé sur le routage dans un réseau sans fil et dispositif afférent
Rmayti et al. Graph-based wormhole attack detection in mobile ad hoc networks (MANETs)
Naveena et al. Analysis and countermeasures of black-hole attack in manet by employing trust-based routing
Gambhir et al. PPN: Prime product number based malicious node detection scheme for MANETs
Shree et al. Wormhole attack in wireless sensor network
Saha et al. Two-level secure re-routing (TSR) in mobile ad hoc networks
Harikrishnan et al. Improved throughput based recognition connection denies for aggressive node in wireless sensor network
US20080263660A1 (en) Method, Device and Program for Detection of Address Spoofing in a Wireless Network
Choi et al. A secure routing method for detecting false reports and wormhole attacks in wireless sensor networks
de Graaf et al. Distributed detection of wormhole attacks in wireless sensor networks
US20200146088A1 (en) Secure iv recovery in bluetooth sig mesh networks
Kadam et al. Detection and Prevention of Wormhole attack in MANET
Ronghui et al. Detecting and locating wormhole attacks in wireless sensor networks using beacon nodes
Sidhu et al. A comprehensive study of routing layer intrusions in zigbee based wireless sensor networks
Patel et al. A survey on detecting wormhole attack in MANET
Elizabeth et al. International Journal of Wireless Communications and Networking Technologies
Prathap et al. PCAD: Power control attack detection in wireless sensor networks
Sharma et al. A review of proposed solutions for wormhole attack in MANET
Singh et al. Review Paper on Attack on Under Water Mobile Ad-hoc Network
Begum et al. Eliminating Intentional Packet Dropping Attacks in MANETs Using Promiscuous Mode
Shukla et al. Security in ad-hoc networks (MANETS)

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13793342

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13793342

Country of ref document: EP

Kind code of ref document: A1