Communications meshes

• US 20020042274A1
• Filed: 10/09/2001
• Published: 04/11/2002
• Est. Priority Date: 10/10/2000
• Status: Active Grant

• Current Assignee: Intel Corporation
• Original Assignee: Radiant Networks PLC
• Inventors: Ades, Stephen
• Granted Patent: US 7,286,489 B2
• Time in Patent Office: Days
• US Class Current: 455/445
• CPC Class Codes: H04L 41/0806 for initial configuration or provisioning, e.g. plug-and-play
• CPC Class Codes: H04L 41/0816 the condition being an adaptation, e.g. in response to network events
• CPC Class Codes: H04L 41/0856 by backing up or archiving configuration information
• CPC Class Codes: H04L 41/0863 by rolling back to previous configuration versions
• CPC Class Codes: H04L 41/0866 Checking the configuration
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

Methods are disclosed for forming a network (1) of nodes (A-H) from a plurality of nodes (A-H) and a plurality of potential transmission links (2) between respective nodes (A-H). Methods are also disclosed for adapting an initial mesh communications network configuration to a final mesh communications network communications configuration. Methods are also disclosed such that at least some of the changes to the initial mesh communications network configuration that are required as part of the adaptation to the final mesh communications network configuration form a group of changes such that all of the changes within the group can occur substantially simultaneously. Various other methods useful in or to a mesh communications network (1) are also disclosed herein.

Claims

1. A method of forming a network of nodes from a plurality of nodes and a plurality of potential transmission links between respective nodes, at least one of the nodes being a connection node that provides a data connection into and out of the formed network, and wherein for each node that is not a connection node there is a maximum number of links acceptable for a transmission path from said node to a connection node, each node in the formed network being able to communicate with at least one other node by a transmission link between said each node and said at least one other node, each of the nodes in the formed network other than said connection node or connection nodes being linked to at least one connection node by at least one transmission path that comprises either a single transmission link between the node and a connection node or respective transmission links between the node and a connection node via one or more intermediate nodes, the method comprising the steps of:

for a node which is not a connection node and which has not been linked to a connection node;

(a) where there is a single connection node, identifying all transmission paths from said node to said single connection node that do not exceed said maximum number of links or, where there are plural connection nodes, identifying all transmission paths from said node to any of said connection nodes that do not exceed said maximum number of links;

(b) testing said paths against at least one criterion for acceptability until an acceptable path is found and providing links between the or each node on that acceptable path so that the or each node on that acceptable path is linked to a connection node by a transmission path which comprises either a single transmission link between the node and a connection node or respective transmission links between the node and a connection node via one or more intermediate nodes; and

,

(c) repeating steps (a) and (b) for all nodes which are not connection nodes and which have not been linked to a connection node.

2. A method according to claim 1, wherein each of the transmission links is a wireless transmission link.

3. A method according to claim 1, wherein some of the transmission links are wireless transmission links and the remainder of the transmission links are cabled transmission links.

4. A method according to claim 1, wherein steps (a) to (c) are applied to nodes in descending order of expected data flow rate requirements for the nodes.

5. A method according to claim 1, comprising the step of, after step (a) and before step (b), determining an order of priority of said paths and wherein in step (b) said paths are tested for acceptability in said order of priority.

6. A method according to claim 5, at least some of the links being wireless transmission links, wherein step (a) comprises identifying all paths from said node to at least one connection node, and wherein the order of priority of the paths is determined in ascending order of the number of wireless transmission links in those paths.

7. A method according to claim 5, wherein step (a) comprises identifying all paths from said node to at least one connection node, and wherein the order of priority of the paths is determined in ascending order of the total currently committed data flow rate of the connection nodes to which said paths lead.

8. A method according to claim 5, at least some of the links being wireless transmission links, wherein the order of the paths is determined in ascending order of the total physical length of the wireless transmission links within said paths.

9. A method according to claim 5, wherein the order of the paths is determined in descending order of the number of links in a path that form at least a portion of a path that has previously been determined to be acceptable.

10. A method according to claim 1, wherein in step (b) a path is determined to be unacceptable if linking the or each node on that path to a connection node would exceed the maximum data traffic flow rate for that connection node.

11. A method according to claim 1, wherein in the formed mesh transmissions to and from a connection node take place during distinct timeslots, and wherein in step (b) a path is determined to be unacceptable if linking the or each node on that path to a connection node would exceed the number of timeslots available at that connection node.

12. A method according to claim 1, wherein in the formed mesh transmissions to and from a connection node take place during distinct timeslots, and wherein in step (b) a path is determined to be unacceptable if linking the or each node on that path to a connection node would exceed the number of timeslots available at any node on that path.

