Process, device and system for mapping transformers to meters and locating non-technical line losses

Information

  • Patent Grant
  • 9189822
  • Patent Number
    9,189,822
  • Date Filed
    Friday, October 19, 2012
    11 years ago
  • Date Issued
    Tuesday, November 17, 2015
    8 years ago
Abstract
A process, device and system for mapping usage data from a plurality of utility usage nodes, such as electricity usage meters, to one or more utility distribution nodes, such as a transformer, in which utility usage data collected at a collection device from the plurality of utility usage nodes at predetermined intervals is received, and utility distribution data collected at the collection device from the utility distribution node at the predetermined intervals is likewise received. Aggregate usage data from one or more of the plurality of utility usage nodes is compared to distribution data from the utility distribution node during one or more of the same predetermined intervals to determine, using a computer, which of the plurality of utility usage nodes is connected to the utility distribution node.
Description
FIELD OF THE INVENTION

The present invention relates to utility usage node-to-utility distribution node mapping, and in particular to processes, devices and systems for mapping usage data from a plurality of utility usage nodes, such as electricity usage meters, to at least one utility distribution node, such as a transformer.


BACKGROUND OF THE INVENTION

Utility companies typically keep records of the electrical connections between individual service delivery points (for example, sockets and electricity meters at homes) and pole- or pad-mounted transformers used to reduce or “transform” the high voltage from the utility down to the 120/240 volt residential service. These records are often inaccurate, sometimes inaccurate more than 50% of the time. In addition, in some cases utility commodities, e.g., electricity, are consumed by non-metered loads, referred to as “non-technical line loss;” often the result of theft.


In addition to theft, such inaccuracies in mapping can result from incorrect wiring in response to an outage and even incorrect wiring or reporting of such wiring at initial installation. For numerous reasons, it is important and would be useful for utility companies to have more accurate mappings. Obviously, theft prevention is critical to customers and the utility companies. Further, in the event of a power outage, knowing exactly which transformer(s) to attend to in order to restore power would greatly reduce down time, as well as utility company employee work time, etc.


Utilities have traditionally performed the transformer-to-meter mapping with field surveys, which are expensive, time consuming, and are generally infrequent so they do not provide continuous data. Such field surveys can actually be conducted by physically following wires from houses to the transformer drums, but the limitations to this method of mapping are fairly obvious. Specifically, the issue is how to determine which house is connected to which transformer and to which phase on the particular transformer.


Such mapping can be attempted with power line carrier meters (i.e., a communications technology that runs over the power line itself) and transformer monitoring. For example, the possibility has been considered of locating a power line carrier communications device at each transformer for the different phases that is connected to meters at various houses. Determining with which meters the communications device can communicate should also indicate to which meters the different phases are connected. However, this solution is generally not economical as it requires the installation of individual monitors at the transformers and meters.


Accordingly, there is a need in the art for a process that allows for accurate and efficient mapping of meters to pole or pad transformers.


SUMMARY OF THE INVENTION

Embodiments of the present invention uses software analytics along with wired or wireless interval metering, without requiring a hard wire connection, in order to more accurately perform transformer-to-meter mapping. For example, using software analytics, the usage can be monitored at each house, and the load can also be monitored on each phase at the transformer. Then, using geographical data, such as the location of houses within a certain distance (e.g., one-half mile) from that transformer, and using a succession of combinations of load profiles from a variety of those houses, the combination of houses that best fits the load profile at the particular transformer can be determined. Further, the present invention facilitates quasi-real-time determination and localization of non-technical line losses.


More particularly, the application of embodiments of the present invention with assumptions and inputs from a multitude of devices on the utility distribution network will provide the utility provider with guidance to make more informed decisions for the use of assets and personnel. For example, there are other kinds of devices that utilities can deploy on the distribution lines in addition to transformer power monitors, such as line current monitors. Additionally, voltage information can be obtained using voltage monitors on the lines or on transformers and at houses, and voltage information can be used to determine which house is connected to which phase on which transformer. Embodiments of the present invention can be used for determining distribution phase load allocation and switched circuit status. Embodiments of the invention will provide utilities with better knowledge of the assets within a geographic region between the substation to the meters and better location for where resources need to be dispatched for work.


Embodiments of the present invention contemplate the use of interval data obtained through economical wireless solutions allowing frequent, reliable correlation and mapping between meters and transformers. It also allows quick and accurate determination of non-technical line losses associated with specific transformers by identifying unallocated consumption. This application of data can then further enhance the analysis for other utility distribution system equipment and configuration status.


Embodiments of the invention utilize, for example, computer hardware, operating systems, programming languages, software applications, and other technology to provide processes, devices and systems for mapping usage data from a plurality of utility usage nodes to at least one utility distribution node that involves, for example, collecting, at a collection device, utility usage data from the plurality of utility usage nodes at predetermined intervals, collecting, at the collection device, utility distribution data from the at least one utility distribution node at the predetermined intervals, and determining, using a computer, which of the plurality of utility usage nodes is connected to the at least one utility distribution node by comparing aggregate usage data from one or more of the plurality of utility usage nodes to distribution data from the at least one utility distribution node during at least one same predetermined interval.


In one aspect, the plurality of utility usage nodes for embodiments of the invention comprises, for example, a plurality of electricity usage nodes, a plurality of water usage nodes, or a plurality of gas usage nodes. In another aspect, the predetermined intervals for embodiments of the invention comprise predetermined intervals of at least one minute, predetermined intervals of up to one hour, or predetermined intervals of between at least one minute and up to one hour. In a further aspect, the plurality of utility usage nodes for embodiments of the invention comprises a plurality of electricity usage meters.


In an additional aspect of embodiments of the invention, collecting, at the collection device, the utility usage data from the plurality of utility usage nodes further comprises collecting, at the collection device, the utility usage data from the plurality of utility usage meters over a wireless network. In a still further aspect, collecting, at the collection device, the utility usage data from the plurality of utility usage nodes further comprises collecting, at the collection device, the utility usage data from the plurality of utility usage meters over a wired network. In still another aspect, the plurality of utility usage meters are time synchronized with one another.


In another aspect, the at least one utility distribution node for embodiments of the invention comprises at least one electricity distribution node, at least one water distribution node, or at least one gas distribution node. In still another aspect, the at least one utility distribution node for embodiments of the invention comprises at least one transformer, and the at least one transformer can further comprise at least one transformer load meter. In an additional aspect for embodiments of the invention, collecting, at the collection device, utility distribution data from the at least one utility distribution node further comprises collecting, at the collection device, load meter data from the at least one transformer load meter over a wireless network.


In a further aspect for embodiments of the invention, collecting, at the collection device, utility distribution data from the at least one utility distribution node further comprises collecting, at the collection device, load meter data from the at least one transformer load meter over a wired network. In a still further aspect, the plurality of utility usage nodes for embodiments of the invention further comprise a plurality of electricity usage meters that are time synchronized with one another and also synchronized with the at least one transformer load meter. In another aspect, the at least one utility distribution node for embodiments of the invention further comprises at least one of a substation bank, a circuit breaker, a line capacitor, a circuit recloser, or a circuit switch.


According to an aspect for embodiments of the invention, determining which of the plurality of utility usage nodes is connected to the at least one utility distribution node further comprises determining that all of the plurality of utility usage nodes are connected to the at least one utility distribution node when utility usage according to the aggregate usage data from all of the plurality of utility usage nodes is substantially equal to utility distribution according to the distribution data from the at least one utility distribution node during the at least one same predetermined interval.


According to another aspect for embodiments of the invention, determining which of the plurality of utility usage nodes is connected to the at least one utility distribution node further comprises determining that a condition of unallocated consumption exists for the at least one utility distribution node when utility usage according to the aggregate usage data from all of the plurality of utility usage nodes is less than the utility distribution according to the distribution data from the at least one utility distribution node during the at least one same predetermined interval.


In a further aspect for embodiments of the invention, determining that a condition of unallocated consumption exists further comprises determining that a non-technical line loss exists for the at least one utility distribution node when utility usage according to the aggregate usage data from all of the plurality of utility usage nodes is less than the utility distribution according to the distribution data from the at least one utility distribution node during the at least one same predetermined interval.


In an additional aspect for embodiments of the invention, determining that a condition of unallocated consumption exists further comprises determining that at least one additional utility usage node is connected to the at least one utility distribution node when the utility usage according to the aggregate usage data from all of the plurality of utility usage nodes is less than the utility distribution according to the distribution data from the at least one utility distribution node during the at least one same predetermined interval.


In another aspect for embodiments of the invention, determining that at least one additional utility usage node is connected to the at least one utility distribution node further comprises identifying the at least one additional node by comparing utility usage according to usage data from said at least one additional utility usage node to an amount by which the utility usage according to the aggregate usage data from the plurality of utility usage nodes is less than the utility distribution according to the distribution data from the at least one utility distribution node during the at least one same predetermined interval.


In still another aspect for embodiments of the invention, determining which of the plurality of utility usage nodes is connected to the at least one utility distribution node further comprises determining that less than all of the plurality of utility usage nodes are connected to the at least one utility distribution node when utility usage according to the aggregate usage data from all of the plurality of utility usage nodes exceeds the utility distribution according to the distribution data from the at least one utility distribution node during the at least one same predetermined interval.


In a still further aspect for embodiments of the invention, determining that less than all of the plurality of utility usage nodes are connected to the at least one utility distribution node further comprises identifying at least one of the plurality of utility usage nodes that is not connected to the at least one utility distribution node by comparing utility usage according to usage data from said at least one of the plurality of utility usage nodes to an amount by which utility according to the aggregate usage data from all of the plurality of utility usage nodes exceeds utility distribution according to the distribution data from the at least one utility distribution node during the at least one same predetermined interval.


