System and method for power outage and restoration notification in an advanced metering infrastructure network

Information

  • Patent Grant
  • 8370697
  • Patent Number
    8,370,697
  • Date Filed
    Friday, March 16, 2012
    12 years ago
  • Date Issued
    Tuesday, February 5, 2013
    11 years ago
Abstract
A method and system are provided to transmit a meter power status. The method includes recognizing a power status change at a meter. The method includes, if the meter is scheduled to transmit first, transmitting a notification message to at least one neighboring meter towards a mesh gate, wherein the notification message includes a power status indicator and a meter identifier. The method includes, if the meter is not scheduled to transmit first, waiting a predetermined time period to receive a notification message from at least one neighboring meter. The method includes, responsive to receiving a notification message, adding a meter identifier to the received notification message before retransmitting the modified notification message to at least one neighboring meter. The method includes retransmitting the notification message.
Description
FIELD OF THE INVENTION

This invention pertains generally to methods and systems for providing power outage and restoration notifications within an Advanced Metering Infrastructure (AMI) network.


BACKGROUND

A mesh network is a wireless network configured to route data between nodes within a network. It allows for continuous connections and reconfigurations around broken or blocked paths by retransmitting messages from node to node until a destination is reached. Mesh networks differ from other networks in that the component parts can all connect to each other via multiple hops. Thus, mesh networks are self-healing: the network remains operational when a node or a connection fails.


Advanced Metering Infrastructure (AMI) or Advanced Metering Management (AMM) are systems that measure, collect and analyze utility usage, from advanced devices such as electricity meters, gas meters, and water meters, through a network on request or a pre-defined schedule. This infrastructure includes hardware, software, communications, customer associated systems and meter data management software. The infrastructure allows collection and distribution of information to customers, suppliers, utility companies and service providers. This enables these businesses to either participate in, or provide, demand response solutions, products and services. Customers may alter energy usage patterns from normal consumption patterns in response to demand pricing. This improves system load and reliability.


A meter may be installed on a power line, gas line, or water line and wired into a power grid for power. During an outage, the meter may cease to function. When power is restored, meter functionality may be restored.


SUMMARY

A method and system provide power outage and restoration notifications within an AMI network. Mesh networks are used to connect meters of an AMI in a geographical area. Each meter may communicate with its neighbors via the mesh network. A mesh gate links the mesh network to a server over a wide area network (WAN). When a power outage occurs among the meters of a mesh network, leaf meters transmit outage messages first. Parent meters add a parent identifier before forwarding the outage messages. This reduces the number of transmitted outage messages within the mesh network. Similarly, restoration messages are transmitted from the leaf nodes first, while parent nodes piggy-back parent identifiers when forwarding the restoration messages from the leaf meters.


In one aspect, there is provided a system and method for power outage and restoration notification in an advanced metering infrastructure network.


In another aspect, there is provided a method of transmitting a meter power status, including: recognizing a power status change at a meter; if the meter is scheduled to transmit first, transmitting a notification message to at least one neighboring meter towards a mesh gate, wherein the notification message includes a power status indicator and a meter identifier; if the meter is not scheduled to transmit first, waiting a predetermined time period to receive a notification message from at least one neighboring meter; responsive to receiving a notification message, adding a meter identifier to the received notification message before retransmitting the modified notification message to at least one neighboring meter; and retransmitting the notification message.


In another aspect, there is provided a method of transmitting a network power status, including: receiving at least one notification message from a meter, wherein the notification message includes a power status indicator and at least one meter identifier; aggregating the received meter identifiers into a composite notification message, the composite notification message including a power status indicator and at least one meter identifier; transmitting the composite notification message to a server over a wide area network; and retransmitting the composite notification message.


In another aspect, there is provided a system for transmitting a network power status, including: (A) a mesh network; (B) a wide area network separate from the mesh network; (C) at least one meter in communication with the mesh network, the meter configured to: recognize a power status change at a meter, if the meter is scheduled to transmit first, transmit a notification message to at least one neighboring meter towards a mesh gate, wherein the notification message includes a power status indicator and a meter identifier, if the meter is not scheduled to transmit first, wait a predetermined time period to receive a notification message from at least one neighboring meter, responsive to receiving a notification message, adding a meter identifier to the received notification message before retransmitting the modified notification message to at least one neighboring meter, and retransmitting the notification message; (D) a mesh gate in communication with the meter over the mesh network and in communication with the wide area network, the mesh gate configured to: receive at least one notification message from a meter, wherein the notification messages include a power status indicator and at least one meter identifier, aggregate the received meter identifiers into a composite notification message, the composite notification message includes a power status indicator and at least one meter identifier, transmit the composite notification message to a server over a wide area network, and retransmitting the composite notification message; and (E) a server in communication with the mesh gate over the wide area network, the server configured to receive the composite notification message.


In another aspect, there is provided a system for transmitting a network power status, including: a mesh network; a wide area network separate from the mesh network; at least one meter in communication with the mesh network; a mesh gate in communication with the meter over the mesh network and in communication with the wide area network; and a server in communication with the mesh gate over the wide area network, the server configured to receive the composite notification message.


In another aspect, there is provided a computer program stored in a computer readable form for execution in a processor and a processor coupled memory to implement a method of transmitting a meter power status, the method including: recognizing a power status change at a meter; if the meter is scheduled to transmit first, transmitting a notification message to at least one neighboring meter towards a mesh gate, wherein the notification message includes a power status indicator and a meter identifier; if the meter is not scheduled to transmit first, waiting a predetermined time period to receive a notification message from at least one neighboring meter; responsive to receiving a notification message, adding a meter identifier to the received notification message before retransmitting the modified notification message to at least one neighboring meter; and retransmitting the notification message.


In another aspect, there is provided a computer program stored in a computer readable form for execution in a processor and a processor coupled memory to implement a method of transmitting a network power status, including: receiving at least one notification message from a meter, wherein the notification message includes a power status indicator and at least one meter identifier; aggregating the received meter identifiers into a composite notification message, the composite notification message including a power status indicator and at least one meter identifier; transmitting the composite notification message to a server over a wide area network; and retransmitting the composite notification message.