13. A method according to claim 1, wherein the or each node on a path being tested in step (b) has plural antennas, each antenna being capable of providing a respective wireless transmission link with another node, wherein a path is determined to be unacceptable in step (b) if linking the or each node on that path to a connection node would result in any of the nodes not having at least one free antenna.

14. A method according to claim 1, wherein the or each node on a path being tested in step (b) has plural antennas, each antenna being capable of providing a respective wireless transmission link with another node, and wherein step (b) comprises the further step of flagging all potential links to/from a node as unavailable for use in a path if that node is linked to a connection node and has only one free antenna or if that node is a connection node and has only one free antenna.

15. A method according to claim 1, wherein step (b) comprises the further step of flagging all potential links between two nodes as unavailable for use in a path if both of said nodes are linked to a connection node.

16. A method according to claim 1, wherein step (b) comprises the further step of flagging all potential links between a node and a connection node as unavailable for use in a path if said node is linked to a connection node.

17. A method according to claim 1, wherein, prior to linking a node to a connection node, a check is made of all other nodes that have not been linked to a connection node to determine whether any of said other nodes would be made unconnectable to a connection node if said first node were linked to said connection node.

18. A method according to claim 17, wherein said first node is not linked to a connection node if there are any nodes that would be made unconnectable to a connection node if said first node were linked to said connection node.

19. A method according to claim 1, comprising the step of, prior to step (a), for a node that has a single potential link to another node, linking that node to another node using said single potential link and marking said single potential link as unavailable for use in another path.

20. A method according to claim 1, comprising the step of providing further links between at least some of the nodes so as to create redundant paths to a connection node for at least one of the nodes.

21. A computer program comprising program instructions for causing a computer to perform the method of claim 1.

22. A storage medium having stored thereon or therein a computer program according to claim 21.

23. A computer programmed to carry out the method of claim 1.

25. A method according to claim 24, wherein each of the transmission links is a wireless transmission link.

26. A method according to claim 24, wherein some of the transmission links are wireless transmission links and the remainder of the transmission links are cabled transmission links.

27. A method according to claim 24, wherein steps (a) to (c) are applied to nodes in descending order of expected data flow rate requirements for the nodes.

28. A method according to claim 24, comprising the step of, after step (a) and before step (b), determining an order of priority of said paths and wherein in step (b) said paths are tested for acceptability in said order of priority.

29. A method according to claim 28, at least some of the links being wireless transmission links, wherein step (a) comprises identifying all paths from said node to at least one connection node, and wherein the order of priority of the paths is determined in ascending order of the number of wireless transmission links in those paths.

30. A method according to claim 28, wherein step (a) comprises identifying all paths from said node to at least one connection node, and wherein the order of priority of the paths is determined in ascending order of the total currently committed data flow rate of the connection nodes to which said paths lead.

31. A method according to claim 28, at least some of the links being wireless transmission links, wherein the order of the paths is determined in ascending order of the total physical length of the wireless transmission links within said paths.

32. A method according to claim 28, wherein the order of the paths is determined in descending order of the number of links in a path that form at least a portion of a path that has previously been determined to be acceptable.

33. A method according to claim 24, wherein in step (b) a path is determined to be unacceptable if linking the or each node on that path to a connection node would exceed the maximum data traffic flow rate for that connection node.

34. A method according to claim 24, wherein in the formed mesh transmissions to and from a connection node take place during distinct timeslots, and wherein in step (b) a path is determined to be unacceptable if linking the or each node on that path to a connection node would exceed the number of timeslots available at that connection node.

35. A method according to claim 24, wherein in the formed mesh transmissions to and from a connection node take place during distinct timeslots, and wherein in step (b) a path is determined to be unacceptable if linking the or each node on that path to a connection node would exceed the number of timeslots available at any node on that path.

36. A method according to claim 24, wherein the or each node on a path being tested in step (b) has plural antennas, each antenna being capable of providing a respective wireless transmission link with another node, wherein a path is determined to be unacceptable in step (b) if linking the or each node on that path to a connection node would result in any of the nodes not having at least one free antenna.

37. A method according to claim 24, wherein the or each node on a path being tested in step (b) has plural antennas, each antenna being capable of providing a respective wireless transmission link with another node, and wherein step (b) comprises the further step of flagging all potential links to/from a node as unavailable for use in a path if that node is linked to a connection node and has only one free antenna or if that node is a connection node and has only one free antenna.

