Communication and message route optimization and messaging in a mesh network

Description

FIELD OF THE INVENTION

This invention pertains generally to methods and systems for routing communications and messages within a mesh network and more particularly to routing algorithms that optimize mesh network resource use.

BACKGROUND OF THE INVENTION

A mesh network is a wireless network configured to route data between mesh device nodes within the 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 nodes 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 mesh device Data management software. The infrastructure collects and distributes 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.

The mesh gate may interface between the mesh network and a server over a wide area network (WAN). Each mesh device may associate with a mesh network and mesh gate, leaving the mesh network vulnerable to a failure in the mesh gate. In addition, there may be limited paths between mesh devices within the mesh network.

SUMMARY OF THE INVENTION

An access point periodically calculates an optimal path from each associated mesh device to the access point. The access point also transmits the optimal path to each mesh device. A mesh network routes messages and other communications between nodes. Nodes of the mesh network can include a mesh gate and at least one mesh device. Tree routing may be used to determine an optimal route from a mesh device to the mesh gate via the mesh network by using neighbor information at each mesh device on the path. Source routing may be used to determine an optimal path from the mesh gate to a mesh device by using neighbor information of the entire mesh network at the mesh gate. Mesh routing may be used to determine an optimal route from a first mesh device to a second mesh device. Routes may be periodically optimized for a variety of performance factors.

In one aspect, there is provided a system for optimizing communication paths within a mesh network, including: means for initiating a mesh network, the mesh network including at least one mesh device; a receiver receiving registration information from each mesh device of the mesh network; a memory storage for storing mesh device information in an accessible memory; a processor logic, responsive to predetermined trigger, for calculating an optimal path from each mesh device, wherein the optimal path includes a set of mesh device addresses corresponding to a set of mesh devices along which a message can be forwarded; and a transmitter for transmitting the calculated optimal path to each mesh device.

In another aspect, there is provided a computer program stored in a computer readable form for execution within a processor and memory associated memory to execute a method for optimizing communication paths within a mesh network, including: initiating a mesh network, the mesh network including at least one mesh device; receiving registration information from each mesh device of the mesh network; storing mesh device information in an accessible memory; responsive to predetermined trigger, calculating an optimal path from each mesh device, wherein the optimal path includes a set of mesh device addresses corresponding to a set of mesh devices along which a message can be forwarded; and transmitting the calculated optimal path to each mesh device.

In another aspect, there is provided a method for transmitting a message over a mesh network via a routing, the method including: associating a first mesh device with a mesh network, the mesh network managed by an access point; and identifying a next mesh device from among a plurality of neighbor mesh devices, the next mesh device being identified by one of: (i) using tree routing comprising: receiving neighbor information from a set of neighboring mesh devices; and identifying the next mesh device by selecting a next mesh device from the set of neighboring mesh devices in response to a request to transmit a message to the access point, wherein the next mesh device is closer to the access point; (ii) using source routing comprising: identifying the next mesh device by receiving a next mesh device address from the access point, wherein the next mesh device is part of an optimal path to the access point; or (iii) using mesh routing comprising: broadcasting an optimal path query to neighboring mesh devices in response to a request to transmit a message to a receiving mesh device; receiving replies from the neighboring mesh devices; and identifying the next mesh device by selecting a next mesh device by calculating an optimal path, the optimal path including an address of a next mesh device.

In another aspect, there is provided a system for transmitting a message over a mesh network via a routing, the system including: means associating a first mesh device with a mesh network, the mesh network managed by an access point; and means for identifying a next mesh device from among a plurality of neighbor mesh devices, the next mesh device being identified by one of: (i) using tree routing comprising: receiving neighbor information from a set of neighboring mesh devices; and identifying the next mesh device by selecting a next mesh device from the set of neighboring mesh devices in response to a request to transmit a message to the access point, wherein the next mesh device is closer to the access point; (ii) using source routing comprising: identifying the next mesh device by receiving a next mesh device address from the access point, wherein the next mesh device is part of an optimal path to the access point; or (iii) using mesh routing comprising: broadcasting an optimal path query to neighboring mesh devices in response to a request to transmit a message to a receiving mesh device; receiving replies from the neighboring mesh devices; and identifying the next mesh device by selecting a next mesh device by calculating an optimal path, the optimal path including an address of a next mesh device.

In another aspect, there is provided a computer program stored in a computer readable form for execution within a processor and memory associated memory to execute a method for transmitting a message over a mesh network via a routing, the method including: associating a first mesh device with a mesh network, the mesh network managed by an access point; and identifying a next mesh device from among a plurality of neighbor mesh devices, the next mesh device being identified by one of: (i) using tree routing comprising: receiving neighbor information from a set of neighboring mesh devices; and identifying the next mesh device by selecting a next mesh device from the set of neighboring mesh devices in response to a request to transmit a message to the access point, wherein the next mesh device is closer to the access point; (ii) using source routing comprising: identifying the next mesh device by receiving a next mesh device address from the access point, wherein the next mesh device is part of an optimal path to the access point; or (iii) using mesh routing comprising: broadcasting an optimal path query to neighboring mesh devices in response to a request to transmit a message to a receiving mesh device; receiving replies from the neighboring mesh devices; and identifying the next mesh device by selecting a next mesh device by calculating an optimal path, the optimal path including an address of a next mesh device.

In another aspect, there is provided a method for transmitting a message over a mesh network via tree routing, the method including: associating a first mesh device with a mesh network, the mesh network managed by an access point; receiving neighbor information from a set of neighboring mesh devices; responsive to a request to transmit a message to the access point, selecting a next mesh device from the set of neighboring mesh devices, wherein the next mesh device is closer to the access point; and transmitting the message to the next mesh device.

In another aspect, there is provided a system for transmitting a message over a mesh network via tree routing, the system including: an association logic unit for associating a first mesh device with a mesh network, the mesh network managed by an access point; a receiver for receiving neighbor information from a set of neighboring mesh devices; a selection logic unit responsive to a request to transmit a message to the access point, selecting a next mesh device from the set of neighboring mesh devices, wherein the next mesh device is closer to the access point; and a transmitter for transmitting the message to the next mesh device.

In another aspect, there is provided a system for transmitting a message over a mesh network via tree routing, the system including: means for associating a first mesh device with a mesh network, the mesh network managed by an access point; means for receiving neighbor information from a set of neighboring mesh devices; means responsive to a request for transmitting a message to the access point, selecting a next mesh device from the set of neighboring mesh devices, wherein the next mesh device is closer to the access point; and means for transmitting the message to the next mesh device.

In another aspect, there is provided a method for transmitting a message over a mesh network via source routing, the method including: associating a first mesh device with a mesh network, the mesh network managed by an access point; receiving a next mesh device address from the access point, wherein the next mesh device is part of an optimal path to the access point; and responsive to a request to transmit a message to the access point, transmitting the message to the next mesh device.

In another aspect, there is provided a system for transmitting a message over a mesh network via source routing, the system including: an association logic unit for associating a first mesh device with a mesh network, the mesh network managed by an access point; a receiver for receiving a next mesh device address from the access point, wherein the next mesh device is part of an optimal path to the access point; and a transmitter responsive to a request to transmit a message to the access point, for transmitting the message to the next mesh device.

In another aspect, there is provided a system for transmitting a message over a mesh network via source routing, the system including: means for associating a first mesh device with a mesh network, the mesh network managed by an access point; means for receiving a next mesh device address from the access point, wherein the next mesh device is part of an optimal path to the access point; and means responsive to a request to transmit a message to the access point, for transmitting the message to the next mesh device.

In another aspect, there is provided a method for transmitting a message over a mesh network via mesh routing, the method including: associating a first mesh device with a mesh network, the mesh network managed by an access point; responsive to a request to transmit a message to a receiving mesh device, broadcasting an optimal path query to neighboring mesh devices; receiving replies from the neighboring mesh devices; calculating an optimal path, the optimal path including an address of a next mesh device; and transmitting the message to the next mesh device.

In another aspect, there is provided a system for transmitting a message over a mesh network via mesh routing, the system including: an association logic unit for associating a first mesh device with a mesh network, the mesh network managed by an access point; a transmitter responsive to a request to transmit a message to a receiving mesh device, for broadcasting an optimal path query to neighboring mesh devices; a receiver for receiving replies from the neighboring mesh devices; a processing logic for calculating an optimal path, the optimal path including an address of a next mesh device; the transmitter being adapted for transmitting the message to the next mesh device.

In another aspect, there is provided a method for route discovery within a mesh network via mesh routing, the method including: associating a first mesh device with a mesh network, the mesh network managed by an access point; responsive to receiving an optimal path query from a sending mesh device, re-broadcasting the optimal path query to neighboring mesh devices; responsive to receiving an optimal path reply, calculating an optimal path; and replying to the sending mesh device with the optimal path.

In another aspect, there is provided a system for route discovery within a mesh network via mesh routing, the system comprising: means associated with a mesh network, the mesh network managed by an access point; means responsive to receiving an optimal path query from a sending mesh device, for re-broadcasting the optimal path query to neighboring mesh devices; means responsive to receiving an optimal path reply, for calculating an optimal path; and means for replying to the sending mesh device with the optimal path.

In another aspect, there is provided a computer program stored in a computer readable form for execution within a processor and memory associated memory to execute a method for route discovery within a mesh network via mesh routing, the method including: associating a first mesh device with a mesh network, the mesh network managed by an access point; responsive to receiving an optimal path query from a sending mesh device, re-broadcasting the optimal path query to neighboring mesh devices; responsive to receiving an optimal path reply, calculating an optimal path; and replying to the sending mesh device with the optimal path.

Other aspects and features will be apparent from the included description, drawings, and accompanying claims.

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. 1A illustrates an example system for providing communications in an AMI system utilizing a tree routing scheme.

FIG. 1B illustrates an example system for providing communications in an AMI system utilizing a source routing scheme.

FIG. 1C illustrates an example system for providing communications in an AMI system utilizing a mesh routing scheme.

FIG. 1D illustrates an example system for optimizing routes within a mesh network.

FIG. 2A illustrates an example mesh device 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 tree routing and route optimization in a mesh network.

FIG. 4B illustrates an example procedure for source routing in a mesh network.

FIG. 4C illustrates an example procedure for mesh routing scheme in a mesh network.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1A illustrates an example system for providing communications in an AMI system utilizing a tree routing scheme. A mesh device wishing to send a message to the mesh gate may look up a neighbor information table and select a neighbor closer to the mesh gate. A mesh gate may also be referred to as a NAN-WAN (Neighborhood Area Network-Wide Area Network) gate or an access point. Other fields stored in the neighbor information table may include a path signal quality. The message may be transmitted to the neighbor for forwarding to the mesh gate. The neighbor information table may be updated via periodic neighbor information exchanges with neighboring mesh devices.

When the forwarding mesh device receives the message, it also looks up a neighbor information table and selects a mesh device closer to the mesh gate. In this way, the message is transmitted from one mesh device to another, until it reaches the mesh gate. A temporary path may be created at each forwarding mesh device. The temporary path may allow a response to be transmitted back to the sending mesh device, if required. Temporary paths may be stored in a memory of forwarding mesh devices for a predetermined interval.

In the example of FIG. 1A, the mesh network A 100 may include a plurality of mesh gates and mesh devices, such as meters, which together cover a geographical area. In a non-limiting embodiment for an urban or metropolitan geographical area, there may be between 1 and 100 mesh gates, but 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 may include utilities sensors and 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. Alternative mesh devices include thermostats, user displays, and other components for monitoring and controlling utilities.

