Aggregated real-time power outages/restoration reporting (RTPOR) in a secure mesh network

Information

  • Patent Grant
  • 8970394
  • Patent Number
    8,970,394
  • Date Filed
    Tuesday, January 24, 2012
    12 years ago
  • Date Issued
    Tuesday, March 3, 2015
    9 years ago
Abstract
Embodiments of the invention provide systems and methods for the reporting of status changes, such as but not limited to power outages and/or power restorations, throughout a smart grid system. Through the use of location-based reporting period selection and/or status change report aggregation, embodiments may provide efficient reporting processes that timely and accurately report status change information from the point(s) of the change to a back-end system via an access point.
Description
FIELD OF THE INVENTION

The present invention relates generally to reporting of status changes, such as but not limited to power outages and power restorations, within a smart grid system.


BACKGROUND OF THE INVENTION

In the utility delivery space, there have been numerous advances in technology in efforts to provide improved methods and systems for monitoring and controlling the delivery and use of various utilities (e.g., electricity, water, gas, etc). By way of specific example, smart grid systems, including advanced metering infrastructures (“AMIs”) and the like, and have been developed which incorporate smart meters or existing meters retrofitted with modules that include at least a radio, configurable microprocessor and storage capacity. These meters are configured to communicate using predetermined protocols with other nodes such as other meters and WAN/NAN access points (i.e., collectors, bridges, mesh gates) in the smart grid across what is commonly referred to as a neighborhood area network (“NAN”).


A smart grid system may be employed to monitor delivery of a utility, such as by reporting meter readings to back-end systems. For example, meters within the smart grid may determine if delivery of power is occurring or if there is a power outage, and may report power readings to the back-end server. The ability to achieve this monitoring automatically and wirelessly is an important advancement over the wired, drive-by or house-to-house meter reading methodologies of the past. A more detailed description of an exemplary smart grid system configuration and the various communications processes implemented across the smart grid are described in at least U.S. patent application Ser. No. 12/554,135, titled “System and Method for Implementing Mesh Network Communications Using a Mesh Network Protocol,” which is incorporated herein by reference in its entirety.


The timely reporting of power outages and restoration across a NAN is critical to maintaining utility access for all customers. Accordingly, there is a need in the art for an efficient reporting process that is able to timely and accurately report outage and restoration information from the point of outage/restoration, across the NAN to the access point and eventually across the WAN to back-end systems for processing and, if necessary, acting on the reported information.


SUMMARY OF THE INVENTION

Embodiments of the invention provide systems and methods for the reporting of status changes, such as but not limited to power outages and/or power restorations, throughout a smart grid system. Through the use of location-based reporting period selection and/or status change report aggregation, embodiments may provide efficient reporting processes that timely and accurately report status change information from the point(s) of the change to a back-end system via an access point.


In one aspect of the invention a method for reporting a status change is provided. The method may include, for example, determining, by a mesh device, that a status change has occurred for a period of time at least as long as a predetermined recognition period. The method also includes determining, by the mesh device, one or more reporting windows within a reporting period. The one or more reporting windows may be determined based on a distance (e.g., number of hops) the mesh device is located from a NAN access point with which it is associated. The mesh device may also receive at least one child status change report from one or more child mesh devices associated with the NAN access point and may also prepare a device status change report, the device status change report including the one or more child status change reports. Finally, the mesh device may transmit the device status change report to one or more parent mesh devices during the reporting window within the reporting period. In certain embodiments, the method may further include listening, by the mesh device, for an acknowledgment from the one or more parent devices and, upon failing to receive the acknowledgement, repeating said receiving, preparing and transmitting.


In another aspect of the invention, a mesh device is provided. The mesh device may includes a processor that determines that a status change has occurred for a period of time at least as long as a predetermined recognition period; determines one or more reporting windows within a reporting period, based on a number of hops the mesh device is located from an access point with which it is associated; and prepares a device status change report. The mesh device may also include a transceiver that receives at least one child status change report from one or more child mesh devices associated with the access point; and transmits the device status change report to one or more parent mesh devices during the one or more reporting windows within the reporting period. Generally, the device status change report may include the one or more child status change reports.


In yet another aspect of the invention, a method of transmitting a status change to a server is provided. The method includes receiving, by an access point, a child status change report from a child mesh device associated with the access point, the child status change report including status change information for one or more child mesh devices that have experienced a status change. The method also includes, determining, by the access point, a random period based on a number of child mesh devices that have experienced a status change. The access point may prepare an access point status change report, including the information from the received child status change report; and may transmit the access point status change report to a server at a randomly selected time within the random period. In certain embodiments, the method may also include determining, by the access point, a retry period based on the number of child mesh devices that have experienced a status change; listening, by the access point, for an acknowledgement from the server; and upon failing to receive the acknowledgment, transmitting, by the access point, the access point status change report to the server at a randomly selected time within the retry period.