38. A method according to claim 24, wherein step (b) comprises the further step of flagging all potential links between two nodes as unavailable for use in a path if both of said nodes are linked to a connection node.

39. A method according to claim 24, wherein step (b) comprises the further step of flagging all potential links between a node and a connection node as unavailable for use in a path if said node is linked to a connection node.

40. A method according to claim 24, wherein, prior to linking a node to a connection node, a check is made of all other nodes that have not been linked to a connection node to determine whether any of said other nodes would be made unconnectable to a connection node if said first node were linked to said connection node.

41. A method according to claim 40, wherein said first node is not linked to a connection node if there are any nodes that would be made unconnectable to a connection node if said first node were linked to said connection node.

42. A method according to claim 24, comprising the step of, prior to step (a), for a node that has a single potential link to another node, linking that node to another node using said single potential link and marking said single potential link as unavailable for use in another path.

43. A method according to claim 24, comprising the step of providing further links between at least some of the nodes so as to create redundant paths to a connection node for at least one of the nodes.

44. A computer program comprising program instructions for causing a computer to perform the method of claim 24.

45. A storage medium having stored thereon or therein a computer program according to claim 44.

46. A computer programmed to carry out the method of claim 24.

48. A method according to claim 47, wherein each of the transmission links is a wireless transmission link.

49. A method according to claim 47, wherein some of the transmission links are wireless transmission links and the remainder of the transmission links are cabled transmission links.

50. A method according to claim 47, wherein steps (a) to (c) are applied to nodes in descending order of expected data flow rate requirements for the nodes.

51. A method according to claim 47, comprising the step of, after step (a) and before step (b), determining an order of priority of said paths and wherein in step (b) said paths are tested for acceptability in said order of priority.

52. A method according to claim 51, at least some of the links being wireless transmission links, wherein step (a) comprises identifying all paths from said node to at least one designated anchor node, and wherein the order of priority of the paths is determined in ascending order of the number of wireless transmission links in those paths.

53. A method according to claim 51, wherein step (a) comprises identifying all paths from said node to at least one designated anchor node, and wherein the order of priority of the paths is determined in ascending order of the total currently committed data flow rate of the designated anchor nodes to which said paths lead.

54. A method according to claim 51, at least some of the links being wireless transmission links, wherein the order of the paths is determined in ascending order of the total physical length of the wireless transmission links within said paths.

55. A method according to claim 51, wherein the order of the paths is determined in descending order of the number of links in a path that form at least a portion of a path that has previously been determined to be acceptable.

56. A method according to claim 47, wherein in step (b) a path is determined to be unacceptable if linking the or each node on that path to a designated anchor node would exceed the maximum data traffic flow rate for that designated anchor node.

57. A method according to claim 47, wherein in the formed mesh transmissions to and from a designated anchor node take place during distinct timeslots, and wherein in step (b) a path is determined to be unacceptable if linking the or each node on that path to a designated anchor node would exceed the number of timeslots available at that designated anchor node.

58. A method according to claim 47, wherein in the formed mesh transmissions to and from a designated anchor node take place during distinct timeslots, and wherein in step (b) a path is determined to be unacceptable if linking the or each node on that path to a designated anchor node would exceed the number of timeslots available at any node on that path.

59. A method according to claim 47, wherein the or each node on a path being tested in step (b) has plural antennas, each antenna being capable of providing a respective wireless transmission link with another node, wherein a path is determined to be unacceptable in step (b) if linking the or each node on that path to a designated anchor node would result in any of the nodes not having at least one free antenna.

60. A method according to claim 47, wherein the or each node on a path being tested in step (b) has plural antennas, each antenna being capable of providing a respective wireless transmission link with another node, and wherein step (b) comprises the further step of flagging all potential links to/from a node as unavailable for use in a path if that node is linked to a designated anchor node and has only one free antenna or if that node is a designated anchor node and has only one free antenna.

61. A method according to claim 47, wherein step (b) comprises the further step of flagging all potential links between two nodes as unavailable for use in a path if both of said nodes are linked to a designated anchor node.

62. A method according to claim 47, wherein step (b) comprises the further step of flagging all potential links between a node and a designated anchor node as unavailable for use in a path if said node is linked to a designated anchor node.

63. A method according to claim 47, wherein, prior to linking a node to a designated anchor node, a check is made of all other nodes that have not been linked to a designated anchor node to determine whether any of said other nodes would be made unconnectable to a designated anchor node if said first node were linked to said designated anchor node.

64. A method according to claim 63, wherein said first node is not linked to a designated anchor node if there are any nodes that would be made unconnectable to a designated anchor node if said first node were linked to said designated anchor node.