In the example of FIG. 1A, the mesh gate A 102 may provide a gateway between the mesh network and a server. The mesh gate A 102 may include a mesh radio to communicate with mesh devices on the mesh network and a WAN communication interface to communicate with a server over the WAN.

In the example of FIG. 1A, the mesh gate A 102 may aggregate information from meters within the mesh network and transmit the information to the server. The mesh gate A may also forward individual communications from a mesh device to the server. While only one mesh gate is depicted in the mesh network A, any number of mesh gates may be deployed, for example, to improve transmission bandwidth to the server and provide redundancy in the mesh network.

The mesh gate may also be known as a collector, a concentrator, or an access point.

In the example of FIG. 1A, the meters A 104, B 106, C 108, D 110, E 112, and F 114 may each be a mesh device associated with the mesh network A through direct or indirect communications with the mesh gate A. Each meter may forward transmissions from other meters within the mesh network towards the mesh gate. While only six meters are depicted, any number of meters may be deployed to cover any number of utility lines or locations within the mesh network.

In the example of FIG. 1A, 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 mesh device D 110. Similarly, meter C 108 can reach mesh gate A 102 through mesh device E 112 and mesh device D 110.

In the example of FIG. A, the WAN 116 may be a 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, an Ethernet network, or any other network.

In the example of FIG. 1A, the server 118 may be a computing device configured to receive information, such as meter readings, from a plurality of mesh networks and meters. The server 118 may also be configured to transmit instructions and queries to the mesh networks, mesh gates, and meters.

In one example embodiment, the server 118 is known as a “head end server” or “head end.”

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 A102 and the server 118 can maintain a table of available applications and services and requesting mesh devices.

In an alternative, any number of servers may be deployed in the AMI system. For example, servers may be distributed by geographical location for shorter communication distances and latency times. Redundant servers may provide backup and failover capabilities in the AMI system.

In the example of FIG. 1A, 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, similar to the mesh network A 102. 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. Each mesh network may include a plurality of meters (not depicted).

In the example of FIG. 1A, each mesh network may include meters covering 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.

In the example of FIG. 1A, in operation, an AMI system may facilitate communications between the system components. Mesh device E 112 may need to transmit a message to the mesh gate A and utilize a tree routing scheme. For example, the mesh device E may look up its neighbor information table and realize mesh device D is one hop from the mesh gate A. Because mesh device E is two hops from the mesh gate A, it may select mesh device D and transmit a message for forwarding to mesh device D. Mesh device D may receive the message, determine it is addressed to the mesh gate A, and forward the message. Mesh device D may also store mesh device E as the next hop on the temporary route.

In the example of FIG. 1A, after mesh gate A receives the message, an optional response may be sent. Mesh gate A may transmit the response to mesh device D, which checks its temporary route table and retrieves mesh device E as the next hop for the message. Thus, mesh device E may receive a response from the mesh gate, if one is required.

FIG. 1B illustrates an example system for providing communications in an AMI system utilizing a source routing scheme. The mesh network A may be as discussed above, including a plurality of mesh devices and at least one mesh gate.

In the example of FIG. 1B, in operation, an AMI system may facilitate communications between the system components. The mesh gate A may need to transmit a message to the mesh device E and utilize a source routing scheme. Each mesh device may maintain a neighbor information table which stores information on neighboring mesh devices. Each mesh device may periodically transmit its neighbor information table to the mesh gate A.

In the example of FIG. 1B, with the neighbor information tables of all mesh devices in the mesh network, the mesh gate may determine an optimal path to a target mesh device. The mesh gate A looks up the neighbor information table of the target mesh device and determines an optimal next hop towards the mesh gate. The mesh gate A looks up the neighbor information table of the next hop mesh device, and determines an optimal next hop. In this way, the mesh gate A may backtrack an optimal path from the target mesh device to the mesh gate A, reverse it, and arrive at the optimal path to the target mesh device. Because the mesh gate is equipped with more computing resources and memory as compared to the mesh devices, the above calculations will not put an undue burden on mesh gate functions.

In the example of FIG. 1B, source routing may be used when sending information to mesh devices, such as clock synchronization commands or other instructions. The mesh gate may further maintain a device registrar, including a status associated with each mesh device in the mesh network. For example, a meter status may be: alive, powered down, or not responding. Meters that are not responding may be removed from the device registrar after a predetermined period.

In the example of FIG. 1B, a temporary path is not required, because each mesh device already stores an optimal next hop towards the mesh gate. Any response that needs to be sent will be forwarded using the above discussed tree routing scheme.

FIG. 1C illustrates an example system for providing communications in an AMI system utilizing a mesh routing scheme. The mesh network A may be as discussed above, including a plurality of mesh devices and at least one mesh gate.

In the example of FIG. 1C, in operation, an AMI system may facilitate communications between the system components. A source mesh device may need to transmit a message to a target mesh device. Each mesh device may maintain a temporary path table, storing information on a next hop in a mesh route. The mesh route may be determined through a mesh device-initiated route discovery routine.

In the example of FIG. 1C, mesh routing may be used when a meter needs to communicate with another meter, and avoids burdening the mesh gate with forwarding functions. When a source mesh device transmits a message, the message is forwarded by intermediate mesh devices in accordance with an entry in the temporary path tables. The temporary route may include a return path, allowing bilateral communications.

In the example of FIG. 1C, a thermostat may transmit a current temperature setting to other thermostats in a residence, maintaining a universal temperature setting for the residence. In an alternative, a power usage sensor may transmit real-time electricity usage information to a display unit. The display unit may be configured to display electricity usage information to a user and provide audible or other alerts.

In the example of FIG. 1C, the temporary path table may include a destination mesh device, a number of hops to the destination meter, and a next hop. When the mesh device receives a message with a destination address, it determines the appropriate next hop by looking up the temporary path table. Entries in the temporary path table may be periodically cleared if not used.

In the example of FIG. 1C, the temporary path table may be populated through a route discovery request transmitted from the source mesh device. The route discovery request is re-broadcasted by each mesh device until a path to the target mesh device is found.

In an alternative, the temporary path table may be populated by the mesh gate. The mesh gate may determine an optimal mesh routing path and transmit a temporary path table entry to each mesh device along the path.

In the example of FIG. 1C, mesh device E may desire to transmit a message to mesh device B. The message may be received at mesh device D for forwarding. Mesh device D may parse the message to determine the addressee is mesh device B. Mesh device D then looks up its path table previously populated from a neighbor exchange, to determine the path to mesh device B.

In the example of FIG. 1C, mesh device D sees that mesh device B 106 is one hop away from the table entry. Therefore, Mesh device D forwards the messages to mesh device B. Mesh device D also creates a temporary route entry, noting the return path for any possible responses from mesh device B to mesh device E.

FIG. 1D illustrates an example system for optimizing routes within a mesh network. The mesh network A may be as discussed above, including a plurality of mesh devices and at least one mesh gate.

In the example of FIG. 1D, in operation, an AMI system may facilitate communications between the system components. The mesh device C 108 may need to transmit a message to the mesh gate A 102. If there are multiple paths available, the mesh gate will need to select the optimal path. For example, a best path between the mesh device and the mesh gate may be selected based on a number of hops and a path signal quality. Mesh devices may periodically exchange neighbor information in a neighbor exchange. A more detailed discussion of the exchange neighbor information is found in U.S. patent applications Ser. No. 12/275,252 (TR0020) filed contemporaneously herewith on Nov. 21, 2008 entitled “METHOD AND SYSTEM FOR CREATING AND MANAGING ASSOCIATION AND BALANCING OF A MESH DEVICE IN A MESH NETWORK,” which is incorporated herein by reference.

In the example of FIG. 1D, an optimal path selection routine may be executed by mesh devices at periodic intervals, for example, once every 24 hours. Changing the optimal path may be limited to provide enough time for mesh devices within the mesh network to update neighborhood tables responsive to the neighbor information exchanges. In addition, each mesh device may need time to transmit newly received neighbor information.

In the example of FIG. 1D, the path signal quality may be measured as a link quality index (LQI). A route may be selected if it has an acceptable LQI. An LQI may have a value of: 3 for Excellent, 2 for Good, 1 for Poor, 0 for No connectivity. A quality of a path may be equal to the worst LQI of the links that comprise the path. For example, the LQI may be used only for route selection but not optimization, to prevent excessive instability in the route tree.

In the example of FIG. 1D, a prospective route may be selected to replace an existing route if it has a better link quality, a lesser number of hops, or any other quality or quantitative measure. When the prospective route is selected, it will be used for future communications.

In the example of FIG. 1D, mesh device C may have two paths to mesh gate A: mesh device E->mesh device D->mesh gate A or mesh device E->meter F->mesh gate A. One of the two paths may be selected based on link quality, number of hops, or any combination of factors.

In the example of FIG. 1D, the path may be selected based on a weighted value of the best route information. For each prospective path, a path value may be calculated. For example, 30% of the calculation may be based on the number of hops in the path, 30% based on the minimum LQI along the path, and 40% on the sum LQI of the path. The path with the highest percentage is selected as the optimal route.

In an alternative, the weighting may be dynamically modified to suit the circumstances. For example, if the system detects high traffic congestion, the path value may include a larger weight on the number of hops. In a high traffic network, it may be desirable to reduce the number of hops if possible, even at the expense of lower signal quality.

In an alternative, if the system detects high radio noise, the path value may include a larger weight on signal quality. In a high noise environment, it may be desirable to seek out a path with the best signal to reduce retransmissions.

It will be appreciated that the mesh gate A 102 can maintain a tree structure of optimal paths to each node within the mesh network. This tree can be updated over time as nodes are added and removed from the mesh network and signal quality/strength change. In this way, an optimal path to each node is always available and updated.

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.

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

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.

In the example of FIG. 2A, the mesh device 200 may communicate with a mesh gate and other mesh devices over a mesh network. For example, the mesh device 200 may be a gas, water or electricity meter installed in a residential building or other location to monitor utilities usage. The mesh device 200 may also control access to utilities on server instructions, for example, by reducing or stopping the flow of gas, water or electricity. In an alternative, the mesh device 200 may be a mobile asset that needs to be tracked by the AMI system.

In the example of FIG. 2A, 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 radio 202 may also communicate with an off-network device not associated with the mesh network.

In the example of FIG. 2A, the communication card 204 may interface between the radio and the sensor. Sensor readings or other data may be converted to radio signals for transmission over the radio. The communication card 204 may include encryption/decryption functionality or other security measures to protect the transmitted data. The communication card 204 may also decode instructions received from the server.

In the example of FIG. 2A, the optional 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 water or gas flowing into 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.

In an alternative, the optional metering sensor may be replaced by another component for performing functions within the AMI system. For example, the mesh device may provide a user interface, such as a thermostat or other utilities control. In this example, the metering sensor may be replaced with a thermostat interface. For example, the mesh device may provide a display screen. In this example, the metering sensor may be replaced with a LCD display screen displaying information for the user. For example, the mesh device may be a simple repeater for extending the range of the mesh network. In this example, the mesh device may simply receive and re-transmit mesh transmissions on the mesh network.

In the example of FIG. 2A, the battery 208 may be configured to independently power the mesh device during a power outage. For example, the battery 208 may be a large capacitor storing electricity to power the meter 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. Alternative battery technologies may be used, for example, galvanic cells, electrolytic cells, fuel cells, flow cells, and voltaic cells.

In the example of FIG. 2A, the memory 210 may store instructions and run-time variables for execution. For example, the memory 210 may include both volatile and non-volatile memory. The memory 210 may also store a history of sensor readings from the metering sensor 206 and an incoming queue of server instructions.