In another aspect of the invention an access point is provided. The access point may include a transceiver that receives a child status change report from a child mesh device associated with the access point, the child status change report including status change information for one or more child mesh devices that have experienced a status change. The access point may also include a processor that determines a random period based on a number of child mesh devices that have experienced a status change; and prepares an access point status change report, including information from the received child status change report. The transceiver may transmit the access point status change report to a server at a randomly selected time within the random period.


In yet another aspect of the invention, a system is provided including a mesh device and an access point. The mesh device is associated with the access point, such as via a mesh network, and experiences a status change. The mesh device may determine that the status change has occurred for a period of time at least as long as a predetermined recognition period; and may transmit a device status change report to an access point during a reporting window within a reporting period, the reporting window based on a number of hops the mesh device is located from the access point. The access point may receive the device status change report from the mesh device; and may transmit an access point status change report including the device status change report to a server at a randomly selected time within a random period, the random period based on a number of child mesh devices that have experienced a status change


These and other aspects of the invention will be better understood by reading the following detailed description and appended claims.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1 illustrates an exemplary system for providing smart grid communications over a mesh network.



FIG. 2A illustrates an exemplary meter device for use within a mesh network.



FIG. 2B illustrates an exemplary access point for use within a mesh network.



FIG. 3 illustrates a reporting timeline for an access point in accordance with a preferred embodiment described herein





DETAILED DESCRIPTION

All terms used herein are intended to have their ordinary meaning in the art unless otherwise provided.


Referring to FIG. 1, an exemplary smart grid system for providing status change information within and to/from at least one mesh network is illustrated. As shown, a mesh network A 100 may include a NAN access point (e.g., mesh gate A) 102 and a plurality of meters: meters A 104, B 106, C 108, D 110, E 112, and F 114. A NAN access point may be referred to herein as a mesh gate, NAN-WAN gate, a collector, or a concentrator. The mesh gate A 102 may communicate with a server 118 over a wide area network (WAN) 116 and it will be appreciated that any number of mesh gates may communicate with the server (e.g., mesh gate B 120 and mesh gate C 124).


In addition to the mesh gate A 102, the mesh network A 100 may include a plurality of mesh devices, e.g., meters (as shown) or communication hubs, which cover a geographical area. The mesh devices may be in communication with or may otherwise include one or more utility sensors for monitoring utility usage, such as gas, water, or electricity usage and usage patterns at a specific customer location. Alternative mesh devices may include thermostats, user displays, and other components for monitoring utilities, which may be part of a home area network (“HAN”). As discussed in detail below, the mesh gate A 102 may aggregate information from mesh devices (meters A 104, B 106, C 108, D 110, E 112, and F 114) within the mesh network A 100 and transmit the information to the server 118.


The meters A 104, B 106, C 108, D 110, E 112, and F 114 may be associated with the mesh network A 100 through direct or indirect communications with the mesh gate A 102. Each meter may forward transmissions from other meters within the mesh network A 100 towards the mesh gate A 102. It will be appreciated that while only six meters are depicted in the mesh network A 100, any number of mesh devices may be deployed to cover any number of utility lines or locations, subject to bandwidth constraints with the mesh network and the mesh gate.


As depicted, only meters A 104 and D 110 are in direct communications with mesh gate A 102. However, meters B 106, E 112 and F 114 can all reach mesh gate A 102 through meter D 110. Similarly, meter C 108 can reach mesh gate A 102 through meter E 112 and meter D 110. Accordingly, meter A 104 may be described as being 1 “hop” from mesh gate A 102; meter D 110 may be described as being 2 “hops” from mesh gate A, and meter C 108 may be described as being 3 “hops” from mesh gate A.


It will be appreciated that the WAN 116 may be any communication medium capable of transmitting digital information. For example, the WAN 116 may be the Internet, a cellular network, a private network, a phone line configured to carry a dial-up connection, or any other network.


The head end server 118 may be a computing device configured to receive information, such as status change information, meter readings, or any other data from a plurality of mesh networks and meters. The server 118 may also be configured to transmit instructions to the mesh networks, mesh gates, and mesh devices. In certain embodiments, the server 118 may be a central processing system including one or more computing systems (i.e., one or more server computers). Where the head end includes more than one computing system, the computing systems can be connected by one or more networks and the system may be referred to as a “backhaul network” or back end system.


The number of mesh networks, e.g., mesh networks B 12 and C 126 are similar to mesh network A 100 in operation, as discussed above. Moreover, descriptions of exemplary mesh networks, including electric meters and other mesh devices, can be found in commonly owned U.S. patent application Ser. No. 12/275,252, titled “Method and System for Creating and Managing Association and Balancing of a Mesh Device in a Mesh Network,” filed Nov. 21, 2008, which is incorporated herein by reference in its entirety.


Referring to FIG. 2A, an exemplary mesh device (e.g., meter) for use within a mesh network is shown. A mesh device 200 may include a radio 202, a communication card 204, a metering sensor 206, and a battery or other power or energy storage device 208. The radio 202 may include a memory 210, a processor 212, a transceiver 214, and a microcontroller unit (MCU) 216. Generally, the communication card 204 may interface between the radio and a sensor 206 and sensor readings may be converted to radio signals for transmission over the radio. The memory 210 may store instructions and run-time variables for execution. For example, the memory 210 may include both volatile and non-volatile memory. The memory 210 may also store a history of sensor readings from the metering sensor 206 and an incoming queue of server instructions. As discussed below, the memory may store status information of the mesh device, and may also store status information received from one or more child mesh devices.