65. A method according to claim 47, comprising the step of, prior to step (a), for a node that has a single potential link to another node, linking that node to another node using said single potential link and marking said single potential link as unavailable for use in another path.

66. A method according to claim 47, comprising the step of providing further links between at least some of the nodes so as to create redundant paths to a designated anchor node for at least one of the nodes.

67. A computer program comprising program instructions for causing a computer to perform the method of claim 47.

68. A storage medium having stored thereon or therein a computer program according to claim 67.

69. A computer programmed to carry out the method of claim 47.

111. A method according to claim 97, wherein said method of formation is a method according to claim 1.

112. A method according to claim 106, wherein said method of formation is a method according to claim 1.

113. A method according to claim 109, wherein said method of formation is a method according to claim 1.

114. A method according to claim 97, wherein said method of formation is a method according to claim 47.

122. A method according to claim 121, wherein there are plural groups of said changes, the transmitting step comprising the step of transmitting relevant information about the changes of each group to each node which during the adaptation will take part in any of the changes.

123. A method according to claim 121, comprising the step of, after a predetermined time following the transmitting step, interrogating each said node to determine if the change has occurred successfully.

124. A computer program comprising program instructions for causing a computer to perform the method of claim 121.

125. A storage medium having stored thereon or therein a computer program according to claim 124.

126. A computer programmed to carry out the method of claim 121.

128. A mesh communications network according to claim 127, wherein all timeslots have the same duration.

130. A mesh communications network according to claim 129, wherein each of said at least some nodes is adapted to enter into a split table mode for said certain predetermined changes to the network topology by which the routing table that was in use prior to said certain predetermined changes to the network topology taking place continues to be used for routing signals across the network whilst a separate updated routing table is calculated and stored separately, the updated routing table being used to route signals across the network after split table mode is exited.

131. A mesh communications network according to claim 129, wherein said certain predetermined changes include one or more of failure or restoration or creation of a link or modification of the desirability of a link.

133. A computer program comprising program instructions for causing a computer to perform the method of claim 132.

134. A storage medium having stored thereon or therein a computer program according to claim 133.

24. A method of providing a topology for a network of nodes and actual transmission links between nodes by determining which of a plurality of potential transmission links between the nodes should be made into actual transmission links between nodes, at least one node being a connection node that provides a data connection into and out of the formed network, and wherein for each node that is not a connection node there is a maximum number of links acceptable for a transmission path from said node to a connection node, each node in the formed network being in communication with at least one other node by a transmission link between said each node and said at least one other node, each of the nodes in the formed network other than said connection node or connection nodes being linked to at least one connection node by at least one transmission path which comprises either a single transmission link between the node and a connection node or respective transmission links between the node and a connection node via one or more intermediate nodes, the method comprising the steps of:

for a node which is not a connection node and which has not been linked to a connection node;

(a) where there is a single connection node, identifying all transmission paths from said node to said single connection node that do not exceed said maximum number of links or, where there are plural connection nodes, identifying all transmission paths from said node to any of said connection nodes that do not exceed said maximum number of links;

(b) testing said paths against at least one criterion for acceptability until an acceptable path is found and flagging in a computer database or data structure a variable representing the or each node on that acceptable path to indicate that said the or each node on that acceptable path is linked to a connection node; and

,

(c) repeating steps (a) and (b) for all nodes which are not connection nodes and which have not been flagged as linked to a connection node;

thereby to provide a dataset representing a topology for a network of the nodes and transmission links between the nodes.

47. A method of forming a network of nodes from a plurality of nodes and a plurality of potential transmission links between respective nodes, each node in the formed network being able to communicate with at least one other node by a transmission link between said each node and said at least one other node, each of the nodes in the formed network being linked to at least one designated anchor node by at least one transmission path that comprises either a single transmission link between the node and a designated anchor node or respective transmission links between the node and a designated anchor node via one or more intermediate nodes, wherein all nodes in the formed network are linked to all other nodes, and wherein for each node that is not a designated anchor node there is a maximum number of links acceptable for a transmission path from said node to a designated anchor node, the method comprising the steps of:

for a node which is not a designated anchor and which has not been linked to a designated anchor node;

(a) where there is a single designated anchor node, identifying all transmission paths from said node to said single designated anchor node that do not exceed said maximum number of links or, where there are plural designated anchor nodes, identifying all transmission paths from said node to any of said designated anchor nodes that do not exceed said maximum number of links;