Other aspects for embodiments of the invention provide, for example, a machine for mapping usage data from a plurality of utility usage nodes to at least one utility distribution node comprising a microprocessor coupled to a memory, wherein the microprocessor is programmed to receive utility usage data collected, at a collection device, from the plurality of utility usage nodes at predetermined intervals, to receive utility distribution data collected, at the collection device, from the at least one utility distribution node at the predetermined intervals, and to determine which of the plurality of utility usage nodes is connected to the at least one utility distribution node by comparing aggregate usage data from one or more of the plurality of utility usage nodes to distribution data from the at least one utility distribution node during at least one same predetermined interval.


Still other aspects for embodiments of the invention provide, for example, a non-transitory computer-readable storage medium with an executable program stored therein, wherein the program instructs a microprocessor to perform the steps of receiving utility usage data collected, at a collection device, from the plurality of utility usage nodes at predetermined intervals, receiving utility distribution data collected, at the collection device, from the at least one utility distribution node at the predetermined intervals, and determining which of the plurality of utility usage nodes is connected to the at least one utility distribution node by comparing aggregate usage data from one or more of the plurality of utility usage nodes to distribution data from the at least one utility distribution node during at least one same predetermined interval.


This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a schematic diagram that illustrates an example of a plurality of customer electricity usage meters connected to a transformer;



FIG. 2 shows exemplary interval meter data for embodiments of the invention from five residential electricity customers;



FIG. 3 shows exemplary expected interval data for embodiments of the invention at the transformer assuming customers 1-4 are connected to the transformer or assuming customers 2-5 are connected to the transformer; and



FIG. 4 is a flow diagram that illustrates an example of the process of mapping usage data from a plurality of utility usage nodes to one or more utility distribution nodes for embodiments of the invention.





DETAILED DESCRIPTION OF INVENTION

Various aspects of the embodiments will now be described. The following description provides specific details for a thorough understanding and enabling description of these examples. Many of these specific details are optional. One skilled in the art will understand, however, that the invention and its various embodiments may be practiced without many of these specific details and options. Additionally, some well-known structures or functions may not be shown or described in detail, so as to avoid unnecessarily obscuring the relevant description.


The terminology used in the description presented below is intended to be interpreted in its broadest reasonable manner, even though it is being used in conjunction with a detailed description of certain specific examples. Certain terms may even be emphasized below; however, any terminology intended to be interpreted in any restricted manner will be overtly and specifically defined as such in this detailed description section. Aspects, features, and elements of the invention and of embodiments of the invention are described throughout the written description and the drawings and claims.


Embodiments of the invention provide a process, device and system of analyzing interval energy consumption data from electricity meters and transformer meters to determine the meter-to-transformer mapping. For example, referring to FIG. 1, the present invention facilitates determining if all or some combination of the Customer meters 1 through 5 are connected to Transformer A. Using load meter data from Transformer A collected over a predetermined period of time, this load information is compared to various combinations of load meter totals over the same period of time for Customers 1 through 5. When there is a match, it is known which Customers 1 through 5 are connected to Transformer A. In other words, for any given time interval, if the cumulative power consumption measured at all five house meters equals the load measured at the transformer, then it can be concluded that only those five house meters are connected to the transformer



FIG. 2 shows exemplary interval meter data from five residential electricity customers. As shown, the consumption interval data from the five homes varies greatly depending on which homes are attached to the transformer. Given the significant variance over smaller intervals, such consumption data makes it possible to map individual meters to transformers on a quasi-real time basis. Such mapping would not be possible using the standard monthly data because the time variation is not such that meter inaccuracy could be eliminated as a source of uncertainty. Put another way, it is entirely possible that the total monthly usage measured at any two or more house meters might coincidentally be the same or nearly the same, but that is not likely over smaller intervals of time. For example, even using an interval such as hourly usage yields 24 data sets to compare for each day and thousands of data sets to compare over an entire month. Such a large data set enables accurate mapping of transformers to meters even though there may be minor measurement inaccuracies in the house meters or on the transformer.


The mapping for embodiments of the invention is possible not only at the single phase level, but down to three phases as well. For example, assume there are three phases on the transformer and power consumption on each of the three phases on the transformer. Instead of five house meters per transformer as in the foregoing example, there are five house meters per phase on the transformer. Thus, the process of mapping the transformer to the meters involves matching three groups of five house meters to corresponding ones of the three phases on the particular transformer.



FIG. 3 shows exemplary expected interval data at the transformer assuming customers 1-4 are connected to the transformer or assuming customers 2-5 are connected to the transformer. The measurable difference between the two curves is significant, showing that correlation of the transformer interval meter data with the individual meter interval data can be used to determine which meters are connected to which transformer. Simply put, FIG. 3 illustrates that if the wrong set of customers is considered, the degree of non-correlation between the transformer interval meter data and the individual meter interval data is substantial.


Once an initial map is established for embodiments of the invention, the continuous data pulls and/or pushes and comparisons will allow for quick issue spotting. For example, if it is determined that Customers 1 through 5 are indeed correctly mapped to Transformer A, and, over a fixed time period, the combined load from Customer meters 1 through 5 does not match with the Transformer A load over the same fixed time period, then the utility company will be alerted that there might be an issue. The discrepancy could result from a tree touching a wire, an improper connection to or disconnection from a meter after an outage or other maintenance. The discrepancy could be the result of theft. Regardless of the source of the discrepancy, due to the quasi real-time mapping resulting from the present invention, the utility company can be alerted to a potential issue at a remote location.



FIG. 4 is a flow diagram that illustrates an example of the process of mapping usage data from a plurality of utility usage nodes to one or more utility distribution nodes for embodiments of the invention. Referring to FIG. 4, at S1, utility usage data is collected at a collection device from the plurality of utility usage nodes at predetermined intervals, and at S2, utility distribution data is collected at the collection device from the utility distribution node at the predetermined intervals. At S3, it is determined, using a computer, which of the plurality of utility usage nodes is connected to the utility distribution node by comparing aggregate usage data from one or more of the plurality of utility usage nodes to distribution data from the utility distribution node during one or more of the same predetermined intervals.


It is to be understood that although the plurality of utility usage nodes and the utility distribution node for illustrative embodiments of the invention comprise, respectively, a plurality of electricity usage nodes consisting, for example, of a plurality of electricity usage meters, and an electricity distribution node, such as a transformer with a transformer load meter, the plurality of utility usage nodes and the utility distribution node may likewise comprise any other type of utility nodes such as water usage and distribution nodes or gas usage and distribution nodes. Further, the utility usage data may be collected from the plurality of electricity usage meters and the transformer load meter over a wireless network or over a wired network. In any event, a key aspect of embodiments of the invention is that the utility usage meters are time synchronized with one another and with the transformer load meter.


It is also to be understood that while the interval shown for the interval data in FIGS. 2 and 3 is three quarters of an hour, any other suitable interval as little as a few seconds up to several hours may be utilized for embodiments of the invention. Preferably, embodiments of the invention utilize a predetermined interval of at least one minute up to one hour. It is to be further noted that while the utility distribution node for illustrative embodiments of the invention comprises a transformer, the utility distribution node may likewise comprise, for example, a substation bank, a circuit breaker, a line capacitor, a circuit recloser, or a circuit switch.


Referring further to FIG. 4, when the comparison at S3 discloses that utility usage according to the aggregate usage data from all of the plurality of utility usage nodes is substantially equal to utility distribution according to the distribution data from the utility distribution node during the one or more same predetermined intervals, it is determined that all of the plurality of utility usage nodes are connected to the utility distribution node. On the other hand, when the comparison discloses that utility usage according to the aggregate usage data from all of the plurality of utility usage nodes is less than the utility distribution according to the distribution data from the utility distribution node during the same predetermined interval or intervals, it is determined that a condition of unallocated consumption exists for the utility distribution node.


As previously, noted, the condition of unallocated consumption can be attributed to a non-technical line loss (i.e. theft) or alternatively the condition of unallocated consumption can be attributed to the existence of one or more additional utility usage nodes connected to the distribution node. An aspect of embodiments of the invention involves identifying the additional node by comparing utility usage according to usage data from the additional utility usage node to an amount by which the utility usage according to the aggregate usage data from the plurality of utility usage nodes is less than the utility distribution according to the distribution data from the utility distribution node during the same predetermined interval or intervals.


Referring again to FIG. 4, when the comparison at S3 discloses that utility usage according to the aggregate usage data from all of the plurality of utility usage according to the aggregate usage data from all of the plurality of utility usage nodes exceeds the utility distribution according to the distribution data from the utility distribution node during one or more of the same predetermined intervals, a determination is made that less than all of the plurality of utility usage nodes are connected to the utility distribution node. Another aspect of embodiments of the invention involves identifying at least one of the plurality of utility usage nodes that is not connected to the utility distribution node by comparing utility usage according to usage data from that particular one of the plurality of utility usage nodes to an amount by which utility according to the aggregate usage data from all of the plurality of utility usage nodes exceeds utility distribution according to the distribution data from the utility distribution node during the same predetermined interval or intervals.


The knowledge of transformer load in conjunction with individual customer load data will facilitate connection decisions and changes when, for example, certain customers suddenly do have or are expected to have increased load requirements. The transformers have limited capacity and as the need or desire to use electric power increases, e.g., for electric cars, utility companies will need to rearrange connections to re-distribute loads and avoid outages or plan for transformer upgrades. Embodiments of the present invention provide a mapping and information solution that gives utility companies the ability to manage loads and equipment and to provide electric services more efficiently and effectively.


In a preferred embodiment, the present invention is implemented using data from wireless meters to pull back the interval data wirelessly from the customer meters as well as the transformer meters. These devices must have relatively accurate (better than a few minutes) time synchronization to enable accurate correlation of the interval data from the various meters. Identically assigned U.S. patent application Ser. No. 12/275,242 entitled “Collector Device and System Utilizing Standardized Utility Metering Protocol” details various exemplary embodiments for facilitating the pull or push of use data from or to meter nodes. The entirety of this application is incorporated herein by reference.