A mesh device 200 may communicate with an access point and other mesh devices over a mesh network. For example, the mesh device 200 may be an electricity smart meter installed in a residential building or other location to monitor electricity usage. The meter may also control access to energy in response to server instructions, for example, by reducing or stopping the flow of electricity.


In certain embodiments, one or more mesh devices 200 may provide a status change report to a head end server in real-time or near real-time via an access point. As used herein, a “status change” may refer to a loss of power (i.e., a power outage) or a restoration of power (i.e., a power restoration). In the event of an outage, the mesh device may employ a secondary power source that backs up the device's real-time clock, such as a battery, super capacitor or the like 208, to provide a “last gasp” of activity. For example, a super capacitor may provide the mesh device with about 15 seconds of recognition time to determine whether a power outage is momentary or lasting and another about 7.5 seconds of time for “last-gasp” radio transmissions.


In one embodiment, a mesh device first determines that a status change has occurred for a period of time lasting at least as long as a predetermined recognition period. The predetermined recognition period may be any amount of time allowed by the secondary power source, such as but not limited to, from about 5 seconds to about 30 seconds, from about 10 seconds to about 25 seconds, or about 15 seconds. Generally, if a mesh device becomes affected by an outage, it may enter a “sleep” mode for the duration of the recognition period, wherein the radio and/or the processor are shut down to preserve the backup power.


If a status change ends prior to the end of the recognition period, the device may resume normal operation and may record the momentary status change in memory. The recorded status change may then be reported by a mesh device in non-real-time as part of a normal, scheduled reporting process (e.g., daily).


However, if the status change persists beyond the recognition period, a mesh device may employ an aggregated real-time or near real-time power outage/restoration reporting (RTPOR) algorithm to report the status change to a parent node. Because the mesh device may be aware of its location within the mesh network defined by each NAN access point, the aggregated algorithm may be location-based, such that the mesh device may autonomously transmit status change report(s) in a way that increases the probability of the report(s) successfully reaching the NAN access point.


In one embodiment, each mesh device receiving a status change report or experiencing a status change may prepare and broadcast an aggregated status change report to one or more of its parent mesh devices during a reporting period. A reporting period may comprise from about 1 to about 5 seconds, for example, about 1.5 seconds. Generally, the reporting period may depend on the secondary source of power employed at the mesh device.


During the reporting period, a mesh device may transmit a status report at a reporting time within a reporting window. The reporting period may be divided into any number of reporting windows, and the mesh device may transmit the status report once (e.g., at a random reporting time), during each reporting window. Accordingly, the mesh device may send status report(s) multiple times during the reporting period.


According to one embodiment, each mesh device may employ a reporting window based on its distance from an access point. For example, a mesh device may determine a reporting window based on a number of hops the mesh device is located from an access point with which it is associated. Each mesh device may employ its knowledge of the mesh network so that devices far from the access point may transmit their information more frequently to increase the probability of successfully reaching their parent devices, while devices near the access point may transmit less frequently to provide more time to aggregate data from child devices and decrease the likelihood of collisions. Generally, the mesh device's clock may be implemented to determine the reporting window and/or reporting time and a timer may be set to begin at the end of the recognition period.


By way of non-limiting example, a mesh device located 1 hop from the access point may employ a reporting window of about 500 ms, a mesh device located 2 hops from the access point may employ a reporting window of about 300; a mesh device located 3 hops from the access point may employ a reporting window of about 214 ms; and so on according to the equation below:

Reporting Window(device at n hops)=reporting period/(1+n)


In one embodiment, a mesh device may prepare a status change report including information about a status change. Such information may include, for example, the start time and end time of the status change, the duration of the status change, the identity of the mesh device, and/or the location of the mesh device. A report may be prepared during each reporting window, or a single report may be prepared and repeatedly transmitted.


In one embodiment, the mesh device may receive one or more child status change reports from one or more child mesh devices. During each reporting window, the mesh device may check for such child status reports and, in certain embodiments, may include information from such reports in the status change report to be transmitted to the mesh device's parent node. In other words, the mesh device may aggregate status change reports from one or more child mesh devices in the mesh network during one or more reporting windows.


For example, during each reporting window, each mesh device in a mesh network may check whether it has received new child status change reports and, if so, may broadcast an aggregated status change report including this new information. Regardless of whether child status change reports are received or not, mesh devices may continue re-broadcasting the aggregated status change report at each reporting window, either until adequate power is no longer available for transmission or for a total of the entire reporting period.