(b) testing said paths against at least one criterion for acceptability until an acceptable path is found and providing links between the or each node on that acceptable path so that the or each node on that acceptable path is linked to a designated anchor node by a transmission path which comprises either a single transmission link between the node and a designated anchor node or respective transmission links between the node and a designated anchor node via one or more intermediate nodes; and

,

(c) repeating steps (a) and (b) for all nodes which are not designated anchor nodes and which have not been linked to a designated anchor node.

70. A method of providing a topology for a network of nodes and actual transmission links between nodes by determining which of a plurality of potential transmission links between the nodes should be made into actual transmission links between nodes, each node in the formed network being in communication with at least one other node by a transmission link between said each node and said at least one other node, each of the nodes in the formed network being linked to at least one designated anchor node by at least one transmission path which comprises either a single transmission link between the node and a designated anchor node or respective transmission links between the node and a designated anchor node via one or more intermediate nodes, wherein all nodes in the formed network are linked to all other nodes, and wherein for each node that is not a designated anchor node there is a maximum number of links acceptable for a transmission path from said node to a designated anchor node, the method comprising the steps of:

for a node which is not a designated anchor node and which has not been linked to a designated anchor node;

(a) where there is a single designated anchor node, identifying all transmission paths from said node to said single designated anchor node that do not exceed said maximum number of links or, where there are plural designated anchor nodes, identifying all transmission paths from said node to any of said designated anchor nodes that do not exceed said maximum number of links;

(b) testing said paths against at least one criterion for acceptability until an acceptable path is found and flagging in a computer database or data structure a variable representing the or each node on that acceptable path to indicate that said the or each node on that acceptable path is linked to a designated anchor node; and

,

(c) repeating steps (a) and (b) for all nodes which are not designated anchor nodes and which have not been flagged as linked to a designated anchor node;

thereby to provide a dataset representing a topology for a network of the nodes and transmission links between the nodes in which all nodes in the formed network are linked to all other nodes.

71. A method according to claim 70, wherein each of the transmission links is a wireless transmission link.

72. A method according to claim 70, wherein some of the transmission links are wireless transmission links and the remainder of the transmission links are cabled transmission links.

73. A method according to claim 70, wherein steps (a) to (c) are applied to nodes in descending order of expected data flow rate requirements for the nodes.

74. A method according to claim 70, comprising the step of, after step (a) and before step (b), determining an order of priority of said paths and wherein in step (b) said paths are tested for acceptability in said order of priority.

75. A method according to claim 74, at least some of the links being wireless transmission links, wherein step (a) comprises identifying all paths from said node to at least one designated anchor node, and wherein the order of priority of the paths is determined in ascending order of the number of wireless transmission links in those paths.

76. A method according to claim 74, wherein step (a) comprises identifying all paths from said node to at least one designated anchor node, and wherein the order of priority of the paths is determined in ascending order of the total currently committed data flow rate of the designated anchor nodes to which said paths lead.

77. A method according to claim 74, at least some of the links being wireless transmission links, wherein the order of the paths is determined in ascending order of the total physical length of the wireless transmission links within said paths.

78. A method according to claim 74, wherein the order of the paths is determined in descending order of the number of links in a path that form at least a portion of a path that has previously been determined to be acceptable.

79. A method according to claim 70, wherein in step (b) a path is determined to be unacceptable if linking the or each node on that path to a designated anchor node would exceed the maximum data traffic flow rate for that designated anchor node.

80. A method according to claim 70, wherein in the formed mesh transmissions to and from a designated anchor node take place during distinct timeslots, and wherein in step (b) a path is determined to be unacceptable if linking the or each node on that path to a designated anchor node would exceed the number of timeslots available at that designated anchor node.

81. A method according to claim 70, wherein in the formed mesh transmissions to and from a designated anchor node take place during distinct timeslots, and wherein in step (b) a path is determined to be unacceptable if linking the or each node on that path to a designated anchor node would exceed the number of timeslots available at any node on that path.

82. A method according to claim 70, wherein the or each node on a path being tested in step (b) has plural antennas, each antenna being capable of providing a respective wireless transmission link with another node, wherein a path is determined to be unacceptable in step (b) if linking the or each node on that path to a designated anchor node would result in any of the nodes not having at least one free antenna.

83. A method according to claim 70, wherein the or each node on a path being tested in step (b) has plural antennas, each antenna being capable of providing a respective wireless transmission link with another node, and wherein step (b) comprises the further step of flagging all potential links to/from a node as unavailable for use in a path if that node is linked to a designated anchor node and has only one free antenna or if that node is a designated anchor node and has only one free antenna.