The simplified example described herein could be expanded in operation, wherein an algorithm implemented on an appropriate processor or processors takes into account the physical proximity of numerous meters to a particular transformer—for example looking at the 100 closest meters to a transformer—to determine which of those meters must be connected to the transformer to create the measured load profile (i.e., trying different combinations of the 100 closest meters until the closest match to the measured load profile is determined). This operation can be performed on demand or as part of a continuous monitoring process. The operation can be utilized as part of a baseline mapping process and/or as part of a mapping validation or map database updating process.


In a similar fashion, customer interval meter data that has been related to a transformer can be further aggregated by assumed phase connections of the transformers up to a common measurement point (i.e. substation bank, circuit breaker, line capacitor, circuit recloser, circuit switch, or any other phase connected device equipped with measurement equipment). For example, all of the customer interval meter data could be further aggregated and compared to the outflow from a substation to determine where gaps of losses may exist. The transformer loads and then the house meters should sum up to the electricity that leaves the substation and if not, a loss exists which can then be isolated. In this manner, the utility can diagnose where equipment may have been incorrectly connected (or reconnected after a storm restoration) to the distribution phase to which the load was originally allocated. By providing guidance, the utility field crews can more efficiently and effectively balance the phase loading of the circuit. A balanced distribution circuit then results in more efficient operation, lower system losses, and lower neutral current that may lead to stray voltage or “tingle” shock.


Finally, many utilities make regular movement of portions of the distribution circuit to other circuits, to other substations, and in some cases to other utilities by opening and closing switching points. With the afore described correlation of synchronized interval data for embodiments of the invention, utilities will use a common measurement point (i.e. substation bank, circuit breaker, line capacitor, circuit recloser, circuit switch, or any other phase-connected device equipped with measurement equipment) and the data from all meter points on the switched portion of a circuit to interpolate whether the portion of the circuit has been switched back, remains switched, or is shared between both circuits. Sharing the circuits may be unintentional and could lead to a catastrophic failure of equipment under certain circumstances and subject personnel to hazards if the system is assumed to be switched.


As data is aggregated higher into the utility system from meter up to substation, the fidelity of the analysis may become questionable. However, embodiments of the present invention, using assumptions and inputs from a multitude of devices as described on the distribution network, will provide the utility with guidance to make more informed decisions for the use of assets and personnel. Embodiments of the current invention enable a utility company to map power connections at the most basic level, i.e., pole or pad transformer. Embodiments of this invention will provide utilities with better knowledge of the assets within a geographic region between the substation to the meters.


The words “herein,” “above,” “below,” and words of similar import, when used in this application, shall refer to this application as a whole and not to any particular portions of this application. Where the context permits, words in the above detailed description using the singular or plural number may also include the plural or singular number respectively. The word “or,” in reference to a list of two or more items, covers all of the following interpretations of the word: any of the items in the list, all of the items in the list, and any combination of the items in the list.


The above detailed description of embodiments of the invention is not intended to be exhaustive or to limit the invention to the precise form disclosed above. While specific embodiments of, and examples for, the invention are described above for illustrative purposes, various equivalent modifications are possible within the scope of the invention, as those skilled in the relevant art will recognize. Further any specific numbers noted herein are only examples: alternative implementations may employ differing values or ranges. The teachings of the invention provided herein can be applied to other processes, devices and systems, not necessarily the processes, devices and systems described above. The elements and acts of the various embodiments described above can be combined to provide further embodiments.


While the above detailed description describes certain embodiments of the invention, and describes the best mode contemplated, no matter how detailed the above appears in text, the invention can be practiced in many ways. Details of the processes, devices and systems may vary considerably in their implementation details, while still being encompassed by the invention disclosed herein. As noted above, particular terminology used when describing certain features or aspects of the invention should not be taken to imply that the terminology is being redefined herein to be restricted to any specific characteristics, features, or aspects of the invention with which that terminology is associated. In general, the terms used in the following claims should not be construed to limit the invention to the specific embodiments disclosed in the specification, unless the above detailed description section explicitly defines such terms. Accordingly, the actual scope of the invention encompasses not only the disclosed embodiments, but also all equivalent ways of practicing or implementing the invention under the claims.

Claims
  • 1. A process for monitoring power distribution comprising: collecting, at a processor, utility usage data from a plurality of utility usage meters at predetermined time periods;collecting, at the processor, utility distribution data from a first utility distribution point at the predetermined time periods;determining, using the processor and geographic data indicating a location for each of the plurality of utility usage meters and a location of the first utility distribution point, a sub-set of the plurality of utility usage meters based on geographic proximity of each of the plurality of utility usage meters to the first utility distribution point; andmapping, using the processor, to determine which utility usage meters of the sub-set of the plurality of utility usage meters are connected to the first utility distribution point by comparing aggregate usage data collected during a given one or more of the predetermined time periods from one or more of the utility usage meters of the sub-set of the plurality of utility usage meters to distribution data collected during the same given one or more of the predetermined time periods from the first utility distribution point.
  • 2. The process of claim 1, wherein the predetermined time periods further comprise predetermined intervals of at least one minute.
  • 3. The process of claim 1, wherein the predetermined time periods further comprise predetermined intervals of up to one hour.
  • 4. The process of claim 1, wherein the predetermined time periods further comprise predetermined intervals of between at least one minute and up to one hour.
  • 5. The process of claim 1, wherein the plurality of individual usage meters further comprise a plurality of electricity usage meters.
  • 6. The process of claim 1, wherein the first distribution point is a transformer.
  • 7. The process of claim 6, wherein the second distribution point is a substation.
  • 8. The process of claim 1, wherein collecting, at the processor, the usage data from the plurality of individual usage meters occurs over a wireless network.
  • 9. The process according to claim 1, wherein mapping by the process comprises: aggregating by the processor load data for each of the mapped usage meters during the given one or more of the predetermined time periods;comparing by the processor aggregated load data for each of the mapped utility usage meters to a power output from a second distribution point during the same given one or more of the predetermined time periods; anddetermining by the processor if the aggregated load data is approximately equal to the power output.
  • 10. The process according to claim 9, further comprising: determining by the processor that the aggregated load data is less than the power output;comparing by the processor the first distribution point data to the power output at the given one or more of the predetermined time periods; andisolating a power loss to between the first distribution point and the mapped usage meters if it is determined by the processor that the first distribution load data is approximately equal to the power output.
  • 11. The process according to claim 9, further including: collecting, at the processor, first distribution point data for each of a first, second and third distribution phase of the first distribution point at the predetermined time periods; andmapping, by the processor, to determine which of the plurality of individual usage meters is connected to each of the first, second and third distribution phases by comparing aggregate usage data collected during a given one or more of the predetermined time periods from one or more of the plurality of individual usage meters to distribution point load data collected during the same given one or more of the predetermined time periods for each of the first, second and third distribution phases.
  • 12. A non-transitory computer-readable storage medium with an executable program stored therein, wherein the program instructs a microprocessor to perform the following steps: map each of a plurality of individual usage meters to one of a first, second and third distribution phase of a first distribution point using usage meter load data and first distribution point data;aggregate load data for each of the mapped usage meters during a predetermined time period;compare aggregated load data for each of the mapped usage meters to a power output from a second distribution point during the predetermined time period; anddetermine if the aggregated load data is approximately equal to the power output.
  • 13. The non-transitory computer-readable storage medium according to claim 11, further comprising: determine the aggregated load data is less than the power output; compare the first distribution point data to the power output at the predetermined time period; andindicate power loss is between the first distribution point and the mapped usage meters if it is determined by the processor that the first distribution load data is approximately equal to the power output.
  • 14. The non-transitory computer-readable storage medium according to claim 12, further comprising: collect usage data from the plurality of individual usage meters at a given one or more predetermined time periods;collect first distribution point data for each of the first, second and third distribution phases at the same given one or more predetermined time periods; anddetermine, which of the plurality of individual usage meters is connected to each of the first, second and third distribution phases by comparing aggregate usage data from one or more of the plurality of individual usage meters to distribution point load data for each of the first, second and third distribution phases during at least one of the same given one or more predetermined time periods.
  • 15. A process for monitoring power distribution comprising: receiving by a processor individual usage meter load data collected during a plurality of predetermined time periods from multiple individual usage meters over a wireless network;receiving by a processor distribution point data collected during the plurality of predetermined time periods from multiple distribution points; andmapping by a processor each of the multiple individual usage meters to one of the multiple distribution points using the received individual usage meter load data and the distribution point data collected during the predetermined time periods.
  • 16. The process according to claim 15, wherein mapping by the process comprises: comparing aggregate individual usage meter data collected during a given one or more of the predetermined time periods from one or more of the multiple individual usage meters to distribution point load data collected during the same given one or more of the predetermined time periods for each of the multiple distribution points.
  • 17. The process according to claim 15, wherein the multiple distribution points are transformers.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 12/721,948, filed Mar. 11, 2010, entitled “PROCESS, DEVICE AND SYSTEM FOR MAPPING TRANSFORMERS TO METERS AND LOCATING NON-TECHNICAL LINE LOSSES,” which claims priority to U.S. Provisional Application No. 61/159,202, filed Mar. 11, 2009, entitled “PROCESS FOR MAPPING TRANSFORMERS TO METERS AND LOCATING NON-TECHNICAL LINE LOSSES,” both of which are incorporated herein by reference in their entirety. This application hereby references and incorporates by reference in its entirety U.S. patent application Ser. No. 12/275,242 entitled “COLLECTOR DEVICE AND SYSTEM UTILIZING STANDARDIZED UTILITY METERING PROTOCOL.”

