Classifications

• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
  • G06F21/50—Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems
  • G06F21/55—Detecting local intrusion or implementing counter-measures
  • G06F21/554—Detecting local intrusion or implementing counter-measures involving event detection and direct action
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L63/00—Network architectures or network communication protocols for network security
  • H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
  • H04L63/1408—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
  • H04L63/1416—Event detection, e.g. attack signature detection
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L63/00—Network architectures or network communication protocols for network security
  • H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
  • H04L63/1408—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L63/00—Network architectures or network communication protocols for network security
  • H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
  • H04L63/1441—Countermeasures against malicious traffic
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
  • H04W12/12—Detection or prevention of fraud
  • H04W12/121—Wireless intrusion detection systems [WIDS]; Wireless intrusion prevention systems [WIPS]
  • H04W12/122—Counter-measures against attacks; Protection against rogue devices

Definitions

• Patent Application No. 62/135,142 filed March 18, 2015, entitled, “System and Method to Detect Attacks on Mobile Wireless Networks Based on Network Controllability Analysis,” the entirety of which is incorporated herein by reference.
• the present invention relates to a system for detecting sources of
• misinformation in mobile wireless networks and, more particularly, to a system for detecting sources of misinformation in mobile wireless networks based on motif analysis.
• Reference Nos. 1-4 and 5 are capable of detecting small changes in
• misinformation such as- those in "shrew” attacks, hut they require detailed knowledge of the network configuration., such as the type and state of protocol instances, applications, and the underlying physical wireless channel.
• Such protocol-specific, or specification-based, approaches are difficult to implement and maintain, and are only practical tor network elements that have simple and easily observable state machines (e.g., media access control (MAC) protocols or routing protocols ⁇ .
• MAC media access control
• these approaches fail if the specification and implementation of the element deviate in a manner that can be exploited with misinformation, or if the specification itself has flaws that can be exploited.
• the published literature such as Literature Reference Nos. 1 and 4 have shown thai both of ' these flaws (i.e., implementation flaws and specification flaws) are common.
• the present invention relates to a system for detecting sources of
• the system comprises one or more processors and a memory having instructions such that when the instructions are executed, the one or more processors perform multiple operations.
• a hierarchical representation of activi ty of a communication network is used to detect and predict sources of
• the hierarchical representation comprises a plurality of nodes and temporal patterns of communication between at least one pair of nodes, each temporal pattern representing a motif, having a size, in the hierarchical representation. Changes in motifs provide a signal for a misinformation attack.
• a visual representation on a display relating to motifs of interest is generated to identify a misinformation attack.
• a. misinformation attack is characterized by m over- representation of motifs having a predetermined size.
• a size threshold for detection of a misinformation, attack is set by learning a maximum frequency of motifs of each size in a normal baseline operation of the communication network
• the system introduces a motifattribution measure at each node i of the communication network.
• nn is defined as a frequency of sub-graphs to which it contributes. A mi greater than double the maximum frequency indicates a likelihood that node i is an attacker.
• the hierarchical representation comprises a plurality of data tables that describe applications and services running on the communication network and a set of inter-dependencies between the applications and sen-ices.
• the system performs a mitigation action.
• the mitigation action comprises isolating an attacking node from the rest of the communication network.
• the present invention also comprises a method for causing a processor to perform the operations described, herein.
• the present invention also comprises a computer program product comprising conipnter-readable instructions stored an a non-transitory computer-readable medium that are executable by a computer having a processor for causing the processor to perform the operations described herein.
• FIG, 1 is a block diagram depicting the components of a system tor detecting sources of misinformation in mobile wireless networks according to various embodiments of the present disclosure
• FIG. 2 is an illustration of a computet program product according to various embodiments of the present disclosure
• FIG. 3 is an illustration of network motif size frequencies according to
• FIG. 4 is an illustration of a barcode of sob-graphs for regular and attacking patterns in FIG. 3 according to various embodiments of the present disclosure
• FIG. 5 A is an illustration of a sample graph, according to various embodiments of the present disclosure
• FIG, SB is an illustration of finding all sub-graphs with, the sample graph in FIG, 5 A according to various embodiments of the present disclosure
• FIG. 6 is a table illustrating pseudo-code of the Enumerate Subgraph (ES IJ) algorithm for finding sub-graphs according to various embodiments of the present disclosure
• FIG. 7 A is a plot illustrating motif size frequency during reset attacks
• FIG. 7B is a plot illustrating motif size frequency during flood attacks according to various embodiments of the present disclosure.
• FIG. 8 is a plot illustrating attribution in a 6 node example using motifs of size 3 according to various embodiments of the present disclosure
• FIG. 9 is a flow diagram illustrating a method to detect attacks on mobile wireless networks according to various embodiments of the present disclosure.
• FIG, 10 is an illustration depicting a relationship between. modules, of th Xnet model according to some embodiments of the present disclosure.
• the present invention relates to a system for detecting sources of
• misinformation in. mobile wireless networks and, more particularly, to a system for detecting sources of misinformation in mobile wireless networks based on motif analysis.
• the following description is presented to enable one of ordinary skill in the art to make and use the invention and to incorporate it in the context of particular applications. Various modifications, as well as a variety of uses in different applications will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to a wide range of aspects. Thus, the present invention is not intended to be limited to the aspects presented, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
• the above labels may change their orientation.
• the present invention -has three "principal" aspects.
• the first is a system for detecting sources of misinformation in mobile wireless networks.
• the system is typically in the form of a computer system operating software or in the form of a "hard-coded" instruction set. This system may be incorporated into- a wide variety of devices that provide different functionalities.
• the second principal aspect is a method, typically in the form of software, operated using a data processing system (computer).
• the third principal aspect is a computer program product.
• the computer program product generally represents computer-readable instructions stored on a .non-transitory computer-readable medium such as an optical storage device, e.g., a compact disc (CD) or digital versatile disc (DVD), or a magnetic, storage device such as a floppy disk or magnetic tape.
• a .non-transitory computer-readable medium such as an optical storage device, e.g., a compact disc (CD) or digital versatile disc (DVD), or a magnetic, storage device such as a floppy disk or magnetic tape.
• CD compact disc
• DVD digital versatile disc
• magnetic, storage device such as a floppy disk or magnetic tape.
• Other, non- limiting examples of computer-readable media include hard disks, read-only memory (ROM), and flash-type memories.
• FIG. 1 A block diagram depicting ah example of a system (i.e., computer system
• the computer system 100 is configured to perform calculations, processes, operations, and/or functions associated with a program or algorithm.
• certain processes and steps discussed herein are realized as a series of instructions (e.g., software program) that reside within computer readable memory units and are executed by one or more processors of the computer system 100. When executed, the instructions cause the computer system 100 to perform specific actions aid exhibit specific behavior, such as described herein.
• the computer system 100 may include an address/data bus 102 that is
• processor 104 configured to communicate information. Additionally, one or more data processing units, such as a processor 104 (or processors), are coupled with the address/data bus 102. The processor 104 is configured to process information. and instructions, hi an aspect,- the processor 104 is a microprocessor.
• the processor 104 may he a di fferent type of processor such as a parallel processor, or a field programmable gate array.
• the computer system 100 is configured to utilize one or more data storage units.
• the computer system 100 may include a volatile memory unit 106 (e.g., random access memory (“RAM”), static RAM, dynamic RAM, etc.) coupled with the address/data bus 102, wherein a volatile memory unit 106 is configured to store information and instructions for the processor 104.
• the computer system 100 further may include a non-volatile memory unit 108 (e.g., read-only memory (“ROM”), programmable ROM (“PROM”), erasable.
• ROM read-only memory
• PROM programmable ROM
• the computer system 100 may execute instructions retrieved from an online data storage unit such as in "Cloud” computing.
• the computer system 100 also may include one or more interfaces, such as an interface 1 10, coupled with the address/data bus 102.
• the one or more interfaces are configured to enable the computer system 100 to interface with other electronic devices and computer systems.
• the communication interfaces implemented by the one or more interfaces may include wireline (e.g., serial cables, moderns, network adaptors, etc.) and/or wireless (e.g., wireless modems, wireless network adaptors, etc.) communication technology.
• the computer system 100 may include an input device 1 12 coupled with the address/data bus 102, wherein the input device 1 12 is configured to communicate information and command selections to the processor .100.
• the input device 1 12 is an alphanumeric input device, such as a keyboard, that may include alphanumeric and/or function keys.
• the input device 1 12 may be an input device -other man an alphanumeric, input device.
• the input device 1 12 may include one or more sensors, such as a camera for video or still, images, a microphone, or a neural sensor.
• Other example input devices 1 12 may include an aceelerometer, a GPS sensor, or a gyroscope.
• the computer system 100 may. include a cursor control device 1 14 coupled with the address/data bus 102, wherein the cursor control device 114 is configured to communicate user input information and/or command selections to tile processor 100.
• the cursor control device 114 is implemented using a device such as a mouse, a track-ball, a track-pad, an optical tracking device, or a touch screen.
• the cursor control device 114 is directed and/or activated via input from the input device 112, such as in response to the use of special keys and key sequence commands associated with the input device 1 12.
• the cursor control device 1 14 is configured to be directed or guided by voice commands.
• the computer system 100 further may include one or more
• the storage device 116 is configured to store information and/or computer executable instructions.
• the storage device 116 is a storage device such as a magnetic or optical disk drive (e.g., hard disk drive (“HDD”), floppy diskette, compact disk read only memory
• HDD hard disk drive
• floppy diskette floppy diskette
• a display device 118 is coupled with the address/data bus 102, wherein the display device 1 18 is configured to display video and/or graphics.
• the display device 118 may include a cathode ray tube (“CRT”), liquid crystal display (“LCD”), field emission display (“FED”), plasma display, or any other display device suitable for displaying video and/or graphic images and alphanumeric characters recognizable to a user.
• CTR cathode ray tube
• LCD liquid crystal display
• FED field emission display
• plasma display or any other display device suitable for displaying video and/or graphic images and alphanumeric characters recognizable to a user.
• the computer system 100 presented herein is an example computing
• the non-limiting example of the computer system 100 is not strictly limited to being a computer system.
• the computer system 100 represents a type of data processing analysis that may be used in accordance with various aspects described herein.
• other computing systems may also be
• one or more operations of various aspects of the present technology are controlled or implemented using computer-executable instructions, such as program modules, being executed by a computer.
• program modules include routines, programs, objects, components and/or data structures that are configured to perform particular tasks or implement particular abstract data types.
• an aspect provides that one or more aspects of the present technology are implemented by utilizing one or more distributed computing environments, such as where tasks are performed by remote processing devices that are linked through a communications network, or such as where various program modules are located in both local and remote computer-storage media including memory-storage devices.
• FIG. 2 An illustrative diagram of a computer program product (i.e.. storage device) embodying the present invention is depicted in FIG. 2.
• the computer program product is depicted as floppy disk 200 or an optical disk 202 such as a CD or DVD.
• the computer program product generally represents computer-readable instructions stored on any compatible non-transitory computer-readable jonednm
• the term "instructions” as used with respect to this invention generally indicates a set of operations to be performed on a computer, and may represent pieces .of a whole program or Individual, separable, software .modules.
• Non-limiting examples of "instruction” include computer program code (source or object code) and "hard-coded" electronics (i.e.
• the "instruction” is stored on any non-transitory computer-readable medium, such as in the memory of a computer or on a floppy disk, a CD-ROM, and a flash drive. In either event, the instructions are encoded on a non-transitory computer-readable medium.
• the exploitation network is a hierarchical model of a network (a network of networks) that provides three different views of the network, linked together by directional links. Xnet is described in detail in U.S. Patent
• the model includes an application dependency layer and a network dependency layer in addition to the network topology itself.
• Xnet moves the problem out of the realm of conventional wireless networking techniques, which are focused on throughput between pairs of nodes, into a representation that enables a more holistic behavioral, treatment. This transfer to the representation is the foundation that enables the social networking and information dynamics approach of the present invention.
• the system according to embodiments of tire invention relies on the Xnet hierarchical model of network activity.
• the Xnet. model includes at least four unique
• modules including the Xnet Dynamics (XD) module 1000, the Xnet
• the XD module 1000 identifies unreliable nodes based on -the dynamics of social networks (with no dependency on protocol) to indicate the presence of malicious or damaged nodes altering control and data plane information in the network.
• the XCO module 1002 identifies the optima! set of nodes repaired to passively monitor ⁇ observability) or actively probe (controllability) a suspected source of misinformation.
• the XE module 1004 simulates a progression of failures to predict which nodes are most likely to be attacked next or should have trust reassessed.
• the RE module 1006 fuses cross-layer and cross-plane (control and data plane) information to identify suspicious nodes and improve reputation-based trust management
• the unified trust metric is computed in a hybrid approach in which nodes combine normalized confidence and trust values based on direct experience and recommendations of other nodes. Such a hybrid approach avoids a centralized point of failure, ensures scalability, and renders the computation resilient to attacks targeting such computations.
• the XD module 1000 identifies nodes that appear to be misbehaving.
• the RE module 1006 gets a minimal set of driver and observer nodes from the XCO module 1002 for the suspect nodes.
• the RE module 1006 uses the driver nodes to do active probing on the suspect nodes, and the observer nodes update a trust metric with the results.
• the XE module 1004 simulates a spread of compromised nodes
• the RE module 1006 formalizes and quantifies trust using a model that relies on local computations based on direct interactions with neighbors and also by incorporating recommendations (and experiences) of other nodes.
• a formal subjective logic and trust model is leveraged for principled combination of evidence about how trustworthy: a node is. Resilience to attacks is gained by adopting a hy brid distributed approach to compute trust avoiding a single point of failure, and the approach is agnostic to control and/or data plane statistics being used.
• the RE module's 1006 trust in a node fails below a certain level, it performs active probing on the node. To do that most efficiently the XCO module 1002 computes a minimal set of driver nodes to issue the challenges and observer nodes to observe the results.
• the system also employs a two-pronged approach to discover sources of misinformation in the network, employing information dynamics identification of suspicions changes in Xnet dependencies, as well as trends in the appearance of such compromised nodes.
• First the XD module 1000 uses a unique information dynamic spectrum framework to predict system instability at critical transitions in complex systems, by analyzing Xnet time series data. This marks nodes for farther inspection by the RE module 1006,
• Second, the XE module 1004 tracks trends in misbehaving nodes, and matches against simulations of contagion and cascading failures. The XE module 1004 will emit a confidence measure as to whether there is a pattern, and if so, the RE module 1006 can focus monitoring and testing resources on predicted next nodes to be attacked. System Administrators can use this information to focus preventative measures.
• network administrators confi gure each node of a network (e.g., mobile wireless network) with compatible networking stacks, host and network services, applications, and other software necessary for the mission, including suite of modules with supporting configuration data.
• a network e.g., mobile wireless network
• the .hierarchical representation of the network i.e., Xnetj, is created in the form of data tables that describe the applications and services that are running on the network, their inter-dependencies, and observable characteristics of their behavioral dynamics under normal operation (e.g.- node degree, traffic flow characteristics, topology).
• KM receives the Application Dependency (AppDep) and Network Dependency (NetDep) graph from Xnet,
• AppDep Application Dependency
• NetDep Network Dependency
• the XM module monitors the dynamics of the
• AppDep and NetDep graphs by collecting time-series data on statistics identified in its baseline configuration, it will develop baseline frequencies for each size of motif that occurs during a set quantum of time (e.g., time quantum, of 10 seconds). This will include keeping track of typical temporal sequences of motifs.
• a compromised node will attract the attention of the XM module, which will observe a sudden change in the •frequency of motif sizes. For example, malicious dropping of packets -at a node will result in a step-change in the load between applications and services that depend on that node.
• the attacking node's dropping of packets can be observed directly at the media access control (MAC) layer by monitoring the channel and observing whether the node is forwarding packets to the next hop,
• MAC media access control
• the abstract network refers to the abstract mathematical representation of the relationshi p between communicating entities in a physical network (i.e., a .real network comprising physical nodes (e.g., radios)).
• the Xriet is a hierarchical network of network graphs whose nodes include the physical radios communicating on the network as well as conceptual nodes that represent communicating network entities, such as applications and network services. Edges between nodes are created whenever one of these nodes sends data to another node (just the start and end node, not the intermediate nodes that forward the message datagrams). An edge exists until the message reaches its destination.
• Network motifs are temporal patterns ofcomttiunicarion between, nodes. Network activity is divided into windows of time. During each window, if an edge appears between two nodes, it can be counted in motifs for that window.
• Network motifs are recurrent and statistical ly significant sub-graphs or patterns of conmiunication between the subsets of nodes that work together.
• Each of these sub-graphs defined by a particular pattern of interactions between vertices, may reflect a framework in which particular communication protocols are achieved efficiently.
• * motifs are of notable importance largely because they capture the underlying commumcation structure of a wireless network. Changes in the histogram of motif sizes provide a characteristic signal for certain types of attacks . When attacks happen, different recurrent sub-graphs would reflect changes in the network communication pattern and, consequently, result in the detection.
• G - (V, E) and G' ⁇ ( ⁇ ', V) be two graphs.
• V denotes vertices (also referred to as “nodes” when discussed in the context of the abstract network).
• E denotes edges (also referred to. as “links”).
• Graph G' is a sub- graph of graph G ( ) ( )
• the mapping f is called an isomorphism between G and G F .
• this mapping represents an. appearance of G' in G.
• the number of appearances of graph G' in G is called the frequency FG of G' in G.
• FIG , 3 is a graph ill ustrating network motif size frequencies during attack vs. normative, demonstrating FG(G') for both regular and attack patterns.
• Regular patterns are represented by unfilled bars, while attack patterns are represented by filled bars.
• FIG, 3 indicates that it is unlikely to find large motifs (size > 5) in a regular communication network (as indicated by the absence of regular patterns) compared to the one under flooding attacks (as indicated by the presence of attack patterns), suggesting a potential attack detector.
• barcodes of notable motifs for different communications were defined that allow one to identify attacks.
• FIG. 4 is an illustration of a barcode 400 of sub-graphs for regular and attacking patterns to FIG. 3, where the. top. sub-graph.402 represents regular patterns, and the bottoms sub-graph 404 represents attack patterns.
• Motifs are those sub-graphs with the frequency FG(G') greater than a
• the threshold is determined by comparing to a null model, such as the recurrent .frequency of the same subgraph in a randomized graph.
• this definition is not appropriate for mobile networking problems. Indeed, one goal here is to distinguish frequent sub-graphs in regular and attack patterns. Yet, even in the communication network running under normal conditions, FG(G') may be very different from a completely random graph, model. Therefore, the approach according to embodiments of the present invention takes FG(G') of the regular pattern as the null, model. An abnormal pattern will be detected if its FG(G') significantly deviates from the null model defined above.
• FIG. 5A depicts a sample graph
• FIG. 5B depicts the ESU (Enumerate Subgraph) algorithmic process of finding ail sub-graphs with three nodes (where nodes are represented by numbered circles) in FIG, 5.A.
• the depth of the tree starts at 0 for the root 500, and increments by 1 for each row below. Since the height of the tree defines the size of the subgraphs that it emimerates, the depth i s al so the. same as the size (i.e . depth
• SUB is the name for the left-most set shown in each box
• EXT is the name for the right-most set in each box.
• SUB represents the current subgraph for the box.
• EXT represents the possible set of nodes that can be used to extend the subgraph.
• the subgraph is the subgraph, and
• ESU first finds the set of all induced sub-graphs of size k; let Sk be this set.
• ESU can be implemented as a recursive function.
• the running of this function can be displayed as a tree-like structure of depth k, called the ES U- Tree, as depicted in FIG. 5B.
• Each of the ESU-Tree nodes (represented by boxes) indicate the status of the recursive function that entails two consecutive sets, SUB and EXT.
• SUB refers to nodes in the target network that are adjacent and establish a partial sub-graph of size the algorithm has found an induced complete sub-graph., so However, if the algorithm must expand SUB to achieve cardinality k. This is done by the EX T set that contains all the nodes that satisfy two conditions.
• each of the nodes in EXT must be adjacen t to at least one of the nodes in SUB; second, their numerical labels roust be larger th an the labels of SUB nodes.
• the first condition makes sure that the expansion of SUB nodes yields a connected graph and the second condition causes ESU-Tree leaves (the bottom row of graphs (element 506)) to be distinct. As a result, overcounting is prevented.
• the EXT set is not a static set. so in each step it may expand by some new nodes that do not breach the two conditions.
• the next step of ESU involves classification of sub-graphs placed in the ESU-Tree leafs into non-isomorphic size-k graph classes. Consequently, ESU determines sub-graphs frequencies and concentrations.
• This stage has been implemented simply by employing McKay's naitty algorithm (see Literature Reference No. 8 for a description of this algorithm), which classifies each subgraph by performing a graph isomorphism test. Therefore, ESU finds the set of all induced k-size sub-graphs in a target graph by a recursive algorithm and then determines their frequency using an efficient tool.
• G-Tfies is another motif discovery algorithm that may be utilized.
• G-Tries constructs a multiway tree (referred to as a g-trie) that can store a collection of graphs.
• Each tree node contains information about a single graph vertex and its corresponding edges to ancestor nodes.
• a path from the root to a leaf corresponds- to one single graph.
• Descendants of a g ⁇ trie node share a common sub-graph.
• the conn ting part takes place. This is- conceptually akin to a prefix tree, which stores sub-graphs according to their structures and finds occurrences of each of these sub-graphs in a larger graph.
• the main idea in the counting process is to backtrack by al l possible sub-graphs, but at the same time do the isomorphism tests.
• the process takes advantage of common substructures in the sense that at a given time there is a partial isomorphic match for several different candidate sub-graphs.
• G-Tries does not need to find those sub-graphs thai are not in the main
• the motif size cannot be increased, to very large- values.
• the approach according to embodiments of the present disclosure works very well analyzing sub-graph sizes n ⁇ 9, which is tractable. While the computational complexity in terms of the graph size N is theoretically unknown, j udging from numerical results from previous work, it might be concluded that it scales as 0(N*M) (with a fixed motif size n) where N is the number of nodes and M is the total numbers of motifs of the underlying network. For most communication networks explored, the graph is sparse and M linearly scales with M, leading to an overall time complexity O(N 2 ) in terms of the whole network size (i.e., the number of devices).
• FIGs, 7 A and 7B plot the frequency of motifs of each size during a reset (web) (FIG. 7A) and flooding (TTCP) (FIG. 7B) attack.
• the "reset” attack sends a special type of TCP packet that essentially forces a TC P connection to "reset", or close unnecessarily.
• the "flooding” attack creates a large volume of unnecessary network traffic that causes a "denial-of-service" of the network .
• the distinct curve colors represent distinct motif sizes, as indicated in FIGs, 7 A and 7B.
• Motif .frequency measures the number of motifs occurri ng in a unit time. In a reset (web) attack, smaller motifs increase in frequency.
• attribution To locate the actual attacker within the network (called "attribution"), a motif attribution measure at each node is further introduced. For each node i, is defined as the frequency of sub-graphs it contributes to. Again, a large
• FIG, 8 plots the motif attribution at the
• a "biaekhole” attack has the ultimate goals of 1) forcing all routes to go through the attacking physical node (i.e., the node "captures” all of the routes between all other pairs of nodes in the network), and 2) dropping ail of the subsequent data traffic that comes across those routes.
• this is similar in concept to how the extreme gravity of a biaekhole pulls all matter into it and (seemingly) destroys it.
• Distinct curve colors represent the 5 non-attacking nodes and the one attacking node 800.
• the plot shows a clear signal (i.e., spike) only for the attacking node 800 when the attack happens.
• the attacking node 800 clearly stands out because the frequency of motifs of size 3 at that node increases nearly 4 times as much as any other node.
• FIG. 9 is a flow diagram of the method to detect attack on networks
• a hierarchical representation of network activity is generated, in a second step 902, changes in the size of temporal motifs in the hierarchical representation are detected, in a third step 904, sources of misinformation in the communication network are detected and predicted.
• Mobile wireless networks experience widespread use in applications, non- limiting examples of which include mobile military and law enforcement networks (soldier-to-soldier, sensar-to-s.ensor, ground and aerial vehiele-to- vehide); commercial vehicle-to- vehicle and vekicle-to-inirasinictai e networks; commercial mesh networks; wireless infrastructure ISPs, and cellular companies
• the system after identifying the presence of misinformation in the network, the system performs an operation to attribute who is responsible for the attack. After attributing the attack to an entity, the system can take actions to mitigate the attack.
• a non-limiting example of a mitigation action would be to isolate the attacking node (i.e., physical radio).
• the action can include informing every other node in the network to simply ignore anything that the attacking node transmits, and not to send anything to, or through, the attacking node.
• Implementation of the system described herein takes the form of a set of algorithms that provides rapid and accurate detection and prediction of sources of misinformation in the control plane of a wireless network.

Landscapes

• Engineering & Computer Science (AREA)
• Computer Security & Cryptography (AREA)
• Computer Networks & Wireless Communication (AREA)
• Computer Hardware Design (AREA)
• General Engineering & Computer Science (AREA)
• Signal Processing (AREA)
• Theoretical Computer Science (AREA)
• Software Systems (AREA)
• Computing Systems (AREA)
• Physics & Mathematics (AREA)
• General Physics & Mathematics (AREA)
• Data Exchanges In Wide-Area Networks (AREA)
• Mobile Radio Communication Systems (AREA)
• Computer And Data Communications (AREA)

Applications Claiming Priority (3)

Publications (2)

Family

ID=57546242

Family Applications (2)

Family Applications Before (1)

Country Status (3)

Families Citing this family (2)

Family Cites Families (22)

• 2016
  • 2016-03-18 WO PCT/US2016/023308 patent/WO2016204839A2/en active Application Filing
  • 2016-03-18 EP EP16812078.0A patent/EP3272075A4/de active Pending
  • 2016-03-18 WO PCT/US2016/023307 patent/WO2016204838A2/en active Application Filing
  • 2016-03-18 CN CN201680010942.5A patent/CN107409124B/zh active Active
  • 2016-03-18 EP EP16812077.2A patent/EP3272102A4/de active Pending
  • 2016-03-18 CN CN201680010741.5A patent/CN107251519B/zh active Active

Also Published As

Similar Documents

Legal Events