84. A method according to claim 70, wherein step (b) comprises the further step of flagging all potential links between two nodes as unavailable for use in a path if both of said nodes are linked to a designated anchor node.

85. A method according to claim 70, wherein step (b) comprises the further step of flagging all potential links between a node and a designated anchor node as unavailable for use in a path if said node is linked to a designated anchor node.

86. A method according to claim 70, wherein, prior to linking a node to a designated anchor node, a check is made of all other nodes that have not been linked to a designated anchor node to determine whether any of said other nodes would be made unconnectable to a designated anchor node if said first node were linked to said designated anchor node.

87. A method according to claim 86, wherein said first node is not linked to a designated anchor node if there are any nodes that would be made unconnectable to a designated anchor node if said first node were linked to said designated anchor node.

88. A method according to claim 70, comprising the step of, prior to step (a), for a node that has a single potential link to another node, linking that node to another node using said single potential link and marking said single potential link as unavailable for use in another path.

89. A method according to claim 70, comprising the step of providing further links between at least some of the nodes so as to create redundant paths to a designated anchor node for at least one of the nodes.

90. A computer program comprising program instructions for causing a computer to perform the method of claim 70.

91. A storage medium having stored thereon or therein a computer program according to claim 90.

92. A computer programmed to carry out the method of claim 70.

93. A method of forming a network of nodes from a plurality of nodes and a plurality of potential transmission links between respective nodes, each node in the formed network being able to communicate with at least one other node by a transmission link between said each node and said at least one other node, wherein at least one of the nodes has a peak traffic rate requirement for traffic to another point in the network and said node has a primary traffic path to said point in the network, the method comprising the steps of:

determining the traffic capacity of said primary path;

identifying other paths, other than said primary path, from said node to said point in the network such that the sum of the traffic capacity of said primary path and the traffic capacity of said other paths is equal to or greater than said peak traffic rate requirement for said node; and

,

making said other paths available to carry traffic from said node to said point in the network in addition to said primary path;

whereby in the formed network if the traffic rate for traffic from said node to said point in the network exceeds the traffic capacity of said primary path, the traffic can be divided into discrete portions which are respectively delivered over the primary path and said other paths to said point in the network.

94. A computer program comprising program instructions for causing a computer to perform the method of claim 93.

95. A method of forming a network of nodes from a plurality of nodes and a plurality of potential transmission links between respective nodes, each node in the formed network being able to communicate with at least one other node by a transmission link between said each node and said at least one other node, wherein at least one of the nodes has a peak traffic rate requirement for traffic to another point in the network and each said node has a primary traffic path plus zero or more other paths to each said point in the network, the method comprising the steps of:

determining the traffic capacity of each said path; and

,

adding in a prioritised order capacity to links in the network such as provide for the peak traffic requirements at said nodes.

96. A computer program comprising program instructions for causing a computer to perform the method of claim 95.

97. A method of adapting an initial mesh communications network configuration to a final mesh communications network communications configuration, wherein:

the initial mesh communications network configuration comprises a first set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh;

the final mesh communications network configuration comprises a second set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh;

the first set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh being different to the second set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh; and

,

wherein there exists a method of forming a mesh communications network configuration from a set of nodes and potential transmission links between the nodes and which allocates timeslots to the transmission links;

the method comprising the step of forming at least a part of the final mesh communications network configuration by operating the method of forming a mesh either or both (i) on the basis of a restricted set of the potential transmission links between the nodes of the second set thus constraining the results produced by the mesh formation such that the initial mesh configuration can be adapted to the final mesh configuration and (ii) by adding one or more additional steps or tests to the method of forming a mesh that constrain the results produced by the mesh formation such that the initial mesh configuration can be adapted to the final mesh configuration.

98. A method according to claim 97, wherein the initial mesh communications network configuration has an initial primary topology being a non-redundant set of paths from every node of the first set to a connection node of the first set, and the final mesh communications network configuration has a final primary topology being a non-redundant set of paths from every node of the second set to a connection node of the second set, and wherein there is at least one new node in the final mesh communications network configuration that is not in the initial mesh communications network configuration,

wherein the step of forming at least part of the final mesh communications network configuration comprises operating the method of forming a mesh on a restricted set of the potential transmission links between the nodes of the second set to produce a final primary topology which is the same as the initial primary topology plus at least one transmission link to the or each new node and in which the or each new node is configured as a node which is at the end of a primary path and which is not configured to be a transit node within the final primary topology for traffic intended for other nodes.