As used herein, the term “child” refers to a mesh device located a further distance away from an access point than the reference mesh device. Similarly, the term “parent” refers to a mesh device located closer to the access point than the reference mesh device. By way of example, if a reference mesh device is located 2 hops from an access point, a mesh device located 1 hop from the access point may be referred to as a “parent mesh device,” and a mesh device located 3 hops from the access point may be referred to as a “child mesh device,” with respect to the reference mesh device.


In certain embodiments, the mesh device may suspend local generation of all other message transmissions, including but not limited to keep-alive messages and neighbor exchange procedures as used by the NAN network layer protocol, and may suspend the relay of data packets from other nodes in the mesh network.


The aggregated RTPOR process is extremely useful in reporting random, isolated power outages as well as restoration of power after any type of outage. After power is restored, the device will use the routing tables and other data stored in its nonvolatile memory to resume communications with the access point to which it belonged before the outage. If communications cannot resume as before, then a new association process will be initiated, for example, as discussed in U.S. patent application Ser. No. 12/554,135, titled “System and Method for Implementing Mesh Network Communications Using a Mesh Network Protocol,” which is incorporated herein by reference in its entirety.


Referring to FIG. 2B, an access point (i.e., mesh gate 230) for use within a mesh network is illustrated. As shown, the mesh gate 230 may include a mesh radio 232, a wide area network interface 234, a battery 236, and a processor 238. The mesh radio 232 may include a memory 242, a processor 244, and a transceiver 246. The mesh gate 230 may also include a WAN interface 234, a battery 236 and a processor 238. By acting as a gateway, the access point forwards information and instructions between the meters in its mesh network and the server. The access point may also function as a node within the mesh network, by forwarding messages between meters.


As status change reports are received at the access point 230, it may timestamp and aggregate these messages (adding its own status information, as appropriate) into a report of confirmed outages that is delivered to the head-end in real-time. Generally, operation of the access point during a power outage requires that it be equipped with a battery backup 236, either integrated as part of the device or supplied as an external unit. Typically, the lead-acid batteries used for backup provide at least 8 hours of operation at 20° Celsius. For such lead-acid batteries, the lifetime is typically 5-7 years before they should be replaced as routine maintenance.


In one embodiment, the access point may aggregate the status change reports from one or more child mesh devices such that they may be reported to a head end. The access point may prepare its own status change report including, for example, a status report table listing all mesh devices associated with the reporting access point for which there has been a change in status (including itself, if applicable). The access point may then transmit the status change report in real-time or near real time to a head end server. In certain embodiments, a real-time status change report may be continually updated while the reporting process is underway, and the most recent changes in device status throughout the system may be ready to be transmitted at any given moment.


Referring to FIG. 3 an exemplary sequence followed by an access point to report to its notification server(s) when a power outage or power restoration event occurs and/or has been reported by one or more associated nodes to an access point is illustrated.


As shown, once a status change has been detected locally or a status change has been reported by one or more associated nodes, the access point may wait for a predetermined minimum delay before transmitting the status change report to a head end server. During the minimum delay, incoming status change reports from mesh devices or local status change events occurring at the access point may be aggregated into a single status change report. After successful reporting the status change report to a server, the minimum delay restarts (and may repeat indefinitely) to aggregate additional incoming status change reports as they are received and local status change events as they occur. The minimum delay may be any amount of time, for example from about 30 seconds to about 60 seconds, or about 45 seconds.


Generally, the access point may determine certain parameters used in the reporting process based on the number of devices affected by a power outage or power restoration. For example, if the number of devices that have changed status exceeds a certain threshold, the values for such notification parameters as the “random period” and “retry period” (discussed below) employed throughout the reporting process may be adjusted. Although the threshold may be set to any value, in certain embodiments, the threshold may be from about 10% to about 30% of the mesh devices associated with the access point, or more particularly, about 20% of such devices.


As shown in FIG. 3, after the minimum delay is over, the access point attempts to transmit the status change report to a first configured notification server at an instant in time randomized over a random period. The random period defines the maximum duration that the access point may wait before attempting transmission, and only one attempt is allowed within this period. Generally, the random period may be from about 5 seconds to about 30 seconds, or from about 10 seconds to about 20 seconds (e.g., about 15 seconds) when less than the threshold number of child devices experience a status change. When greater than the threshold number of child devices experience a status change, the random period may range from about 30 seconds to about 60 seconds (e.g., about 45 seconds).


In one embodiment, upon sending a status change report to a head end server, the access point may listen for an acknowledgment from the server that the report was received. If the access point does not successfully receive an acknowledgement from the server, the transmission attempt may be assumed to have failed, and the next attempt may occur over a retry period. The attempt may be initiated at a random instant over the retry period, and only one attempt may be allowed within this period. Generally, the retry period may be from about 10 seconds to about 60 seconds (e.g., about 15 seconds, about 30 seconds, or about 45 seconds) when less than the threshold number of child devices experience a status change. When greater than the threshold number of child devices experience a status change, the retry period may range from about 30 seconds to about 60 seconds (e.g., about 45 seconds).


If the transmission again fails, retries are attempted in successive retry windows until the transmission is successful or the number of maximum retries has been reached. Generally, each retry may be attempted over a retry period, as described above. Moreover, the maximum number of retries may be set to any value (e.g., 1, 2, 3, 4, 5, etc.).


