Abstract: Methods of reassembling a mesh network which has been disrupted by the unavailability of a node or a link are disclosed. Nodes continuously receive beacon messages originating from a leader node. These beacon messages may be transmitted directly by the leader node, or may have been retransmitted by an intermediate node. When a node determines that it has not received a beacon message in a certain time period, it concludes that it is now disconnected from that leader node. At this point, it may choose to act as a leader node and form a new network, or may join with another network. The determination of which network to join may be based on some indicia associated with the leader node of that network.

Abstract: A method of efficiently disseminating various types of information throughout a mesh network is disclosed. Information is typically propagated through the network using a variety of protocols and messages. However, in one embodiment, a single message, communicates all of this information at once. The message includes data originating at the leader, which does not change as the messages are propagated through the network, as well as topology and link information that is created by the forwarding nodes. The data originating at the leader includes the identity of the leader node and a sequence number. Additionally, a version number is included by the leader which represents the state of the quasi-static information. Quasi-static information may include, for example, the identity of a node that has access to a central control system or the internet. This compact message format allows improved efficiency and use of the network.

Abstract: A method of efficiently disseminating various types of information throughout a mesh network is disclosed. Information is typically propagated through the network using a variety of protocols and messages. However, in one embodiment, a single message, communicates all of this information at once. The message includes data originating at the leader, which does not change as the messages are propagated through the network, as well as topology and link information that is created by the forwarding nodes. The data originating at the leader includes the identity of the leader node and a sequence number. Additionally, a version number is included by the leader which represents the state of the quasi-static information. Quasi-static information may include, for example, the identity of a node that has access to a central control system or the internet. This compact message format allows improved efficiency and use of the network.

Abstract: Methods of reassembling a mesh network which has been disrupted by the unavailability of a node or a link are disclosed. Nodes continuously receive beacon messages originating from a leader node. These beacon messages may be transmitted directly by the leader node, or may have been retransmitted by an intermediate node. When a node determines that it has not received a beacon message in a certain time period, it concludes that it is now disconnected from that leader node. At this point, it may choose to act as a leader node and form a new network, or may join with another network. The determination of which network to join may be based on some indicia associated with the leader node of that network.

Abstract: A method for directing packets in a radio network includes, at each node of the network, maintaining link data characterizing reliability of transmissions between neighboring nodes and that node based on received radio transmissions at that node, and distributing the link data to one or more of the neighboring nodes.

Abstract: In a method for directing packets in a radio network, a route of nodes from an origin to a destination is determined according to a routing algorithm. A packet is transmitted along the route. A failure of a first node to forward the packet along the route is detected. The packet is transmitted to the destination from a second node not on the route.

Abstract: A wireless mesh network includes nodes of a first type and nodes of a second type. Packets are routed from nodes of the first type to nodes of the second type using a first routing protocol, and packet are routed from nodes of the second type to nodes of the first type using a second routing protocol that differs from the first routing protocol.

Abstract: A method for monitoring a network includes, transmitting and receiving messages at nodes of a network, generating monitoring data associated with the messages at the nodes, collecting the monitoring data from the nodes at a monitoring station in communication with the network, and associating a first portion of the collected monitoring data that corresponds to an event with a second portion of the collected monitoring data that corresponds to the event.

Abstract: A method for identifying nodes in a network includes selecting identification parameters for the nodes in the network. At some nodes in the network, identification information is maintained for a plurality of nodes based on messages received from neighboring nodes, and the identification information is monitored for a conflict between two or more nodes.