Route determining methods for a network
An invitation message ( 112, 116, 120 ) is sent from a concentrator ( 102 ) to nodes in a network. Each node records ( 124 ) an identifier ( 126 ) of the node or concentrator from which it received the message and forwards ( 122 ) the message to its neighbors. A node ( 108 ) then sends a trace message ( 132, 134, 136 ) to the concentrator ( 102 ) via intermediate nodes ( 106, 104 ) traversed by the invitation message in reaching the node and appends thereto the identifiers of the intermediate nodes. The concentrator then uses source routing to send a subsequent message ( 144, 146, 148 ) to the node ( 108 ) using the identifiers included in the trace message. The invitation message and/or the subsequent message includes characteristics) ( 200 ) of the concentrator one or more of which are then stored by nodes, including node ( 108 ). The characteristic(s) are used in deciding ( 206, 208 ) to send further trace messages, thereby regulating use of network bandwidth.
1. A method for determining routing information for a network of nodes, comprising:
sending a first message from a concentrator to the nodes in the network, wherein each node records an identifier of the node or concentrator from which the node receives the first message and then forwards the first message to neighboring nodes, wherein the first message includes at least one characteristic of the concentrator, said at least one characteristic including an indicator denoting the amount of storage capacity available for storing identifiers;
sending a second message identifying a first node to the concentrator, wherein the second message traverses any intermediate nodes traversed by the first message to reach the first node and has appended the identifier of each such intermediate node;
determining a route for a third message from the concentrator to the first node according to the identifiers included in the second message;
recording said at least one characteristic at the first node;
determining whether the concentrator is constrained based on said at least one characteristic; and
sending an additional message from the first node to the concentrator if said at least one characteristic indicates that the concentrator's storage capacity for identifiers is constrained.
2. A method as claimed in claim 1 , wherein the third message comprises at least one characteristic of the concentrator.
3. A method as claimed in claim 1 , wherein the first message is a modified ZigBee route request frame.
4. A method as claimed in claim 1 , wherein the second message is a ZigBee route record command frame.
5. A method as claimed in claim 1 , wherein the second message is a modified ZigBee network layer data frame.
6. A method as claimed in claim 1 , wherein the third message is a modified ZigBee network layer data frame.
7. A system for determining routing information for a network of nodes, the system comprising:
a concentrator operable to send a first message to nodes in the network;
a first node operable to:
record an identifier of the node or concentrator from which the first node receives the first message;
forward the first message to neighboring nodes;
send a second message identifying the first node to the concentrator, wherein the second message traverses any intermediate nodes traversed by the first message to reach the first node and has appended the identifier of each such intermediate node; and
the concentrator being operable to:
receive the second message; and
determine a route for a third message from the concentrator to the first node according to the identifiers included in the second message; wherein
the concentrator is further operable to include at least one characteristic of the concentrator in the first message, said at least one characteristic including an indicator denoting the amount of storage capacity available for storing identifiers, and
the first node is further operable to:
record said at least one characteristic at the first node; and,
send an additional message from the first node to the concentrator if said at least one characteristic indicates that the concentrator's storage capacity for identifiers is constrained.
8. A system as claimed in claim 7 , wherein the third message comprises at least one characteristic of the concentrator.
9. A system as claimed in claim 7 , wherein the first message is a modified ZigBee route request frame.
10. A system as claimed in claim 7 , wherein the second message is a ZigBee route record command frame.
11. A system as claimed in claim 7 , wherein the second message is a modified ZigBee network layer data frame.
12. A system as claimed in claim 7 , wherein the third message is a modified ZigBee network layer data frame.