Device health estimation by combining contextual information with sensor data

Information

  • Patent Grant
  • 10078062
  • Patent Number
    10,078,062
  • Date Filed
    Tuesday, December 15, 2015
    8 years ago
  • Date Issued
    Tuesday, September 18, 2018
    5 years ago
Abstract
A method and system for detecting fault in a machine. During operation, the system obtains control signals and corresponding sensor data that indicates a condition of the machine. The system determines consistent time intervals for each of the control signals. During a consistent time interval the standard deviation of a respective control signal is less than a respective predetermined threshold. The system aggregates the consistent time intervals to determine aggregate consistent intervals. The system then maps the aggregate consistent intervals to the sensor data to determine time interval segments for the sensor data. The system may generate features based on the sensor data. Each respective feature is generated from a time interval segment of the sensor data. The system trains a classifier using the features, and applies the classifier to additional sensor data indicating a condition of the machine over a period of time to detect a machine fault.
Description
FIELD

The present disclosure generally relates to estimating device health. More specifically, the present disclosure relates to a method and system for accurately diagnosing device failure by combining a device's operating context with sensor data.


RELATED ART

The growing Internet of Things is predicted to connect 30 billion devices by 2020. This will bring in tremendous amounts of data and drive the innovations needed to realize the vision of Industry 4.0, which includes cyber-physical systems monitoring physical processes, and communicating and cooperating with each other and with humans in real time. One of the key challenges is how to analyze large amounts of data to provide useful and actionable information for business intelligence and decision making. In particular, one challenge is to prevent unexpected downtime and its significant impact on overall equipment effectiveness (OEE) and total cost of ownership (TCO) in many industries. Continuous monitoring of equipment and early detection of incipient faults can support optimal maintenance strategies, prevent downtime, increase productivity, and reduce costs. To that end, there have been a number of anomaly detection and diagnosis methods proposed for detecting machine fault and estimating machine health.


Some have proposed applying different approaches to detect anomalies for various types of equipment, including statistical methods, neural network methods, and reliability methods. Some approaches focus on analyzing, combining, and modeling sensor data (e.g. vibration, current, acoustics signal) to detect machine faults. However, in some cases, these approaches may generate false alarms. Previous approaches have also used vibration data and/or acceleration data for diagnosing machine imbalance fault conditions. Other approaches may use temperature data to diagnose faults. However, it can be expensive to acquire vibration data and it may be difficult and insufficiently accurate to use temperature data to perform diagnostics.


SUMMARY

One embodiment of the present invention provides a method for detecting fault in a machine. During operation, the system obtains a plurality of control signals associated with controlling the machine and sensor data that indicates a condition of the machine during a time period when the plurality of control signals control the machine. The system then determines consistent time intervals for each of the plurality of control signals, in which during a consistent time interval the standard deviation of a respective control signal is less than a respective predetermined threshold. The system may aggregate the consistent time intervals of the plurality of control signals to determine aggregate consistent intervals. The system then maps the aggregate consistent intervals of the plurality of control signals to the sensor data to determine a plurality of time interval segments for the sensor data. The system may generate a plurality of features based on the sensor data, in which each respective feature is generated from a time interval segment of the plurality of time interval segments for the sensor data. The system may then train a classifier using the plurality of features, and subsequently apply the classifier to additional sensor data indicating a condition of the machine over a period of time to detect a machine fault.


In one variation on this embodiment, the plurality of control signals includes spindle motor speed, spindle load, and actual spindle speed, and the sensor data is temperature data indicating a temperature associated with the machine.


In one variation on this embodiment, aggregating the consistent time intervals includes determining an intersection of sets of consistent time intervals over all control signals.


In one variation on this embodiment, generating the features includes computing an average, a standard deviation, a maximum fast Fourier transform (FFT) value, and a FFT frequency at maximum amplitude for the sensor data.


In a further variation on this embodiment, the generated features form a high-dimensional feature space. The system also applies principal component analysis (PCA) to project the high-dimensional feature space into a low-dimensional space, and applies linear discriminant analysis (LDA) to determine an optimal coordinate transformation that provides maximum separation between classes.


In a further variation on this embodiment, determining consistent time intervals further includes generating a temporal segment representation of the machine's operation context.


In a further variation on this embodiment, applying the classifier further includes generating features for the classifier with same conditions as in classifier training by determining time intervals of a primary control signal that have same values for the primary control signal as a value of the primary control signal when generating training features.


In a further variation on this embodiment, the system removes one or more control signal intervals that are inconsistent from the plurality of control signals.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1 presents a diagram illustrating an exemplary machine fault detection system, in accordance with an embodiment of the present invention.



FIG. 2 presents a flow chart illustrating an exemplary process to generate a classifier for detecting machine faults, in accordance with an embodiment of the present invention.



FIG. 3 illustrates an exemplary graph of the result of a temporal segmentation scheme with spindle speed control.



FIG. 4 illustrates an exemplary graph of spindle speed control with consistent time segments.



FIG. 5 illustrates an exemplary diagram of aggregating control signals.



FIG. 6 illustrates an exemplary graph of principal component analysis-linear discriminant analysis results for group 1.



FIG. 7 illustrates an exemplary graph of principal component analysis-linear discriminant analysis results for group 2.



FIG. 8 illustrates an exemplary fault detection apparatus, in accordance with an embodiment.



FIG. 9 presents an exemplary server in a machine fault detection system, in accordance with an embodiment of the present invention.





In the figures, like reference numerals refer to the same figure elements.


DETAILED DESCRIPTION

The following description is presented to enable any person skilled in the art to make and use the invention, and is provided in the context of a particular application and its requirements. Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present invention. Thus, the present invention is not limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.


The data structures and code described in this detailed description are typically stored on a computer-readable storage medium, which may be any device or medium that can store code and/or data for use by a computer system. The computer-readable storage medium includes, but is not limited to, volatile memory, non-volatile memory, magnetic and optical storage devices such as disk drives, magnetic tape, CDs (compact discs), DVDs (digital versatile discs or digital video discs), or other media capable of storing computer-readable media now known or later developed.


Overview


Embodiments of the present invention solve the problem of diagnosing machine fault in the absence of vibration data by training a classifier to intelligently combine device operating context information and sensor data to detect abnormal conditions and accurately diagnose device failure. This disclosure describes a data fusion method that combines sensor data indicating the condition of a machine tool with the machine's operating context to detect machine faults. A fault detection system may train a classifier to detect machine faults using features generated from the sensor data. One or more sensors can monitor the machine tool and provide streams of sensor data indicating the condition of the machine tool, including sensor data such as temperature data. Contextual data may include data indicating multiple control signals used to control and operate the machine tool.


The system can leverage contextual information to classify sensor data more accurately. By accounting for environmental or external input (e.g., fluctuations in control signals) the system can reduce or eliminate the number of false alarms. For example, the system may diagnose imbalance of a machine tool that has a cutting tool attached to a spindle. The spindle rotates to turn the cutting tool. A machine tool controller may use closed-loop control with multiple control signals to control the machine. Some of these control signals include control signals for spindle motor speed, spindle load, and actual spindle speed. The control signals may fluctuate and that can affect the output or condition of the machine. The system can train the classifier using only temperature data that correspond to those portions of the control signals that are stable and avoid the fluctuating input signals. This improves the accuracy of the classifier when the system applies the classifier to temperature data that corresponds to stable segments of the control signals with the same control signal conditions.


The system determines the time intervals at which the control signals are consistent (or constant) and uses the consistent intervals to segmentize corresponding sensor data. For example, the control signals may be consistent during some interval with a standard deviation equal to or below a predetermined threshold (e.g., a standard deviation of zero). The system defines a temporal segment for each of the consistent portions of the control signals and may generate aggregated segments that each represents an aggregation of the temporal segments. The system then maps the aggregated segments to the temperature sensor data to define segments in the temperature sensor data. The system uses the segments in the temperature sensor data as features to train a classifier. For example, some of the features may include average, standard deviation, maximum fast Fourier transform (FFT) value, and FFT frequency at maximum amplitude for a segment. The system thus extracts features from the temperature sensor data using the contextual information derived from the control signals. The system trains a classifier using the extracted features. The system can use the trained classifier to detect machine faults for sensor data that corresponds to consistent control signal conditions. The classifier can detect (or predict) abnormal or anomalous temperature sensor data coming from the machine, and can alert a machine operator that there may be an current (or upcoming) problem with the machine.


Thus, by considering the machine's operating context, the system can analyze the device's health condition and diagnose device failure using cheaper sensor data, without needing to use vibration data that may be ideal but is more to expensive to acquire.


Exemplary Machine Fault Detection System



FIG. 1 presents a diagram illustrating an exemplary machine fault detection system 100, in accordance with an embodiment of the present invention. Machine fault detection system 100 includes a fault detection server 102 communicating with one or more sensors 104 over a network 106 that can detect the current condition of a machine 108 and provide continuous sensor data that indicates the condition of machine 108. For example, sensor 104 may provide continuous temperature data for machine 108 by measuring and/or detecting the temperature of the machine. Server 102 may also communicate with an agent 110. Agent 110 may communicate with an adapter 112 to retrieve control signal data.


System 100 may use MTConnect to diagnose machine health condition by combining sensor data with operating context information. MTConnect is an open-source communication protocol designed to allow machine tools and other equipment to talk to one another and to computer programs that process data from the machines. MTConnect was developed to connect various legacy machines independent of the controller providers. MTConnect allows for monitoring machine operating context in real-time.