In the example of FIG. 2A, the mesh device may also include a memory in additional to 210. A neighbor table may be stored in memory accessible by the mesh device. For example, the neighbor table may store a best parent field, a best five parents field, a mesh gate load field, a number of hops to the mesh gate field, and a mesh gate path signal quality field. The neighbor table information may be transmitted to other mesh devices in a neighbor exchange and also transmitted to a mesh gate. The neighbor table may be used to determine a best route on the mesh network for a message to be transmitted.

In the example of FIG. 2A, the processor 212 may execute instructions, for example, stored in the memory. 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.

In the example of FIG. 2A, the transceiver 214 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. The transceiver 214 may receive server instructions from a server, which are communicated to the memory and the processor.

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.

In the example of FIG. 2A, each component may be modular and configured for easy removal and replacement. This facilitates component upgrading over a lifetime of the meter as new functionality are developed and deployed in the AMI system.

In the example of FIG. 2A, 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 flowing through the line. 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.

In the example of FIG. 2A, in operation, the mesh device 200 may communicate over a mesh network and directly with an off-network device via the radio 202. The communication card 204 may interface between the metering sensor 206 and the radio 202. For example, sensor readings may be transmitted to and instructions received from a server. In addition, the mesh device may participate in the mesh network by forwarding any messages that require forwarding to a next mesh device on a dynamically determined or pre-determined path.

In an alternative, mesh devices may be similar to meters except the metering sensor is replaced by whatever component is necessary to perform the mesh device's function. For example, a user display may include an output screen. For example, a thermostat may include a dial for receiving user input and an analog/digital converter to produce an input signal.

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 hardware necessary, and the MCU 216 executes any necessary firmware or software.

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 also include a WAN interface 234, a battery 236 and a processor 238. The mesh gate 230 may interface between mesh devices such as meters over a mesh network and a server over a WAN. The mesh gate 230 may be installed in a central location relative to the meters and also communicate with a server over a WAN.

In the example of FIG. 2B, 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.

In the example of FIG. 2B, 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 functionality or other security measures to protect data being transmitted to and from the server.

In the example of FIG. 2B, 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.

In the example of FIG. 2B, 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 transmission to the server. Server instructions may be received from the WAN interface 234 and transmitted to meters in the mesh network for execution. Server instructions may also be received from the WAN interface 234 for execution by the processor 238.

In the example of FIG. 2B, an accessible memory may store neighbor information for all mesh devices within the mesh network and associated with the mesh device. For example, neighbor information for each mesh device may include a best parent field, a best five parents field, a mesh gate load field, a number of hops to the mesh gate field, and a mesh gate path signal quality field. The neighbor table information may be exchanged between mesh devices and also transmitted to the mesh gate. The mesh gate may be configured to calculating various routing based on the compiled neighbor table.

In the example of FIG. 2B, 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.

In the example of FIG. 2B, 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.

In the example of FIG. 2B, the mesh gate may include an additional memory configured to store values in the execution of mesh gate functions. For example, a history of meter readings, status updates may be stored for future retrieval. In addition, a neighbor table of the mesh table associated with the mesh gate may be stored. The neighbor table may be used to determine a best path through the mesh network for messages.

In the example of FIG. 2B, 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.

In the example of FIG. 2B, 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.

In the example of FIG. 2B, in operation, the 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. The mesh gate may also function as a node within the mesh network, by forwarding messages between mesh devices.

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

In the example of FIG. 3, the radio 300 may be a mesh radio installed in a mesh gate, a mesh device or an off-network device. 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 or communicate with other mesh devices. The radio 300 may be configured to transmit wireless signals over a predetermined or dynamically determined frequency to other radios.

In the example of FIG. 3, 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, such as software executing on an electricity meter or a mesh gate.

In the example of FIG. 3, 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 may be implemented as ANSI C12.12/22.

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

In the example of FIG. 3, the network layer 308 is responsible for end to end (source to destination) packet delivery. The layer's functionality 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. For example, the network layer 308 may translate a short address into a network address.

In the example of FIG. 3, 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 provides functionality including transferring data between network entities and error correction/detection. For example, the layer may be implemented as IEEE 802.15.4.

In the example of FIG. 3, 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 provides an electrical, mechanical, and procedural interface to the transmission medium. For example, the layer may be implemented as IEEE 802.15.4.

In the example of FIG. 3, in operation, 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. The illustrated network stack may facilitate intra-mesh network communication by utilizing a short address to identify addressees.

FIG. 4A illustrates an example procedure for tree routing and route optimization in a mesh network. The procedure may execute on a mesh device participating in a mesh network. The procedure may allow the mesh device to transmit a message to the mesh gate via an optimal route. For example, the message may be a meter reading, a status report, a request, or any other communication. The procedure may also allow the mesh device to optimize the selected route over time as neighbor information is received and network situation changes.

In the example of FIG. 4A, in 4002, the mesh device may associate with a mesh network. The mesh device may attempt to detect nearby neighboring mesh devices or mesh gates, and transmit an association request. The association request may be forwarded by neighboring mesh devices to the mesh gate, and an association acknowledgement may be sent in response. The mesh device may then be associated with the mesh gate and thereafter participate in the mesh network as a node. Additional details regarding the association process are described in U.S. patent application Ser. No. 12/275,252 (TR0020) filed contemporaneously herewith on Nov. 21, 2008 entitled “METHOD AND SYSTEM FOR CREATING AND MANAGING ASSOCIATION AND BALANCING OF A MESH DEVICE IN A MESH NETWORK,” which is incorporated herein by reference.

In one embodiment, an association request can initiate a neighbor information exchange. The neighbor information exchange can include a signal quality in both directions. In some situations, it is possible to have a good signal quality from a first node to a second node in a mesh network, but bad signal quality from the second node to the first node.

After the initial association request, the mesh device will periodically transmit a keep-alive message to the mesh gate. Each keep-alive message will store a return path to the transmitting mesh device in a message header. This path can be saved at the mesh gate.

In the example of FIG. 4A, in 4004, the mesh device may receive neighbor information in a neighbor exchange with at least one neighbor. Mesh devices in the mesh network may periodically transmit neighbor information about themselves and their neighbors. For example, neighbor information may be transmitted at a random time within an interval, such as every 60 minutes. By transmitting at a random time, collisions are avoided within the mesh network. The neighbor information may include a next hop to the mesh gate, a path signal quality, and a number of hops to the mesh gate.

In the example of FIG. 4A, in 4006, the mesh device may optionally test whether the received neighbor information indicates a better neighbor. For example, the mesh device may compare entries in its neighbor information table with the received neighbor information. A neighbor may be associated with a score, calculated as a formula. For example, the formula may weight a path signal quality and a number of hops to the mesh gate to calculate the score. The mesh device may compare the calculated scores. If a better neighbor is available with a better score, the mesh device may proceed to 4008. If the neighbor information does not indicate a better neighbor, the mesh device may proceed to 4010.

In the example of FIG. 4A, in 4008, the mesh device may optionally update a neighbor information table entry. For example, the neighbor information table may be updated responsive to newly received neighbor information. For example, the neighbor information table may be updated if a better neighbor has been selected based on a better path to the mesh gate.

In the example of FIG. 4A, in 4010, the mesh device may optionally receive a transmission for forwarding. For example, the transmission may be received from a child mesh device that is further away from the mesh gate. The child mesh device may wish to transmit the message to the mesh gate and had selected the mesh device as the next mesh device.

In the example of FIG. 4A, in 4012, the mesh device may test whether a message is to be transmitted to the mesh gate. For example, the mesh device may receive a message for forwarding from a child mesh device, as discussed above. In an alternative, the mesh device may execute an application that requires a message to be transmitted to the mesh gate. For example, the application may need to report a meter sensor reading, a status update, or any other communication to the mesh gate. If a message is to be transmitted to the mesh gate, the mesh device may proceed to 4014. If no message is to be transmitted, the mesh device may continue to function as a node in the mesh network and proceed to 4004.

In the example of FIG. 4A, in 4014, the mesh device may select a next mesh device. For example, the next mesh device may be selected from the neighbor information table as being closer to the mesh gate and has an acceptable path score. For example, the path score may be determined, in part, based on a path signal quality and a number of hops to the mesh gate to calculate the score.

In the example of FIG. 4A, in 4016, the mesh device may optionally insert an address of the next mesh device in a message header. For example, the address of the next mesh device may be retrieved from the neighbor information table.

In the example of FIG. 4A, in 4018, the mesh device may transmit the message to the next mesh device. For example, the message may be broadcast on a mesh network frequency or channel and received by the next mesh device. The next mesh device may check the message header, extract the destination address, and verify it is the intended recipient of the message. The next message may also extract a flag indicating the message is to be forwarded to the mesh gate.

In the example of FIG. 4A, in 4020, the mesh device may optionally store a temporary path. For example, the temporary path may be stored as a temporary path table entry and include a transmitting mesh device and a receiving mesh device. The entry may be created when a message is received at the mesh device for forwarding. The mesh device stores the intended destination and the transmitting mesh device. The entry may be used when an optionally response is sent back from the destination mesh device. The mesh device looks up the temporary path table and retrieves the transmitting mesh device's address, and can therefore forward the response onwards.

In the example of FIG. 4A, in 4022, the mesh device may optionally test whether an acknowledgement was received. For example, the next mesh device may be configured to reply with an acknowledgement when the message is received. In this way, each mesh device is responsible for forwarding the message onwards to the next mesh device. If an acknowledgement was received, the mesh device may continue functioning as a node in the mesh network and proceed to 4004. If no acknowledgement was received, the mesh device may proceed to 4024.

In the example of FIG. 4A, in 4024, the mesh device may optionally select a second best mesh device from the neighbor information table. If the next mesh device has failed to transmit an acknowledgement, it may have failed and therefore be unable to forward the message. The mesh device may then select a second best mesh device to forward the message.

In the example of FIG. 4A, in 4026, the mesh device may optionally transmit the message to the second best mesh device. The second best mesh device's addresses may be added to the message header and the message broadcasted on the mesh network's channel or frequency.

In an alternative, if an acknowledgement is not received from the second best mesh device, the mesh device may continue attempting to transmit the message to alternative mesh devices in decreasing order of a path score.

In the example of FIG. 4A, in operation, a mesh device may transmit messages to the mesh gate and also forward messages from child mesh devices to the mesh gate. The messages are transmitted to the next mesh device, closer to the mesh gate, for further forwarding. The mesh device may provide retry functionality in case the next mesh device fails to acknowledge the message. The mesh device may also update its neighbor information table and select a more optimal next mesh device responsive to periodic neighbor information exchanges. In this way, simple mesh devices with limited computing resources will always have an optimal path over which to transmit a message to the mesh gate.

FIG. 4B illustrates an example procedure for source routing in a mesh network. The procedure may execute on a mesh gate participating in a mesh network. The procedure may allow the mesh gate to transmit a message to a target mesh device on the mesh network via an optimal route. For example, the message may be an instruction, a query, or any other communication.

In the example of FIG. 4B, in 4102, the mesh gate may associate with a mesh network. The mesh gate may reply with association acknowledgements when it receives association requests from nearby mesh devices. If a mesh device is not in direct radio contact with a mesh device, the association request and acknowledgement may be forwarded by a neighboring mesh device.

In the example of FIG. 4B, in 4104, the mesh gate may receive neighbor information from mesh devices within the mesh network. Mesh devices may periodically transmit neighbor information about themselves and their neighbors. For example, neighbor information may be transmitted at a random time within an interval, such as every 60 minutes. By transmitting at a random time, collusions are avoided within the mesh network. The neighbor information may include a next hop to the mesh gate, a path signal quality, and a number of hops to the mesh gate. The mesh gate may compile the neighbour information into a master neighbour information table.