However, if the server acknowledges successful transmission, then, for that specific server, the status of each associated node for which a status change has been communicated may be reset. If more than one server has been configured by the access point, then, for each notification server, the above steps may be repeated.


In certain embodiment, after the real-time status change report has been successfully or unsuccessfully transmitted to all notification servers as described above, the access point may wait for an exclusion period to ensure that all other access points in the network are able to reach the notification servers before transmitting an additional status change report. The exclusion period may last from about 30 seconds to about 120 seconds, including but not limited to about 30 seconds, about 60 seconds, about 90 seconds, or about 120 seconds.


If additional status changes occur during the exclusion period, then the above described process may be repeated. In other words, after the exclusion period has elapsed, any incoming status change reports received or local status change events occurring since the last report or during the exclusion period may trigger another cycle, beginning with the minimum delay. If new child status change reports are received after the status change report has been reported to a first server, but prior to being reported to another server, then the first notification server may only be informed of the new events once the process has been reinitiated.


Unless specifically stated otherwise as apparent from the foregoing discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, can refer to the action and processes of a data processing system, or similar electronic device, that manipulates and transforms data represented as physical (electronic) quantities within the system's registers and memories into other data similarly represented as physical quantities within the system's memories or registers or other such information storage, transmission or display devices.


The exemplary embodiments can relate to an apparatus for performing one or more of the functions described herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a machine (e.g. computer) readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs and magnetic-optical disks, read only memories (ROMs), random access memories (RAMs) erasable programmable ROMs (EPROMs), electrically erasable programmable ROMs (EEPROMs), magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a bus.


Some exemplary embodiments described herein are described as software executed on at least one processor, though it is understood that embodiments can be configured in other ways and retain functionality. The embodiments can be implemented on known devices such as a server, a personal computer, a special purpose computer, a programmed microprocessor or microcontroller and peripheral integrated circuit element(s), and ASIC or other integrated circuit, a digital signal processor, a hard-wired electronic or logic circuit such as a discrete element circuit, or the like. In general, any device capable of implementing the processes described herein can be used to implement the systems and techniques according to this invention.


It is to be appreciated that the various components of the technology can be located at distant portions of a distributed network and/or the interne, or within a dedicated secure, unsecured and/or encrypted system. Thus, it should be appreciated that the components of the system can be combined into one or more devices or co-located on a particular node of a distributed network, such as a telecommunications network. As will be appreciated from the description, and for reasons of computational efficiency, the components of the system can be arranged at any location within a distributed network without affecting the operation of the system. Moreover, the components could be embedded in a dedicated machine.


Furthermore, it should be appreciated that the various links connecting the elements can be wired or wireless links, or any combination thereof, or any other known or later developed element(s) that is capable of supplying and/or communicating data to and from the connected elements. The terms determine, calculate and compute, and variations thereof, as used herein are used interchangeably and include any type of methodology, process, mathematical operation or technique.


The invention described and claimed herein is not to be limited in scope by the specific embodiments herein disclosed since these embodiments are intended as illustrations of several aspects of the invention. Any equivalent embodiments are intended to be within the scope of this invention. Indeed, various modifications of the invention in addition to those shown and described herein will become apparent to those skilled in the art from the foregoing description. Such modifications are also intended to fall within the scope of the appended claims. All publications cited herein are incorporated by reference in their entirety.