In one embodiment, agent 110 may format control signal data received from adapter 112 into an MTConnect standard XML stream, and respond to HTTP requests by returning the appropriate control signal data. In some embodiments, agent 110 can also send control signal data to server 102 as agent 110 collects the data. Adapter 112 collects and filters data that includes control signal data from a machine tool controller 114, and sends the collected data to agent 110.


Machine tool controller 114 may control machine 108 with closed-loop control and multiple control signals. Examples of control signals include spindle motor speed, spindle load, actual spindle speed and Y drive load. Machine controller 114 may use feedback from the current state of the machine to control machine 108.


Fault detection server 102 may use the sensor data to detect problems with machine 108. Fault detection server 102 may include a sensor data receiver 116, a control signal data receiver 118, a feature generator 120, a classifier generator 122, and a fault detector 124.


Sensor data receiver 116 may receive continuously streaming (e.g., time series) sensor data from sensor 104. Control signal data receiver 118 may receive control signal data from agent 110. Feature generator 120 may analyze a control signal to determine consistent intervals and aggregate time intervals, and map the aggregate time intervals to time series sensor data (e.g., indicating temperature of machine 108) to segmentize the sensor data and generate features. Classifier generator 122 may generate a classifier by training the classifier on the generated features.


Fault detector 124 may apply the generated classifier to sensor data and control signal input (e.g., in the form of temporal segments) in order to detect machine faults. In some embodiments, fault detector 124 may utilize feature generator 120 to generate features from sensor data using control signal input so that the classifier can classify sensor data segments under the same control signal conditions that the classifier is trained with. Further, some implementations may utilize different sensors and/or additional sensors to detect or measure other machine conditions.


System 100 may diagnose any fault with machine 108. For example, system 100 may detect imbalance problems with machine 108. System 100 may determine a degree of imbalance for machine 108. Machine 108 may be a machine tool with a spindle holding a cutting tool. For example, there may be an imbalance problem if the machine tool, spindle, and/or cutting tool is incorrectly positioned.


System 100 can diagnose any fault using a combination of contextual data (e.g., control signal) received from agent 110 and sensor data that complement each other. System 100 can use the contextual data to discretize (e.g., segmentize) the sensor data and train a classifier using features generated from the sensor data segments. System 100 can apply the classifier to detect faults in machine 108, and alert an operator 126.


Generating a Classifier



FIG. 2 presents a flow chart illustrating an exemplary process to generate a classifier for detecting machine faults, in accordance with an embodiment of the present invention. Embodiments of the present invention are not limited to the operations depicted in FIG. 2, and some embodiments may perform the operations of FIG. 2 in a different order or with operations that vary from that depicted in FIG. 2


As depicted in FIG. 2, the system may initially obtain sensor data and control signal data (operation 202). For example, the system may obtain multiple control signals such as a control signal for controlling a spindle motor speed, a control signal for spindle load, and a control signal for actual spindle speed. The system may also obtain continuously streaming (e.g., time series) sensor data such as the temperature data for a machine. In some embodiments, the system can also obtain other time series sensor data from additional sensors or different sensor types not depicted in FIG. 1.


The system may then perform a segmentation technique that provides a temporal representation of the machine's operation context, and combine the temporal representation with sensor data to estimate machine health.


The system may analyze the control signal data to determine consistent time intervals for control signals (operation 204). These are time intervals that have a standard deviation at or below a minimum predetermined threshold (e.g., the predetermined threshold may be zero).


In some embodiments, to utilize the control signals to provide temporal segmentation, e.g., assuming quasi-steady state, the system determines the time intervals in which the following conditions are satisfied: (i) all experiments display same values (e.g., result in same values) for the primary control signal (e.g., actual spindle speed) and (ii) all the control signals are constant over the same period. Note that, to determine the dynamic response, rather than quasi steady state response, the control signals should be consistent across the experiments so that responses are compared under the same set of control inputs. FIG. 3 shows a graph 300 illustrating the result of this temporal segmentation scheme with the spindle speed control. In some embodiments, the classifier classifies sensor data corresponding to control signal input (e.g., consistent time intervals) that satisfies these conditions. For example, the value of the primary control signal is the same for features when applying a classifier and for features when training the classifier. As another example, all control signals are constant over the same time period for features when applying the classifier and for features when training the classifier.


In some embodiments, there may be multiple control signals. For each sample time, the system may compute the standard deviation for each control signal separately (e.g., zero standard deviation shows a control signal which has the same value for all the sample data). In other words, for each of the control signals, the system may compute the standard deviation at each time step (e.g., time interval). The system may identify the periods with standard deviation at or below a predetermined threshold to find the consistent time intervals. For example, the predetermined threshold may be zero. For example, FIG. 4 illustrates a graph 400 showing consistent time intervals as 16 segments along the time axis. The system may remove one or more control signals that are inconsistent (e.g., this assumes that these control signals are secondary feedback signals). In some embodiments, the system may remove one or more inconsistent control signal intervals.


The system can determine the intersection of the sets of consistent time intervals over all (or a plurality of) the control signals to determine the aggregate time intervals (e.g., temporal segments) over which the control signals are statistically consistent (operation 206). This is illustrated by a graph 500 in FIG. 5. For example, the system may determine that there are 16 temporal segments for the control signals, as depicted in the graphs 400, 500 in FIG. 4-FIG. 5.


System 100 may then generate features from segments of the sensor data that correspond to the aggregate time intervals for the control signals (operation 208). The system may map the aggregate time intervals (e.g., temporal segments) that are consistent to the sensor data to segmentize the sensor data. The system may analyze each segment of the time series for sensor data separately, and decompose the sensor data into features using time-domain and frequency domain analysis. For example, for each segment, system 100 may generate features such as the average, standard deviation, maximum FFT value, and FFT frequency at maximum amplitude. These features characterize or summarize observations of the sensor data for a segment. The generated features may form a high-dimensional feature space. For the examples depicted in FIG. 3-FIG. 7 the system may determine that there are 16 temporal segments, and the system may generate a 64 dimensional feature space to diagnose machine imbalance.


In some embodiments, the system projects the high-dimensional data to a much smaller sub-space to prevent over-fitting. The system may use linear transformation-based approaches. The system may use principal component analysis (PCA) to project a high-dimensional feature space into a low-dimensional space followed by a linear discriminant analysis (LDA) to search the optimal separation among various device health conditions. For example, the system may use PCA to reduce the dimensionality from 64 to 4. The system may use LDA to determine the optimal coordinate transformation that provides maximum separation between classes.



FIG. 6 and FIG. 7 illustrates graphs 600, 700 showing the results of PCA-LDA analysis for fluid temperature sensor data. The inventors determined from experimental results that a temperature sensor located at a motor also exhibited diagnostic capability after applying control-based temporal segmentation. Note that besides temperature sensor data, system 100 can use any other suitable streams of sensor data indicating the condition of the machine, such as pressure sensor data. System 100 can generate features from segments using different types or combinations of sensor data. In some embodiments, system 100 can also generate a classifier using other types of control signals and combinations of control signals besides the control signals described in this specification.


The system may then train a classifier based on the features (operation 210). System 100 may use any type of classifier, including examples such as decision tree classifiers, naive Bayes classifiers, support vector machines, rule-based classifiers, and neural networks. System 100 may apply the trained classifier on streaming temperature sensor data indicating the condition of the machine to predict upcoming machine faults or detect current machine faults (operation 212). In one embodiment, the classifier may classify sensor data that corresponds to control signals matching the same conditions as the control signals used in training the classifier.


Exemplary Apparatus



FIG. 8 presents a block diagram illustrating an exemplary apparatus 800 for detecting machine faults, in accordance with an embodiment. Apparatus 800 can comprise a plurality of modules which may communicate with one another via a wired or wireless communication channel. Apparatus 800 may be realized using one or more integrated circuits, and may include fewer or more modules than those shown in FIG. 8. Further, apparatus 800 may be integrated in a computer system, or realized as a separate device which is capable of communicating with other computer systems and/or devices.


Specifically, apparatus 800 can comprise a sensor data receiver 802, a control signal data receiver 804, a feature generator 806, a classifier generator 808, and a fault detector 810. Note that apparatus 800 may also include additional modules and data not depicted in FIG. 8, and different implementations may arrange functionality according to a different set of modules. Embodiments of the present invention are not limited to any particular arrangement of modules.


Sensor data receiver 802 may receive a continuous stream of sensor data from a sensor. The sensor data indicates a condition of a machine, such as a measure of the temperature or pressure of a machine. Control data signal data receiver 804 may receive control signals from an agent, and the agent may obtain the control signals through an adapter connected to the machine. Feature generator 806 may analyze the control signal data to determine consistent intervals and aggregate time intervals, and segmentize corresponding sensor data to generate features. Classifier generator 808 may generate a classifier based on the generated features. Fault detector 810 may apply the generated classifier to sensor data to detect machine faults. Fault detector 810 may utilize feature generator 806 to generate features from sensor data and control signal input so that the classifier can classify sensor data segments under the same control signal conditions and/or other conditions that the classifier is trained with.



FIG. 9 presents a machine fault detection server 900 in a machine fault detection system, in accordance with an embodiment of the present invention. In FIG. 9, server 900 includes a processor 902, a memory 904, and a storage device 906. Storage device 906 stores programs to be executed by processor 902. Specifically, storage device 906 stores a sensor data receiver 908, a control signal data receiver 910, a feature generator 912, a classifier generator 914, and a fault detector 916, as well as other applications, such as applications 918 and 920. Machine fault detection server 900 may be coupled to an optional display 922, a keyboard 924, and a pointing device 926.