In another aspect, there is provided a method of transmitting a meter power status, including: recognizing a power status change at a meter; if the meter is scheduled to transmit first, transmitting a notification message from the meter to at least one neighboring meter towards a mesh gate, wherein the notification message includes a power status indicator and a meter identifier; if the meter is not scheduled to transmit first, waiting a predetermined time period to receive a notification message from at least one neighboring meter; responsive to receiving a notification message, adding a meter identifier to the received notification message before retransmitting the modified notification message to at least one neighboring meter, wherein the notification message includes a power status indicator and at least one meter identifier; aggregating the received meter identifiers into a composite notification message, the composite notification message including a power status indicator and at least one meter identifier; transmitting the composite notification message to a server over a wide area network; and retransmitting the composite notification message.


In another aspect, there is provided a computer program stored in a computer readable form for execution in a processor and a processor coupled memory to implement a method of transmitting a meter power status, the method including: recognizing a power status change at a meter; if the meter is scheduled to transmit first, transmitting a notification message from the meter to at least one neighboring meter towards a mesh gate, wherein the notification message includes a power status indicator and a meter identifier; if the meter is not scheduled to transmit first, waiting a predetermined time period to receive a notification message from at least one neighboring meter; responsive to receiving a notification message, adding a meter identifier to the received notification message before retransmitting the modified notification message to at least one neighboring meter, wherein the notification message includes a power status indicator and at least one meter identifier; aggregating the received meter identifiers into a composite notification message, the composite notification message including a power status indicator and at least one meter identifier; transmitting the composite notification message to a server over a wide area network; and retransmitting the composite notification message.


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 illustrates an example system for providing AMI communications over a mesh network.



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



FIG. 2B illustrates an example mesh gate for use within a mesh network.



FIG. 3 illustrates an example network stack for use within a mesh radio.



FIG. 4A illustrates an example procedure for transmitting outage and restoration notifications from a meter within a mesh network.



FIG. 4B illustrates an example procedure for transmitting outage and restoration notifications from a mesh gate within a wide area network.



FIG. 5A illustrates a first timing of transmitting outage notifications from a meter within a mesh network.



FIG. 5B illustrates a second timing of transmitting outage notifications from a meter within a mesh network.



FIG. 5C illustrates a third timing of transmitting outage notifications from a meter within a mesh network.



FIG. 6 illustrates a timing of transmitting restoration notifications from a meter within a mesh network.





DETAILED DESCRIPTION


FIG. 1 illustrates an example system for providing AMI communications over a mesh network. A mesh network A 100 may include a mesh gate A 102 and a plurality of meters: meters A 104, B 106, C 108, D 110, E 112, and F 114. A mesh gate may also be referred to as a NAN-WAN gate or an access point. The mesh gate A 102 may communicate to a server 118 over a wide area network 116. Optionally, a mesh gate B 120 and a mesh network B 122 may also communicate with the server 118 over the wide area network (WAN) 116. Optionally, a mesh gate C 124 and a mesh network C 126 may also communicate with the server 118 over the wide area network 116.


In one example embodiment, the server 118 is known as a “head end.” The mesh gate may also be known as a collector, a concentrator, or an access point.


It will be appreciated that a mesh device association can include a registration for application service at the mesh gate A 102 or the server 118. The mesh gate A 102 and the server 118 can maintain a table of available applications and services and requesting mesh devices.


The mesh network A 100 may include a plurality of mesh gates and meters which cover a geographical area. The meters may be part of an AMI system and communicate with the mesh gates over the mesh network. For example, the AMI system may monitor utilities usage, such as gas, water, or electricity usage and usage patterns.


The mesh gate A 102 may provide a gateway between the mesh network A 100 and a server, discussed below. The mesh gate A 102 may include a mesh radio to communicate with the mesh network A 100 and a WAN communication interface to communicate with a WAN.


The mesh gate A 102 may aggregate information from meters within the mesh network A 100 and transmit the information to the server. The mesh gate A 102 may be as depicted below. It will be appreciated that while only one mesh gate is depicted in the mesh network A 100, any number of mesh gates may be deployed within the mesh network A 100, for example, to improve transmission bandwidth to the server and provide redundancy. A typical system will include a plurality of mesh gates within the mesh network. In a non-limiting embodiment for an urban or metropolitan geographical area, there may be between 1 and 100 mesh gates, though this is not a limitation of the invention. In one embodiment, each mesh gate supports approximately 400 meters, depending on system requirements, wireless reception conditions, available bandwidth, and other considerations. It will be appreciated that it is preferable to limit meter usage of bandwidth to allow for future upgrades.


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


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.