99. A method according to claim 98, wherein said restricted set of the potential transmission links between the nodes of the second set is the combination of all transmission links in the initial mesh communications network configuration plus all potential transmission links between the or each new node and a node in the initial mesh network configuration, whereby the final primary topology is the same as the initial primary topology plus at least one transmission link to the or each new node.

100. A method according to claim 97, the initial mesh communications network configuration having an initial primary topology being a non-redundant set of paths from every node of the first set to a connection node of the first set, wherein the step of forming the final mesh communications network configuration is constrained to prevent a primary path being added that adds a timeslot to any transmission link in the initial primary topology.

101. A method according to claim 97, the initial mesh communications network configuration having an initial primary topology being a non-redundant set of paths from every node of the first set to a connection node of the first set, wherein in the step of forming the final mesh communications network configuration, one or more timeslots are added to links in the initial primary topology.

102. A method according to claim 97, the initial mesh communications network configuration having an initial primary topology being a non-redundant set of paths from every node of the first set to a connection node of the first set, wherein the step of forming the final mesh communications network configuration includes the step of removing one or more links which are in the initial mesh communications network configuration and which are not in the initial primary topology.

103. A method according to claim 97, wherein the initial mesh communications network configuration has an initial primary topology being a non-redundant set of paths from every node of the first set to a connection node of the first set, and the final mesh communications network configuration has a final primary topology being a non-redundant set of paths from every node of the second set to a connection node of the second set, and wherein there may be at least one new node in the final mesh communications network configuration that is not in the initial mesh communications network configuration, and

wherein, in the step of forming at least part of the final mesh communications network configuration, said restricted set of the potential transmission links between the nodes of the second set is all transmission links in the initial mesh network configuration plus, where there is at least one new node in the final mesh communications network configuration that is not in the initial mesh communications network configuration, all potential transmission links between the or each new node and a node in the initial mesh communications network configuration.

104. A method according to claim 103, wherein the change from the initial mesh communications network configuration to the final mesh communications network configuration is made as a single triggered step.

105. A computer program comprising program instructions for causing a computer to perform the method of claim 97.

118. A method according to claim 97, wherein at least some of the changes to the initial mesh communications network configuration that are required as part of the adaptation to the final mesh communications network configuration form a group of changes such that all of the changes within the group can occur substantially simultaneously, the method comprising the step of executing a group of such changes by:

transmitting relevant information about the changes in the group to each node which during the adaptation will take part in any of the changes of said group; and

,

subsequently transmitting an instruction to each said node to carry out said changes of said group, thereby to cause each said node to effect said changes of said group substantially simultaneously.

106. A method of adapting an initial mesh communications network configuration to a final mesh communications network communications configuration, wherein:

the initial mesh communications network configuration comprises a first set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh;

the final mesh communications network configuration comprises a second set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh;

the first set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh being different to the second set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh;

the initial mesh communications network configuration having an initial primary topology being a non-redundant set of paths from every node of the first set to a connection node of the first set, and the final mesh communications network configuration having a final primary topology being a non-redundant set of paths from every node of the second set to a connection node of the second set;

wherein there exists a method of forming a primary topology for a mesh communications network configuration from a set of nodes and potential transmission links between the nodes and which allocates timeslots to the transmission links;

the method comprising the step of operating the method of forming a mesh to form the final primary topology such that it can co-exist with the initial primary topology, whereby the initial mesh configuration can be adapted to the final mesh configuration.

107. A method according to claim 106, wherein in the method of forming the final primary topology, a path is determined to be unacceptable if at any node on the path, the number of potential transmission links that would be used for the path and that were not links in the initial primary topology exceeds the number of new links that the node can support in the final topology as calculated on the basis of the number of free timeslots and free antennas at the node.

108. A computer program comprising program instructions for causing a computer to perform the method of claim 106.

115. A method according to claim 106, wherein said method of formation is a method according to claim 47.

119. A method according to claim 106, wherein at least some of the changes to the initial mesh communications network configuration that are required as part of the adaptation to the final mesh communications network configuration form a group of changes such that all of the changes within the group can occur substantially simultaneously, the method comprising the step of executing a group of such changes by:

transmitting relevant information about the changes in the group to each node which during the adaptation will take part in any of the changes of said group; and

,

subsequently transmitting an instruction to each said node to carry out said changes of said group, thereby to cause each said node to effect said changes of said group substantially simultaneously.

109. A method of adapting an initial mesh communications network configuration to a final mesh communications network communications configuration, wherein:

the initial mesh communications network configuration comprises a first set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh;

the final mesh communications network configuration comprises a second set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh;

the first set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh being different to the second set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh;