Claims
  • 1. A method for reporting a status change comprising: determining, by a mesh device, that a status change has occurred for a period of time at least as long as a predetermined recognition period;determining, by the mesh device, one or more reporting windows within a reporting period, based on a number of hops the mesh device is located from an access point with which the mesh device is associated, wherein the one or more reporting windows is determined based on: (the reporting period)/(1+n), where n is the number of hops;receiving, by the mesh device, at least one child status change report from one or more child mesh devices associated with the access point;preparing, by the mesh device, a device status change report, the device status change report including the one or more child status change reports; andtransmitting, by the mesh device, the device status change report to one or more parent mesh devices during the reporting window within the reporting period.
  • 2. A method according to claim 1, wherein the status change is a power outage or power restoration.
  • 3. A method according to claim 1, wherein the recognition period comprises about 15 seconds.
  • 4. A method according to claim 1, wherein a radio and a processor of the mesh device are shut down during the recognition period.
  • 5. A method according to claim 1, wherein the reporting period comprises from about 1 second to about 5 seconds.
  • 6. A method according to claim 5, wherein the reporting period comprises about 1.5 seconds.
  • 7. A method according to claim 1, wherein the reporting window comprises about 500 ms when the mesh device is located 1 hop from the access point.
  • 8. A method according to claim 1, wherein the reporting window comprises about 300 ms when the mesh device is located 2 hops from the access point.
  • 9. A method according to claim 1, wherein the reporting window comprises about 214 ms when the mesh device is located 3 hops from the access point.
  • 10. A method according to claim 1, wherein the device status change report is transmitted at a random reporting time within the reporting window.
  • 11. A method according to claim 1 further comprising listening, by the mesh device, for an acknowledgment from the one or more parent devices and, upon failing to receive the acknowledgement, repeating said receiving, preparing and transmitting.
  • 12. A mesh device comprising: a processor for: determining that a status change has occurred for a period of time at least as long as a predetermined recognition period;determining one or more reporting windows within a reporting period, based on a number of hops the mesh device is located from a access point with which the mesh device is associated, wherein the one or more reporting windows is determined based on: (the reporting period)/(1+n), where n is the number of hops; andpreparing a device status change report;a transceiver for: receiving at least one child status change report from one or more child mesh devices associated with the access point; andtransmitting the device status change report to one or more parent mesh devices during the one or more reporting windows within the reporting period, the device status change report including the one or more child status change reports.
  • 13. A mesh device according to claim 12, wherein the status change is a power outage or power restoration.
  • 14. A mesh device according to claim 12, wherein recognition period comprises about 15 seconds.
  • 15. A mesh device according to claim 12, wherein the transceiver and the processor are shut down during the recognition period.
  • 16. A mesh device according to claim 12, wherein the reporting period comprises from about 1 second to about 5 seconds.
  • 17. A mesh device according to claim 16, wherein the reporting period comprises about 1.5 seconds.
  • 18. A mesh device according to claim 12, wherein the reporting window comprises about 500 ms when the mesh device is located 1 hop from the access point; about 300 ms when the mesh device is located 2 hops from the access point; or about 214 ms when the mesh device is located 3 hops from the access point.
  • 19. A mesh device according to claim 12, wherein the device status change report is transmitted at a random reporting time within the reporting window.
  • 20. A mesh device according to claim 12, wherein the transceiver listens for an acknowledgment from the one or more parent devices and, upon failing to receive the acknowledgement, the processor repeats said preparing and said transceiver repeats said receiving and transmitting.
  • 21. A method of transmitting a status change to a server comprising: receiving, by an access point, a child status change report from a child mesh device associated with the access point, the child status change report including status change information for one or more child mesh devices that have experienced a status change;determining, by the access point, a random period based on a number of child mesh devices that have experienced a status change;preparing, by the access point, an access point status change report, including the information from the received child status change report; andtransmitting, by the access point, the access point status change report to a server at a randomly selected time within the random period.
  • 22. A method according to claim 21 further comprising: determining, by the access point, a retry period based on the number of child mesh devices that have experienced a status change;listening, by the access point, for an acknowledgement from the server; andupon failing to receive the acknowledgment, transmitting, by the access point, the access point status change report to the server at a randomly selected time within the retry period.
  • 23. The method of claim 22 further comprising repeating said listening step and, upon failing to receive the acknowledgment, repeating said transmitting of the access point status change report during a second retry period.
  • 24. A method according to claim 21, wherein said random reporting period is from about 10 seconds to about 20 seconds when less than a threshold number of the child mesh devices experience a status change.
  • 25. A method according to claim 24, wherein said random reporting period is from about 30 seconds to about 60 seconds when more than a threshold number of the child mesh devices experience a status change.
  • 26. A method according to claim 25, wherein said threshold number comprises from about 10% to about 30% of the child mesh devices associated with the access point.
  • 27. A method according to claim 26, wherein said threshold number is about 20% of the child mesh devices associated with the access point.
  • 28. A method according to claim 21, further comprising resetting the status of each of the child mesh devices that have experienced a status change, upon receiving an acknowledgment of a successful transmission from the server.
  • 29. A method according to claim 21, wherein said status change comprises a power outage or power restoration.
  • 30. An access point comprising: a transceiver: receiving a child status change report from a child mesh device associated with the access point, the child status change report including status change information for one or more child mesh devices that have experienced a status change;a processor: determining a random period based on a number of child mesh devices that have experienced a status change; andpreparing an access point status change report, including information from the received child status change report;wherein the transceiver transmits the access point status change report to a server at a randomly selected time within the random period.
  • 31. An access point according to claim 30 wherein: the processor determines a retry period based on the number of child mesh devices that have experienced a status change; andthe transceiver listens for an acknowledgement from the server and, upon failing to receive the acknowledgment, transmits the access point status change report to the server at a randomly selected time within the retry period.
  • 32. An access point according to claim 30, wherein said random reporting period is from about 10 seconds to about 20 seconds when less than a threshold number of the child mesh devices experience a status change.
  • 33. An access point according to claim 32, wherein said random reporting period is from about 30 seconds to about 60 seconds when more than a threshold number of the child mesh devices experience a status change.
  • 34. An access point according to claim 33, wherein said threshold number comprises from about 10% to about 30% of the child mesh devices associated with the access point.
  • 35. An access point according to claim 34, wherein said threshold number is about 20% of the child mesh devices associated with the access point.
  • 36. An access point according to claim 30, wherein said status change comprises a power outage or power restoration.
  • 37. A system comprising: (i) a mesh device associated with an access point, the mesh device experiencing a status change and: determining that the status change has occurred for a period of time at least as long as a predetermined recognition period; andtransmitting a device status change report to an access point during a reporting window within a reporting period, the reporting window based on a number of hops the mesh device is located from the access point;(ii) the access point: receiving the device status change report from the mesh device; andtransmitting an access point status change report including the device status change report to a server at a randomly selected time within a random period, the random period based on a number of child mesh devices that have experienced a status change.
  • 38. A system according to claim 37, wherein the device status change report includes a child status change report.
  • 39. A system according to claim 37, wherein the status change comprises a power outage or power restoration.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application claims benefit of similarly titled U.S. Provisional Patent Application 61/435,822, filed Jan. 25, 2011, which is incorporated herein by reference in its entirety.