Sensor data receiver 908 may receive a continuous stream of sensor data from a sensor. The sensor data indicates a condition of a machine, such as a measure of the temperature or pressure of a machine. Control signal data receiver 910 may receive control signals from an agent, and the agent obtains the control signals through an adapter connected to the machine. Feature generator 912 may analyze the control signal data to determine consistent intervals and aggregate time intervals, and segmentize corresponding sensor data to generate features. Classifier generator 914 may generate a classifier based on the generated features. Fault detector 916 may apply the generated classifier to sensor data and control signal input (e.g., in the form of temporal segments) in order to detect machine faults. In some embodiments, fault detector 916 may utilize feature generator 912 to generate features from sensor data and control signal input so that the classifier can classify sensor data segments under the same control signal conditions and/or other conditions that the classifier is trained with.


The methods and processes described in the detailed description section can be embodied as code and/or data, which can be stored in a computer-readable storage medium as described above. When a computer system reads and executes the code and/or data stored on the computer-readable storage medium, the computer system performs the methods and processes embodied as data structures and code and stored within the computer-readable storage medium.


Furthermore, the methods and processes described below can be included in hardware modules. For example, the hardware modules can include, but are not limited to, application-specific integrated circuit (ASIC) chips, field-programmable gate arrays (FPGAs), and other programmable-logic devices now known or later developed. When the hardware modules are activated, the hardware modules perform the methods and processes included within the hardware modules.


The foregoing descriptions of embodiments of the present invention have been presented for purposes of illustration and description only. They are not intended to be exhaustive or to limit the present invention to the forms disclosed. Accordingly, many modifications and variations will be apparent to practitioners skilled in the art. Additionally, the above disclosure is not intended to limit the present invention. The scope of the present invention is defined by the appended claims.

Claims
  • 1. A computer-executable method for detecting fault in a machine, comprising: obtaining a control signal associated with controlling the machine and sensor data that indicates a condition of the machine during a time period when the control signal controls the machine;determining consistent time intervals for the control signal, wherein during a consistent time interval the standard a standard deviation of the control signal is less than a predetermined threshold;mapping the consistent time intervals to the sensor data to determine a plurality of time interval segments for the sensor data;generating a plurality of training features based on the sensor data, wherein each respective feature is generated in association with from a time interval segment;providing the plurality of training features as input to a classifier to train the classifier to classify abnormal sensor data during a respective consistent time interval;generating new features for the classifier with same conditions as in classifier training by determining time intervals of a primary control signal that have same values for the primary control signal as a value of the primary control signal when generating the training features; anddetecting a machine fault by providing new features associated with additional machine sensor data as input to the classifier to detect abnormal sensor data during a respective consistent time interval.
  • 2. The method of claim 1, wherein the control signal is at least one of a spindle motor speed, spindle load, and actual spindle speed; and wherein the sensor data is temperature data indicating a temperature associated with the machine.
  • 3. The method of claim 1, wherein generating the plurality of training features includes computing at least one of an average, a standard deviation, a maximum fast Fourier transform (FFT) value, and a FFT frequency at maximum amplitude for the sensor data.
  • 4. The method of claim 3, wherein the generated training features form a high-dimensional feature space, further comprising: applying principal component analysis (PCA) to project the high-dimensional feature space into a low-dimensional space; andapplying linear discriminant analysis (LDA) to determine an optimal coordinate transformation that provides maximum separation between classes.
  • 5. The method of claim 1, wherein determining consistent time intervals further comprises generating a temporal segment representation of the machine's operation context.
  • 6. The method of claim 1, further comprising: removing one or more control signal intervals that are inconsistent from a plurality of control signals before determining aggregate consistent intervals based on the plurality of control signals.
  • 7. A non-transitory computer-readable storage medium storing instructions which when executed by a computer cause the computer to perform a method for detecting fault in a machine, the method comprising: obtaining a control signal associated with controlling the machine and sensor data that indicates a condition of the machine during a time period when the control signal controls the machine;determining consistent time intervals for the control signal, wherein during a consistent time interval a standard deviation of the control signal is less than a predetermined threshold;mapping the consistent time intervals to the sensor data to determine a plurality of time interval segments for the sensor data;generating a plurality of training features based on the sensor data, wherein each respective feature is generated in association with a time interval segment;providing the plurality of training features as input to a classifier to train the classifier to classify abnormal sensor data during a respective consistent time interval;generating new features for the classifier with same conditions as in classifier training by determining time intervals of a primary control signal that have same values for the primary control signal as a value of the primary control signal when generating the training features; anddetecting a machine fault by providing new features associated with additional machine sensor data as input to the classifier to detect abnormal sensor data during a respective consistent time interval.
  • 8. The storage medium of claim 7, wherein the control signal is at least one of a spindle motor speed, spindle load, and actual spindle speed; and the and wherein the sensor data is temperature data indicating a temperature associated with the machine.
  • 9. The storage medium of claim 7, wherein generating the plurality of training features includes computing at least one of an average, a standard deviation, a maximum fast Fourier transform (FFT) value, and a FFT frequency at maximum amplitude for the sensor data.
  • 10. The storage medium of claim 7, wherein determining consistent time intervals further comprises generating a temporal segment representation of the machine's operation context.
  • 11. The storage medium of claim 7, wherein the method further comprises: removing one or more control signal intervals that are inconsistent from a plurality of control signals before determining aggregate consistent intervals based on the plurality of control signals.
  • 12. A computing system comprising: one or more processors;a memory; anda non-transitory computer-readable medium coupled to the one or more processors storing instructions stored that, when executed by the one or more processors, cause the computing system to perform a method comprising:obtaining a control signal associated with controlling the machine and sensor data that indicates a condition of the machine during a time period when the control signal controls the machine;determining consistent time intervals for the control signal, wherein during a consistent time interval a standard deviation of the control signal is less than a predetermined threshold;mapping the consistent time intervals to the sensor data to determine a plurality of time interval segments for the sensor data;generating a plurality of training features based on the sensor data, wherein each respective feature is generated in association with from a time interval segment;providing the plurality of training features as input to a classifier to train the classifier to classify abnormal sensor data during a respective consistent time interval;generating new features for the classifier with same conditions as in classifier training by determining time intervals of a primary control signal that have same values for the primary control signal as a value of the primary control signal when generating the training features; anddetecting a machine fault by providing new features associated with additional machine sensor data as input to the classifier to detect abnormal sensor data during a respective consistent time interval.
  • 13. The computing system of claim 12, wherein the control signal is at least one of a spindle motor speed, spindle load, and actual spindle speed; and wherein the sensor data is temperature data indicating a temperature associated with the machine.
  • 14. The computing system of claim 12, wherein generating the plurality of training features includes computing at least one of an average, a standard deviation, a maximum fast Fourier transform (FFT) value, and a FFT frequency at maximum amplitude for the sensor data.
  • 15. The method of claim 1, further comprising: aggregating consistent time intervals of a plurality of control signals to determine aggregate consistent intervals.
  • 16. The method of claim 15, wherein aggregating the consistent time intervals comprises determining an intersection of sets of consistent time intervals over all control signals.
  • 17. The storage medium of claim 7, wherein the method further comprises: aggregating consistent time intervals of a plurality of control signals to determine aggregate consistent intervals.
  • 18. The storage medium of claim 17, wherein aggregating the consistent time intervals comprises determining an intersection of sets of consistent time intervals over all control signals.
  • 19. The computing system of claim 12, wherein the method further comprises: aggregating consistent time intervals of a plurality of control signals to determine aggregate consistent intervals.
  • 20. The computing system of claim 19, wherein aggregating the consistent time intervals comprises determining an intersection of sets of consistent time intervals over all control signals.