the initial mesh communications network configuration having an initial primary topology being a non-redundant set of paths from every node of the first set to a connection node of the first set, and the final mesh communications network configuration having a final primary topology being a non-redundant set of paths from every node of the second set to a connection node of the second set;

wherein there exists a method of forming a primary topology for a mesh communications network configuration from a set of nodes and potential transmission links between the nodes and which allocates timeslots to the transmission links;

the method comprising the steps of;

(A) operating the method of forming a mesh to form an intermediate primary topology such that it can co-exist with the initial primary topology,

(B) operating the method of forming a mesh to form a further intermediate primary topology which can co-exist with the previous intermediate topology,

(C) repeating step (B) until the further intermediate primary topology can co-exist with the final primary topology,

whereby the initial mesh configuration can be adapted to the final mesh configuration via a sequence of co-existing primary topologies.

110. A computer program comprising program instructions for causing a computer to perform the method of claim 109.

116. A method according to claim 109, wherein said method of formation is a method according to claim 47.

120. A method according to claim 109, wherein at least some of the changes to the initial mesh communications network configuration that are required as part of the adaptation to the final mesh communications network configuration form a group of changes such that all of the changes within the group can occur substantially simultaneously, the method comprising the step of executing a group of such changes by:

transmitting relevant information about the changes in the group to each node which during the adaptation will take part in any of the changes of said group; and

,

subsequently transmitting an instruction to each said node to carry out said changes of said group, thereby to cause each said node to effect said changes of said group substantially simultaneously.

117. A method of adapting an initial mesh communications network configuration to a final mesh communications network communications configuration, wherein:

the initial mesh communications network configuration comprises a first set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh;

the final mesh communications network configuration comprises a second set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh;

the first set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh being different to the second set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh; and

,

wherein there exists a set of adaptation techniques available for adapting the initial mesh communications network configuration to the final mesh communications network communications configuration which can be ordered in ascending order of likelihood of success of the adaptation and/or complexity of execution;

the method comprising the step of applying said set of adaptation techniques in said ascending order until one of said techniques is successful in adapting the initial mesh communications network configuration to the final mesh communications network communications configuration.

121. A method of adapting an initial mesh communications network configuration to a final mesh communications network communications configuration, wherein:

the initial mesh communications network configuration comprises a first set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh;

the final mesh communications network configuration comprises a second set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh;

the first set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh being different to the second set of nodes, transmission links between the nodes, timeslot allocations to the transmission links and traffic paths across the mesh;

wherein at least some of the changes to the initial mesh communications network configuration that are required as part of the adaptation to the final mesh communications network configuration form a group of changes such that all of the changes within the group can occur substantially simultaneously, the method comprising the step of executing a group of such changes by;

transmitting relevant information about the changes in the group to each node which during the adaptation will take part in any of the changes of said group; and

,

subsequently transmitting an instruction to each said node to carry out said changes of said group, thereby to cause each said node to effect said changes of said group substantially simultaneously.

127. A mesh communications network, the network comprising plural nodes and transmission links between the nodes, and wherein timeslots are allocated to the transmission links for transmission and reception of signals between the nodes over the links, wherein on at least one link at least two consecutive timeslots are allocated for transmission such that user traffic is in use transmitted continuously over more than one timeslot on said at least one link.

129. A mesh communications network, the network comprising plural nodes and transmission links between the nodes arranged in a network topology, at least some of the nodes being linked to plural other nodes via transmission links, each of said at least some nodes having a routing table for routing signals across the network by specifying the link along which signals from the node to another node are to be sent and being capable of updating the routing table according to the status of links in the network, each of said at least some nodes being arranged such that for certain predetermined changes to the network topology the updated routing table is not applied immediately for routing signals across the network.

132. A method of measuring the behaviour of a proposed mesh communications network whilst operating an existing mesh communications network, wherein:

the proposed mesh communications network comprises a proposed network of nodes in which each node is able to communicate with at least one other node by a wireless transmission link between said each node and said at least one other node, each transmission of a signal over a link from a first node to a second node taking place during a timeslot; and

wherein;

the existing mesh communications network comprises an existing network of nodes in which each node is able to communicate with at least one other node by a wireless transmission link between said each node and said at least one other node, each transmission of a signal over a link from a first node to a second node taking place during a timeslot;

the method comprising the steps of;

using one or more auxiliary timeslots within the existing mesh communications network to emulate the wireless transmission environment of one or more proposed transmission configurations over the links that will exist in the proposed mesh communications network.

135. A computer programmed to carry out the method of claim 132.