In the example of FIG. 4B, in 4106, the mesh gate may optionally receive a transmission for forwarding. For example, the transmission may be received from a mesh device for forwarding to another mesh device. With the mesh gate's greater computing resources and complete neighbor information for each mesh device in the network, having the mesh gate route all inter-mesh device communications may improve performance.

In the example of FIG. 4B, in 4108, the mesh gate may test whether a message is to be transmitted to the target mesh device. For example, the mesh gate may receive a message for forwarding from a source mesh device, as discussed above. In an alternative, the mesh gate may execute an application that requires a message to be transmitted to the target mesh device. For example, the application may transmit a query, a mesh device instruction, or any other communication. If a message is to be transmitted to the target mesh device, the mesh gate may proceed to 4110. If no message is to be transmitted, the mesh gate may continue to function in the mesh network and proceed to 4104.

In the example of FIG. 4B, in 4110, the mesh gate may determine a mesh network path to the target mesh device. For example, the mesh gate may look up the target mesh device's neighbor information table and execute a tree routing routine to determine an optimal path from the target mesh device to the mesh gate. Because the neighbor information table for each mesh device in the mesh network is stored in the mesh gate, calculating the optimal path is straightforward. The route will then be reversed for the optimal path from the mesh gate to the target mesh device.

In the example of FIG. 4B, in 4112, the mesh gate may optionally insert an address of the next mesh device in a message header. The mesh gate may also insert the complete path with addresses of each intermediate mesh device in the message header or as part of the message body.

In the example of FIG. 4B, in 4114, the mesh device may transmit the message to the next mesh device. For example, the message may be broadcasted on a mesh network frequency or channel and received by the next mesh device. The next mesh device may check the message header, extract the destination address, and verify it is the intended recipient of the message. The next message may also extract a flag indicating the message is to be forwarded to the target mesh device, and therefore extract an address of the next mesh device from the message header or body and insert it into the message header. The next mesh device may then forward the message onwards.

In the example of FIG. 4B, in 4116, the mesh gate may optionally test whether an acknowledgement was received. For example, the next mesh device may be configured to reply with an acknowledgement when the message is received. In this way, each mesh device is responsible for forwarding the message onwards to the next mesh device. If an acknowledgement was received, the mesh gate may continue functioning in the mesh network and proceed to 4108. If no acknowledgement was received, the mesh gate may proceed to 4118, where an alternative mesh device is selected for a retry.

In the example of FIG. 4B, in 4118, the mesh gate may optionally select a second best mesh device from the neighbor information table. If the next mesh device has failed to transmit an acknowledgement, it may have failed and therefore be unable to forward the message. The mesh gate may then select a second best mesh device to forward the message.

In the example of FIG. 4B, in 4120, the mesh gate may optionally transmit the message to the second best mesh device. An alternative mesh network path may be calculated including the second best mesh device and added to the message. The second best mesh device's addresses may be added to the message header and the message broadcasted on the mesh network's channel or frequency.

In an alternative, if an acknowledgement is not received from the second best mesh device, the mesh gate may continue attempting to transmit the message to alternative mesh devices in decreasing order of a path score.

In the example of FIG. 4B, in operation, a mesh gate may transmit messages to the target mesh device and also forward any messages to the target mesh device. The messages are transmitted to the next mesh device, closer to the target mesh device, for further forwarding. The mesh gate may provide retry functionality in case the next mesh device fails to acknowledge the message. The mesh gate may also update a master neighbor information table responsive to periodic neighbor information exchanges.

FIG. 4C illustrates an example procedure for mesh routing scheme in a mesh network. The procedure may execute on a mesh device participating in a mesh network. The procedure may allow the mesh device to transmit a message to a target mesh device via an optimal route. For example, the message may be a mesh device instruction, a status report, a request, or any other communication. In one example, a thermostat may transmit a temperature setting to a heater. In another example, an electricity meter may transmit real-time electricity consumption to a display unit.

In the example of FIG. 4C, in 4202, the mesh device may associate with a mesh network. The mesh device may attempt to detect nearby neighboring mesh devices or mesh gates, and transmit an association request. The association request may be forwarded by neighboring mesh devices to the mesh gate, and an association acknowledgement may be sent in response. The mesh device may then be associated with the mesh gate and thereafter participate in the mesh network as a node.

In the example of FIG. 4C, in 4204, the mesh device may receive neighbor information in a neighbor exchange with at least one neighbor. Mesh devices in the mesh network may periodically transmit neighbor information about themselves and their neighbors. For example, neighbor information may be transmitted at a random time within an interval, such as every 60 minutes. By transmitting at a random time, collisions are avoided within the mesh network. The neighbor information may include a next hop to the mesh gate, a path signal quality, and a number of hops to the mesh gate.

In the example of FIG. 4C, in 4206, the mesh device may optionally receive a transmission for forwarding. For example, the transmission may be received from a child mesh device that is further away from the target mesh device. The child mesh device may wish to transmit the message to the target mesh device and had selected the mesh device as the next mesh device.

In the example of FIG. 4C, in 4208, the mesh device may test whether a message is to be transmitted to the target mesh device. For example, the mesh device may receive a message for forwarding from a child mesh device, as discussed above. In an alternative, the mesh device may execute an application that requires a message to be transmitted to the target mesh device. For example, the application may need to transmit a meter sensor reading, a status update, or any other communication. If a message is to be transmitted to the target mesh device, the mesh device may proceed to 4210. If no message is to be transmitted, the mesh device may continue to function as a node in the mesh network and proceed to 4204.

In the example of FIG. 4C, in 4210, the mesh device may execute a route discovery routine. For example, the route discovery may include a broadcasted request for a path to the target mesh device. Every mesh device that receives the requests checks if it is the target mesh device. If yes, it replies, and its answer is forwarded back to the mesh device with the path. If no, the request may be re-broadcasted. This may result in one or more routes to the target mesh device.

In one embodiment, route discovery can restrict re-broadcasting by signal quality. For example, in a first pass, mesh devices will only re-broadcast to neighbors where a signal exceeds a first threshold. In subsequent passes, the threshold is lowered. In this way, a highest quality signal quality path will be found.

In the example of FIG. 4C, in 4212, the mesh device may select a next mesh device. From the one or more routes discovered above, one path may be selected based on a path score. For example, the path score may be determined, in part, based on a path signal quality and a number of hops.

In the example of FIG. 4C, in 4214, the mesh device may optionally insert an address of the next mesh device in a message header. For example, the address of the next mesh device may be retrieved from the neighbor information table.

In the example of FIG. 4C, in 4216, the mesh device may transmit the message to the next mesh device. For example, the message may be broadcasted on a mesh network frequency or channel and received by the next mesh device. The next mesh device may check the message header, extract the destination address, and verify it is the intended recipient of the message. The next message may also extract a flag indicating the message is to be forwarded to the mesh gate.

In the example of FIG. 4C, in 4218, the mesh device may optionally store a temporary path. For example, the temporary path may be stored as a temporary path table entry and include a transmitting mesh device and a receiving mesh device. The entry may be created when a message is received at the mesh device for forwarding. The mesh device stores the intended destination and the transmitting mesh device. The entry may be used when an optionally response is sent back from the destination mesh device. The mesh device looks up the temporary path table and retrieves the transmitting mesh device's address, and can therefore forward the response onwards.

In the example of FIG. 4C, in operation, a mesh device may transmit messages to the target mesh device and also forward messages from child mesh devices to the target mesh device. The messages are transmitted to the next mesh device, closer to the target mesh device, for further forwarding along a discovered route.

In an alternative, the route discovery may be executed by a mesh gate accessing the neighbor information of all mesh devices within the mesh network. In this example, the mesh gate may transmit messages to each mesh device along the path, the messages including an entry for the temporary path table of each mesh device to create the mesh route.

In the above procedures, a neighbor exchange can be used to update neighbor information and routing tables. Each mesh device associated with a mesh network periodically generates and transmits a neighbor exchange message that is broadcasted to nearby mesh devices. Each receiving mesh device will also determine a signal quality of the received broadcast, which is stored in a neighborhood table associated with the transmitting mesh device.