US Referenced Citations (530)
Number Name Date Kind
4132981 White Jan 1979 A
4190800 Kelly, Jr. et al. Feb 1980 A
4204195 Bogacki May 1980 A
4254472 Juengel et al. Mar 1981 A
4322842 Martinez Mar 1982 A
4396915 Farnsworth et al. Aug 1983 A
4425628 Bedard et al. Jan 1984 A
4638314 Keller Jan 1987 A
4644320 Carr et al. Feb 1987 A
4749992 Fitzmeyer et al. Jun 1988 A
4792946 Mayo Dec 1988 A
4939726 Flammer et al. Jul 1990 A
5007052 Flammer Apr 1991 A
5056107 Johnson et al. Oct 1991 A
5077753 Grau, Jr. et al. Dec 1991 A
5079768 Flammer Jan 1992 A
5115433 Baran et al. May 1992 A
5117422 Hauptschein et al. May 1992 A
5130987 Flammer Jul 1992 A
5138615 Lamport et al. Aug 1992 A
5159592 Perkins Oct 1992 A
5216623 Barrett et al. Jun 1993 A
5276680 Messenger Jan 1994 A
5311581 Merriam et al. May 1994 A
5400338 Flammer, III et al. Mar 1995 A
5430729 Rahnema Jul 1995 A
5432507 Mussino et al. Jul 1995 A
5453977 Flammer, III et al. Sep 1995 A
5459727 Vannucci Oct 1995 A
5463777 Bialkowski et al. Oct 1995 A
5465398 Flammer Nov 1995 A
5467345 Cutter, Jr. et al. Nov 1995 A
5471469 Flammer, III et al. Nov 1995 A
5479400 Dilworth et al. Dec 1995 A
5488608 Flammer, III Jan 1996 A
5515369 Flammer, III et al. May 1996 A
5515509 Rom May 1996 A
5528507 McNamara et al. Jun 1996 A
5544036 Brown, Jr. et al. Aug 1996 A
5553094 Johnson et al. Sep 1996 A
5570084 Retter et al. Oct 1996 A
5572528 Shuen Nov 1996 A
5596722 Rahnema Jan 1997 A
5608721 Natarajan et al. Mar 1997 A
5608780 Gerszberg et al. Mar 1997 A
5623495 Eng et al. Apr 1997 A
5659300 Dresselhuys et al. Aug 1997 A
5673252 Johnson et al. Sep 1997 A
5696501 Ouellette et al. Dec 1997 A
5717718 Rowsell et al. Feb 1998 A
5719564 Sears Feb 1998 A
5726644 Jednacz et al. Mar 1998 A
5727057 Emery et al. Mar 1998 A
5737318 Melnik Apr 1998 A
5740366 Mahany et al. Apr 1998 A
5748104 Argyroudis et al. May 1998 A
5757783 Eng et al. May 1998 A
5758331 Johnson May 1998 A
5761083 Brown, Jr. et al. Jun 1998 A
5767790 Jovellana Jun 1998 A
5774660 Brendel et al. Jun 1998 A
5812531 Cheung et al. Sep 1998 A
5822309 Ayanoglu et al. Oct 1998 A
5844893 Gollnick et al. Dec 1998 A
5874903 Shuey et al. Feb 1999 A
5880677 Lestician Mar 1999 A
5892758 Argyroudis Apr 1999 A
5894422 Chasek Apr 1999 A
5896097 Cardozo Apr 1999 A
5898387 Davis et al. Apr 1999 A
5898826 Pierce et al. Apr 1999 A
5901067 Kao et al. May 1999 A
5903566 Flammer, III May 1999 A
5914672 Glorioso et al. Jun 1999 A
5914673 Jennings et al. Jun 1999 A
5920697 Masters et al. Jul 1999 A
5926531 Petite Jul 1999 A
5933092 Ouellette et al. Aug 1999 A
5953371 Rowsell et al. Sep 1999 A
5963146 Johnson et al. Oct 1999 A
5963457 Kanoi et al. Oct 1999 A
5974236 Sherman Oct 1999 A
5986574 Colton Nov 1999 A
5987011 Toh Nov 1999 A
5991806 McHann, Jr. Nov 1999 A
6014089 Tracy et al. Jan 2000 A
6018659 Ayyagari et al. Jan 2000 A
6026133 Sokoler Feb 2000 A
6028522 Petite Feb 2000 A
6044062 Brownrigg et al. Mar 2000 A
6058355 Ahmed et al. May 2000 A
6061609 Kanoi et al. May 2000 A
6073169 Shuey et al. Jun 2000 A
6075777 Agrawal et al. Jun 2000 A
6078785 Bush Jun 2000 A
6084867 Meier Jul 2000 A
6088659 Kelley et al. Jul 2000 A
6097703 Larsen et al. Aug 2000 A
6108699 Moiin Aug 2000 A
6118269 Davis Sep 2000 A
6122603 Budike, Jr. Sep 2000 A
6124806 Cunningham et al. Sep 2000 A
6134587 Okanoue Oct 2000 A
6137423 Glorioso et al. Oct 2000 A
6150955 Tracy et al. Nov 2000 A
6169979 Johnson Jan 2001 B1
6172616 Johnson et al. Jan 2001 B1
6195018 Ragle et al. Feb 2001 B1
6218953 Petite Apr 2001 B1
6233327 Petite May 2001 B1
6239722 Colten et al. May 2001 B1
6240080 Okanoue et al. May 2001 B1
6246677 Nap et al. Jun 2001 B1
6246689 Shavitt Jun 2001 B1
6249516 Brownrigg et al. Jun 2001 B1
6298053 Flammer, III et al. Oct 2001 B1
6300881 Yee et al. Oct 2001 B1
6304556 Haas Oct 2001 B1
6311105 Budike, Jr. Oct 2001 B1
6338087 Okanoue Jan 2002 B1
6362745 Davis Mar 2002 B1
6363057 Ardalan et al. Mar 2002 B1
6366217 Cunningham et al. Apr 2002 B1
6369719 Tracy et al. Apr 2002 B1
6369769 Nap et al. Apr 2002 B1
6373399 Johnson et al. Apr 2002 B1
6396839 Ardalan et al. May 2002 B1
6400949 Bielefeld et al. Jun 2002 B1
6407991 Meier Jun 2002 B1
6415330 Okanoue Jul 2002 B1
6430268 Petite Aug 2002 B1
6437692 Petite et al. Aug 2002 B1
6457054 Bakshi Sep 2002 B1
6480497 Flammer, III et al. Nov 2002 B1
6480505 Johansson et al. Nov 2002 B1
6492910 Ragle et al. Dec 2002 B1
6509841 Colton et al. Jan 2003 B1
6522974 Sitton Feb 2003 B2
6535498 Larsson et al. Mar 2003 B1
6538577 Ehrke et al. Mar 2003 B1
6553355 Arnoux et al. Apr 2003 B1
6577671 Vimpari Jun 2003 B1
6606708 Devine et al. Aug 2003 B1
6618578 Petite Sep 2003 B1
6618772 Kao et al. Sep 2003 B1
6628764 Petite Sep 2003 B1
6633823 Bartone et al. Oct 2003 B2
6636894 Short et al. Oct 2003 B1
6650249 Meyer et al. Nov 2003 B2
6653945 Johnson et al. Nov 2003 B2
6657552 Belski et al. Dec 2003 B2
6665620 Burns et al. Dec 2003 B1
6671635 Forth et al. Dec 2003 B1
6681110 Crookham et al. Jan 2004 B1
6681154 Nierlich et al. Jan 2004 B2
6684245 Shuey et al. Jan 2004 B1
6691173 Morris et al. Feb 2004 B2
6697331 Riihinen et al. Feb 2004 B1
6710721 Holowick Mar 2004 B1
6711166 Amir et al. Mar 2004 B1
6711409 Zavgren, Jr. et al. Mar 2004 B1
6714787 Reed et al. Mar 2004 B2
6718137 Chin Apr 2004 B1
6725281 Zintel et al. Apr 2004 B1
6728514 Bandeira et al. Apr 2004 B2
6747557 Petite et al. Jun 2004 B1
6747981 Ardalan et al. Jun 2004 B2
6751445 Kasperkovitz et al. Jun 2004 B2
6751455 Acampora Jun 2004 B1
6751672 Khalil et al. Jun 2004 B1
6772052 Amundsen et al. Aug 2004 B1
6775258 van Valkenburg et al. Aug 2004 B1
6778099 Meyer et al. Aug 2004 B1
6785592 Smith et al. Aug 2004 B1
6798352 Holowick Sep 2004 B2
6801865 Gilgenbach et al. Oct 2004 B2
6826620 Mawhinney et al. Nov 2004 B1
6829216 Nakata Dec 2004 B1
6829347 Odiaka Dec 2004 B1
6831921 Higgins Dec 2004 B2
6836737 Petite et al. Dec 2004 B2
6839775 Kao et al. Jan 2005 B1
6842706 Baraty Jan 2005 B1
6845091 Ogier et al. Jan 2005 B2
6859186 Lizalek et al. Feb 2005 B2
6865185 Patel et al. Mar 2005 B1
6885309 Van Heteren Apr 2005 B1
6891838 Petite et al. May 2005 B1
6900738 Crichlow May 2005 B2
6904025 Madour et al. Jun 2005 B1
6904385 Budike, Jr. Jun 2005 B1
6909705 Lee et al. Jun 2005 B1
6914533 Petite Jul 2005 B2
6914893 Petite Jul 2005 B2
6946972 Mueller et al. Sep 2005 B2
6954814 Leach Oct 2005 B1
6963285 Fischer et al. Nov 2005 B2
6967452 Aiso et al. Nov 2005 B2
6970434 Mahany et al. Nov 2005 B1
6970771 Preiss et al. Nov 2005 B1
6975613 Johansson Dec 2005 B1
6980973 Karpenko Dec 2005 B1
6982651 Fischer Jan 2006 B2
6985087 Soliman Jan 2006 B2
6995666 Luttrell Feb 2006 B1
6999441 Flammer, III et al. Feb 2006 B2
7009379 Ramirez Mar 2006 B2
7009493 Howard et al. Mar 2006 B2
7010363 Donnelly et al. Mar 2006 B2
7016336 Sorensen Mar 2006 B2
7020701 Gelvin et al. Mar 2006 B1
7042368 Patterson et al. May 2006 B2
7046682 Carpenter et al. May 2006 B2
7053767 Petite et al. May 2006 B2
7054271 Brownrigg et al. May 2006 B2
7062361 Lane Jun 2006 B1
7064679 Ehrke et al. Jun 2006 B2
7072945 Nieminen et al. Jul 2006 B1
7079810 Petite et al. Jul 2006 B2
7089089 Cumming et al. Aug 2006 B2
7102533 Kim Sep 2006 B2
7103511 Petite Sep 2006 B2
7106044 Lee, Jr. et al. Sep 2006 B1
7119713 Shuey et al. Oct 2006 B2
7126494 Ardalan et al. Oct 2006 B2
7135850 Ramirez Nov 2006 B2
7135956 Bartone et al. Nov 2006 B2
7137550 Petite Nov 2006 B1
7143204 Kao et al. Nov 2006 B1
7145474 Shuey et al. Dec 2006 B2
7170425 Christopher et al. Jan 2007 B2
7185131 Leach Feb 2007 B2
7188003 Ransom et al. Mar 2007 B2
7197046 Hariharasubrahmanian Mar 2007 B1
7200633 Sekiguchi et al. Apr 2007 B2
7209840 Petite et al. Apr 2007 B2
7215926 Corbett et al. May 2007 B2
7222111 Budike, Jr. May 2007 B1
7230544 Van Heteren Jun 2007 B2
7231482 Leach Jun 2007 B2
7248181 Patterson et al. Jul 2007 B2
7248861 Lazaridis et al. Jul 2007 B2
7250874 Mueller et al. Jul 2007 B2
7251570 Hancock et al. Jul 2007 B2
7263073 Petite et al. Aug 2007 B2
7271735 Rogai Sep 2007 B2
7274305 Luttrell Sep 2007 B1
7274975 Miller Sep 2007 B2
7277027 Ehrke et al. Oct 2007 B2
7277967 Kao et al. Oct 2007 B2
7289887 Rodgers Oct 2007 B2
7295128 Petite Nov 2007 B2
7301476 Shuey et al. Nov 2007 B2
7304587 Boaz Dec 2007 B2
7308370 Mason, Jr. et al. Dec 2007 B2
7312721 Mason, Jr. et al. Dec 2007 B2
7315257 Patterson et al. Jan 2008 B2
7317404 Cumeralto et al. Jan 2008 B2
7321316 Hancock et al. Jan 2008 B2
7324453 Wu et al. Jan 2008 B2
7327998 Kumar et al. Feb 2008 B2
7346463 Petite et al. Mar 2008 B2
7348769 Ramirez Mar 2008 B2
7349766 Rodgers Mar 2008 B2
7362709 Hui et al. Apr 2008 B1
7366113 Chandra et al. Apr 2008 B1
7379981 Elliott et al. May 2008 B2
7397907 Petite Jul 2008 B2
7406298 Luglio et al. Jul 2008 B2
7411964 Suemura Aug 2008 B2
7427927 Borleske et al. Sep 2008 B2
7444640 Partanen Oct 2008 B2
6249516 Brownrigg et al. Nov 2008 C1
7451019 Rodgers Nov 2008 B2
7457273 Nakanishi et al. Nov 2008 B2
7468661 Petite et al. Dec 2008 B2
7487282 Leach Feb 2009 B2
7495578 Borleske Feb 2009 B2
7498873 Opshaug et al. Mar 2009 B2
7505453 Carpenter et al. Mar 2009 B2
7512234 McDonnell et al. Mar 2009 B2
7515571 Kwon et al. Apr 2009 B2
7516106 Ehlers et al. Apr 2009 B2
7522540 Maufer Apr 2009 B1
7522639 Katz Apr 2009 B1
7539151 Demirhan et al. May 2009 B2
7545285 Shuey et al. Jun 2009 B2
7548826 Witter et al. Jun 2009 B2
7548907 Wall et al. Jun 2009 B2
7554941 Ratiu et al. Jun 2009 B2
7562024 Brooks et al. Jul 2009 B2
7586420 Fischer et al. Sep 2009 B2
7599665 Sinivaara Oct 2009 B2
7602747 Maksymczuk et al. Oct 2009 B2
7609673 Bergenlid et al. Oct 2009 B2
7613147 Bergenlid et al. Nov 2009 B2
7623043 Mizra et al. Nov 2009 B2
7626967 Yarvis et al. Dec 2009 B2
7650425 Davis et al. Jan 2010 B2
7676231 Demirhan et al. Mar 2010 B2
7680041 Johansen Mar 2010 B2
7729496 Hacigumus Jun 2010 B2
7756538 Bonta et al. Jul 2010 B2
7814322 Gurevich et al. Oct 2010 B2
7847706 Ross et al. Dec 2010 B1
8140667 Keyghobad et al. Mar 2012 B2
8966069 Vaswani et al. Feb 2015 B2
20010005368 Rune Jun 2001 A1
20010038342 Foote Nov 2001 A1
20010046879 Schramm et al. Nov 2001 A1
20020012358 Sato Jan 2002 A1
20020013679 Petite Jan 2002 A1
20020031101 Petite et al. Mar 2002 A1
20020066095 Yu May 2002 A1
20020110118 Foley Aug 2002 A1
20020120569 Day Aug 2002 A1
20020174354 Bel et al. Nov 2002 A1
20020186619 Reeves et al. Dec 2002 A1
20030001640 Lao et al. Jan 2003 A1
20030001754 Johnson et al. Jan 2003 A1
20030033394 Stine Feb 2003 A1
20030037268 Kistler Feb 2003 A1
20030050737 Osann Mar 2003 A1
20030112822 Hong et al. Jun 2003 A1
20030117966 Chen Jun 2003 A1
20030122686 Ehrke et al. Jul 2003 A1
20030123481 Neale et al. Jul 2003 A1
20030156715 Reeds, III et al. Aug 2003 A1
20030158677 Swarztrauber et al. Aug 2003 A1
20030163224 Klaar et al. Aug 2003 A1
20030229900 Reisman Dec 2003 A1
20030233201 Horst et al. Dec 2003 A1
20040008663 Srikrishna et al. Jan 2004 A1
20040031030 Kidder et al. Feb 2004 A1
20040034773 Balabine et al. Feb 2004 A1
20040056775 Crookham et al. Mar 2004 A1
20040066310 Ehrke et al. Apr 2004 A1
20040077341 Chandranmenon et al. Apr 2004 A1
20040082203 Logvinov et al. Apr 2004 A1
20040100953 Chen et al. May 2004 A1
20040113810 Mason, Jr. et al. Jun 2004 A1
20040117788 Karaoguz et al. Jun 2004 A1
20040125776 Haugli et al. Jul 2004 A1
20040138787 Ransom et al. Jul 2004 A1
20040140908 Gladwin et al. Jul 2004 A1
20040157613 Steer et al. Aug 2004 A1
20040183687 Petite et al. Sep 2004 A1
20040185845 Abhishek et al. Sep 2004 A1
20040210544 Shuey et al. Oct 2004 A1
20050026569 Lim et al. Feb 2005 A1
20050027859 Alvisi et al. Feb 2005 A1
20050030968 Rich et al. Feb 2005 A1
20050033967 Morino et al. Feb 2005 A1
20050055432 Rodgers Mar 2005 A1
20050058144 Ayyagari et al. Mar 2005 A1
20050065742 Rodgers Mar 2005 A1
20050122944 Kwon et al. Jun 2005 A1
20050136972 Smith et al. Jun 2005 A1
20050172024 Cheifot et al. Aug 2005 A1
20050201397 Petite Sep 2005 A1
20050243867 Petite Nov 2005 A1
20050251403 Shuey Nov 2005 A1
20050257215 Denby et al. Nov 2005 A1
20050270173 Boaz Dec 2005 A1
20050276243 Sugaya et al. Dec 2005 A1
20050286440 Strutt et al. Dec 2005 A1
20060028355 Patterson et al. Feb 2006 A1
20060044117 Farkas et al. Mar 2006 A1
20060055432 Shimokawa et al. Mar 2006 A1
20060056363 Ratiu et al. Mar 2006 A1
20060056368 Ratiu et al. Mar 2006 A1
20060077906 Maegawa et al. Apr 2006 A1
20060087993 Sengupta et al. Apr 2006 A1
20060098576 Brownrigg et al. May 2006 A1
20060098604 Flammer, III et al. May 2006 A1
20060111111 Ovadia May 2006 A1
20060140135 Bonta et al. Jun 2006 A1
20060146717 Conner et al. Jul 2006 A1
20060158347 Roche et al. Jul 2006 A1
20060161310 Lal Jul 2006 A1
20060167784 Hoffberg Jul 2006 A1
20060184288 Rodgers Aug 2006 A1
20060215583 Castagnoli Sep 2006 A1
20060215673 Olvera-Hernandez Sep 2006 A1
20060217936 Mason et al. Sep 2006 A1
20060230276 Nochta Oct 2006 A1
20060271244 Cumming et al. Nov 2006 A1
20060271678 Jessup et al. Nov 2006 A1
20070001868 Boaz Jan 2007 A1
20070013547 Boaz Jan 2007 A1
20070014313 Bickel et al. Jan 2007 A1
20070019598 Prehofer Jan 2007 A1
20070036353 Reznik et al. Feb 2007 A1
20070057767 Sun et al. Mar 2007 A1
20070060147 Shin et al. Mar 2007 A1
20070063868 Borleske Mar 2007 A1
20070085700 Walters et al. Apr 2007 A1
20070087756 Hoffberg Apr 2007 A1
20070103324 Kosuge et al. May 2007 A1
20070109121 Cohen May 2007 A1
20070110024 Meier May 2007 A1
20070120705 Kiiskila et al. May 2007 A1
20070136817 Nguyen Jun 2007 A1
20070139220 Mirza et al. Jun 2007 A1
20070143046 Budike, Jr. Jun 2007 A1
20070147268 Kelley et al. Jun 2007 A1
20070169074 Koo et al. Jul 2007 A1
20070169075 Lill et al. Jul 2007 A1
20070169080 Friedman Jul 2007 A1
20070177538 Christensen et al. Aug 2007 A1
20070177576 Johansen et al. Aug 2007 A1
20070177613 Shorty et al. Aug 2007 A1
20070189249 Gurevich et al. Aug 2007 A1
20070200729 Borleske et al. Aug 2007 A1
20070201504 Christensen et al. Aug 2007 A1
20070204009 Shorty et al. Aug 2007 A1
20070205915 Shuey et al. Sep 2007 A1
20070206503 Gong et al. Sep 2007 A1
20070206521 Osaje Sep 2007 A1
20070207811 Das et al. Sep 2007 A1
20070210933 Leach Sep 2007 A1
20070211636 Bellur et al. Sep 2007 A1
20070239477 Budike, Jr. Oct 2007 A1
20070248047 Shorty et al. Oct 2007 A1
20070257813 Vaswani et al. Nov 2007 A1
20070258508 Werb et al. Nov 2007 A1
20070263647 Shorty et al. Nov 2007 A1
20070265947 Schimpf et al. Nov 2007 A1
20070266429 Ginter et al. Nov 2007 A1
20070271006 Golden et al. Nov 2007 A1
20070276547 Miller Nov 2007 A1
20080018492 Ehrke et al. Jan 2008 A1
20080024320 Ehrke et al. Jan 2008 A1
20080031145 Ethier et al. Feb 2008 A1
20080032703 Krumm et al. Feb 2008 A1
20080037569 Werb et al. Feb 2008 A1
20080042874 Rogai Feb 2008 A1
20080046388 Budike, Jr. Feb 2008 A1
20080048883 Boaz Feb 2008 A1
20080051036 Vaswani et al. Feb 2008 A1
20080063205 Braskich et al. Mar 2008 A1
20080068217 Van Wyk et al. Mar 2008 A1
20080068994 Garrison et al. Mar 2008 A1
20080068996 Clave et al. Mar 2008 A1
20080086560 Monier et al. Apr 2008 A1
20080089314 Meyer et al. Apr 2008 A1
20080095221 Picard Apr 2008 A1
20080097782 Budike, Jr. Apr 2008 A1
20080107034 Jetcheva et al. May 2008 A1
20080117110 Luglio et al. May 2008 A1
20080129538 Vaswani et al. Jun 2008 A1
20080130535 Shorty et al. Jun 2008 A1
20080130562 Shorty et al. Jun 2008 A1
20080132185 Elliott et al. Jun 2008 A1
20080136667 Vaswani et al. Jun 2008 A1
20080151795 Shorty et al. Jun 2008 A1
20080151824 Shorty et al. Jun 2008 A1
20080151825 Shorty et al. Jun 2008 A1
20080151826 Shorty et al. Jun 2008 A1
20080151827 Shorty et al. Jun 2008 A1
20080154396 Shorty et al. Jun 2008 A1
20080159213 Shorty et al. Jul 2008 A1
20080165712 Shorty et al. Jul 2008 A1
20080170511 Shorty et al. Jul 2008 A1
20080177678 Di Martini et al. Jul 2008 A1
20080180274 Cumeralto et al. Jul 2008 A1
20080181133 Thubert et al. Jul 2008 A1
20080183339 Vaswani et al. Jul 2008 A1
20080186202 Vaswani et al. Aug 2008 A1
20080186203 Vaswani et al. Aug 2008 A1
20080187001 Vaswani et al. Aug 2008 A1
20080187116 Reeves et al. Aug 2008 A1
20080189415 Vaswani et al. Aug 2008 A1
20080189436 Vaswani et al. Aug 2008 A1
20080204272 Ehrke et al. Aug 2008 A1
20080205355 Liu et al. Aug 2008 A1
20080224891 Ehrke et al. Sep 2008 A1
20080225737 Gong et al. Sep 2008 A1
20080238714 Ehrke et al. Oct 2008 A1
20080238716 Ehrke et al. Oct 2008 A1
20080272934 Wang et al. Nov 2008 A1
20080310311 Flammer et al. Dec 2008 A1
20080310377 Flammer et al. Dec 2008 A1
20080317047 Zeng et al. Dec 2008 A1
20090003214 Vaswani et al. Jan 2009 A1
20090003232 Vaswani et al. Jan 2009 A1
20090003243 Vaswani et al. Jan 2009 A1
20090003356 Vaswani et al. Jan 2009 A1
20090010178 Tekippe Jan 2009 A1
20090034418 Flammer, III et al. Feb 2009 A1
20090034419 Flammer, III et al. Feb 2009 A1
20090034432 Bonta et al. Feb 2009 A1
20090043911 Flammer et al. Feb 2009 A1
20090046732 Pratt, Jr. et al. Feb 2009 A1
20090055032 Rodgers Feb 2009 A1
20090068947 Petite Mar 2009 A1
20090077405 Johansen Mar 2009 A1
20090079584 Grady et al. Mar 2009 A1
20090082888 Johansen Mar 2009 A1
20090096605 Petite et al. Apr 2009 A1
20090102737 Birnbaum et al. Apr 2009 A1
20090115626 Vaswani et al. May 2009 A1
20090134969 Veillette May 2009 A1
20090135716 Veillette May 2009 A1
20090135843 Veillette May 2009 A1
20090161594 Zhu et al. Jun 2009 A1
20090167547 Gilbert Jul 2009 A1
20090168846 Filippo, III et al. Jul 2009 A1
20090175238 Jetcheva et al. Jul 2009 A1
20090179771 Seal et al. Jul 2009 A1
20090235246 Seal et al. Sep 2009 A1
20090243840 Petite et al. Oct 2009 A1
20090245270 van Greunen et al. Oct 2009 A1
20090262642 van Greunen et al. Oct 2009 A1
20090267792 Crichlow Oct 2009 A1
20090285124 Aguirre et al. Nov 2009 A1
20090303972 Flammer, III et al. Dec 2009 A1
20090315699 Satish et al. Dec 2009 A1
20090319672 Reisman Dec 2009 A1
20090320073 Reisman Dec 2009 A1
20100037069 Deierling et al. Feb 2010 A1
20100037293 St. Johns et al. Feb 2010 A1
20100040042 van Greunen et al. Feb 2010 A1
20100060259 Vaswani et al. Mar 2010 A1
20100061350 Flammer, III Mar 2010 A1
20100073193 Flammer, III Mar 2010 A1
20100074176 Flammer, III et al. Mar 2010 A1
20100074304 Flammer, III Mar 2010 A1
20110176433 Monogioudis Jul 2011 A1
20120221278 Cook Aug 2012 A1
Foreign Referenced Citations (23)
Number Date Country
0 578 041 Nov 1999 EP
0 663 746 Jan 2003 EP
0 812 502 Aug 2004 EP
0 740 873 Dec 2005 EP
10-070774 Mar 1998 JP
10-135965 May 1998 JP
WO 9512942 May 1995 WO
WO 9610307 Apr 1996 WO
WO 9610307 Apr 1996 WO
WO 0054237 Sep 2000 WO
WO 0126334 Apr 2001 WO
WO 0155865 Aug 2001 WO
WO 03015452 Feb 2003 WO
WO 2005091303 Sep 2005 WO
WO 2006059195 Jun 2006 WO
WO 2007015822 Aug 2007 WO
WO 2007132473 Nov 2007 WO
WO 2008027457 Mar 2008 WO
WO 2008033287 Mar 2008 WO
WO 2008033514 Mar 2008 WO
WO 2008038072 Apr 2008 WO
WO 2008092268 Aug 2008 WO
WO 2009067251 May 2009 WO
Non-Patent Literature Citations (118)
Entry
Hydro One Networks, Inc., Request for Proposal for Smart Metering Services, 16 pp., Mar. 4, 2005.
Trilliant Networks, “The Trilliant AMI Solution,” RFP SCP-07003, 50 pp., Mar. 22, 2007.
“ZigBee Smart Energy Profile Specification,” ZigBee Profile 0x0109, Revision 14, Document 075356r14, 202 pp., May 29, 2008.
Hubaux, J. P., et al. “Towards Mobile Ad-Hoc WANs: Terminodes,” 2000 IEEE, Wireless Communications and Networking Conference, WCNC, vol. 3, pp. 1052-1059, 2000.
Miklos, G., et al., “Performance Aspects of Bluetooth Scatternet Formation,” First Annual Workshop on Mobile and Ad Hoc Networking and Computing, MobiHOC 2000, pp. 147-148, 2000.
Eng, K. Y., et al. “BAHAMA: A Broadband Ad-Hoc Wireless ATM Local-Area Network,” 1995 IEEE International Conference on Communications, ICC '95 Seattle, ‘Gateway to Globalization’, vol. 2, pp. 1216-1223, Jun. 18-22, 1995.
Lee, David J. Y., “Ricocheting Bluetooth,” 2nd International Conference on Microwave and Millimeter Wave Technology Proceedings, ICMMT 2000, pp. 432-435, 2000.
Lilja, Tore, “Mobile Energy Supervision,” Twenty-second International Telecommunications Energy Conference, 2000 INTELEC, pp. 707-712, 2000.
Parkka, Juha, et al., “A Wireless Wellness Monitor for Personal Weight Management,” Proceedings of the 2000 IEEE EMBS International Conference on Information Technology Applications in Biomedicine, pp. 83-88, 2000.
Broch, J., et al., “Supporting Hierarchy and Heterogeneous Interfaces in Multi-Hop Wireless Ad Hoc Networks,” Proceedings of the Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN '99), pp. 370-375 (7 pp. with Abstract), Jun. 23-25, 1999.
Privat, G., “A System-Architecture Viewpoint on Smart Networked Devices,” Microelectronic Engineering, vol. 54, Nos. 1-2, pp. 193-197, Dec. 2000.
Jonsson, U., et al., “MIPMANET-Mobile IP for Mobile Ad Hoc Networks,” MobiHOC 2000, First Annual Workshop on Mobile and Ad Hoc Networking and Computing, pp. 75-85 (12 pp. with Abstract), 2000.
Kapoor, R., et al., “Multimedia Support Over Bluetooth Piconets,” First Workshop on Wireless Mobile Internet, pp. 50-55, Jul. 2001.
Sung-Yuan, K., “The Embedded Bluetooth CCD Camera,” TENCON, Proceedings of the IEEE Region 10 International Conference on Electrical and Electronic Technology, vol. 1, pp. 81-84 (5 pp. with Abstract), Aug. 19-22, 2001.
Lim, A., “Distributed Services for Information Dissemination in Self-Organizing Sensor Networks,” Journal of the Franklin Institute, vol. 338, No. 6, pp. 707-727, Sep. 2001.
Meguerdichian, S., et al., “Localized Algorithms in Wireless Ad-Hoc Networks: Location Discovery and Sensor Exposure,” ACM Symposium on Mobile Ad Hoc Networking & Computing, MobiHOC 2001, pp. 106-116, Oct. 2001.
Lilakiatsakun, W., et al. “Wireless Home Networks Based on a Hierarchical Bluetooth Scatternet Architecture,” Proceedings of the Ninth IEEE International Conference on Networks, pp. 481-485 (6 pp. with Abstract), Oct. 2001.
Jha, S., et al., “Universal Network of Small Wireless Operators (UNSWo),” Proceedings of the First IEEE/ACM International Symposium on Cluster Computing and the Grid, pp. 626-631 (7 pp. with Abstract), 2001.
“AMRON Technologies Successfully Deploys Advanced Metering Solution for C&I Customers Using Bluetooth” [online], Sep. 2, 2004 [retrieved on Jan. 2, 2009], 3 pp., Retrieved from the Internet: http://www.techweb.com/showpressrelease?articleId=X234101&CompanyId=3.
Utility Intelligence, “Exclusive Distributors of Dynamic Virtual Metering” [online], Copyright 2004-2005 [retrieved on May 12, 2005], Retrieved from the Internet: http://www.empoweringutilities.com/hardware.html, 29 pp.
“AMRON Meter Management System” [online], [retrieved on May 12, 2005], 41 pp., Retrieved from the Internet: http://www.amronm5.com/products/.
U.S. Appl. No. 90/008,011, filed Jul. 24, 2006, 75 pp.
Broch, Josh, et al., “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proceedings of the Fourth Annual ACM/IEEE International Conference in Mobile Computing and Networking (MobiCom '98), Dallas, Texas, 13 pp., Oct. 25-30, 1998.
Broch, Josh, et al., “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks” [online], Mar. 13, 1998 [retrieved on Feb. 24, 2009], 31 pp., Retrieved from the Internet: http://tools.ietf.org/draft-ietf-manet-dsr-00.txt.
Katz, Randy H. and Brewer, Eric A., “The Case for Wireless Overlay Networks,” Electrical Engineering and Computer Science Department, University of California, Berkeley, 12 pp., 1996.
Johnson, David B., “Routing in Ad Hoc Networks of Mobile Hosts,” IEEE, pp. 158-163, 1995.
Nachum Shacham, Edwin B. Brownrigg, & Clifford A. Lynch, A Packet Radio Network for Library Automation, 1987 IEEE Military Communications Conference, vol. 2 at 21.3.1, (Oct. 1987).
Nachum Shacham & Janet D. Tornow, Future Directions in Packet Radio Technology, Proc. of the IEEE Infocom 1985 at 93 (Mar. 1985). 17 pp.
John Jubin & Janet D. Tornow, The DARPA Packet Radio Network Protocols, Proc. of the IEEE, vol. 75, No. 1 at 21 (Jan. 87).
John Jubin, Current Packet Radio Network Protocols, Proc. of the IEEE Infocom1985 at 86 (Mar. 1985), 9 pp.
David B. Johnson & David A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks, reprinted in Mobile Computing, 153, Kluwer Academic Publishers (Tomasz Imielinski & Henry F. Korth eds., 1996), 18 pp.
David B. Johnson, Mobile Host Internetworking Using IP Loose Source Routing, Carnegie Mellon University CMU-CS-93-128, DARPA Order No. 7330 (Feb. 1993), 18 pp.
Daniel M. Frank, Transmission of IP Datagrams Over NET/ROM Networks, Proc. of the ARRL 7th Computer Networking Conference 1988 at 65 (Oct. 1988), 6 pp.
Robert E. Kahn, et al., Advances in Packet Radio Technology, Proc. of the IEEE, vol. 66, No. 11, pp. 1468-1496 (Nov. 1978).
Clifford A. Lynch & Edwin B. Brownrigg, Packet Radio Networks, Bergamon Press, 259-74 (1987).
Charles E. Perkins & Pravin Bhagwat, Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers, ACM SIGCOMM Computer Communication Review, vol. 24, Issue 4 at 234 (Oct. 1994), 11 pp.
William MacGregor, Jil Westcott, & Michael Beeler, Multiple Control Stations in Packet Radio Networks, 1982 IEEE Military Communications Conference, vol. 3 at 10.3-1 (Oct. 1982), 6 pp.
Nachum Shacham & Jil Westcott, Future Directions in Packet Radio Architectures and Protocols, Proc. of the IEEE, vol. 75, No. 1 at 83 (Jan. 1987), 17 pp.
David B. Johnson and David A. Maltz, Protocols for Adaptive Wireless and Mobile Networking, IEEE Personal Communications, Feb. 1996, p. 34-42.
Arek J. Dadej and Daniel Floreani, Interconnected Mobile Radio Networks—A step Towards Integrated Multimedia Military Communications, Communications and Networks for the Year 2000, IEEE Singapore International Conference on Networks/International Conference on Information Engineering '93, vol. 1, p. 152-156.
David A. Beyer, Accomplishments of the DARPA SURAN Program, IEEE MILCOM 1990, p. 39.6.1-8.
William S. Hortos, Application of Neural Networks to the Dynamic Spatial Distribution of Nodes within an Urban Wireless Network, SPIE, vol. 2492, p. 58-70, 1995.
Nachum Shacham and Richard G. Ogier, Network Control and Data Transport for C3I Applications, IEEE 1987, p. 30.5.1-6.
John E. Rustad, Reidar Skaug, and Andreas Aasen, New Radio Networks for Tactical Communication, IEEE Jornal on Selected Areas in Communications, vol. 8, No. 5, p. 713-27, Jun. 1990.
Barry M. Leiner, Donald L. Nielson, and Fouad A. Tobagi, Issues in Packet Radio Network Design, Proceedings of the IEEE, vol. 75, No. 1, p. 6-20, Jan. 1987.
Janet Tornow, Functional Summary of the DARPA SURAP1 Network, DARPA, Sep. 1986, 17 pp.
John F. Shoch and Lawrence Stewart, Interconnecting Local Networks via the Packet Radio Network, Sixth Data Communications Symposium, Nov. 1979, pp. 153-158.
J.R. Cleveland, Performance and Design Considerations for Mobile Mesh Networks, IEEE MILCOM 96, vol. 1, p. 245-49.
Cmdr. R. E. Bruninga, USN, A Worldwide Packet Radio Network, Signal, vol. 42, No. 10, p. 221-230, Jun. 1988.
Nachum Shacham and Janet Tornow, Packet Radio Networking, Telecommunications, vol. 20, No. 9, p. 42-48, 64, 82, Sep. 1986.
Spencer T. Carlisle, Edison's NetComm Project, IEEE 1989, Paper No. 89CH2709-4-B5, p. B5-1-B5-4.
Brian H. Davies and T.R. Davies, The Application of Packet Switching Techniques to Combat Net Radio, Proceedings of the IEEE, vol. 75, No. 1, p. 43-55, Jan. 1987.
Fouad A. Tobagi, Richard Binder, and Barry Leiner, Packet Radio and Satellite Networks, IEEE Communications Magazine, vol. 22, No. 11, p. 24-40, Nov. 1984.
M. Scott Corson, Joseph Macker, and Stephen G. Batsell, Architectural Considerations for Mobile Mesh Networking, IEEE MILCOM 96, vol. 1, p. 225-9.
K.Y. Eng, et. al., Bahama: A Broadband Ad-Hoc Wireless ATM Local-Area Network, 1995 IEEE International Conference on Communications, vol. 2, p. 1216-23, Jun. 18-22, 1995.
J. Jonquin Garcia-Luna-Aceves, A Fail-Safe Routing Algorithm for Multihop Packet-Radio Networks, IEEE INFOCOM '86, p. 434-43, Apr. 8-10, 1986.
Johanes P. Tamtomo, A Prototype of TCP/IP-Based Internet-PRNET for Land Information Networks and Services, Department of Surveying Engineering, University of New Brunswick, Jan. 25, 1993, 118 pp.
A. Alwan, et al., Adaptive Mobile Multimedia Networks, IEEE Personal Communications, p. 34-51, Apr. 1996.
Michael Ball, et al., Reliability of Packet Switching Broadcast Radio Networks, IEEE Transactions on Circuits and Systems, vol. Cas-23, No. 12, p. 806-13 ,Dec. 1976.
Kenneth Brayer, Implementation and Performance of Survivable Computer Communication with Autonomous Decentralized Control, IEEE Communications Magazine, p. 34-41, Jul. 1983.
Weidong Chen and Eric Lin, Route Optimization and Locations Updates for Mobile Hosts, Proceedings of the 16th ICDCS, p. 319-326, 1996.
Daniel Cohen, Jonathan B. Postel, and Raphael Rom, IP Addressing and Routing in a Local Wireless Network, IEEE INFOCOM 1992, p. 5A.3.1-7.
Charles Perkins and David B. Johnson, Mobility Support in IPv6, Sep. 22, 1994, http//www.monarch.cs.rice.edu/internet-drafts/draft-perkins-ipv6-mobility-sup-00.txt (last visited Sep. 26, 2009.
Jonathan J. Hahn and David M. Stolle, Packet Radio Network Routing Algorithms: A Survey, IEEE Communications Magazine, vol. 22, No. 11, p. 41-7, Nov. 1984.
David A. Hall, Tactical Internet System Architecture for the Task Force XXI, IEEE 1996, p. 219-30.
Robert Hinden and Alan Sheltzer, The DARPA Internet Gateway, DARPA RFC 823, Sep. 1982, 45 pp.
Manuel Jimenez-Cedeno and Ramon Vasquez-Espinosa, Centralized Packet Radio Network: A Communication Approach Suited for Data Collection in a Real-Time Flash Flood Prediction System, Dept. of Electrical and Computer Engineering, University of Puerto Rico-Mayaguez, ACM 0-89791-568-2/93, p. 709-13, 1993.
David B. Johnson, Routing in Ad Hoc Networks of Mobile Hosts, Workshop on Mobile Computing Systems and Applications, Dec. 8-9, 1994, Santa Cruz, California, IEEE 1995, p. 158-63.
David B. Johnson, Route Optimization in Mobile IP, Nov. 28, 1994, http://www.monarch.cs.rice.edu/internet-drafts/draft-ietf-mobileip-optim-00.txt (last visted Sep. 26, 2009), 32 pp.
Mark G. Lewis and J.J. Garcia-Luna-Aceves, Packet-Switching Applique for Tactical VHF Radios, 1987 IEEE MILCOM Communciations Conference, Oct. 19-22, 1987, Washington, D.C., p. 21.2.1-7.
Sioe Mak and Denny Radford, Design Considerations for Implementation of Large Scale Automatic Meter Reading Systems, IEEE Transactions on Power Delivery, vol. 10, No. 1, p. 97-103, Jan. 1995.
Charles E. Perkins and Pravin Bhagwat, A Mobile Networking System Based on Internet Protocol, IEEE Personal Communications, First Quarter 1994, IEEE 1994, p. 32-41.
Richard Schulman, Richard Snyder, and Larry J. Williams, SINCGARS Internet Controller-Heart of the Digitized Battlefield, Proceedings of the 1996 Tactical Communications Conference, Apr. 30-May 2, 1996, Fort Wayne, Indiana, p. 417-21.
Nachum Shacham and Earl J. Craighill, Dynamic Routing for Real-Time Data Transport in Packet Radio Networks, Proceedings of INFOCOM 1982, IEEE 1982, p. 152-58.
R. Lee Hamilton, Jr. and Hsien-Chuen Yu, Optimal Routing in Multihop Packet Radio Networks, IEEE 1990, p. 389-96.
Carl A. Sunshine, Addressing Problems in Multi-Network Systems, Proceedings of INFOCOM 1982, IEEE 1982, p. 12-18.
J.J. Garcia-Luna-Aceves, Routing Management in Very Large-Scale Networks, North-Holland, Future Generations Computer Systems 4, 1988, pp. 81-93.
J.J. Garcia-Luna-Aceves, A Minimum-hop Routing Algorithm Based on Distributed Information, North-Holland, Computer Networks and ISDN Systems 16, 1988/89, p. 367-382.
D. Hubner, J. Kassubek, F. Reichert, A Distributed Multihop Protocol for Mobile Stations to Contact a Stationary Infrastructure, Third IEE Conference on Telecommunications, Conference Publication No. 331, p. 204-7.
Jens Zander and Robert Forchheimer, The SOFTNET Project: A Retrospect, IEEE EUROCON, Jun. 13-17, 1988, p. 343-5.
Mario Gerla and Jack Tzu-Chich Tsai, Multicluster, Mobile, Multimedia Radio Network, Wireless Networks 1, J.C. Baltzer AG, Science Publishers, 1995, p. 255-265.
F. G. Harrison, Microwave Radio in the British TeleCom Access Network, Second IEE National Conference on Telecommunications, Conference Publication No. 300, Apr. 2-5, 1989, p. 208-13.
Chai-Keong Toh, A Novel Distributed Routing Protocol to Support Ad-Hoc Mobile Computing, Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications, Mar. 27-29, 1996, p. 480-6.
Fadi F. Wahhab, Multi-Path Routing Protocol for Rapidly Deployable Radio Networks, Thesis submitted to the Department of Electrical Engineering and Computer Science of the University of Kansas, 1994, 59 pp.
Jil Westcott and Gregory Lauer, Hierarchical Routing for Very Large Networks, IEEE MILCOM 1984, Oct. 21-24, 1984, Conference Record vol. 2, p. 214-8.
International Search Report and Written Opinion for Application No. PCT/US08/13027, dated Feb. 9, 2009, 6 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13023, dated Jan. 12, 2009, 10 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13019, dated Jan. 12, 2009, 13 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13025, dated Jan. 13, 2009, 7 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13018, dated Jan. 30, 2009, 9 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13020, dated Jan. 9, 2009, 8 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13028, dated Jan. 15, 2009, 9 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13021, dated Jan. 15, 2009, 11 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13016, dated Jan. 9, 2009, 7 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13024, dated Jan. 13, 2009, 9 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13022, dated Jan. 27, 2009, 10 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13030, dated Jan. 9, 2009, 7 pp.
International Search Report and Written Opinion for Application No. PCT/US08/12161, dated Mar. 2, 2009, 13 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13017, dated Mar. 18, 2009, 11 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13026, dated Feb. 24, 2009, 9 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13029, dated Feb. 2, 2009, 8 pp.
International Search Report and Written Opinion for Application No. PCT/US08/13032, dated May 12, 2009, 14 pp.
International Search Report and Written Opinion for Application No. PCT/US09/05008, dated Oct. 22, 2009, 8 pp.
Leis, John, “TCP/IP Protocol Family,” pp. 1 and 42-43, Apr. 3, 2006.
Supplementary European Search Report for Application No. EP 08 85 1869, dated Dec. 30, 2010, 7 pp.
International Search Report and Written Opinion for Application No. PCT/US10/26956, dated May 19, 2010, 2 pp.
Supplementary European Search Report for Application No. EP 08 85 1132, dated Dec. 6, 2010, 9 pp.
Baumann, R., et al., “Routing Packets Into Wireless Mesh Networks,” Wireless and Mobile Computing, Networking and Communications, 2007, WIMOB 2007, Third IEEE International Conference, Piscataway, NJ, Oct. 8, 2007, p. 38 (XP031338321).
Levis Stanford University, J. P. Vasseur, Cisco Systems, et al., “Overview of Existing Routing Protocols for Low Power and Lossy Networks,” draft-levis-rl2n-overview-protocols-02.txt, IETF Standard-Working-Draft, Internet Engineering Task Force, IETF, Ch, No. 2, Nov. 17, 2007 (XP015054252) (ISSN: 0000-0004).
Culler Arch Rock, J.P. Vasseur, Cisco Systems, et al., “Routing Requirements for Low Power and Lossy Networks, draft-culler-rl2n-routing-reqs-01.txt,” IETF Standard-Working-Draft, Internet Engineering Task Force, IETF, CH, No. 1, Jul. 7, 2007 (XP015050851) (ISSN: 000-0004).
Perkins, C. E., et al., “Ad Hoc On-Demand Distance Vector (AODV) Routing,” Network Working Group Internet Draft, XX, Nov. 9, 2001 (XP002950167).
Postel, J., “RFC 793 Transmission Control Protocol,” Sep. 1981 [retrieved on Jan. 1, 2007], Retrieved From the Internet: http://www.ietf.org/rfc/rfc0793.txt.
Supplementary European Search Report for Application No. EP 08 85 1927, dated Dec. 22, 2010, 10 pp.
Younis, M., et al., “Energy-Aware Routing in Cluster-Based Sensor Networks,” Modeling, Analysis and Simulation of Computer and Telecommunications Systems, 10th IEEE Proceedings on Mascots, Oct. 11-16, 2002, Piscataway, NJ (XP010624424) (ISNB: 978-0-7695-1840-4).
Supplementary European Search Report for Application No. EP 08 85 3052, dated Mar. 18, 2011, 10 pp.
Supplementary European Search Report for Application No. EP 08 85 1560, dated Mar. 24, 2011, 9 pp.
Supplementary European Search Report for Application No. EP 08 85 2992, dated Mar. 23, 2011, 6 pp.
Extended European Search Report, Application No. EP10751404, p. 1-6, May 28, 2014.
Related Publications (1)
Number Date Country
20130076534 A1 Mar 2013 US
Provisional Applications (1)
Number Date Country
61159202 Mar 2009 US
Continuations (1)
Number Date Country
Parent 12721948 Mar 2010 US
Child 13656000 US