US Referenced Citations (592)
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 Fitzemeyer 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 Cutler, 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
5572438 Ehlers et al. Nov 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
5684710 Ehlers et al. Nov 1997 A
5696501 Ouellette et al. Dec 1997 A
5696695 Ehlers 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
5896566 Averbuch et al. 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
5919247 Van Hoff et al. Jul 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
6556830 Lenzo 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
6687901 Imamatsu Feb 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
6711512 Noh Mar 2004 B2
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 Mayer 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
6882635 Eitan et al. Apr 2005 B2
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 Johannson 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
7053853 Merenda 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
7103086 Steed et al. 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
7174260 Tuff et al. Feb 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
7230931 Struhsaker Jun 2007 B2
7231482 Leach Jun 2007 B2
7245938 Sobczak et al. Jul 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
7266158 Matsumura Sep 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 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
7366191 Higashiyama Apr 2008 B2
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
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
7546595 Wickham et al. Jun 2009 B1
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
7571865 Nicodem et al. Aug 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
7733224 Tran Jun 2010 B2
7743224 Wang Jun 2010 B2
7756538 Bonta et al. Jul 2010 B2
7788491 Dawson Aug 2010 B1
7802245 Sonnier et al. Sep 2010 B2
7814322 Gurevich et al. Oct 2010 B2
7818758 de Bonet et al. Oct 2010 B2
7847706 Ross et al. Dec 2010 B1
7911359 Walters et al. Mar 2011 B2
8051415 Suzuki Nov 2011 B2
8059011 Van Wyk et al. Nov 2011 B2
8582481 Kim et al. Nov 2013 B2
8625496 Brownrigg et al. Jan 2014 B2
20010005368 Rune Jun 2001 A1
20010010032 Ehlers et al. Jul 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
20020051269 Margalit et al. May 2002 A1
20020066095 Yu May 2002 A1
20020110118 Foley Aug 2002 A1
20020114303 Crosbie et al. 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
20030014633 Gruber 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
20030207697 Shpak Nov 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
20040039817 Lee et al. Feb 2004 A1
20040056775 Crookham et al. Mar 2004 A1
20040061605 Howard Apr 2004 A1
20040066310 Ehrke et al. Apr 2004 A1
20040077341 Chandranmenon et al. Apr 2004 A1
20040081086 Hippelainen 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
20040193329 Ransom et al. Sep 2004 A1
20040210544 Shuey et al. Oct 2004 A1
20040268142 Karjala et al. Dec 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
20050187928 Byers Aug 2005 A1
20050193390 Suzuki et al. Sep 2005 A1
20050195757 Kidder et al. Sep 2005 A1
20050201397 Petite Sep 2005 A1
20050228874 Edgett et al. Oct 2005 A1
20050239414 Mason et al. Oct 2005 A1
20050243867 Petite Nov 2005 A1
20050249113 Kobayashi et al. 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
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
20060130053 Buljore et al. Jun 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
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
20070063866 Webb Mar 2007 A1
20070063868 Borleske Mar 2007 A1
20070085700 Walters et al. Apr 2007 A1
20070087756 Hoffberg Apr 2007 A1
20070089110 Li Apr 2007 A1
20070101442 Bondurant May 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
20070174467 Ballou, Jr. et al. 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
20080011864 Tessier et al. Jan 2008 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 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
20080184341 Sebesta 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
20080283620 Knapp Nov 2008 A1
20080310311 Flammer et al. Dec 2008 A1
20080310377 Flammer et al. Dec 2008 A1
20080317047 Zeng et al. Dec 2008 A1
20080318547 Ballou, Jr. 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
20090129575 Chakraborty et al. May 2009 A1
20090132220 Chakraborty et al. May 2009 A1
20090134969 Veillette May 2009 A1
20090135677 Veillette May 2009 A1
20090135716 Veillette May 2009 A1
20090135843 Veillette May 2009 A1
20090136042 Veillette May 2009 A1
20090138617 Veillette May 2009 A1
20090138777 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
20090201936 Dumet et al. Aug 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
20090310593 Sheynblat et al. Dec 2009 A1
20090315699 Satish et al. Dec 2009 A1
20090319672 Reisman Dec 2009 A1
20090320073 Reisman Dec 2009 A1
20100017249 Fincham et al. Jan 2010 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
20100061272 Veillette 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
20100138660 Haynes et al. Jun 2010 A1
20100238917 Silverman et al. Sep 2010 A1
20100256830 Kressner et al. Oct 2010 A1
20100328031 Powers et al. Dec 2010 A1
20100332359 Powers et al. Dec 2010 A1
20110004358 Pollack et al. Jan 2011 A1
20110035073 Ozog Feb 2011 A1
20110066297 Saberi et al. Mar 2011 A1
20120192025 Veillette Jul 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 (139)
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/.
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, Pergamon Press, (1987), 121 pp.
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 visited Sep. 26, 2009), 32 pp.
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-r12n-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-r12n-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.ietforg/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.
International Search Report and Written Opinion for Application No. PCT/US2011/060694, dated Apr. 9, 2012, 10 pp.
International Search Report and Written Opinion for Application No. PCT/US2011/049227, dated Jan. 31, 2012, 9 pp.
International Search Report and Written Opinion for Application No. PCT/US12/22334, dated Apr. 9, 2012, 9 pp.
International Search Report and Written Opinion for Application No. PCT/US11/56620, dated Mar. 13, 2012, 8 pp.
Supplementary European Search Report for Application No. EP 08 84 2449, dated Nov. 29, 2011, 5 pp.
Lin, Shen, et al., “A Wireless Network Based on the Combination of Zigbee and GPRS” [online], [retrieved on Feb. 16, 2012], IEEE International Conference on Networking, Sensing and Control, Apr. 6-8, 2008, 4 pp., Retrieved From the Internet: http://ieeexplore.ieee.org/xpls/abs—all.jsp?arnumber=4525223.
Telegesis, “ZigBee Gateway Makes Your Meter Smart” [online], 2005 [retrieved on Feb. 16, 2012], 1 p., Retrieved From the Internet: http://www.telegesis.com/downloads/general/SSV%20IP%20gateway%20case%20study.pdf.
Supplementary European Search Report for Application No. EP 09 81 1849, dated Dec. 13, 2011, 9 pp.
Gerla, Mario, et al., Multicasting Protocols for High-Speed, Wormhole-Routing Local Area Networks, ACM SIGCOMM Computer Communication Review, vol. 26, No. 4, Oct. 4, 1996, pp. 184-193.
International Search Report and Written Opinion for Application No. PCT/US2011/049277, dated Jan. 31, 2012, 9 pp.
International Search Report and Written Opinion for Application No. PCT/US11/21167, dated Mar. 21, 2012, 8 pp.
“UCAIug Home Area Network System Requirements Specification, A Work Product of the OpenHAN Task Force Formed by the SG Systems Working Group Under the Open Smart Grid (OpenSG) Technical Committee of the UCA® International Users Group, Version 2.0,” 157 pp., Aug. 30, 2010.
“ZigBee Smart Energy Profile Specification,” ZigBee Profile: 0x0109, Revision 15, Dec. 1, 2008, Document 075345r15 (SEP Document), 244 pp.
Edison Electric Institute (EEI), “Uniform Business Practices for Unbundled Electricity Metering, vol. Two,” Dec. 5, 2000, 196 pp., www.naesb.org/pdf/ubp120500.pdf.
“ZigBee Smart Energy Profile Specification,” ZigBee Profile: 0x0109, Revision 16, Version 1.1, Document 075356r16ZB, 332 pp., Mar. 23, 2011.
“ZigBee Over-the-Air Upgrading Cluster,” ZigBee Alliance, Document 095264r18, Revision 18, Version 1.0, 63 pp., Mar. 14, 2010.
IEEE Standard for Information Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan Area Networks—Specific Requirements, “Part 15.4: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low-Rate Wireless Personal Area Networks (WPANs),” IEEE Computer Society, 323 pp., Sep. 8, 2006.
IEEE Standard for Information Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan Area Networks—Specific Requirements, “Part 15.4: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low-Rate Wireless Personal Area Networks (LR-WPANs),” IEEE Computer Society, 679 pp., Oct. 1, 2003.
“ZigBee Cluster Library Specification,” ZigBee Alliance, Document 075123r02ZB, 420 pp., May 29, 2008.
Liu, Ryan, et al., “A Survey of PEV Impacts on Electric Utilities,” EEE PES Innovative Smart Grid Technologies Conference, Anaheim, California, 8 pp., Jan. 17-19, 2011.
“Utility/Lab Workshop on PV Technology and Systems,” DTE Energy DER Technology Adoption, DEW Analysis of Renewable, PEV & Storage, Tempe, Arizona, 36 pp., Nov. 8-9, 2010.
“Network Device: Gateway Specification,” ZigBee Alliance, ZigBee Document 075468r35, Revision 35, Version No. 1.0, 301 pp., Mar. 23, 2011.
International Search Report and Written Opinion for Application No. PCT/US12/28135, dated Jul. 5, 2012, 7 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, 1991.
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.
Related Publications (1)
Number Date Country
20120192025 A1 Jul 2012 US
Provisional Applications (1)
Number Date Country
61435822 Jan 2011 US