An access point such as a NAN-WAN gate and also described as a mesh gate in this and in related applications, may perform any one or more of many different functions including for example, but not limited to, one or any combination of: relaying information from a server (such as to a head end server) to the mesh network nodes, routing information, aggregating information from the nodes and microportals within any sub-network that may be configured for transmission to a server (such as to the head end server), acting as a HAN coordinator, acting as a NAN-WAN gate, transmitting firmware upgrades, and/or multicasting messages. A mesh gate may also be referred to as a collector because it collects information from the NAN-associated or other nodes and/or microportals in its sub-network.

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 optimizing communication paths within a mesh network, comprising: initiating a mesh network, the mesh network including at least one mesh device;receiving registration information from each mesh device of the mesh network;storing mesh device information in an accessible memory;responsive to a predetermined trigger, calculating an optimal path from each mesh device, wherein the optimal path includes a set of mesh device addresses corresponding to a set of mesh devices along which a message can be forwarded;transmitting the calculated optimal path to each mesh device;receiving, by the at least one mesh device, a request to transmit a message to a next mesh device; andidentifying, by the at least one mesh device, the next mesh device from among a plurality of neighbor mesh devices, wherein identifying the next mesh device further comprises calculating, by the at least one mesh device, a score for a next mesh device according to the calculated optimal path, and a score for an alternative next mesh device according to an alternate optimal path based on at least a link quality index corresponding to signal quality of the alternate optimal path, the link quality index included in neighbor information received in a neighbor exchange from at least one neighbor mesh device and selecting, based on a comparison of the calculated scores, one of the next mesh device according to the calculated optimal path and the alternative next mesh device according to the alternate optimal path.
2. The method of claim 1, wherein the predetermined trigger is selected from the set consisting of a time, a period, the occurrence of an event, the non-occurrence of an event, or any combination of two or more of these.
3. The method of claim 1, further comprising: storing the associated optimal path in the accessible memory for each mesh device.
4. The method of claim 1, further comprising: receiving a message from a mesh device transmitted along the associated optimal path.
5. The method of claim 1, wherein the optimal path is calculated, in part, based on: a next hop to an access point, a path signal quality, and a number of hops to the access point.
6. A system for optimizing communication paths within a mesh network, comprising: a mesh network including at least one mesh device;a receiver receiving registration information from each mesh device of the mesh network;a memory storage for storing mesh device information in an accessible memory;a processor logic, responsive to a predetermined trigger, for calculating an optimal path from each mesh device, wherein the optimal path includes a set of mesh device addresses corresponding to a set of mesh devices along which a message can he forwarded;a transmitter for transmitting the calculated optimal path to each mesh device; anda processor logic for the at least one mesh device, responsive to receiving a request to transmit a message to a next mesh device, for identifying the next mesh device from among a plurality of neighbor mesh devices, wherein identifying the next mesh device further comprises calculating a score for a next mesh device according to the calculated optimal path and a score for an alternative next mesh device according to an alternate optimal path based on at least a link quality index corresponding to signal quality of the alternate optimal path, the link quality index included in neighbor information received in a neighbor exchange from at least one neighbor mesh device and selecting, based on a comparison of the calculated scores, one of the next mesh device according to the calculated optimal path and the alternative next mesh device according to the alternate optimal path.
7. The system of claim 6, wherein the predetermined trigger is selected from the set consisting of a time, a period, the occurrence of an event, the non-occurrence of an event, or any combination of two or more of these.
8. The system of claim 6, further comprising: a memory control logic for storing the associated optimal path in the accessible memory for each mesh device.
9. The system of claim 6, wherein: the receiver is adapted for receiving a message from a mesh device transmitted along the associated optimal path.
10. The system of claim 6, wherein the optimal path is calculated, in part, based on: a next hop to an access point, a path signal quality, and a number of hops to the access point.
11. A non-transitory computer readable storage medium with an executable program stored thereon, wherein the program instructs a processor to perform the following steps of a method for optimizing communication paths within a mesh network, comprising: initiating a mesh network, the mesh network including at least one mesh device;receiving registration information from each mesh device of the mesh network;storing mesh device information in an accessible memory;responsive to a predetermined trigger, calculating an optimal path from each mesh device, wherein the optimal path includes a set of mesh device addresses corresponding to a set of mesh devices along which a message can be forwarded;transmitting the calculated optimal path to each mesh device; andresponsive to receiving a request to transmit a message to a next mesh device, identifying the next mesh device from among a plurality of neighbor mesh devices, wherein identifying the next mesh device further comprises calculating a score for a next mesh device according to the calculated optimal path and a score for an alternative next mesh device according to an alternate optimal path based on at least a link quality index corresponding to signal quality of the alternate optimal path, the link quality index included in neighbor information received in a neighbor exchange from at least one neighbor mesh device and selecting, based on a comparison of the calculated scores, one of the next mesh device according to the calculated optimal path and the alternative next mesh device according to the alternate optimal path.
12. The non-transitory computer readable storage medium of claim 11, wherein the predetermined trigger is selected from the set consisting of a time, a period, the occurrence of an event, the non-occurrence of an event, or any combination of two or more of these.
13. The non-transitory computer readable storage medium of claim 11, further comprising: storing the associated optimal path in the accessible memory for each mesh device.
14. The non-transitory computer readable storage medium of claim 11, further comprising: receiving a message from a mesh device transmitted along the associated optimal path.
15. The non-transitory computer readable storage medium of claim 11, wherein the optimal path is calculated, in part, based on: a next hop to an access point, a path signal quality, and a number of hops to the access point.
16. A method for transmitting a message over a mesh network via a routing, the method comprising: associating a first mesh device with a mesh network, the mesh network managed by an access point;identifying a next mesh device from among a plurality of neighbor mesh devices;wherein identifying the next mesh device further comprises calculating, by the first mesh device, a score for the next mesh device according to a stored calculated optimal path and a score for an alternative next mesh device according to an alternate optimal path based on at least a link quality index corresponding to signal quality of the alternate optimal path, the link quality index included in neighbor information received in a neighbor exchange from at least one neighbor mesh device and selecting, based on a comparison of the calculated scores, one of the next mesh device according to the calculated optimal path and the alternative next mesh device according to the alternate optimal path; andtransmitting the message to the identified next mesh device.
17. The method in claim 16, wherein the identifying a next mesh device from among a plurality of neighbor mesh devices comprises: receiving neighbor information from a set of neighboring mesh devices; andidentifying the next mesh device by selecting a next mesh device from the set of neighboring mesh devices in response to a request to transmit a message to the access point, wherein the next mesh device is closer to the access point.
18. The method in claim 16, further comprising optimizing communication paths within a mesh network, comprising: initiating a mesh network, the mesh network including at least one mesh device;receiving registration information from each mesh device of the mesh network;storing mesh device information in an accessible memory;responsive to predetermined trigger, calculating an optimal path from each mesh device, wherein the optimal path includes a set of mesh device addresses corresponding to a set of mesh devices along which a message can be forwarded; andtransmitting the calculated optimal path to each mesh device.
19. A method for transmitting a message over a mesh network via a routing, the method comprising: associating a first mesh device with a mesh network, the mesh network managed by an access point;identifying a next mesh device from among a plurality of neighbor mesh devices, the next mesh device being identified by one of: (i) using tree routing comprising: receiving neighbor information from a set of neighboring mesh devices; and identifying the next mesh device by selecting a next mesh device from the set of neighboring mesh devices in response to a request to transmit a message to the access point, wherein the next mesh device is closer to the access point;(ii) using source routing comprising: identifying the next mesh device by receiving a next mesh device address from the access point, wherein the next mesh device is part of an optimal path to the access point; or(iii) using mesh routing comprising: broadcasting an optimal path query to neighboring mesh devices in response to a request to transmit a message to a receiving mesh device; receiving replies from the neighboring mesh devices; and identifying the next mesh device by selecting a next mesh device by calculating an optimal path, the optimal path including an address of a next mesh device; andwherein identifying the next mesh device further comprises calculating, by the first mesh device, a score for the next mesh device according to a stored calculated optimal path and a score for an alternative next mesh device according to an alternate optimal path based on at least a link quality index corresponding to signal quality of the alternate optimal path, the link quality index included in neighbor information received in a neighbor exchange from at least one neighbor mesh device and selecting, based on a comparison of the calculated scores, one of the next mesh device according to the stored calculated optimal path and the alternative next mesh device according to the alternate optimal path.
20. The method in claim 19, further comprising transmitting the message to the identified next mesh device.
21. The method in claim 19, further comprising optimizing communication paths within a mesh network, comprising: initiating a mesh network, the mesh network including at least one mesh device;receiving registration information from each mesh device of the mesh network;storing mesh device information in an accessible memory;responsive to predetermined trigger, calculating an optimal path from each mesh device, wherein the optimal path includes a set of mesh device addresses corresponding to a set of mesh devices along which a message can be forwarded; andtransmitting the calculated optimal path to each mesh device.
22. A system for transmitting a message over a mesh network, the system comprising: means for associating a first mesh device with a mesh network, the mesh network managed by an access point;means for identifying a next mesh device from among a plurality of neighbor mesh devices, the next mesh device being identified by one of: (i) using tree routing comprising: receiving neighbor information from a set of neighboring mesh devices; and identifying the next mesh device by selecting a next mesh device from the set of neighboring mesh devices in response to a request to transmit a message to the access point, wherein the next mesh device is closer to the access point;(ii) using source routing comprising: identifying the next mesh device by receiving a next mesh device address from the access point, wherein the next mesh device is part of an optimal path to the access point; or(iii) using mesh routing comprising: broadcasting an optimal path query to neighboring mesh devices in response to a request to transmit a message to a receiving mesh device; receiving replies from the neighboring mesh devices at the first mesh device; and identifying the next mesh device by selecting a next mesh device by calculating an optimal path, the optimal path including an address of a next mesh device; andwherein the means for identifying the next mesh device further comprises means for calculating, by the first mesh device, a score for the next mesh device according to a stored calculated optimal path and a score for an alternative next mesh device according to an alternate optimal path based on at least a link quality index corresponding to signal quality of the alternate optimal path, the link quality index included in neighbor information received in a neighbor exchange from at least one neighbor mesh device and selecting, based on a comparison of the calculated scores, one of the next mesh device according to the stored calculated optimal path and the alternative next mesh device according to the alternate optimal path.
23. The system in claim 22, further comprising a transmitter for transmitting the message to the identified next mesh device.
24. The system in claim 22, further comprising means for optimizing communication paths within the mesh network comprising: a receiver receiving registration information from each mesh device of the mesh network;a memory storage for storing mesh device information in an accessible memory;a processor logic, responsive to predetermined trigger, for calculating an optimal path from each mesh device, wherein the optimal path includes a set of mesh device addresses corresponding to a set of mesh devices along which a message can be forwarded; anda transmitter for transmitting the calculated optimal path to each mesh device.
25. A non-transitory computer readable storage medium with an executable program stored thereon, wherein the program instructs a processor to perform the following steps of a method for transmitting a message over a mesh network, the method comprising: associating a first mesh device with a mesh network, the mesh network managed by an access point;identifying a next mesh device from among a plurality of neighbor mesh devices, the next mesh device being identified by one of: (i) using tree routing comprising: receiving neighbor information from a set of neighboring mesh devices; and identifying the next mesh device by selecting a next mesh device from the set of neighboring mesh devices in response to a request to transmit a message to the access point, wherein the next mesh device is closer to the access point;(ii) using source routing comprising: identifying the next mesh device by receiving a next mesh device address from the access point, wherein the next mesh device is part of an optimal path to the access point; or(iii) using mesh routing comprising: broadcasting an optimal path query to neighboring mesh devices in response to a request to transmit a message to a receiving mesh device; receiving replies from the neighboring mesh devices; and identifying the next mesh device by selecting a next mesh device by calculating an optimal path, the optimal path including an address of a next mesh device; andwherein identifying the next mesh device further comprises calculating by the first mesh device, a score for the next mesh device according to a stored calculated optimal path and a score for an alternative next mesh device according to an alternate optimal path based on at least a link quality index corresponding to signal quality of the alternate optimal path, the link quality index included in neighbor information received in a neighbor exchange from at least one neighbor mesh device and selecting, based on a comparison of the calculated scores, one of the next mesh device according to the stored calculated optimal path and the alternative next mesh device according to the alternate optimal path.
26. The non-transitory computer readable storage medium in claim 25, further wherein the method further comprising transmitting the message to the identified next mesh device.
27. The non-transitory computer readable storage medium in claim 25, wherein the method further comprising optimizing communication paths within a mesh network comprising: receiving registration information from each mesh device of the mesh network;storing mesh device information in an accessible memory;responsive to predetermined trigger, calculating an optimal path from each mesh device, wherein the optimal path includes a set of mesh device addresses corresponding to a set of mesh devices along which a message can be forwarded; andtransmitting the calculated optimal path to each mesh device.
28. A method for transmitting a message over a mesh network via tree routing, comprising: associating a first flesh device with a mesh network, the mesh network managed by an access point;receiving neighbor information at the first mesh device from a set of neighboring mesh devices;responsive to a request to transmit a message to the access point, selecting a next mesh device from the set of neighboring mesh devices, wherein the next mesh device is closer to the access point;wherein selecting the next mesh device further comprises calculating, by the first mesh device, a score for the next mesh device according to a stored calculated optimal path and a score for an alternative next mesh device according to an alternate optimal path based on at least a link quality index corresponding to signal quality of the alternate optimal path, the link quality index included in neighbor information received in a neighbor exchange from at least one neighbor mesh device and selecting, based on a comparison of the calculated scores, one of the next mesh device according to the calculated optimal path and the alternative next mesh device according to the alternate optimal path; andtransmitting the message to the next mesh device.
29. The method of claim 28, further comprising: receiving a message from a sending mesh device for forwarding, wherein the request to transmit the message to the access point is indicated in a header of the message; andreplying to the sending mesh device with an acknowledgement after the message has been transmitted.
30. The method of claim 29, further comprising: storing a temporary path in an accessible memory, wherein the temporary path includes an address of the sending mesh device and an address of the next mesh device.
31. The method of claim 30, further comprising: receiving a reply from the next mesh device;retrieving the temporary path from the accessible memory; andforwarding the reply to the sending mesh device.
32. The method of claim 29, wherein the neighbor information includes: a next hop to the access point, a path signal quality, and a number of hops to the access point.
33. The method of claim 29, further comprising: responsive to a failure to receive an acknowledgement for the transmitted message, selecting a second best mesh device from the set of neighboring mesh devices and transmitting the message to the second best mesh device.
34. The method of claim 29, further comprising: responsive to receiving the neighbor information, updating a neighbor information table in accessible memory.
35. A system for transmitting a message over a mesh network via tree routing, comprising: an association logic unit for associating a first mesh device with a mesh network, the mesh network managed by an access point;a receiver for receiving neighbor information from a set of neighboring mesh devices;a selection logic unit responsive to a request to transmit a message to the access point, selecting a next mesh device from the set of neighboring mesh devices, wherein the next mesh device is closer to the access point;the selection logic unit, further calculating a score for the next mesh device according to a stored calculated optimal path and a score for an alternative next mesh device according to an alternate optimal path based on at least a link quality index corresponding to signal quality of the alternate optimal path, the link quality index included in neighbor information received in a neighbor exchange from at least one neighbor mesh device and selecting, based on a comparison of the calculated scores, one of the next mesh device according to the calculated optimal path and the alternative next mesh device according to the alternate optimal path; anda transmitter for transmitting the message to the next mesh device.
36. The system of claim 35, wherein: the receiver is adapted for receiving a message from a sending mesh device for forwarding, wherein the request to transmit the message to the access point is indicated in a header of the message; andthe receiver of the sending mesh device being adapted to receive a reply with an acknowledgement after the message to the next mesh device has been transmitted.
37. The system of claim 36, further comprising: a memory storage for storing a temporary path in an accessible memory, wherein the temporary path includes an address of the sending mesh device and an address of the next mesh device.
38. The system of claim 37, further comprising: a memory control logic for retrieving the temporary path from the accessible memory; andthe receiver is adapted to receive a reply from the next mesh device, retrieve the temporary path from the accessible memory; and forward the reply to the sending mesh device.
39. The system of claim 35, wherein the neighbor information includes: a next hop to the access point, a path signal quality, and a number of hops to the access point.
40. The system of claim 35, further comprising: means responsive to a failure to receive an acknowledgement for the transmitted message, for selecting a second best mesh device from the set of neighboring mesh devices and transmitting the message to the second best mesh device.
41. The system of claim 35, further comprising: means responsive to receiving the neighbor information, for updating a neighbor information table in accessible memory.
42. A non-transitory computer storage medium with an executable program stored thereon, wherein the program instructs a processor to perform the following steps of a method for transmitting a message over a mesh network via tree routing, the method comprising: associating a first mesh device with a mesh network, the mesh network managed by an access point;receiving neighbor information at the first mesh device from a set of neighboring mesh devices;responsive to a request to transmit a message to the access point, selecting a next mesh device from the set of neighboring mesh devices, wherein the next mesh device is closer to the access point;wherein selecting the next mesh device further comprises calculating a score for the next mesh device according to a stored calculated optimal path and a score for an alternative next mesh device according to an alternate optimal path based on at least a link quality index corresponding to signal quality of the alternate optimal path, the link quality index included in neighbor information received in a neighbor exchange from at least one neighbor mesh device and selecting, based on a comparison of the calculated scores, one of the next mesh device according to the calculated optimal path and the alternative next mesh device according to the alternate optimal path; andtransmitting the message to the next mesh device.
43. The non-transitory computer readable storage medium of claim 42, wherein the method further comprising: receiving a message from a sending mesh device fur forwarding, wherein the request to transmit the message to the access point is indicated in a header of the message; andreplying to the sending mesh device with an acknowledgement after the message has been transmitted.
44. The non-transitory computer readable storage medium of claim 43, wherein the method further comprising: storing a temporary path in an accessible memory, wherein the temporary path includes an address of the sending mesh device and an address of the next mesh device.
45. The non-transitory computer readable storage medium of claim 44, wherein the method further comprising: receiving a reply from the next mesh device;retrieving the temporary path from the accessible memory; andforwarding the reply to the sending mesh device.
46. The non-transitory computer readable storage medium of claim 42, wherein the neighbor information includes: a next hop to the access point, a path signal quality, and a number of hops to the access point.
47. The non-transitory computer readable storage medium of claim 42, further comprising: responsive to a failure to receive an acknowledgement for the transmitted message, selecting a second best mesh device from the set of neighboring mesh devices and transmitting the message to the second best mesh device.
48. The non-transitory computer readable storage medium of claim 42, further comprising: responsive to receiving the neighbor information, updating a neighbor information table in accessible memory.
49. A system for transmitting a message over a mesh network via tree routing, comprising: means for associating a first mesh device with a mesh network, the mesh network managed by an access point;means for receiving neighbor information at the first mesh device from a set of neighboring mesh devices;means responsive to a request for transmitting a message to the access point, selecting a next mesh device from the set of neighboring mesh devices, wherein the next mesh device is closer to the access point;wherein the selection means further comprises means for calculating a score for the next mesh device according to a stored calculated optimal path and a score for an alternative next mesh device according to an alternate optimal path based on at least a link quality index corresponding to signal quality of the alternate optimal path, the link quality index included in neighbor information received in a neighbor exchange from at least one neighbor mesh device and selecting, based on a comparison of the calculated scores, one of the next mesh device according to the calculated optimal path and the alternative next mesh device according to the alternate optimal path; andmeans for transmitting the message to the next mesh device.
50. The system of claim 49, further comprising: means for receiving a message from a sending mesh device for forwarding, wherein the request to transmit the message to the access point is indicated in a header of the message; andmeans for replying to the sending mesh device with an acknowledgement after the message has been transmitted.
51. The system of claim 50, further comprising: means for storing a temporary path in an accessible memory, wherein the temporary path includes an address of the sending mesh device and an address of the next mesh device.
52. The system of claim 51, further comprising: means for receiving a reply from the next mesh device;means for retrieving the temporary path from the accessible memory; andmeans for forwarding the reply to sending mesh device.
53. The system of claim 49, wherein the neighbor information includes: a next hop to the access point, a path signal quality, and a number of hops to the access point.
54. The system of claim 49, farther comprising: means for responsive to a failure to receive an acknowledgement for the transmitted message, for selecting a second best mesh device from the set of neighboring mesh devices and transmitting the message to the second best mesh device.
55. The system of claim 49, further comprising: means for responsive for receiving the neighbor information, updating a neighbor information table in accessible memory.