US Referenced Citations (437)
Number Name Date Kind
817441 Niesz Apr 1906 A
3921945 Swaim Nov 1975 A
4309569 Merkle Jan 1982 A
4921898 Lenney May 1990 A
5070134 Oyamada Dec 1991 A
5110856 Oyamada May 1992 A
5506844 Rao Apr 1996 A
5629370 Freidzon May 1997 A
5870605 Bracho Feb 1999 A
6052683 Irwin Apr 2000 A
6085320 Kaliski et al. Jul 2000 A
6091724 Chandra Jul 2000 A
6173364 Zenchelsky Jan 2001 B1
6226618 Downs May 2001 B1
6233617 Rothwein May 2001 B1
6233646 Hahm May 2001 B1
6332158 Risley Dec 2001 B1
6366988 Skiba Apr 2002 B1
6574377 Cahill Jun 2003 B1
6654792 Verma Nov 2003 B1
6667957 Corson Dec 2003 B1
6681220 Kaplan Jan 2004 B1
6681326 Son Jan 2004 B2
6769066 Botros Jul 2004 B1
6772333 Brendel Aug 2004 B1
6862280 Bertagna Mar 2005 B1
6901452 Bertagna May 2005 B1
6917985 Madruga Jul 2005 B2
6968393 Chen Nov 2005 B1
6981029 Menditto Dec 2005 B1
7013389 Srivastava Mar 2006 B1
7031308 Garcia-Luna-Aceves Apr 2006 B2
7061877 Gummalla Jun 2006 B1
7152094 Jannu Dec 2006 B1
7177646 ONeill Feb 2007 B2
7206860 Murakami Apr 2007 B2
7257837 Xu Aug 2007 B2
7287275 Moskowitz Oct 2007 B2
7315541 Housel Jan 2008 B1
7339929 Zelig Mar 2008 B2
7350229 Lander Mar 2008 B1
7362727 ONeill Apr 2008 B1
7382787 Barnes Jun 2008 B1
7430755 Hughes Sep 2008 B1
7444251 Nikovski Oct 2008 B2
7466703 Arunachalam Dec 2008 B1
7472422 Agbabian Dec 2008 B1
7496668 Hawkinson Feb 2009 B2
7509425 Rosenberg Mar 2009 B1
7523016 Surdulescu Apr 2009 B1
7542471 Samuels Jun 2009 B2
7543064 Juncker Jun 2009 B2
7552233 Raju Jun 2009 B2
7555482 Korkus Jun 2009 B2
7555563 Ott Jun 2009 B2
7564812 Elliott Jul 2009 B1
7567547 Mosko Jul 2009 B2
7567946 Andreoli Jul 2009 B2
7580971 Gollapudi Aug 2009 B1
7623535 Guichard Nov 2009 B2
7647507 Feng Jan 2010 B1
7660324 Oguchi Feb 2010 B2
7685290 Satapati Mar 2010 B2
7698463 Ogier Apr 2010 B2
7769887 Bhattacharyya Aug 2010 B1
7779467 Choi Aug 2010 B2
7801177 Luss Sep 2010 B2
7816441 Elizalde Oct 2010 B2
7831733 Sultan Nov 2010 B2
7908337 Garcia-Luna-Aceves Mar 2011 B2
7924837 Shabtay Apr 2011 B1
7953885 Devireddy May 2011 B1
8000267 Solis Aug 2011 B2
8010691 Kollmansberger Aug 2011 B2
8074289 Carpentier Dec 2011 B1
8117441 Kurien Feb 2012 B2
8160069 Jacobson Apr 2012 B2
8204060 Jacobson Jun 2012 B2
8214364 Bigus Jul 2012 B2
8224985 Takeda Jul 2012 B2
8225057 Zheng Jul 2012 B1
8271578 Sheffi Sep 2012 B2
8312064 Gauvin Nov 2012 B1
8386622 Jacobson Feb 2013 B2
8467297 Liu Jun 2013 B2
8473633 Eardley Jun 2013 B2
8553562 Allan Oct 2013 B2
8572214 Garcia-Luna-Aceves Oct 2013 B2
8654649 Vasseur Feb 2014 B2
8665757 Kling Mar 2014 B2
8667172 Ravindran Mar 2014 B2
8688619 Ezick Apr 2014 B1
8699350 Kumar Apr 2014 B1
8718055 Vasseur May 2014 B2
8750820 Allan Jun 2014 B2
8761022 Chiabaut Jun 2014 B2
8762477 Xie Jun 2014 B2
8762570 Qian Jun 2014 B2
8762707 Killian Jun 2014 B2
8767627 Ezure Jul 2014 B2
8817594 Gero Aug 2014 B2
8826381 Kim Sep 2014 B2
8832302 Bradford Sep 2014 B1
8836536 Marwah Sep 2014 B2
8862774 Vasseur Oct 2014 B2
8868779 ONeill Oct 2014 B2
8903756 Zhao Dec 2014 B2
8934496 Vasseur Jan 2015 B2
8937865 Kumar Jan 2015 B1
9071498 Beser Jun 2015 B2
9112895 Lin Aug 2015 B1
20020010795 Brown Jan 2002 A1
20020038296 Margolus Mar 2002 A1
20020048269 Hong Apr 2002 A1
20020054593 Morohashi May 2002 A1
20020077988 Sasaki Jun 2002 A1
20020078066 Robinson Jun 2002 A1
20020138551 Erickson Sep 2002 A1
20020176404 Girard Nov 2002 A1
20020188605 Adya Dec 2002 A1
20020199014 Yang Dec 2002 A1
20030033394 Stine Feb 2003 A1
20030046437 Eytchison Mar 2003 A1
20030048793 Pochon Mar 2003 A1
20030051100 Patel Mar 2003 A1
20030074472 Lucco Apr 2003 A1
20030088696 McCanne May 2003 A1
20030097447 Johnston May 2003 A1
20030099237 Mitra May 2003 A1
20030140257 Peterka Jul 2003 A1
20030158694 Wegerich Aug 2003 A1
20030195688 Mensler Oct 2003 A1
20030229892 Sardera Dec 2003 A1
20040024879 Dingman Feb 2004 A1
20040030602 Rosenquist Feb 2004 A1
20040071140 Jason Apr 2004 A1
20040073715 Folkes Apr 2004 A1
20040139230 Kim Jul 2004 A1
20040221047 Grover Nov 2004 A1
20040225627 Botros Nov 2004 A1
20040252683 Kennedy Dec 2004 A1
20050003832 Osafune Jan 2005 A1
20050028156 Hammond Feb 2005 A1
20050032581 Wagner Feb 2005 A1
20050043060 Brandenberg Feb 2005 A1
20050050211 Kaul Mar 2005 A1
20050074001 Mattes Apr 2005 A1
20050149508 Deshpande Jul 2005 A1
20050159823 Hayes Jul 2005 A1
20050198351 Nog Sep 2005 A1
20050249196 Ansari Nov 2005 A1
20050259637 Chu Nov 2005 A1
20050262217 Nonaka Nov 2005 A1
20050281288 Banerjee Dec 2005 A1
20050289222 Sahim Dec 2005 A1
20060010249 Sabesan Jan 2006 A1
20060029102 Abe Feb 2006 A1
20060039379 Abe Feb 2006 A1
20060051055 Ohkawa Mar 2006 A1
20060072523 Richardson Apr 2006 A1
20060099973 Nair May 2006 A1
20060129514 Watanabe Jun 2006 A1
20060133343 Huang Jun 2006 A1
20060173831 Basso Aug 2006 A1
20060193295 White Aug 2006 A1
20060206445 Andreoli Sep 2006 A1
20060215684 Capone Sep 2006 A1
20060223504 Ishak Oct 2006 A1
20060256767 Suzuki Nov 2006 A1
20060268792 Belcea Nov 2006 A1
20070019619 Foster Jan 2007 A1
20070073888 Madhok Mar 2007 A1
20070094265 Korkus Apr 2007 A1
20070112880 Yang May 2007 A1
20070124412 Narayanaswami May 2007 A1
20070127457 Mirtorabi Jun 2007 A1
20070160062 Morishita Jul 2007 A1
20070162394 Zager Jul 2007 A1
20070171828 Dalal Jul 2007 A1
20070189284 Kecskemeti Aug 2007 A1
20070195765 Heissenbuttel Aug 2007 A1
20070204011 Shaver Aug 2007 A1
20070209067 Fogel Sep 2007 A1
20070239892 Ott Oct 2007 A1
20070240207 Belakhdar Oct 2007 A1
20070245034 Retana Oct 2007 A1
20070253418 Shiri Nov 2007 A1
20070255677 Alexander Nov 2007 A1
20070255699 Sreenivas Nov 2007 A1
20070255781 Li Nov 2007 A1
20070274504 Maes Nov 2007 A1
20070276907 Maes Nov 2007 A1
20070294187 Scherrer Dec 2007 A1
20080005056 Stelzig Jan 2008 A1
20080010366 Duggan Jan 2008 A1
20080037420 Tang Feb 2008 A1
20080043989 Furutono Feb 2008 A1
20080046340 Brown Feb 2008 A1
20080059631 Bergstrom Mar 2008 A1
20080080440 Yarvis Apr 2008 A1
20080101357 Iovanna May 2008 A1
20080107034 Jetcheva May 2008 A1
20080123862 Rowley May 2008 A1
20080133583 Artan Jun 2008 A1
20080133755 Pollack Jun 2008 A1
20080151755 Nishioka Jun 2008 A1
20080159271 Kutt Jul 2008 A1
20080165775 Das Jul 2008 A1
20080186901 Itagaki Aug 2008 A1
20080200153 Fitzpatrick Aug 2008 A1
20080215669 Gaddy Sep 2008 A1
20080216086 Tanaka Sep 2008 A1
20080243992 Jardetzky Oct 2008 A1
20080250006 Dettinger Oct 2008 A1
20080256359 Kahn Oct 2008 A1
20080270618 Rosenberg Oct 2008 A1
20080271143 Stephens Oct 2008 A1
20080287142 Keighran Nov 2008 A1
20080288580 Wang Nov 2008 A1
20080298376 Takeda Dec 2008 A1
20080320148 Capuozzo Dec 2008 A1
20090006659 Collins Jan 2009 A1
20090013324 Gobara Jan 2009 A1
20090022154 Kiribe Jan 2009 A1
20090024641 Quigley Jan 2009 A1
20090030978 Johnson Jan 2009 A1
20090037763 Adhya Feb 2009 A1
20090052660 Chen Feb 2009 A1
20090067429 Nagai Mar 2009 A1
20090077184 Brewer Mar 2009 A1
20090092043 Lapuh Apr 2009 A1
20090097631 Gisby Apr 2009 A1
20090103515 Pointer Apr 2009 A1
20090113068 Fujihira Apr 2009 A1
20090116393 Hughes May 2009 A1
20090144300 Chatley Jun 2009 A1
20090157887 Froment Jun 2009 A1
20090185745 Momosaki Jul 2009 A1
20090193101 Munetsugu Jul 2009 A1
20090222344 Greene Sep 2009 A1
20090228593 Takeda Sep 2009 A1
20090254572 Redlich Oct 2009 A1
20090268905 Matsushima Oct 2009 A1
20090285209 Stewart Nov 2009 A1
20090287835 Jacobson Nov 2009 A1
20090288143 Stebila Nov 2009 A1
20090288163 Jacobson Nov 2009 A1
20090292743 Bigus Nov 2009 A1
20090293121 Bigus Nov 2009 A1
20090300079 Shitomi Dec 2009 A1
20090300407 Kamath Dec 2009 A1
20090307333 Welingkar Dec 2009 A1
20090323632 Nix Dec 2009 A1
20100005061 Basco Jan 2010 A1
20100027539 Beverly Feb 2010 A1
20100046546 Ram Feb 2010 A1
20100057929 Merat Mar 2010 A1
20100058346 Narang Mar 2010 A1
20100088370 Wu Apr 2010 A1
20100094767 Miltonberger Apr 2010 A1
20100098093 Ejzak Apr 2010 A1
20100100465 Cooke Apr 2010 A1
20100103870 Garcia-Luna-Aceves Apr 2010 A1
20100124191 Vos May 2010 A1
20100125911 Bhaskaran May 2010 A1
20100131660 Dec May 2010 A1
20100150155 Napierala Jun 2010 A1
20100165976 Khan Jul 2010 A1
20100169478 Saha Jul 2010 A1
20100169503 Kollmansberger Jul 2010 A1
20100180332 Ben-Yochanan Jul 2010 A1
20100182995 Hwang Jul 2010 A1
20100185753 Liu Jul 2010 A1
20100195653 Jacobson Aug 2010 A1
20100195654 Jacobson Aug 2010 A1
20100195655 Jacobson Aug 2010 A1
20100217874 Anantharaman Aug 2010 A1
20100232402 Przybysz Sep 2010 A1
20100232439 Dham Sep 2010 A1
20100235516 Nakamura Sep 2010 A1
20100246549 Zhang Sep 2010 A1
20100250497 Redlich Sep 2010 A1
20100250939 Adams Sep 2010 A1
20100268782 Zombek Oct 2010 A1
20100272107 Papp Oct 2010 A1
20100284309 Allan Nov 2010 A1
20100284404 Gopinath Nov 2010 A1
20100293293 Beser Nov 2010 A1
20100322249 Thathapudi Dec 2010 A1
20110013637 Xue Jan 2011 A1
20110022812 vanderLinden Jan 2011 A1
20110029952 Harrington Feb 2011 A1
20110055392 Shen Mar 2011 A1
20110055921 Narayanaswamy Mar 2011 A1
20110060716 Forman Mar 2011 A1
20110060717 Forman Mar 2011 A1
20110090908 Jacobson Apr 2011 A1
20110106755 Hao May 2011 A1
20110145597 Yamaguchi Jun 2011 A1
20110145858 Philpott Jun 2011 A1
20110149858 Hwang Jun 2011 A1
20110153840 Narayana Jun 2011 A1
20110158122 Murphy Jun 2011 A1
20110161408 Kim Jun 2011 A1
20110202609 Chaturvedi Aug 2011 A1
20110219427 Hito Sep 2011 A1
20110231578 Nagappan Sep 2011 A1
20110239256 Gholmieh Sep 2011 A1
20110258049 Ramer Oct 2011 A1
20110264824 Venkata Subramanian Oct 2011 A1
20110265159 Ronda Oct 2011 A1
20110265174 Thornton Oct 2011 A1
20110271007 Wang Nov 2011 A1
20110286457 Ee Nov 2011 A1
20110286459 Rembarz Nov 2011 A1
20110295783 Zhao Dec 2011 A1
20110299454 Krishnaswamy Dec 2011 A1
20120011170 Elad Jan 2012 A1
20120011551 Levy Jan 2012 A1
20120036180 Thornton Feb 2012 A1
20120047361 Erdmann Feb 2012 A1
20120066727 Nozoe Mar 2012 A1
20120106339 Mishra May 2012 A1
20120114313 Phillips May 2012 A1
20120120803 Farkas May 2012 A1
20120127994 Ko May 2012 A1
20120136676 Goodall May 2012 A1
20120136936 Quintuna May 2012 A1
20120136945 Lee May 2012 A1
20120137367 Dupont May 2012 A1
20120141093 Yamaguchi Jun 2012 A1
20120155464 Kim Jun 2012 A1
20120158973 Jacobson Jun 2012 A1
20120163373 Lo Jun 2012 A1
20120179653 Araki Jul 2012 A1
20120197690 Agulnek Aug 2012 A1
20120198048 Loffe Aug 2012 A1
20120221150 Arensmeier Aug 2012 A1
20120224487 Hui Sep 2012 A1
20120257500 Lynch Oct 2012 A1
20120284791 Miller Nov 2012 A1
20120290669 Parks Nov 2012 A1
20120290919 Melnyk Nov 2012 A1
20120291102 Cohen Nov 2012 A1
20120314580 Hong Dec 2012 A1
20120317307 Ravindran Dec 2012 A1
20120331112 Chatani Dec 2012 A1
20130024560 Vasseur Jan 2013 A1
20130041982 Shi Feb 2013 A1
20130051392 Filsfils Feb 2013 A1
20130060962 Wang Mar 2013 A1
20130073552 Rangwala Mar 2013 A1
20130074155 Huh Mar 2013 A1
20130091539 Khurana Apr 2013 A1
20130110987 Kim May 2013 A1
20130111063 Lee May 2013 A1
20130151584 Westphal Jun 2013 A1
20130163426 Beliveau Jun 2013 A1
20130166668 Byun Jun 2013 A1
20130173822 Hong Jul 2013 A1
20130182568 Lee Jul 2013 A1
20130182931 Fan Jul 2013 A1
20130185406 Choi Jul 2013 A1
20130191412 Kitamura Jul 2013 A1
20130197698 Shah Aug 2013 A1
20130198119 Eberhardt, III Aug 2013 A1
20130219038 Lee Aug 2013 A1
20130219081 Qian Aug 2013 A1
20130219478 Mahamuni Aug 2013 A1
20130223237 Hui Aug 2013 A1
20130227114 Vasseur Aug 2013 A1
20130227166 Ravindran Aug 2013 A1
20130242996 Varvello Sep 2013 A1
20130250809 Hui Sep 2013 A1
20130282854 Jang Oct 2013 A1
20130282860 Zhang Oct 2013 A1
20130282920 Zhang Oct 2013 A1
20130304937 Lee Nov 2013 A1
20130329696 Xu Dec 2013 A1
20130336323 Srinivasan Dec 2013 A1
20130339481 Hong Dec 2013 A1
20130343408 Cook Dec 2013 A1
20140003232 Guichard Jan 2014 A1
20140006354 Parkison Jan 2014 A1
20140006565 Muscariello Jan 2014 A1
20140029445 Hui Jan 2014 A1
20140032714 Liu Jan 2014 A1
20140040505 Barton Feb 2014 A1
20140040628 Fort Feb 2014 A1
20140074730 Arensmeier Mar 2014 A1
20140075567 Raleigh Mar 2014 A1
20140082135 Jung Mar 2014 A1
20140089454 Jeon Mar 2014 A1
20140096249 Dupont Apr 2014 A1
20140108474 David Apr 2014 A1
20140115037 Liu Apr 2014 A1
20140129736 Yu May 2014 A1
20140136814 Stark May 2014 A1
20140140348 Perlman May 2014 A1
20140143370 Vilenski May 2014 A1
20140146819 Bae May 2014 A1
20140149733 Kim May 2014 A1
20140156396 deKozan Jun 2014 A1
20140165207 Engel Jun 2014 A1
20140172783 Suzuki Jun 2014 A1
20140172981 Kim Jun 2014 A1
20140173034 Liu Jun 2014 A1
20140173076 Ravindran Jun 2014 A1
20140192717 Liu Jul 2014 A1
20140195328 Ferens Jul 2014 A1
20140195641 Wang Jul 2014 A1
20140195666 Dumitriu Jul 2014 A1
20140233575 Xie Aug 2014 A1
20140237085 Park Aug 2014 A1
20140245359 DeFoy Aug 2014 A1
20140254595 Luo Sep 2014 A1
20140280823 Varvello Sep 2014 A1
20140281489 Peterka Sep 2014 A1
20140281505 Zhang Sep 2014 A1
20140282816 Xie Sep 2014 A1
20140289325 Solis Sep 2014 A1
20140289790 Wilson Sep 2014 A1
20140314093 You Oct 2014 A1
20140337276 Iordanov Nov 2014 A1
20140365550 Jang Dec 2014 A1
20150006896 Franck Jan 2015 A1
20150018770 Baran Jan 2015 A1
20150032892 Narayanan Jan 2015 A1
20150039890 Khosravi Feb 2015 A1
20150063802 Bahadur Mar 2015 A1
20150089081 Thubert Mar 2015 A1
20150095481 Ohnishi Apr 2015 A1
20150095514 Yu Apr 2015 A1
20150188770 Naiksatam Jul 2015 A1
20150195149 Vasseur Jul 2015 A1
20150207633 Ravindran Jul 2015 A1
20170372268 Ilan Dec 2017 A1
Foreign Referenced Citations (16)
Number Date Country
1720277 Jun 1967 DE
19620817 Nov 1997 DE
0295727 Dec 1988 EP
0757065 Jul 1996 EP
1077422 Feb 2001 EP
1384729 Jan 2004 EP
2124415 Nov 2009 EP
2214357 Aug 2010 EP
03005288 Jan 2003 WO
03042254 May 2003 WO
03049369 Jun 2003 WO
03091297 Nov 2003 WO
2007113180 Oct 2007 WO
2007144388 Dec 2007 WO
2011049890 Apr 2011 WO
2013123410 Aug 2013 WO
Non-Patent Literature Citations (153)
Entry
Jacobson, Van et al., “Content-Centric Networking, Whitepaper Describing Future Assurable Global Networks”, Palo Alto Research Center, Inc., Jan. 30, 2007, pp. 1-9.
Koponen, Teemu et al., “A Data-Oriented (and Beyond) Network Architecture”, SIGCOMM '07, Aug. 27-31, 2007, Kyoto, Japan, XP-002579021, p. 181-192.
Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovic, and Fabian E. Bustamante. Drafting Behind Akamai: Inferring Network Conditions Based on CDN Redirections. IEEE/ACM Transactions on Networking {Feb. 2009).
“PBC Library-Pairing-Based Cryptography-About,” http://crypto.stanford.edu/pbc. downloaded Apr. 27, 2015.
C. Gentry and A. Silverberg. Hierarchical ID-Based Cryptography. Advances in Cryptolog—ASIACRYPT 2002. Springer Berlin Heidelberg (2002).
Boneh et al., “Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Keys”, 2005.
D. Boneh and M. Franklin. Identity-Based Encryption from the Weil Pairing. Advances in Cryptology—CRYPTO 2001, vol. 2139, Springer Berlin Heidelberg (2001).
Anteniese et al., “Improved Proxy Re-Encryption Schemes with Applications to Secure Distributed Storage”, 2006.
Xiong et al., “CloudSeal: End-to-End Content Protection in Cloud-based Storage and Delivery Services”, 2012.
J. Bethencourt, A, Sahai, and B. Waters, ‘Ciphertext-policy attribute-based encryption,’ in Proc. IEEE Security & Privacy 2007, Berkeley, CA, USA, May 2007, pp. 321-334.
J. Lotspiech, S. Nusser, and F. Pestoni. Anonymous Trust: Digit.
J. Shao and Z. Cao. CCA-Secure Proxy Re-Encryption without Pairings. Public Key Cryptography. Springer Lecture Notes in Computer Sciencevol. 5443 (2009).
Gopal et al. “Integrating content-based Mechanisms with hierarchical File systems”, Feb. 1999, University of Arizona, 15 pages.
R. H. Deng, J. Weng, S. Liu, and K. Chen. Chosen-Ciphertext Secure Proxy Re-Encryption without Pairings. CANS. Spring Lecture Notes in Computer Science vol. 5339 (2008).
RTMP (2009). Available online at http://wwwimages.adobe.com/www.adobe.com/content/dam/Adobe/en/devnet/rtmp/ pdf/rtmp specification 1.0.pdf.
S. Chow, J. Weng, Y. Yang, and R. Deng. Efficient Unidirectional Proxy Re-Encryption. Progress in Cryptology—AFRICACRYPT 2010. Springer Berlin Heidelberg (2010).
S. Kamara and K. Lauter. Cryptographic Cloud Storage. Financial Cryptography and Data Security. Springer Berlin Heidelberg (2010).
Sandvine, Global Internet Phenomena Report—Spring 2012. Located online at http://www.sandvine.com/downloads/ documents/Phenomenal H 2012/Sandvine Global Internet Phenomena Report 1H 2012.pdf.
The Despotify Project (2012). Available online at http://despotify.sourceforge.net/.
V. K. Adhikari, S. Jain, Y. Chen, and Z.-L. Zhang. Vivisecting Youtube:An Active Measurement Study. In INFOCOM12 Mini-conference (2012).
Vijay Kumar Adhikari, Yang Guo, Fang Hao, Matteo Varvello, Volker Hilt, Moritz Steiner, and Zhi-Li Zhang. Unreeling Netflix: Understanding and Improving Multi-CDN Movie Delivery. In the Proceedings of IEEE INFOCOM 2012 (2012).
Jacobson, Van et al. ‘VoCCN: Voice Over Content-Centric Networks.’ Dec. 1, 2009. ACM ReArch'09.
Rosenberg, J. “Interactive Connectivity Establishment (ICE): A Protocol for Network Address Translator (NAT) Traversal for Offer/Answer Protocols”, Apr. 2010, pp. 1-117.
Shih, Eugene et al., ‘Wake on Wireless: An Event Driven Energy Saving Strategy for Battery Operated Devices’, Sep. 23, 2002, pp. 160-171.
Fall, K. et al., “DTN: an architectural retrospective”, Selected areas in communications, IEEE Journal on, vol. 28, No. 5, Jun. 1, 2008, pp. 828-835.
Gritter, M. et al., ‘An Architecture for content routing support in the Internet’, Proceedings of 3rd Usenix Symposium on Internet Technologies and Systems, 2001, pp. 37-48.
“CCNx,” http://ccnx.org/. downloaded Mar. 11, 2015.
“Content Delivery Network”, Wikipedia, Dec. 10, 2011, http://en.wikipedia.org/w/index.php?title=Content_delivery_network&oldid=465077460.
“Digital Signature” archived on Aug. 31, 2009 at http://web.archive.org/web/20090831170721/http://en.wikipedia.org/wiki/Digital_signature.
“Introducing JSON,” http://www.json.org/. downloaded Mar. 11, 2015.
“Microsoft PlayReady,” http://www.microsoft.com/playready/.downloaded Mar. 11, 2015.
“Pursuing a pub/sub internet (PURSUIT),” http://www.fp7-pursuit.ew/PursuitWeb/. downloaded Mar. 11, 2015.
“The FP7 4WARD project,” http://www.4ward-project.eu/. downloaded Mar. 11, 2015.
A. Broder and A. Karlin, “Multilevel Adaptive Hashing”, Jan. 1990, pp. 43-53.
Detti, Andrea, et al. “CONET: a content centric inter-networking architecture.” Proceedings of the ACM SIGCOMM workshop on Information-centric networking. ACM, 2011.
A. Wolman, M. Voelker, N. Sharma N. Cardwell, A. Karlin, and H.M. Levy, “On the scale and performance of cooperative web proxy caching,” ACM SIGHOPS Operating Systems Review, vol. 33, No. 5, pp. 16-31, Dec. 1999.
Afanasyev, Alexander, et al. “Interest flooding attack and countermeasures in Named Data Networking.” IFIP Networking Conference, 2013. IEEE, 2013.
B. Ahlgren et al., ‘A Survey of Information-centric Networking’ IEEE Commun. Magazine, Jul. 2012, pp. 26-36.
Bari, MdFaizul, et al. ‘A survey of naming and routing in information-centric networks.’ Communications Magazine, IEEE 50.12 (2012): 44-53.
Baugher, Mark et al., “Self-Verifying Names for Read-Only Named Data”, 2012 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Mar. 2012, pp. 274-279.
Brambley, Michael, A novel, low-cost, reduced-sensor approach for providing smart remote monitoring and diagnostics for packaged air conditioners and heat pumps. Pacific Northwest National Laboratory, 2009.
C.A. Wood and E. Uzun, “Flexible end-to-end content security in CCN,” in Proc. IEEE CCNC 2014, Las Vegas, CA, USA, Jan. 2014.
Carzaniga, Antonio, Matthew J. Rutherford, and Alexander L. Wolf. ‘A routing scheme for content-based networking.’ INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies. vol. 2. IEEE, 2004.
Cho, Jin-Hee, Ananthram Swami, and Ray Chen. “A survey on trust management for mobile ad hoc networks.” Communications Surveys & Tutorials, IEEE 13.4 (2011): 562-583.
Compagno, Alberto, et al. “Poseidon: Mitigating interest flooding DDoS attacks in named data networking.” Local Computer Networks (LCN), 2013 IEEE 38th Conference on. IEEE, 2013.
Conner, William, et al. “A trust management framework for service-oriented environments.” Proceedings of the 18th international conference on World wide web. ACM, 2009.
Content Centric Networking Project (CCN) [online], http://ccnx.org/releases/latest/doc/technical/, Downloaded Mar. 9, 2015.
Content Mediator Architecture for Content-aware Networks (COMET) Project [online], http://www.comet-project.org/, Downloaded Mar. 9, 2015.
D.K. Smetters, P. Golle, and J.D. Thornton, “CCNx access control specifications,” PARC, Tech. Rep., Jul. 2010.
Dabirmoghaddam, Ali, Maziar Mirzazad Barijough, and J. J. Garcia-Luna-Aceves. ‘Understanding optimal caching and opportunistic caching at the edge of information-centric networks.’ Proceedings of the 1st international conference on Information-centric networking. ACM, 2014.
Detti et al., “Supporting the Web with an information centric network that routes by name”, Aug. 2012, Computer Networks 56, pp. 3705-3702.
Dijkstra, Edsger W., and Carel S. Scholten. ‘Termination detection for diffusing computations.’ Information Processing Letters 11.1 (1980): 1-4.
Dijkstra, Edsger W., Wim HJ Feijen, and A_J M. Van Gasteren. “Derivation of a termination detection algorithm for distributed computations.” Control Flow and Data Flow: concepts of distributed programming. Springer Berlin Heidelberg, 1986. 507-512.
E. Rescorla and N. Modadugu, “Datagram transport layer security,” IETF RFC 4347, Apr. 2006.
E.W. Dijkstra, W. Feijen, and A.J.M. Van Gasteren, “Derivation of a Termination Detection Algorithm for Distributed Computations,” Information Processing Letter, vol. 16, No. 5, 1983.
Fayazbakhsh, S. K., Lin, Y., Tootoonchian, A., Ghodsi, A., Koponen, T., Maggs, B., & Shenker, S. {Aug. 2013). Less pain, most of the gain: Incrementally deployable ICN. In ACM SIGCOMM Computer Communication Review (vol. 43, No. 4, pp. 147-158). ACM.
G. Tyson, S. Kaune, S. Miles, Y. El-Khatib, A. Mauthe, and A. Taweel, “A trace-driven analysis of caching in content-centric networks,” In Proc. IEEE ICCCN 2012, Munich, Germany, Jul.-Aug. 2012, pp. 1-7.
G. Wang, Q. Liu, and J. Wu, “Hierarchical attribute-based encryption for fine-grained access control in cloud storage services,” in Proc. ACM CCS 2010, Chicago, IL, USA, Oct. 2010, pp. 735-737.
G. Xylomenos et al., “A Survey of Information-centric Networking Research,” IEEE Communication Surveys and Tutorials, Jul. 2013.
Garcia, Humberto E., Wen-Chiao Lin, and Semyon M. Meerkov. “A resilient condition assessment monitoring system.” Resilient Control Systems (ISRCS), 2012 5th International Symposium on. IEEE, 2012.
Garcia-Luna-Aceves, Jose J. ‘A unified approach to loop-free routing using distance vectors or link states.’ ACM SIGCOMM Computer Communication Review. vol. 19. No. 4. ACM, 1989.
Garcia-Luna-Aceves, Jose J. ‘Name-Based Content Routing in Information Centric Networks Using Distance Information’ Proc ACM ICN 2014, Sep. 2014.
Ghali, Cesar, GeneTsudik, and Ersin Uzun. “Needle in a Haystack: Mitigating Content Poisoning in Named-Data Networking.” Proceedings of NDSS Workshop on Security of Emerging Networking Technologies (SENT). 2014.
Ghodsi, Ali, et al. “Information-centric networking: seeing the forest for the trees.” Proceedings of the 10th ACM Workshop on Hot Topics in Networks. ACM, 2011.
Ghodsi, Ali, et al. “Naming in content-oriented architectures.” Proceedings of the ACM SIGCOMM workshop on Information-centric networking. ACM, 2011.
Gupta, Anjali, Barbara Liskov, and Rodrigo Rodrigues. “Efficient Routing for Peer-to-Peer Overlays.” NSDI. vol. 4. 2004.
Heckerman, David, John S. Breese, and Koos Rommelse. “Decision-Theoretic Troubleshooting.” Communications of the ACM. 1995.
Heinemeier, Kristin, et al. “Uncertainties in Achieving Energy Savings from HVAC Maintenance Measures in the Field.” ASHRAE Transactions 118.Part 2 {2012).
Herlich, Matthias et al., “Optimizing Energy Efficiency for Bulk Transfer Networks”, Apr. 13, 2010, pp. 1-3, retrieved for the Internet: URL:http://www.cs.uni-paderborn.de/fileadmin/informationik/ag-karl/publications/miscellaneous/optimizing.pdf (retrieved on Mar. 9, 2012).
Hoque et al., ‘NLSR: Named-data Link State Routing Protocol’, Aug. 12, 2013, ICN 2013, pp. 15-20.
https://code.google.com/p/ccnx-trace/.
I. Psaras, R.G. Clegg, R. Landa, W.K. Chai, and G. Pavlou, “Modelling and evaluation of CCN-caching trees,” in Proc. IFIP Networking 2011, Valencia, Spain, May 2011, pp. 78-91.
Intanagonwiwat, Chalermek, Ramesh Govindan, and Deborah Estrin. ‘Directed diffusion: a scalable and robust communication paradigm for sensor networks.’ Proceedings of the 6th annual international conference on Mobile computing and networking. ACM, 2000.
J. Aumasson and D. Bernstein, “SipHash: a fast short-input PRf”, Sep. 18, 2012.
J. Hur, “Improving security and efficiency in attribute-based data sharing,” IEEE Trans. Knowledge Data Eng., vol. 25, No. 10, pp. 2271-2282, Oct. 2013.
V. Jacobson et al., ‘Networking Named Content,’ Proc. IEEE CoNEXT '09, Dec. 2009.
Jacobson et al., “Custodian-Based Information Sharing,” Jul. 2012, IEEE Communications Magazine: vol. 50 Issue 7 (p. 3843).
Ji, Kun, et al. “Prognostics enabled resilient control for model-based building automation systems.” Proceedings of the 12th Conference of International Building Performance Simulation Association. 2011.
K. Liang, L. Fang, W. Susilo, and D.S. Wong, “A Ciphertext-policy attribute-based proxy re-encryption with chosen-ciphertext security,” in Proc. INCoS 2013, Xian, China, Sep. 2013, pp. 552-559.
Katipamula, Srinivas, and Michael R. Brambley. “Review article: methods for fault detection, diagnostics, and prognostics for building systemsa review, Part I.” HVAC&R Research 11.1 (2005): 3-25.
Katipamula, Srinivas, and Michael R. Brambley. “Review article: methods for fault detection, diagnostics, and prognostics for building systemsa review, Part II.” HVAC&R Research 11.2 (2005): 169-187.
L. Wang et al., ‘OSPFN: an OSPF Based Routing Protocol for Named Data Networking,’ Technical Report NDN-0003, 2012.
L. Zhou, V. Varadharajan, and M. Hitchens, “Achieving secure role-based access control on encrypted data in cloud storage,” IEEE Trans. Inf. Forensics Security, vol. 8, No. 12, pp. 1947-1960, Dec. 2013.
Li, Wenjia, Anupam Joshi, and Tim Finin. “Coping with node misbehaviors in ad hoc networks: A multi-dimensional trust management approach.” Mobile Data Management (MDM), 2010 Eleventh International Conference on. IEEE, 2010.
Lopez, Javier, et al. “Trust management systems for wireless sensor networks: Best practices.” Computer Communications 33.9 (2010): 1086-1093.
M. Green and G. Ateniese, “Identity-based proxy re-encryption,” in Proc. ACNS 2007, Zhuhai, China, Jun. 2007, pp. 288-306.
M. Ion, J. Zhang, and E.M. Schooler, “Toward content-centric privacy in ICN: Attribute-based encryption and routing,” in Proc. ACM SIGCOMM ICN 2013, Hong Kong, China, Aug. 2013, pp. 39-40.
M. Naor and B. Pinkas “Efficient trace and revoke schemes,” in Proc. FC 2000, Anguilla, British West Indies, Feb. 2000, pp. 1-20.
M. Nystrom, S. Parkinson, A. Rusch, and M. Scott, “PKCS#12: Personal information exchange syntax v. 1.1,” IETF RFC 7292, K. Moriarty, Ed., Jul. 2014.
M. Parsa and J.J. Garcia-Luna-Aceves, “A Protocol for Scalable Loop-free Multicast Routing.” IEEE JSAC, Apr. 1997.
M. Walfish, H. Balakrishnan, and S. Shenker, “Untangling the web from DNS,” in Proc. USENIX NSDI 2004, Oct. 2010, pp. 735-737.
Mahadevan, Priya, et al. “Orbis: rescaling degree correlations to generate annotated internet topologies.” ACM SIGCOMM Computer Communication Review. vol. 37. No. 4. ACM, 2007.
Mahadevan, Priya, et al. “Systematic topology analysis and generation using degree correlations.” ACM SIGCOMM Computer Communication Review. vol. 36. No. 4. ACM, 2006.
Matocha, Jeff, and Tracy Camp. ‘A taxonomy of distributed termination detection algorithms.’ Journal of Systems and Software 43.3 (1998): 207-221.
Matteo Varvello et al., “Caesar: A Content Router for High Speed Forwarding”, ICN 2012, Second Edition on Information-Centric Networking, New York, Aug. 2012.
McWilliams, Jennifer A., and Iain S. Walker. “Home Energy Article: A Systems Approach to Retrofitting Residential HVAC Systems.” Lawrence Berkeley National Laboratory (2005).
Merindol et al., “An efficient algorithm to enable path diversity in link state routing networks”, Jan. 10, Computer Networks 55 (2011), pp. 1132-1140.
Mobility First Project [online], http://mobilityfirst.winlab.rutgers.edu/, Downloaded Mar. 9, 2015.
Narasimhan, Sriram, and Lee Brownston. “HyDE-A General Framework for Stochastic and Hybrid Modelbased Diagnosis.” Proc. DX 7 (2007): 162-169.
NDN Project [online], http://www.named-data.net/, Downloaded Mar. 9, 2015.
Omar, Mawloud, Yacine Challal, and Abdelmadjid Bouabdallah. “Certification-based trust models in mobile ad hoc networks: A survey and taxonomy.” Journal of Network and Computer Applications 35.1 (2012): 268-286.
P. Mahadevan, E.Uzun, S. Sevilla, and J. Garcia-Luna-Aceves, “CCN-krs: A key resolution service for ccn,” in Proceedings of the 1st International Conference on Information-centric Networking, Ser. INC 14 New York, NY, USA: ACM, 2014, pp. 97-106. [Online]. Available: http://doi.acm.org/10.1145/2660129.2660154.
S. Deering, “Multicast Routing in Internetworks and Extended LANs,” Proc. ACM SIGCOMM '88, Aug. 1988.
S. Deering et al., “The PIM architecture for wide-area multicast routing,” IEEE/ACM Trans, on Networking, vol. 4, No. 2, Apr. 1996.
S. Jahid, P. Mittal, and N. Borisov, “EASiER: Encryption-based access control in social network with efficient revocation,” in Proc. ACM ASIACCS 2011, Hong Kong, China, Mar. 2011, pp. 411-415.
S. Kamara and K. Lauter, “Cryptographic cloud storage,” in Proc. FC 2010, Tenerife, Canary Islands, Spain, Jan. 2010, pp. 136-149.
S. Kumar et al. “Peacock Hashing: Deterministic and Updatable Hashing for High Performance Networking,” 2008, pp. 556-564.
S. Misra, R. Tourani, and N.E. Majd, “Secure content delivery in information-centric networks: Design, implementation, and analyses,” in Proc. ACM SIGCOMM ICN 2013, Hong Kong, China, Aug. 2013, pp. 73-78.
S. Yu, C. Wang, K. Ren, and W. Lou, “Achieving secure, scalable, and fine-grained data access control in cloud computing,” in Proc. IEEE INFOCOM 2010, San Diego, CA, USA, Mar. 2010, pp. 1-9.
S.J. Lee, M. Gerla, and C. Chiang, “On-demand Multicast Routing Protocol in Multihop Wireless Mobile Networks,” Mobile Networks and Applications, vol. 7, No. 6, 2002.
Scalable and Adaptive Internet Solutions (SAIL) Project [online], http://sail-project.eu/ Downloaded Mar. 9, 2015.
Schein, Jeffrey, and Steven T. Bushby. A Simulation Study of a Hierarchical, Rule-Based Method for System-Level Fault Detection and Diagnostics in HVAC Systems. US Department of Commerce,[Technology Administration], National Institute of Standards and Technology, 2005.
Shani, Guy, Joelle Pineau, and Robert Kaplow. “A survey of point-based POMDP solvers.” Autonomous Agents and Multi-Agent Systems 27.1 (2013): 1-51.
Sheppard, John W., and Stephyn GW Butcher. “A formal analysis of fault diagnosis with d-matrices.” Journal of Electronic Testing 23.4 (2007): 309-322.
Shneyderman, Alex et al., ‘Mobile VPN: Delivering Advanced Services in Next Generation Wireless Systems’, Jan. 1, 2003, pp. 3-29.
Solis, Ignacio, and J. J. Garcia-Luna-Aceves. ‘Robust content dissemination in disrupted environments.’ proceedings of the third ACM workshop on Challenged networks. ACM, 2008.
Sun, Ying, and Daniel S. Weld. “A framework for model-based repair.” AAAI. 1993.
T. Ballardie, P. Francis, and J. Crowcroft, “Core Based Trees (CBT),” Proc. ACM SIGCOMM '88, Aug. 1988.
T. Dierts, “The transport layer security (TLS) protocol version 1.2,” IETF RFC 5246, 2008.
T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K.H. Kim, S. Shenker, and I. Stoica, ‘A data-oriented (and beyond) network architecture,’ ACM SIGCOMM Computer Communication Review, vol. 37, No. 4, pp. 181-192, Oct. 2007.
V. Goyal, 0. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-grained access control of encrypted data,” in Proc. ACM CCS 2006, Alexandria, VA, USA, Oct.-Nov. 2006, pp. 89-98.
V. Jacobson, D.K. Smetters, J.D. Thornton, M.F. Plass, N.H. Briggs, and R.L. Braynard, ‘Networking named content,’ in Proc. ACM CoNEXT 2009, Rome, Italy, Dec. 2009, pp. 1-12.
Verma, Vandi, Joquin Fernandez, and Reid Simmons. “Probabilistic models for monitoring and fault diagnosis.” The Second IARP and IEEE/RAS Joint Workshop on Technical Challenges for Dependable Robots in Human Environments. Ed. Raja Chatila. Oct. 2002.
Vutukury, Srinivas, and J. J. Garcia-Luna-Aceves. A simple approximation to minimum-delay routing. vol. 29. No. 4. ACM, 1999.
W.-G. Tzeng and Z.-J. Tzeng, “A public-key traitor tracing scheme with revocation using dynamic shares,” in Proc. PKC 2001, Cheju Island, Korea, Feb. 2001, pp. 207-224.
Waldvogel, Marcel “Fast Longest Prefix Matching: Algorithms, Analysis, and Applications”, A dissertation submitted to the Swiss Federal Institute of Technology Zurich, 2002.
Walker, Iain S. Best practices guide for residential HVAC Retrofits. No. LBNL-53592. Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA (US), 2003.
Wang, Jiangzhe et al.,“DMND: Collecting Data from Mobiles Using Named Data”, Vehicular Networking Conference, 2010 IEEE, pp. 49-56. .
Xylomenos, George, et al. “A survey of information-centric networking research.” Communications Surveys & Tutorials, IEEE 16.2 (2014): 1024-1049.
Yi, Cheng, et al. ‘A case for stateful forwarding plane.’ Computer Communications 36.7 (2013): 779-791.
Yi, Cheng, et al. ‘Adaptive forwarding in named data networking.’ ACM SIGCOMM computer communication review 42.3 (2012): 62-67.
Zahariadis, Theodore, et al. “Trust management in wireless sensor networks.” European Transactions on Telecommunications 21.4 (2010): 386-395.
Zhang, et al., “Named Data Networking (NDN) Project”, http://www.parc.com/publication/2709/named-data-networking-ndn-project.html, Oct. 2010, NDN-0001, PARC Tech Report.
Zhang, Lixia, et al. ‘Named data networking.’ ACM SIGCOMM Computer Communication Review 44.3 {2014): 66-73.
Soh et al., “Efficient Prefix Updates for IP Router Using Lexicographic Ordering and Updateable Address Set”, Jan. 2008, IEEE Transactions on Computers, vol. 57, No. 1.
Beben et al., “Content Aware Network based on Virtual Infrastructure”, 2012 13th ACIS International Conference on Software Engineering.
Biradar et al., “Review of multicast routing mechanisms in mobile ad hoc networks”, Aug. 16, Journal of Network and Computer Applications 35 (2012) 221-229.
D. Trossen and G. Parisis, “Designing and realizing and information-centric internet,” IEEE Communications Magazing, vol. 50, No. 7, pp. 60-67, Jul. 2012.
Garcia-Luna-Aceves et al., “Automatic Routing Using Multiple Prefix Labels”, 2012, IEEE, Ad Hoc and Sensor Networking Symposium.
Gasti, Paolo et al., ‘DoS & DDoS in Named Data Networking’, 2013 22nd International Conference on Computer Communications and Networks (ICCCN), Aug. 2013, pp. 1-7.
Ishiyama, “On the Effectiveness of Diffusive Content Caching in Content-Centric Networking”, Nov. 5, 2012, IEEE, Information and Telecommunication Technologies (APSITT), 2012 9th Asia-Pacific Symposium.
J. Hur and D.K. Noh, “Attribute-based access control with efficient revocation in data outsourcing systers,” IEEE Trans. Parallel Distrib. Syst, vol. 22, No. 7, pp. 1214-1221, Jul. 2011.
Kaya et al., “A Low Power Lookup Technique for Multi-Hashing Network Applications”, 2006 IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures, Mar. 2006.
Hoque et al., “NLSR: Named-data Link State Routing Protocol”, Aug. 12, 2013, ICN'13.
Nadeem Javaid, “Analysis and design of quality link metrics for routing protocols in Wireless Networks”, PhD Thesis Defense, Dec. 15, 2010, Universete Paris-Est.
Wetherall, David, “Active Network vision and reality: Lessons form a capsule-based system”, ACM Symposium on Operating Systems Principles, Dec. 1, 1999. pp. 64-79.
Kulkarni A.B. et al., “Implementation of a prototype active network”, IEEE, Open Architectures and Network Programming, Apr. 3, 1998, pp. 130-142.
Xie et al. “Collaborative Forwarding and Caching in Content Centric Networks”, Networking 2012.
Amadeo et al. “Design and Analysis of a Transport-Level Solution for Content-Centric VANETs”, University “Mediterranea” of Reggio Calabria, Jun. 15, 2013.
Lui et al. (A TLV-Structured Data Naming Scheme for Content-Oriented Networking, pp. 5822-5827, International Workshop on the Network of the Future, Communications (ICC), 2012 IEEE International Conference on Jun. 10-15, 2012).
Peter Dely et al. “OpenFlow for Wireless Mesh Networks” Computer Communications and Networks, 2011 Proceedings of 20th International Conference on, IEEE, Jul. 31, 2011 (Jul. 31, 2011), pp. 1-6.
Garnepudi Parimala et al “Proactive, reactive and hybrid multicast routing protocols for Wireless Mesh Networks”, 2013 IEEE International Conference on Computational Intelligence and Computing Research, IEEE, Dec. 26, 2013, pp. 1-7.
Tiancheng Zhuang et al. “Managing Ad Hoc Networks of Smartphones”, International Journal of Information and Education Technology, Oct. 1, 2013.
Related Publications (1)
Number Date Country
20170167993 A1 Jun 2017 US