The wide area network (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 server 118 may be a computing device configured to receive information 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 meters.


It will be appreciated that while only one server is depicted, any number of servers may be used in the AMI system. For example, servers may be distributed by geographical location. Redundant servers may provide backup and failover capabilities in the AMI system.


The optional mesh gates B 120 and C 124 may be similar to mesh gate A 102, discussed above. Each mesh gate may be associated with a mesh network. For example, mesh gate B 120 may be associated with mesh network B 122 and mesh gate C 124 may be associated with mesh network C 126.


The mesh network B 122 and the mesh network C 126 may be similar to the mesh network A 102. Each mesh network may include a plurality of meters (not depicted).


Each mesh network may cover a geographical area, such as a premise, a residential building, an apartment building, or a residential block. Alternatively, the mesh network may include a utilities network and be configured to measure utilities flow at each sensor. Each mesh gate communicates with the server over the WAN, and thus the server may receive information from and control a large number of meters or mesh devices. Mesh devices may be located wherever they are needed, without the necessity of providing wired communications with the server.



FIG. 2A illustrates an example meter for use within a mesh network. A meter 200 may include a radio 202, a communication card 204, a metering sensor 206, and a battery or other power or energy storage device or source 208. The radio 202 may include a memory 210, a processor 212, a transceiver 214, and a microcontroller unit (MCU) 216 or other processor or processing logic.


A mesh device can be any device configured to participate as a node within a mesh network. An example mesh device is a mesh repeater, which can be a wired device configured to retransmit received mesh transmissions. This extends a range of a mesh network and provides mesh network functionality to mesh devices that enter sleep cycles.


The meter 200 may be a mesh device communicating with a mesh gate and other mesh devices over a mesh network. For example, the meter 200 may be a gas, water or electricity meter installed in a residential building or other location to monitor utilities usage. The meter 200 may also control access to utilities on server instructions, for example, by reducing the flow of gas, water or electricity.


The radio 202 may be a mesh radio configured to communicate with a mesh network. The radio 202 may transmit, receive, and forward messages to the mesh network. Any meter within the mesh network may thus communicate with any other meter or mesh gate by communicating with its neighbor and requesting a message be forwarded.


The communication card 204 may interface between the radio 202 and the sensor 206. Sensor readings may be converted to radio signals for transmission over the radio 202. The communication card 204 may include encryption/decryption or other security functions to protect the transmission. In addition, the communication card 204 may decode instructions received from the server.


The metering sensor 206 may be a gas, water, or electricity meter sensor, or another sensor. For example, digital flow sensors may be used to measure a quantity of utilities consumed within a residence or building. Alternatively, the sensor 206 may be an electricity meter configured to measure a quantity of electricity flowing over a power line.


The battery 208 may be configured to independently power the meter 200 during a power outage. For example, the battery 208 may be a large capacitor storing electricity to power the meter 200 for at least five minutes after a power outage. Small compact but high capacity capacitors known as super capacitors are known in the art and may advantageously be used. One exemplary super capacitor is the SESSCAP 50f 2.7v 18×30 mm capacitor. Alternative battery technologies may be used, for example, galvanic cells, electrolytic cells, fuel cells, flow cells, and voltaic cells.


It will be appreciated that the radio 202, communication card 204, metering sensor 206 and battery 208 may be modular and configured for easy removal and replacement. This facilitates component upgrading over a lifetime of the meter 200.


The memory 210 of the radio 202 may store instructions and run-time variables of the radio 202. 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.


The processor 212 of the radio 202 may execute instructions, for example, stored in memory 210. Instructions stored in memory 210 may be ordinary instructions, for example, provided at time of meter installation, or special instructions received from the server during run time.


The transceiver 214 of the radio 202 may transmit and receive wireless signals to a mesh network. The transceiver 214 may be configured to transmit sensor readings and status updates under control of the processor 212. The transceiver 214 may receive server instructions from a server, which are communicated to the memory 210 and the processor 212.


In the example of FIG. 2A, the MCU 216 can execute firmware or software required by the meter 200. The firmware or software can be installed at manufacture or via a mesh network over the radio 202.


In one embodiment, any number of MCUs can exist in the meter 200. For example, two MCUs can be installed, a first MCU for executing firmware handling communication protocols, and a second MCU for handling applications.


It will be appreciated that a mesh device and a mesh gate can share the architecture of meter 200. The radio 202 and the MCU 216 provide the necessary hardware, and the MCU 216 executes any necessary firmware or software.


Meters may be located in geographically dispersed locations within an AMI system. For example, a meter may be located near a gas line, an electric line, or a water line entering a building or premise to monitor a quantity of gas, electricity, or water. The meter may communicate with other meters and mesh gates through a mesh network. The meter may transmit meter readings and receive instructions via the mesh network.



FIG. 2B illustrates an example mesh gate for use within a mesh network. 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 interface between mesh devices (for example, meters) in a mesh network and a server. For example, meters may be as discussed above. The mesh gate 230 may be installed in a central location relative to the meters and also communicate with a server over a WAN.


The mesh radio 232 may be a mesh radio configured to communicate with meters over a mesh network. The radio 232 may transmit, receive, and forward messages to the mesh network.


The WAN interface 234 may communicate with a server over a WAN. For example, the WAN may be a cellular network, a private network, a dial up connection, or any other network. The WAN interface 234 may include encryption/decryption or other security functions to protect data being transmitted to and from the server.


The battery 236 may be configured to independently power the mesh gate 230 during a power outage. For example, the battery 236 may be a large capacitor storing electricity to power the mesh gate 230 for at least five minutes after a power outage. A power outage notification process may be activated during a power outage.


The processor 238 may control the mesh radio 232 and the WAN interface 234. Meter information received from the meters over the mesh radio 232 may be compiled into composite messages for forwarding to the server. Server instructions may be received from the WAN interface 234 and forwarded to meters in the mesh network.


It will be appreciated that the mesh radio 232, WAN interface 234, battery 236, and processor 238 may be modular and configured for easy removal and replacement. This facilitates component upgrading over a lifetime of the mesh gate 230.


The memory 242 of the mesh radio 232 may store instructions and run-time variables of the mesh radio 232. For example, the memory 242 may include both volatile and non-volatile memory. The memory 242 may also store a history of meter communications and a queue of incoming server instructions. For example, meter communications may include past sensor readings and status updates.


The processor 244 of the mesh radio 232 may execute instructions, for example, stored in memory 242. Instructions stored in memory 242 may be ordinary instructions, for example, provided at time of mesh gate installation, or special instructions received from the server during run-time.


The transceiver 246 of the mesh radio 232 may transmit and receive wireless signals to a mesh network. The transceiver 246 may be configured to receive sensor readings and status updates from a plurality of meters in the mesh network. The transceiver 246 may also receive server instructions, which are communicated to the memory 242 and the processor 244.


A mesh gate may interface between a mesh network and a server. The mesh gate may communicate with meters in the mesh network and communicate with the server over a WAN network. By acting as a gateway, the mesh gate forwards information and instructions between the meters in its mesh network and the server.



FIG. 3 illustrates an example network stack for use within a mesh radio. A radio 300 may interface with an application process 302. The application process 302 may communicate with an application layer 304, which communicates with a transport layer 306, a network layer 308, a data link layer 310 and a physical layer 312.


The radio 300 may be a mesh radio as discussed above. For example, the radio 300 may be a component in a meter, a mesh gate, or any other mesh device configured to participate in a mesh network. The radio 300 may be configured to transmit wireless signals over a predetermined frequency to other radios.


The application process 302 may be an executing application that requires information to be communicated over the network stack. For example, the application process 302 may be software supporting an AMI system.


The application layer 304 interfaces directly with and performs common application services for application processes. Functionality includes semantic conversion between associated application processes. For example, the application layer 304 may be implemented as ANSI C12.12/22.


The transport layer 306 responds to service requests from the application layer 304 and issues service requests to the network layer 308. It delivers data to the appropriate application on the host computers. For example, the layer 306 may be implemented as TCP (Transmission Control Protocol), and UDP (User Datagram Protocol).


The network layer 308 is responsible for end to end (source to destination) packet delivery. The functionality of the layer 308 includes transferring variable length data sequences from a source to a destination via one or more networks while maintaining the quality of service, and error control functions. Data will be transmitted from its source to its destination, even if the transmission path involves multiple hops.


The data link layer 310 transfers data between adjacent network nodes in a network, wherein the data is in the form of packets. The layer 310 provides functionality including transferring data between network entities and error correction/detection. For example, the layer 310 may be implemented as IEEE 802.15.4.


The physical layer 312 may be the most basic network layer, transmitting bits over a data link connecting network nodes. No packet headers or trailers are included. The bit stream may be grouped into code words or symbols and converted to a physical signal, which is transmitted over a transmission medium, such as radio waves. The physical layer 312 provides an electrical, mechanical, and procedural interface to the transmission medium. For example, the layer 312 may be implemented as IEEE 802.15.4.


The network stack provides different levels of abstraction for programmers within an AMI system. Abstraction reduces a concept to only information which is relevant for a particular purpose. Thus, each level of the network stack may assume the functionality below it on the stack is implemented. This facilitates programming features and functionality for the AMI system.



FIG. 4A illustrates an example procedure for transmitting outage and restoration notifications from a meter within a mesh network. A mesh device, such as a meter, may include a sensor for measuring utilities and receive power from a power grid. At times, the power grid may fail during a power outage. The power grid may also be restored after an outage. The meter may include a battery configured to power the meter for a period of time, during which the meter executes a power outage notification procedure to inform a mesh gate and a server of the power outage. Similarly, the meter may execute a power restoration notification when functionality is restored after power is restored to the power grid.


In 400, the meter may detect a power status change. For example, the meter may include an electric sensor sensing a power, current, or voltage of an electric line powering the meter from a power grid. When the sensor senses a cut-off in electricity, the meter may wait a predetermined recognition period before determining that a power outage has occurred.


When a meter's power is restored after an outage, the meter may also wait a predetermined recognition period before determining that the power outage has ended and power has been restored. Using a recognition period before an outage or a restoration has occurred prevents the meter from trigging the notification procedure for brief outages and restorations.


In 402, the meter tests whether it is the first to transmit. For example, the meter may look up a neighborhood table to determine whether it is a leaf meter. A leaf meter may have no children meters, and is thus the last meter on its associated branch. For example, FIG. 1 depicts meters A 104, B 106, C 108, and F 114 as leaf meters. Meter F 114 is a leaf meter because no child meter would transmit through it to reach mesh gate A 102, even though meter F 114 has two alternate paths to the mesh gate A 102 (F 114 to E 112 to D 110 to mesh gate or F 114 to D 110 to mesh gate).


A one-hop device, which can be a device in direct communications with the mesh gate, may transmit immediately.


Alternatively, the meter may look up the neighborhood table to determine a number of hops to the mesh gate. If it is farthest from the mesh gate on its branch, it will transmit first. If the meter determines yes, the meter proceeds to 404. If no, the meter proceeds to 410. The neighborhood table can be built during association requests and subsequent neighbor exchanges.


In 404, the meter may transmit a notification message. The notification message may include a nature of the notification (whether a power outage or restoration has occurred, as determined in 400) and a meter identifier. The meter identifier may be a globally unique identifier assigned to the meter at manufacture or installation that identifies the meter to the mesh gate and the server.


If the notification message has previously been transmitted, the meter may attempt a retry transmission. Retries may be attempted until an acknowledgement is received or a predetermined number of retry attempts has been exceeded.


Information transmitted in the transmission may include a device identifier, a time of outage, and any other necessary information. In one embodiment, a number of transmitted neighbor information may be restricted. For example, only a predetermined maximum number of parents, siblings, and children node information can be transmitted to limit message size. Neighbors can be selected based on a preferred route ratio. Neighbors that are on a preferred route of a meter's path to the mesh gate may be prioritized. The preferred route ratio can be used to select routes with a minimum of hops over a best minimum signal quality link to the mesh gate.


In 406, the meter may test whether it has exceeded a predetermined retry attempts. The meter may increment a counter for a number of retries after every attempt to transmit a notification message in 404. The predetermined retry attempts may be set to limit network congestion, both within the mesh network and over a WAN from a mesh gate to the server during a power outage and restoration.


Alternatively, the meter may continually attempt to transmit until its battery is drained during a power outage notification procedure. This may be used in an AMI system where it is important to receive as many accurate outage notifications as possible, or where network bandwidth is of lesser concern. If the predetermined retry attempts have been exceed, the procedure ends. If no, the meter procedures to 408.


In 408, the meter optionally delays a random time period. For example, the delay may allow other meters in the mesh network to transmit and reduce collisions. Further, the delay may improve battery life after a power outage.


The random time period may be associated with a predetermined floor value, below which it cannot be set. This may be an exclusion period during which no retransmission may be attempted by the meter.


In 410, the meter tests whether a child message has been received. For example, a non-leaf meter will not transmit during a first attempt, and may receive notification messages from child meters. If yes, the meter proceeds to 412. If no, the meter proceeds to 404. In one embodiment, if the meter determines it has missed the child messages, it may immediately transmit its message.


In 412, the meter may insert a meter identifier in the notification message. The notification message received from the child meter in 410 may include a status (whether the notification is for a power outage or restoration) and at least one meter identifier associated with children meters. The meter may insert its own identifier into the message before forwarding the message in 404.


By executing the procedure above, leaf meters transmit notification messages first. Each meter waits to receive a notification message from children meters before adding its identifier and forwarding the notification to its parent meter. This reduces message congestion in the mesh network during a notification procedure.


In an alternative example, each parent meter may determine how many children meters it has, and wait for notification messages from all children meters before compiling the messages into one message to be forwarded. Alternatively, the parent meter may wait for a predetermined period of time, because only some children meters may be affected by a power outage.


It will be appreciated that if a meter has not suffered a power outage, it would simply forward any received notification messages to its parent without adding its identifier into the message. Similarly, if a parent meter has not had a power restoration; it will remain off and be unable to forward notification messages. In this example, children meters may attempt alternative routes to transmit notification messages, as discussed below.



FIG. 4B illustrates an example procedure for transmitting outage and restoration notifications from a mesh gate within a wide area network. A mesh gate and its associated mesh devices, such as meters, may receive power from a power grid. At times, the power grid may fail during a power outage. The power grid may also be restored after an outage. The mesh gate may include a battery configured to power the mesh gate for a period of time, during which the mesh gate executes a power outage notification procedure to inform a server of the outage and affected meters. Similarly, the mesh gate may execute a power restoration notification when power is restored to the power grid.


In 450, the mesh gate may receive a notification message from a meter within its mesh network. For example, the notification message may include a status indicating whether it is an outage or restoration notification and at least one meter identifier. The notification message may be as discussed above.


In 452, the mesh gate may test whether it has finished receiving notification messages from the mesh network. For example, the mesh gate may continually receive notification messages until its battery drops to a critical level during an outage. The critical level may be set to where enough power remains in the battery to allow the mesh gate to transmit its composite notification message to the server, as discussed below, along with a predetermined number of retries.


Alternatively, the mesh gate may wait for a predetermined time period after receiving a first notification message. For example, the predetermined time period may be determined, in part, based on the size of the mesh network, the maximum number of hops to reach a leaf meter, the link quality of the mesh network, etc.


Alternatively, the mesh gate may proceed as soon as message notifications from all children meters within the mesh network have been received. If all children meters are accounted for, the mesh gate does not need to wait for further notification messages.


If the mesh gate has finished receiving notification messages, it may proceed to 454. If no, it may proceed to 450 to await more notification messages.


In 454, the mesh gate may select a power reporting configuration. For example, two power reporting configurations may be available: one used for minor outage, such as one affecting only a few meters, and one used for major outages, such as one affecting many meters. The power reporting configuration may affect the retry attempts and delay periods discussed below.


For example, it may be very important to inform the server of a major outage. Thus, a high number of retry attempts may be set. It may be likely that a major outage has affected other mesh networks. Thus, a longer delay period may be used to reduce transmission collisions over the WAN. In addition, a longer window may be set to wait for notification messages from meters.


In 456, the mesh gate may aggregate all the notification messages into a composite notification message. For example, the mesh gate may create the composite notification message containing a status indicating whether an outage or restoration has occurred in the mesh network and a list of meter identifiers associated with the notification. For example, the list of meter identifiers may be received in 452 from one or more meters.


In one example, the mesh gate may receive both an outage and a restoration notification message. The mesh gate may aggregate a first notification message, for example, all received outage notification messages, for transmission. Then, the mesh gate may aggregate a second notification message, for example, the restoration notification message for transmission.


In 458, the mesh gate may transmit the composite notification message to the server over a WAN. For example, the WAN may be a cellular network, a wired network, or another network configured to carry information. In one example, the WAN used to transmit the composite notification message may be a secondary communications medium. A primary wired network may fail during a power outage, and therefore a backup network may be used. For example, the backup network may be a battery-powered network, cellular network, a battery-powered wired network, or another network configured to operate during an outage.


If the composite notification message has previously been transmitted, the mesh gate may attempt a retry transmission. Retries may be attempted until an acknowledgement is received or a predetermined number of retry attempts has been exceeded.


In 460, the mesh gate may test whether a predetermined number of retry attempts has been exceeded. The mesh gate may increment a counter for a number of retries after every attempt to transmit a notification message in 458. The predetermined retry attempts may be set to limit network congestion over the WAN to the server during a power outage and restoration.


Alternatively, the mesh gate may continually attempt to transmit until its battery is drained during a power outage notification procedure. This may be used in an AMI system where it is important to receive as many accurate outage notifications as possible, or where network bandwidth is of lesser concern.


For example, the predetermined number of retry attempts may be set in part based on the power reporting configuration selected in 454. If the predetermined number of retry attempts has been exceeded, the mesh gate may end the procedure. If no, the mesh gate may proceed to 462.


In 462, the mesh gate may optionally delay a random time period. For example, the delay may allow other mesh gates in the WAN to transmit and reduce collisions. Further, the delay may improve battery life after a power outage.


For example, the delay period may be set in part based on the power reporting configuration selected in 454. The random time period may be associated with a floor value, below which it cannot be set. This may be an exclusion period during which no retransmission may be attempted.


The mesh gate may aggregate all notification messages sent to it by meters over the mesh network. The composite notification message consists of a power status and a list of meter identifiers identifying the meters affected by the power status. The composite notification message may be transmitted over an outage-resistant communications link to a server.



FIG. 5A illustrates a first timing of transmitting outage notifications from a meter within a mesh network. A power outage notification process allows orderly transmission of power outage notification from one or more mesh devices (such as a meter) in a mesh network to a mesh gate. The mesh gate aggregates the notifications and transmits a composite message to a server. Because the mesh network may include a large number of meters, transmitting individual notifications from each meter may cause network congestion, especially because other meters within the mesh network are also likely affected by the same outage and will also be sending outage notifications.


A recognition period (e.g., RECOGNITION_PERIOD) may elapse between an occurrence of a power outage and time T1, when the power outage is recognized by the meter. The recognition period may prevent minor power fluctuations or outages from triggering the outage notification procedure.



FIG. 5B illustrates a second timing of transmitting outage notifications from a meter within a mesh network. The meter may wait for a first random period before a first attempt to send a power outage notification at time T2. A first attempt wait period (e.g., PO_RND_PERIOD) may represent a maximum random delay in seconds used before the first attempt. This random delay starts after recognition period (RECOGNITION_PERIOD) elapses at time T1. The first attempt is reserved for leaf meters. A meter which is not a leaf meter will not transmit during the first attempt.


The meter may wait for a retry random period before a retry attempt at time T3. A retry wait period (e.g., PO_RETRY_RND_PERIOD) may represent a maximum random delay in seconds used for each retry. This random delay starts after time T2, when a first transmission attempt occurs.


Using a random delay before the first and retry attempts prevents colliding transmission from multiple meters and reduces network congestion. If a meter attempts to transmit but a transmission is already in progress, the meter may wait for the transmission in progress to end before attempting to transmit.


If a meter receives a notification from a child meter, its transmission includes the child's notification plus the meter's identifier. By piggy-backing the meter's identifier in a child's notification and forwarding the notification, the number of individual notifications and messages are reduced in the mesh network.


The meter may continually retry to transmit an outage notification until the meter's battery is drained. In addition, there may be a predetermined maximum number retries. In addition, there may be a minimum period for the first delay and the subsequent retry delays. The minimum delay periods may eliminate the possibility of immediate retransmissions and guarantee a minimum delay between attempts.


The mesh gate may receive all the power outage notification messages and compile the information into a message for transmission to a server over a WAN. The mesh gate may also retransmit the compiled notification as necessary, until its battery is drained.


Child meters in a mesh network transmit outage notifications first, and parent meters piggy-back meter identifiers into the child notifications before forwarding the child notifications. A number of messages and notifications transmitted in the mesh network during an outage are thereby reduced.



FIG. 6 illustrates a timing of transmitting restoration notifications from a meter within a mesh network. A power restoration notification process allows orderly transmission of power restoration notification messages from one or more mesh devices (such as a meter) in a mesh network to a mesh gate. The mesh gate aggregates the notifications and transmits a composite message to a server. Because the mesh network may include a large number of meters, transmitting individual notifications from each meter may cause network congestion, especially because other meters within the mesh network are also likely affected by the restoration and will also be sending restoration notifications.


When power is restored at a meter, the meter may first wait for a recognition period before deciding the power has been restored. The recognition period may prevent triggering restoration notifications when power returns for a brief moment before the outage continues.


A first random period, PR_RND_PERIOD, may represent a maximum random delay used before a first attempt is made to send a power restoration notification. This first random period may begin after the power restored recognition period, PR_RECOGNITION_PERIOD. A first notification may be transmitted. Only leaf meters transmit during the first attempt.


A retry random period, PR_RETRY_RND_PERIOD, may represent a maximum random delay before a retry to send a power restoration notification. The retry random period begins after the first random period.


Using a random delay before the first and retry attempts reduces colliding transmission from multiple meters. If a meter attempts to transmit but a transmission is already in progress, the meter may wait for the transmission to end before attempting to transmit.


After the first attempt to transmit has been made, the mesh gate may wait a minimum delay (e.g., MIN_DELAY) to time T4 and an additional random period (e.g., RAND_PERIOD) to time T5 before retrying transmission. Each retry attempt may be preceded by a retry random period (e.g., RETRY_RND_PERIOD) to time T6, and a maximum number of retry attempts may be set at maximum retries (e.g., MAX_RETRIES). The procedure may stop at time T7, after all retry attempts have been made.


If a meter receives a notification from a child meter, its transmission includes the child's notification plus the meter's identifier. By piggy-backing the meter's identifier in a child's notification and forwarding the notification, the number of individual notifications and messages are reduced in the mesh network.


The mesh gate may receive all power restoration notification messages and compile the information into a composite message for transmission to a server over a WAN. Similarly, the mesh gate may also repeatedly attempt to transmit the composite restoration message until a maximum number of retries have been made or the server acknowledges the transmission.


Child meters in a mesh network transmit restoration notifications first, and parent meters piggy-back meter identifiers into the child notifications before forwarding the child notifications. A number of messages and notifications transmitted in the mesh network during a restoration are thereby reduced.


If a child meter attempts to forward a message to a parent meter that is not functional (for example, the parent meter's power has not been restored); the child meter may wait a predetermined period of time. If the parent meter remains non-functional, the child meter may attempt to send its notification via an alternative path through the mesh network stored in its memory. If that fails, the child meter may attempt to discover a new route through the mesh network to the mesh gate. If that fails, the child meter may attempt to associate with a new mesh network in order to transmit its restoration notification message.


Although the above embodiments have been discussed with reference to specific example embodiments, it will be evident that the various modification, combinations and changes can be made to these embodiments. Accordingly, the specification and drawings are to be regarded in an illustrative sense rather than in a restrictive sense. The foregoing specification provides a description with reference to specific exemplary embodiments. It will be evident that various modifications may be made thereto without departing from the broader spirit and scope as set forth in the following claims. The specification and drawings are, accordingly, to be regarded in an illustrative sense rather than a restrictive sense.

Claims
  • 1. A method of transmitting a meter power status, comprising: recognizing, by a meter, a power status change at the meter at a first time;waiting, by the meter, a predetermined recognition period from the first time to a second time;determining, by the meter, that the meter is not scheduled to transmit first;waiting, by the meter, a predetermined time period from the second time to a third time to receive a notification message from at least one neighboring meter including a meter identifier of the at least one neighboring meter;responsive to receiving the notification message from the neighboring meter, adding, by the meter, the meter identifier of the meter to the received notification message including the meter identifier of the at least one neighboring meter before retransmitting the received notification message to at least one other neighboring meter; andretransmitting, by the meter, the received notification message during a random time period from the third time to a fourth time.
  • 2. The method of claim 1, wherein the power status change is at least one of: a power outage and a power restoration.
  • 3. The method of claim 1, wherein the meter communicates with neighboring meters via a mesh network.
  • 4. The method of claim 1, further comprising: responsive to a first failure to receive an acknowledgement, retransmitting, by the meter, the notification message over an alternative mesh network path;responsive to a second failure to receive an acknowledgement, retransmitting, by the meter, the notification message through a newly discovered mesh network path; andresponsive to a third failure to receive an acknowledgement, associating, by the meter, with a new mesh network and retransmitting the notification message over the new mesh network.
  • 5. A system for transmitting a network power status, comprising: (A) a mesh network;(B) a wide area network separate from the mesh network;(C) at least one meter in communication with the mesh network, the meter configured to: recognize a power status change at a meter,if the meter is scheduled to transmit first, transmit a notification message to at least one neighboring meter towards a mesh gate, wherein the notification message includes a power status indicator and a meter identifier of the meter,if the meter is not scheduled to transmit first, wait a predetermined time period to receive a notification message from at least one neighboring meter including a meter identifier of the at least one neighboring meter,responsive to receiving the notification message from the neighboring meter, adding the meter identifier of the meter to the received notification message from the neighboring meter before retransmitting the received notification message to at least one other neighboring meter, andretransmitting the received notification message;(D) a mesh gate in communication with the at least one meter over the mesh network and in communication with the wide area network, the mesh gate configured to: receive at least one notification message from a meter, wherein each notification messages includes a power status indicator and at least one meter identifier,aggregate received meter identifiers into a composite notification message, the composite notification message include a power status indicator and at least one meter identifier,transmit the composite notification message to a server over a wide area network, andretransmitting the composite notification message; and(E) a server in communication with the mesh gate over the wide area network, the server configured to receive the composite notification message.
  • 6. The system of claim 5, wherein the power status change is at least one of: a power outage and a power restoration.
  • 7. The system of claim 5, wherein the meter is scheduled to transmit first if it has a high number of hops from the mesh gate.
  • 8. The system of claim 5, wherein the meter is scheduled to transmit first if it is a leaf node in a mesh network.
  • 9. The system of claim 5, wherein the mesh gate is further configured to select an isolated outage reporting configuration or a major outage reporting configuration, wherein the major outage reporting configuration includes a longer aggregation window.
  • 10. The system of claim 5, wherein the mesh gate does not retransmit the composite notification message during an exclusion period.
  • 11. A computer program stored in a non-transitory computer readable form for execution in a processor and a processor coupled memory to implement a method of transmitting a meter power status, the method comprising: recognizing a power status change at a meter at a first time;waiting a predetermined recognition period from the first time to a second time;determining that the meter is not scheduled to transmit first;waiting a predetermined time period from the second time to a third time to receive a notification message from at least one neighboring meter including a meter identifier of the at least one neighboring meter;responsive to receiving the notification message from the neighboring meter, adding the meter identifier of the meter to the received notification message including the meter identifier of the at least one neighboring meter before retransmitting the received notification message to at least one other neighboring meter; andretransmitting the received notification message during a random time period from the third time to a fourth time.
  • 12. A method of transmitting a meter power status, comprising: recognizing, by a meter, a power status change at the meter;if the meter is scheduled to transmit first, transmitting, by the meter, a notification message from the meter to at least one neighboring meter towards a mesh gate, wherein the notification message includes a power status indicator and a meter identifier of the meter;if the meter is not scheduled to transmit first, waiting, by the meter, a predetermined time period to receive a notification message from at least one neighboring meter including a meter identifier of the at least one neighboring meter;responsive to receiving the notification message from the neighboring meter, adding, by the meter, the meter identifier of the meter to the received notification message including the meter identifier of the at least one neighboring meter before retransmitting the received notification message to at least one other neighboring meter;aggregating, by a mesh gate, received meter identifiers into a composite notification message, the composite notification message including a power status indicator and at least one meter identifier;transmitting, by the mesh gate, the composite notification message to a server over a wide area network; andretransmitting, by the mesh gate, the composite notification message.
  • 13. A computer program stored in a non-transitory computer readable form for execution in a processor and a processor coupled memory to implement a method transmitting a meter power status, the method comprising: recognizing a power status change at a meter;if the meter is scheduled to transmit first, transmitting a notification message from the meter to at least one neighboring meter towards a mesh gate, wherein the notification message includes a power status indicator and a meter identifier of the meter;if the meter is not scheduled to transmit first, waiting a predetermined time period to receive a notification message from at least one neighboring meter;responsive to receiving the notification message from the neighboring meter, adding the meter identifier of the meter to the received notification message before retransmitting the received notification message to at least one other neighboring meter;selecting a power reporting configuration;aggregating received meter identifiers into a composite notification message based on the selected power reporting configuration, the composite notification message including a power status indicator and at least one meter identifier;transmitting the composite notification message to a server over a wide area network; andretransmitting the composite notification message.
  • 14. A system for transmitting a network power status, comprising: (A) a mesh network;(B) a wide area network separate from the mesh network;(C) at least one meter in communication with the mesh network, the meter configured to: recognize a power status change at a the meter at first time,wait a predetermined recognition period from the first time to a second time;determine that the meter is not scheduled to transmit first;wait a predetermined time period from the second time to a third time to receive a notification message from at least one neighboring meter including a meter identifier of the at least one neighboring meter,responsive to receiving the notification message from the neighboring meter, adding the meter identifier of the meter to the received notification message from the neighboring meter before retransmitting the received notification message to at least one other neighboring meter, andretransmitting the received notification message during a random time period from the third time to a fourth time;(D) a mesh gate in communication with the at least one meter over the mesh network and in communication with the wide area network; and(E) a server in communication with the mesh gate over the wide area network.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 12/275,254, filed Nov. 21, 2008, now U.S. Pat. No. 8,171,364, and claims the benefit of priority to the following United States provisional patent applications which are incorporated herein by reference in their entirety: Ser. No. 60/989,957 entitled “Point-to-Point Communication within a Mesh Network”, filed Nov. 25, 2007;Ser. No. 60/989,967 entitled “Efficient And Compact Transport Layer And Model For An Advanced Metering Infrastructure (AMI) Network,” filed Nov. 25, 2007;Ser. No. 60/989,958 entitled “Creating And Managing A Mesh Network Including Network Association,” filed Nov. 25, 2007;Ser. No. 60/989,964 entitled “Route Optimization Within A Mesh Network,” filed Nov. 25, 2007;Ser. No. 60/989,950 entitled “Application Layer Device Agnostic Collector Utilizing ANSI C12.22,” filed Nov. 25, 2007;Ser. No. 60/989,953 entitled “System And Method For Real Time Event Report Generation Between Nodes And Head End Server In A Meter Reading Network Including From Smart And Dumb Meters,” filed Nov. 25, 2007;Ser. No. 60/989,956 entitled “System and Method for False Alert Filtering of Event Messages Within a Network”, filed Nov. 25, 2007;Ser. No. 60/989,975 entitled “System and Method for Network (Mesh) Layer And Application Layer Architecture And Processes,” filed Nov. 25, 2007;Ser. No. 60/989,959 entitled “Tree Routing Within a Mesh Network,” filed Nov. 25, 2007;Ser. No. 60/989,961 entitled “Source Routing Within a Mesh Network,” filed Nov. 25, 2007;Ser. No. 60/989,962 entitled “Creating and Managing a Mesh Network,” filed Nov. 25, 2007;Ser. No. 60/989,951 entitled “Network Node And Collector Architecture For Communicating Data And Method Of Communications,” filed Nov. 25, 2007;Ser. No. 60/989,955 entitled “System And Method For Recovering From Head End Data Loss And Data Collector Failure In An Automated Meter Reading Infrastructure,” filed Nov. 25, 2007;Ser. No. 60/989,952 entitled “System And Method For Assigning Checkpoints To A Plurality Of Network Nodes In Communication With A Device Agnostic Data Collector,” filed Nov. 25, 2007;Ser. No. 60/989,954 entitled “System And Method For Synchronizing Data In An Automated Meter Reading Infrastructure,” filed Nov. 25, 2007;Ser. No. 61/025,285 entitled “Outage and Restoration Notification within a Mesh Network”, filed Jan. 31, 2008;Ser. No. 60/992,312 entitled “Mesh Network Broadcast,” filed Dec. 4, 2007;Ser. No. 60/992,313 entitled “Multi Tree Mesh Networks”, filed Dec. 4, 2007;Ser. No. 60/992,315 entitled “Mesh Routing Within a Mesh Network,” filed Dec. 4, 2007;Ser. No. 61/025,279 entitled “Point-to-Point Communication within a Mesh Network”, filed Jan. 31, 2008, and which are incorporated by reference.Ser. No. 61/025,270 entitled “Application Layer Device Agnostic Collector Utilizing Standardized Utility Metering Protocol Such As ANSI C12.22,” filed Jan. 31, 2008;Ser. No. 61/025,276 entitled “System And Method For Real-Time Event Report Generation Between Nodes And Head End Server In A Meter Reading Network Including Form Smart And Dumb Meters,” filed Jan. 31, 2008;Ser. No. 61/025,282 entitled “Method And System for Creating And Managing Association And Balancing Of A Mesh Device In A Mesh Network,” filed Jan. 31, 2008;Ser. No. 61/025,271 entitled “Method And System for Creating And Managing Association And Balancing Of A Mesh Device In A Mesh Network,” filed Jan. 31, 2008;Ser. No. 61/025,287 entitled “System And Method For Operating Mesh Devices In Multi-Tree Overlapping Mesh Networks”, filed Jan. 31, 2008;Ser. No. 61/025,278 entitled “System And Method For Recovering From Head End Data Loss And Data Collector Failure In An Automated Meter Reading Infrastructure,” filed Jan. 31, 2008;Ser. No. 61/025,273 entitled “System And Method For Assigning Checkpoints to A Plurality Of Network Nodes In Communication With A Device-Agnostic Data Collector,” filed Jan. 31, 2008;Ser. No. 61/025,277 entitled “System And Method For Synchronizing Data In An Automated Meter Reading Infrastructure,” filed Jan. 31, 2008;Ser. No. 61/025,285 entitled “System and Method for Power Outage and Restoration Notification in An Automated Meter Reading Infrastructure,” filed Jan. 31, 2008; andSer. No. 61/094,116 entitled “Message Formats and Processes for Communication Across a Mesh Network,” filed Sep. 4, 2008. This application hereby references and incorporates by reference each of the following United States nonprovisional patent applications filed contemporaneously herewith: Ser. No. 12/275,236 entitled “Point-to-Point Communication within a Mesh Network”, filed Nov. 21, 2008;Ser. No. 12/275,305 entitled “Efficient And Compact Transport Layer And Model For An Advanced Metering Infrastructure (AMI) Network,” filed Nov. 21, 2008;Ser. No. 12/275,238 entitled “Communication and Message Route Optimization and Messaging in a Mesh Network,” filed Nov. 21, 2008;Ser. No. 12/275,242 entitled “Collector Device and System Utilizing Standardized Utility Metering Protocol,” filed Nov. 21, 2008;Ser. No. 12/275,245 entitled “System and Method for False Alert Filtering of Event Messages Within a Network,” filed Nov. 21, 2008;Ser. No. 12/275,252 entitled “Method and System for Creating and Managing Association and Balancing of a Mesh Device in a Mesh Network,” filed Nov. 21, 2008; andSer. No. 12/275,257 entitled “System And Method For Operating Mesh Devices In Multi-Tree Overlapping Mesh Networks”, filed Nov. 21, 2008.

US Referenced Citations (576)
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 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
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 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
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
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
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
8051415 Suzuki Nov 2011 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
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
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, 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
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 Chakroaborty et al. May 2009 A1
20090132220 Chakroborty 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
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
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
20110066297 Saberi et al. Mar 2011 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
International Search Report and Written Opinion for Application No. PCT/US09/05008, dated Oct. 22, 2009, 8 pp.
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. 1987).
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, 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.
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.
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 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.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.
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/13032, dated May 12, 2009, 14 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.
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.
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.
Reexamination Application No. 90/008,011, filed Jul. 24, 2006, 75 pp.
“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=X324101&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/.
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.
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.
Related Publications (1)
Number Date Country
20120179941 A1 Jul 2012 US
Provisional Applications (30)
Number Date Country
60989957 Nov 2007 US
60989967 Nov 2007 US
60989958 Nov 2007 US
60989964 Nov 2007 US
60989950 Nov 2007 US
60989953 Nov 2007 US
60989956 Nov 2007 US
60989975 Nov 2007 US
60989959 Nov 2007 US
60989961 Nov 2007 US
60989962 Nov 2007 US
60989951 Nov 2007 US
60989955 Nov 2007 US
60989952 Nov 2007 US
60989954 Nov 2007 US
61025285 Jan 2008 US
60992312 Dec 2007 US
60992313 Dec 2007 US
60992315 Dec 2007 US
61025279 Jan 2008 US
61025270 Jan 2008 US
61025276 Jan 2008 US
61025282 Jan 2008 US
61025271 Jan 2008 US
61025287 Jan 2008 US
61025278 Jan 2008 US
61025273 Jan 2008 US
61025277 Jan 2008 US
61025285 Jan 2008 US
61094116 Sep 2008 US
Continuations (1)
Number Date Country
Parent 12275254 Nov 2008 US
Child 13423160 US