CROSS REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of priority to the following U.S. 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 (TR0004-PRO);Ser. No. 60/989,967 entitled “Efficient And Compact Transport Layer And Model For An Advanced Metering Infrastructure (AMI) Network,” filed Nov. 25, 2007 (TR0003-PRO);Ser. No. 60/989,958 entitled “Creating And Managing A Mesh Network Including Network Association,” filed Nov. 25, 2007 (TR0005-PRO);Ser. No. 60/989,964 entitled “Route Optimization Within A Mesh Network,” filed Nov. 25, 2007 (TR0007-PRO);Ser. No. 60/989,950 entitled “Application Layer Device Agnostic Collector Utilizing ANSI C12.22,” filed Nov. 25, 2007 (TR0009-PRO);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 (TR0010-PRO);Ser. No. 60/989,975 entitled “System and Method for Network (Mesh) Layer And Application Layer Architecture And Processes,” filed Nov. 25, 2007 (TR0014-PRO);Ser. No. 60/989,959 entitled “Tree Routing Within a Mesh Network,” filed Nov. 25, 2007 (TR0017-PRO);Ser. No. 60/989,961 entitled “Source Routing Within a Mesh Network,” filed Nov. 25, 2007 (TR0019-PRO);Ser. No. 60/989,962 entitled “Creating and Managing a Mesh Network,” filed Nov. 25, 2007 (TR0020-PRO);Ser. No. 60/989,951 entitled “Network Node And Collector Architecture For Communicating Data And Method Of Communications,” filed Nov. 25, 2007 (TR0021-PRO);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 (TR0022-PRO);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 (TR0023-PRO);Ser. No. 60/989,954 entitled “System And Method For Synchronizing Data In An Automated Meter Reading Infrastructure,” filed Nov. 25, 2007 (TR0024-PRO);Ser. No. 60/992,312 entitled “Mesh Network Broadcast,” filed Dec. 4, 2007 (TR0027-PRO);Ser. No. 60/992,313 entitled “Multi Tree Mesh Networks”, filed Dec. 4, 2007 (TR0028-PRO);Ser. No. 60/992,315 entitled “Mesh Routing Within a Mesh Network,” filed Dec. 4, 2007 (TR0029-PRO);Ser. No. 61/025,279 entitled “Point-to-Point Communication within a Mesh Network”, filed Jan. 31, 2008 (TR0030-PRO), 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 (TR0031-PRO);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 (TR0032-PRO);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 (TR0035-PRO);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 (TR0037-PRO);Ser. No. 61/025,287 entitled “System And Method For Operating Mesh Devices In Multi-Tree Overlapping Mesh Networks”, filed Jan. 31, 2008 (TR0038-PRO);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 (TR0039-PRO);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 (TR0040-PRO);Ser. No. 61/025,277 entitled “System And Method For Synchronizing Data In An Automated Meter Reading Infrastructure,” filed Jan. 31, 2008 (TR0041-PRO); andSer. No. 61/094,116 entitled “Message Formats and Processes for Communication Across a Mesh Network,” filed Sep. 4, 2008 (TR0049-PRO). This application hereby references and incorporates by reference each of the following United States patent applications filed contemporaneously herewith: Ser. No. 12/275,236 entitled “Point-to-Point Communication within a Mesh Network”, filed Nov. 21, 2008 (TR0004-US);Ser. No. 12/275,242 entitled “Efficient And Compact Transport Layer And Model For An Advanced Metering Infrastructure (AMI) Network,” filed Nov. 21, 2008 (TR0003-US);Ser. No. 12/275,242 entitled “COLLECTOR DEVICE AND SYSTEM UTILIZING STANDARDIZED UTILITY METERING PROTOCOL,” filed Nov. 21, 2008 (TR0009-US);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 (TR0020-US); andSer. No. 12/275,257 entitled “System And Method For Operating Mesh Devices In Multi-Tree Overlapping Mesh Networks”, filed Nov. 21, 2008 (TR0038-US).

US Referenced Citations (523)

Number	Name	Date	Kind
4132981	White	Jan 1979	A
4190800	Kelly, Jr. et al.	Feb 1980	A
4204195	Bogacki	May 1980	A
4254472	Juengel et al.	Mar 1981	A
4322842	Martinez	Mar 1982	A
4396915	Farnsworth et al.	Aug 1983	A
4425628	Bedard et al.	Jan 1984	A
4638314	Keller	Jan 1987	A
4644320	Carr et al.	Feb 1987	A
4749992	Fitzemeyer et al.	Jun 1988	A
4792946	Mayo	Dec 1988	A
4939726	Flammer et al.	Jul 1990	A
5007052	Flammer	Apr 1991	A
5056107	Johnson et al.	Oct 1991	A
5077753	Grau, Jr. et al.	Dec 1991	A
5079768	Flammer	Jan 1992	A
5115433	Baran et al.	May 1992	A
5117422	Hauptschein et al.	May 1992	A
5130987	Flammer	Jul 1992	A
5138615	Lamport et al.	Aug 1992	A
5159592	Perkins	Oct 1992	A
5216623	Barrett et al.	Jun 1993	A
5276680	Messenger	Jan 1994	A
5311581	Merriam et al.	May 1994	A
5400338	Flammer, III et al.	Mar 1995	A
5430729	Rahnema	Jul 1995	A
5432507	Mussino et al.	Jul 1995	A
5453977	Flammer, III et al.	Sep 1995	A
5459727	Vannucci	Oct 1995	A
5463777	Bialkowski et al.	Oct 1995	A
5465398	Flammer	Nov 1995	A
5467345	Cutler, Jr. et al.	Nov 1995	A
5471469	Flammer, III et al.	Nov 1995	A
5479400	Dilworth et al.	Dec 1995	A
5488608	Flammer, III	Jan 1996	A
5515369	Flammer, III et al.	May 1996	A
5515509	Rom	May 1996	A
5528507	McNamara et al.	Jun 1996	A
5544036	Brown, Jr. et al.	Aug 1996	A
5553094	Johnson et al.	Sep 1996	A
5570084	Ritter et al.	Oct 1996	A
5572528	Shuen	Nov 1996	A
5596722	Rahnema	Jan 1997	A
5608721	Natarajan et al.	Mar 1997	A
5608780	Gerszberg et al.	Mar 1997	A
5623495	Eng et al.	Apr 1997	A
5659300	Dresselhuys et al.	Aug 1997	A
5673252	Johnson et al.	Sep 1997	A
5696501	Ouellette et al.	Dec 1997	A
5717718	Rowsell et al.	Feb 1998	A
5719564	Sears	Feb 1998	A
5726644	Jednacz et al.	Mar 1998	A
5727057	Emery et al.	Mar 1998	A
5737318	Melnik	Apr 1998	A
5740366	Mahany et al.	Apr 1998	A
5748104	Argyroudis et al.	May 1998	A
5757783	Eng et al.	May 1998	A
5758331	Johnson	May 1998	A
5761083	Brown, Jr. et al.	Jun 1998	A
5767790	Jovellana	Jun 1998	A
5774660	Brendel et al.	Jun 1998	A
5812531	Cheung et al.	Sep 1998	A
5822309	Ayanoglu et al.	Oct 1998	A
5844893	Gollnick et al.	Dec 1998	A
5874903	Shuey et al.	Feb 1999	A
5880677	Lestician	Mar 1999	A
5892758	Argyroudis	Apr 1999	A
5894422	Chasek	Apr 1999	A
5896097	Cardozo	Apr 1999	A
5898387	Davis et al.	Apr 1999	A
5898826	Pierce et al.	Apr 1999	A
5901067	Kao et al.	May 1999	A
5903566	Flammer, III	May 1999	A
5914672	Glorioso et al.	Jun 1999	A
5914673	Jennings et al.	Jun 1999	A
5920697	Masters et al.	Jul 1999	A
5926531	Petite	Jul 1999	A
5933092	Ouellette et al.	Aug 1999	A
5953371	Rowsell et al.	Sep 1999	A
5963146	Johnson et al.	Oct 1999	A
5963457	Kanoi et al.	Oct 1999	A
5974236	Sherman	Oct 1999	A
5986574	Colton	Nov 1999	A
5987011	Toh	Nov 1999	A
5991806	McHann, Jr.	Nov 1999	A
6014089	Tracy et al.	Jan 2000	A
6018659	Ayyagari et al.	Jan 2000	A
6026133	Sokoler	Feb 2000	A
6028522	Petite	Feb 2000	A
6044062	Brownrigg et al.	Mar 2000	A
6058355	Ahmed et al.	May 2000	A
6061609	Kanoi et al.	May 2000	A
6073169	Shuey et al.	Jun 2000	A
6075777	Agrawal et al.	Jun 2000	A
6078785	Bush	Jun 2000	A
6084867	Meier	Jul 2000	A
6088659	Kelley et al.	Jul 2000	A
6097703	Larsen et al.	Aug 2000	A
6108699	Moiin	Aug 2000	A
6118269	Davis	Sep 2000	A
6122603	Budike, Jr.	Sep 2000	A
6124806	Cunningham et al.	Sep 2000	A
6134587	Okanoue	Oct 2000	A
6137423	Glorioso et al.	Oct 2000	A
6150955	Tracy et al.	Nov 2000	A
6169979	Johnson	Jan 2001	B1
6172616	Johnson et al.	Jan 2001	B1
6195018	Ragle et al.	Feb 2001	B1
6218953	Petite	Apr 2001	B1
6233327	Petite	May 2001	B1
6239722	Colton et al.	May 2001	B1
6240080	Okanoue et al.	May 2001	B1
6246677	Nap et al.	Jun 2001	B1
6246689	Shavitt	Jun 2001	B1
6249516	Brownrigg et al.	Jun 2001	B1
6298053	Flammer, III et al.	Oct 2001	B1
6300881	Yee et al.	Oct 2001	B1
6304556	Haas	Oct 2001	B1
6311105	Budike, Jr.	Oct 2001	B1
6338087	Okanoue	Jan 2002	B1
6362745	Davis	Mar 2002	B1
6363057	Ardalan et al.	Mar 2002	B1
6366217	Cunningham et al.	Apr 2002	B1
6369719	Tracy et al.	Apr 2002	B1
6369769	Nap et al.	Apr 2002	B1
6373399	Johnson et al.	Apr 2002	B1
6396839	Ardalan et al.	May 2002	B1
6400949	Bielefeld et al.	Jun 2002	B1
6407991	Meier	Jun 2002	B1
6415330	Okanoue	Jul 2002	B1
6430268	Petite	Aug 2002	B1
6437692	Petite et al.	Aug 2002	B1
6457054	Bakshi	Sep 2002	B1
6480497	Flammer, III et al.	Nov 2002	B1
6480505	Johansson et al.	Nov 2002	B1
6492910	Ragle et al.	Dec 2002	B1
6509841	Colton et al.	Jan 2003	B1
6522974	Sitton	Feb 2003	B2
6535498	Larsson et al.	Mar 2003	B1
6538577	Ehrke et al.	Mar 2003	B1
6553355	Arnoux et al.	Apr 2003	B1
6577671	Vimpari	Jun 2003	B1
6606708	Shifrin et al.	Aug 2003	B1
6618578	Petite	Sep 2003	B1
6618772	Kao et al.	Sep 2003	B1
6628764	Petite	Sep 2003	B1
6633823	Bartone et al.	Oct 2003	B2
6636894	Short et al.	Oct 2003	B1
6650249	Meyer et al.	Nov 2003	B2
6653945	Johnson et al.	Nov 2003	B2
6657552	Belski et al.	Dec 2003	B2
6665620	Burns et al.	Dec 2003	B1
6671635	Forth et al.	Dec 2003	B1
6681110	Crookham et al.	Jan 2004	B1
6681154	Nierlich et al.	Jan 2004	B2
6684245	Shuey et al.	Jan 2004	B1
6691173	Morris et al.	Feb 2004	B2
6697331	Riihinen et al.	Feb 2004	B1
6710721	Holowick	Mar 2004	B1
6711166	Amir et al.	Mar 2004	B1
6711409	Zavgren, Jr. et al.	Mar 2004	B1
6714787	Reed et al.	Mar 2004	B2
6718137	Chin	Apr 2004	B1
6725281	Zintel et al.	Apr 2004	B1
6728514	Bandeira et al.	Apr 2004	B2
6747557	Petite et al.	Jun 2004	B1
6747981	Ardalan et al.	Jun 2004	B2
6751445	Kasperkovitz et al.	Jun 2004	B2
6751455	Acampora	Jun 2004	B1
6751672	Khalil et al.	Jun 2004	B1
6772052	Amundsen et al.	Aug 2004	B1
6775258	van Valkenburg et al.	Aug 2004	B1
6778099	Meyer et al.	Aug 2004	B1
6785592	Smith et al.	Aug 2004	B1
6798352	Holowick	Sep 2004	B2
6801865	Gilgenbach et al.	Oct 2004	B2
6826620	Davis et al.	Nov 2004	B1
6829216	Nakata	Dec 2004	B1
6829347	Odiaka	Dec 2004	B1
6831921	Higgins	Dec 2004	B2
6836737	Petite et al.	Dec 2004	B2
6839775	Kao et al.	Jan 2005	B1
6842706	Baraty	Jan 2005	B1
6845091	Ogier et al.	Jan 2005	B2
6859186	Lizalek et al.	Feb 2005	B2
6865185	Patel et al.	Mar 2005	B1
6885309	Van Heteren	Apr 2005	B1
6891838	Petite et al.	May 2005	B1
6900738	Crichlow	May 2005	B2
6904025	Madour et al.	Jun 2005	B1
6904385	Budike, Jr.	Jun 2005	B1
6909705	Lee et al.	Jun 2005	B1
6914533	Petite	Jul 2005	B2
6914893	Petite	Jul 2005	B2
6946972	Mueller et al.	Sep 2005	B2
6954814	Leach	Oct 2005	B1
6963285	Fischer et al.	Nov 2005	B2
6967452	Aiso et al.	Nov 2005	B2
6970434	Mahany et al.	Nov 2005	B1
6970771	Preiss et al.	Nov 2005	B1
6975613	Johansson	Dec 2005	B1
6980973	Karpenko	Dec 2005	B1
6982651	Fischer	Jan 2006	B2
6985087	Soliman	Jan 2006	B2
6995666	Luttrell	Feb 2006	B1
6999441	Flammer, III et al.	Feb 2006	B2
7009379	Ramirez	Mar 2006	B2
7009493	Howard et al.	Mar 2006	B2
7010363	Donnelly et al.	Mar 2006	B2
7016336	Sorensen	Mar 2006	B2
7020701	Gelvin et al.	Mar 2006	B1
7042368	Patterson et al.	May 2006	B2
7046682	Carpenter et al.	May 2006	B2
7053767	Petite et al.	May 2006	B2
7054271	Brownrigg et al.	May 2006	B2
7062361	Lane	Jun 2006	B1
7064679	Ehrke et al.	Jun 2006	B2
7072945	Nieminen et al.	Jul 2006	B1
7079810	Petite et al.	Jul 2006	B2
7089089	Cumming et al.	Aug 2006	B2
7102533	Kim	Sep 2006	B2
7103511	Petite	Sep 2006	B2
7106044	Lee, Jr. et al.	Sep 2006	B1
7119713	Shuey et al.	Oct 2006	B2
7126494	Ardalan et al.	Oct 2006	B2
7135850	Ramirez	Nov 2006	B2
7135956	Bartone et al.	Nov 2006	B2
7137550	Petite	Nov 2006	B1
7143204	Kao et al.	Nov 2006	B1
7145474	Shuey et al.	Dec 2006	B2
7170425	Christopher et al.	Jan 2007	B2
7185131	Leach	Feb 2007	B2
7188003	Ransom et al.	Mar 2007	B2
7197046	Hariharasubrahmanian	Mar 2007	B1
7200633	Sekiguchi et al.	Apr 2007	B2
7209840	Petite et al.	Apr 2007	B2
7215926	Corbett et al.	May 2007	B2
7222111	Budike, Jr.	May 2007	B1
7230544	Van Heteren	Jun 2007	B2
7231482	Leach	Jun 2007	B2
7248181	Patterson et al.	Jul 2007	B2
7248861	Lazaridis et al.	Jul 2007	B2
7250874	Mueller et al.	Jul 2007	B2
7251570	Hancock et al.	Jul 2007	B2
7263073	Petite et al.	Aug 2007	B2
7271735	Rogai	Sep 2007	B2
7274305	Luttrell	Sep 2007	B1
7274975	Miller	Sep 2007	B2
7277027	Ehrke et al.	Oct 2007	B2
7277967	Kao et al.	Oct 2007	B2
7289887	Rodgers	Oct 2007	B2
7295128	Petite	Nov 2007	B2
7301476	Shuey et al.	Nov 2007	B2
7304587	Boaz	Dec 2007	B2
7308370	Mason, Jr. et al.	Dec 2007	B2
7312721	Mason, Jr. et al.	Dec 2007	B2
7315257	Patterson et al.	Jan 2008	B2
7317404	Cumeralto et al.	Jan 2008	B2
7321316	Hancock et al.	Jan 2008	B2
7324453	Wu et al.	Jan 2008	B2
7327998	Kumar et al.	Feb 2008	B2
7346463	Petite et al.	Mar 2008	B2
7348769	Ramirez	Mar 2008	B2
7349766	Rodgers	Mar 2008	B2
7362709	Hui et al.	Apr 2008	B1
7366113	Chandra et al.	Apr 2008	B1
7379981	Elliott et al.	May 2008	B2
7397907	Petite	Jul 2008	B2
7406298	Luglio et al.	Jul 2008	B2
7411964	Suemura	Aug 2008	B2
7427927	Borleske et al.	Sep 2008	B2
7451019	Rodgers	Nov 2008	B2
7457273	Nakanishi et al.	Nov 2008	B2
7468661	Petite et al.	Dec 2008	B2
7487282	Leach	Feb 2009	B2
7495578	Borleske	Feb 2009	B2
7498873	Opshaug et al.	Mar 2009	B2
7505453	Carpenter et al.	Mar 2009	B2
7512234	McDonnell et al.	Mar 2009	B2
7515571	Kwon et al.	Apr 2009	B2
7516106	Ehlers et al.	Apr 2009	B2
7522540	Maufer	Apr 2009	B1
7522639	Katz	Apr 2009	B1
7539151	Demirhan et al.	May 2009	B2
7545285	Shuey et al.	Jun 2009	B2
7548826	Witter et al.	Jun 2009	B2
7548907	Wall et al.	Jun 2009	B2
7554941	Ratiu et al.	Jun 2009	B2
7562024	Brooks et al.	Jul 2009	B2
7586420	Fischer et al.	Sep 2009	B2
7599665	Sinivaara	Oct 2009	B2
7602747	Maksymczuk et al.	Oct 2009	B2
7609673	Bergenlid et al.	Oct 2009	B2
7613147	Bergenlid et al.	Nov 2009	B2
7623043	Mizra et al.	Nov 2009	B2
7626967	Yarvis et al.	Dec 2009	B2
7650425	Davis et al.	Jan 2010	B2
7676231	Demirhan et al.	Mar 2010	B2
7680041	Johansen	Mar 2010	B2
7729496	Hacigumus	Jun 2010	B2
7756538	Bonta et al.	Jul 2010	B2
7814322	Gurevich et al.	Oct 2010	B2
7847706	Ross et al.	Dec 2010	B1
20010005368	Rune	Jun 2001	A1
20010038342	Foote	Nov 2001	A1
20010046879	Schramm et al.	Nov 2001	A1
20020012358	Sato	Jan 2002	A1
20020013679	Petite	Jan 2002	A1
20020031101	Petite et al.	Mar 2002	A1
20020051269	Margalit et al.	May 2002	A1
20020066095	Yu	May 2002	A1
20020110118	Foley	Aug 2002	A1
20020120569	Day	Aug 2002	A1
20020174354	Bel et al.	Nov 2002	A1
20020186619	Reeves et al.	Dec 2002	A1
20030001640	Lao et al.	Jan 2003	A1
20030001754	Johnson et al.	Jan 2003	A1
20030033394	Stine	Feb 2003	A1
20030037268	Kistler	Feb 2003	A1
20030050737	Osann, Jr.	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
20030229900	Reisman	Dec 2003	A1
20030233201	Horst et al.	Dec 2003	A1
20040008663	Srikrishna et al.	Jan 2004	A1
20040031030	Kidder et al.	Feb 2004	A1
20040034773	Balabine et al.	Feb 2004	A1
20040056775	Crookham et al.	Mar 2004	A1
20040066310	Ehrke et al.	Apr 2004	A1
20040077341	Chandranmenon et al.	Apr 2004	A1
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
20040210544	Shuey et al.	Oct 2004	A1
20050026569	Lim et al.	Feb 2005	A1
20050027859	Alvisi et al.	Feb 2005	A1
20050030968	Rich et al.	Feb 2005	A1
20050033967	Morino et al.	Feb 2005	A1
20050055432	Rodgers	Mar 2005	A1
20050058144	Ayyagari et al.	Mar 2005	A1
20050065742	Rodgers	Mar 2005	A1
20050122944	Kwon et al.	Jun 2005	A1
20050136972	Smith et al.	Jun 2005	A1
20050172024	Cheifot et al.	Aug 2005	A1
20050201397	Petite	Sep 2005	A1
20050243867	Petite	Nov 2005	A1
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
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
20070063868	Borleske	Mar 2007	A1
20070085700	Walters et al.	Apr 2007	A1
20070087756	Hoffberg	Apr 2007	A1
20070103324	Kosuge et al.	May 2007	A1
20070109121	Cohen	May 2007	A1
20070110024	Meier	May 2007	A1
20070120705	Kiiskila et al.	May 2007	A1
20070136817	Nguyen	Jun 2007	A1
20070139220	Mirza et al.	Jun 2007	A1
20070143046	Budike	Jun 2007	A1
20070147268	Kelley et al.	Jun 2007	A1
20070169074	Koo et al.	Jul 2007	A1
20070169075	Lill et al.	Jul 2007	A1
20070169080	Friedman	Jul 2007	A1
20070177538	Christensen et al.	Aug 2007	A1
20070177576	Johansen et al.	Aug 2007	A1
20070177613	Shorty et al.	Aug 2007	A1
20070189249	Gurevich et al.	Aug 2007	A1
20070200729	Borleske et al.	Aug 2007	A1
20070201504	Christensen et al.	Aug 2007	A1
20070204009	Shorty et al.	Aug 2007	A1
20070205915	Shuey et al.	Sep 2007	A1
20070206503	Gong et al.	Sep 2007	A1
20070206521	Osaje	Sep 2007	A1
20070207811	Das et al.	Sep 2007	A1
20070210933	Leach	Sep 2007	A1
20070211636	Bellur et al.	Sep 2007	A1
20070239477	Budike	Oct 2007	A1
20070248047	Shorty et al.	Oct 2007	A1
20070257813	Vaswani et al.	Nov 2007	A1
20070258508	Werb et al.	Nov 2007	A1
20070263647	Shorty et al.	Nov 2007	A1
20070265947	Schimpf et al.	Nov 2007	A1
20070266429	Ginter et al.	Nov 2007	A1
20070271006	Golden et al.	Nov 2007	A1
20070276547	Miller	Nov 2007	A1
20080018492	Ehrke et al.	Jan 2008	A1
20080024320	Ehrke et al.	Jan 2008	A1
20080031145	Ethier et al.	Feb 2008	A1
20080032703	Krumm et al.	Feb 2008	A1
20080037569	Werb et al.	Feb 2008	A1
20080042874	Rogai	Feb 2008	A1
20080046388	Budike	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 Stuber 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	Apr 2008	A1
20080107034	Jetcheva et al.	May 2008	A1
20080117110	Luglio et al.	May 2008	A1
20080129538	Vaswani et al.	Jun 2008	A1
20080130535	Shorty et al.	Jun 2008	A1
20080130562	Shorty et al.	Jun 2008	A1
20080132185	Elliott et al.	Jun 2008	A1
20080136667	Vaswani et al.	Jun 2008	A1
20080151795	Shorty et al.	Jun 2008	A1
20080151824	Shorty et al.	Jun 2008	A1
20080151825	Shorty et al.	Jun 2008	A1
20080151826	Shorty et al.	Jun 2008	A1
20080151827	Shorty et al.	Jun 2008	A1
20080154396	Shorty et al.	Jun 2008	A1
20080159213	Shorty et al.	Jul 2008	A1
20080165712	Shorty et al.	Jul 2008	A1
20080170511	Shorty et al.	Jul 2008	A1
20080177678	Di Martini et al.	Jul 2008	A1
20080180274	Cumeralto et al.	Jul 2008	A1
20080181133	Thubert et al.	Jul 2008	A1
20080183339	Vaswani et al.	Jul 2008	A1
20080186202	Vaswani et al.	Aug 2008	A1
20080186203	Vaswani et al.	Aug 2008	A1
20080187001	Vaswani et al.	Aug 2008	A1
20080187116	Reeves et al.	Aug 2008	A1
20080189415	Vaswani et al.	Aug 2008	A1
20080189436	Vaswani et al.	Aug 2008	A1
20080204272	Ehrke et al.	Aug 2008	A1
20080205355	Liu et al.	Aug 2008	A1
20080224891	Ehrke et al.	Sep 2008	A1
20080225737	Gong et al.	Sep 2008	A1
20080238714	Ehrke et al.	Oct 2008	A1
20080238716	Ehrke et al.	Oct 2008	A1
20080272934	Wang et al.	Nov 2008	A1
20080310311	Flammer et al.	Dec 2008	A1
20080310377	Flammer et al.	Dec 2008	A1
20080317047	Zeng et al.	Dec 2008	A1
20090003214	Vaswani et al.	Jan 2009	A1
20090003232	Vaswani et al.	Jan 2009	A1
20090003243	Vaswani et al.	Jan 2009	A1
20090003356	Vaswani et al.	Jan 2009	A1
20090010178	Tekippe	Jan 2009	A1
20090034418	Flammer, III et al.	Feb 2009	A1
20090034419	Flammer, III et al.	Feb 2009	A1
20090034432	Bonta et al.	Feb 2009	A1
20090043911	Flammer et al.	Feb 2009	A1
20090046732	Pratt, Jr. et al.	Feb 2009	A1
20090055032	Rodgers	Feb 2009	A1
20090068947	Petite	Mar 2009	A1
20090077405	Johansen	Mar 2009	A1
20090079584	Grady et al.	Mar 2009	A1
20090082888	Johansen	Mar 2009	A1
20090096605	Petite et al.	Apr 2009	A1
20090102737	Birnbaum et al.	Apr 2009	A1
20090115626	Vaswani et al.	May 2009	A1
20090134969	Veillette	May 2009	A1
20090135716	Veillette	May 2009	A1
20090135843	Veillette	May 2009	A1
20090161594	Zhu et al.	Jun 2009	A1
20090167547	Gilbert	Jul 2009	A1
20090168846	Filippo Iii et al.	Jul 2009	A1
20090175238	Jetcheva et al.	Jul 2009	A1
20090179771	Seal et al.	Jul 2009	A1
20090235246	Seal et al.	Sep 2009	A1
20090243840	Petite et al.	Oct 2009	A1
20090245270	Van Greunen et al.	Oct 2009	A1
20090262642	Van Greunen et al.	Oct 2009	A1
20090267792	Crichlow	Oct 2009	A1
20090285124	Aguirre et al.	Nov 2009	A1
20090303972	Flammer, III et al.	Dec 2009	A1
20090315699	Satish et al.	Dec 2009	A1
20090319672	Reisman	Dec 2009	A1
20090320073	Reisman	Dec 2009	A1
20100037069	Deierling et al.	Feb 2010	A1
20100037293	St. Johns et al.	Feb 2010	A1
20100040042	Van Greunen et al.	Feb 2010	A1
20100060259	Vaswani et al.	Mar 2010	A1
20100061350	Flammer, III	Mar 2010	A1
20100073193	Flammer, III	Mar 2010	A1
20100074176	Flammer, III et al.	Mar 2010	A1
20100074304	Flammer, III	Mar 2010	A1

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
WO2007015822	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

Related Publications (1)

	Number	Date	Country
	20090135716 A1	May 2009	US

Provisional Applications (27)

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
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
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
61094116	Sep 2008	US

Communication and message route optimization and messaging in a mesh network

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

US Classifications

Field of Search

US

International Classifications

Term Extension