COMMUNICATION AND MESSAGE ROUTE OPTIMIZATION AND MESSAGING IN A MESH NETWORK

• US 20090135716A1
• Filed: 11/21/2008
• Published: 05/28/2009
• Est. Priority Date: 11/25/2007
• Status: Active Grant

• Current Assignee: Trilliant Networks Incorporated
• Original Assignee: Trilliant Networks Incorporated
• Inventors: VEILLETTE, Michel
• Granted Patent: US 8,144,596 B2
• Time in Patent Office: Days
• US Class Current: 370/221
• CPC Class Codes: G01D 4/004 Remote reading of utility meters to a fixed location
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04L 45/34 Source routing
• CPC Class Codes: H04L 45/48 Routing tree calculation
• CPC Class Codes: H04Q 3/66 Traffic distributors
• CPC Class Codes: H04W 40/22 using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
• CPC Class Codes: Y02B 90/20 Smart grids as enabling technology in buildings sector smart grids supporting the management or operation of end-user stationary applications in general, or like technologies with no associated climate change mitigation effect Y04S20/00
• CPC Class Codes: Y02D 30/70 in wireless communication networks
• CPC Class Codes: Y04S 20/30 Smart metering, e.g. specially adapted for remote reading

Abstract

A method and system facilitate communications between an unassociated device and a server via a mesh network and a wide area network. The method may include receiving transmissions from candidate proxy devices, wherein each candidate proxy device is associated with a mesh network. The method may include selecting a proxy device from the candidate proxy devices. The method may include communicating with a server via the proxy device and the associated mesh network.

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

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 the 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 be forwarded; and

a transmitter for transmitting the calculated optimal path to each mesh device.

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 the access point, a path signal quality, and a number of hops to the access point.

11. 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, 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; and

transmitting the calculated optimal path to each mesh device.

12. The computer program 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 computer program of claim 11, further comprising:

storing the associated optimal path in the accessible memory for each mesh device.

14. The computer program of claim 11, further comprising:

receiving a message from a mesh device transmitted along the associated optimal path.

15. The computer program of claim 11, wherein the optimal path is calculated, in part, based on:

a next hop to the 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; and

transmitting 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; 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.

18. The method in claim 16, wherein the identifying a next mesh device from among a plurality of neighbor mesh devices comprises:

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.

19. The method in claim 16, wherein the identifying a next mesh device from among a plurality of neighbor mesh devices comprises:

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.

20. 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; and

transmitting the calculated optimal path to each mesh device.

21. 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; 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.

22. The method in claim 21, further comprising transmitting the message to the identified next mesh device.

23. The method in claim 21, 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; and

transmitting the calculated optimal path to each mesh device.

24. 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; 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 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.

25. The system in claim 24, further comprising a transmitter for transmitting the message to the identified next mesh device.

26. The system in claim 24, 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; and

a transmitter for transmitting the calculated optimal path to each mesh device.

27. 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, the method comprising:

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.

28. The computer program in claim 27, further wherein the method further comprising transmitting the message to the identified next mesh device.

29. The computer program in claim 27, 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; and

transmitting the calculated optimal path to each mesh device.

30. A method for transmitting a message over a mesh network via tree routing, 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; and

transmitting the message to the next mesh device.

31. The method of claim 30, 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; and

replying to the sending mesh device with an acknowledgement after the message has been transmitted.

32. The method of claim 31, 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.

33. The method of claim 32, further comprising:

receiving a reply from the next mesh device;

retrieving the temporary path from the accessible memory; and

forwarding the reply to the sending mesh device.

34. The method of claim 31, 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.

35. The method of claim 31, 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.

36. The method of claim 31, further comprising:

responsive to receiving the neighbor information, updating a neighbor information table in accessible memory.

37. 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; and

a transmitter for transmitting the message to the next mesh device.

38. The system of claim 37, 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; and

the 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.

39. The system of claim 38, 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.

40. The system of claim 39, further comprising:

a memory control logic for retrieving the temporary path from the accessible memory; and

the 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.

41. The system of claim 37, 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.

42. The system of claim 37, 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.

43. The system of claim 37, further comprising:

means responsive to receiving the neighbor information, for updating a neighbor information table in accessible memory.

44. 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 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; and

transmitting the message to the next mesh device.

45. The computer program of claim 44, wherein the method 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; and

replying to the sending mesh device with an acknowledgement after the message has been transmitted.

46. The computer program of claim 45, 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.

47. The computer program of claim 46, wherein the method further comprising:

receiving a reply from the next mesh device;

retrieving the temporary path from the accessible memory; and

forwarding the reply to the sending mesh device.

48. The computer program of claim 44, 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.

49. The computer program of claim 44, 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.

50. The computer program of claim 44, further comprising:

responsive to receiving the neighbor information, updating a neighbor information table in accessible memory.

51. 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; and

means for transmitting the message to the next mesh device.

52. The system of claim 51, 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; and

means for replying to the sending mesh device with an acknowledgement after the message has been transmitted.

53. The system of claim 52, 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.

54. The system of claim 53, further comprising:

means for receiving a reply from the next mesh device;

means for retrieving the temporary path from the accessible memory; and

means for forwarding the reply to the sending mesh device.

55. The system of claim 51, 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.

56. The system of claim 51, further 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.

57. The system of claim 51, further comprising:

means for responsive for receiving the neighbor information, updating a neighbor information table in accessible memory.

58. A method for transmitting a message over a mesh network via source routing, comprising:

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.

59. The method of claim 58, 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; and

replying to the sending mesh device with an acknowledgement after the message has been transmitted.

60. The method of claim 59, further comprising:

storing a temporary path in an accessible memory, wherein the temporary path includes an address of the sending mesh device.

61. The method of claim 60, further comprising:

receiving a reply from the next mesh device;

retrieving the temporary path from the accessible memory; and

forwarding the reply to the sending mesh device.

62. The method of claim 58, wherein the optimal path is calculated, in part, based on:

a next hop to the access point, a path signal quality, and a number of hops to the access point.

63. A system for transmitting a message over a mesh network via source 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 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.

64. The system of claim 63, 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; and

the 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.

65. The system of claim 64, 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.

66. The system of claim 65, further comprising:

a memory control logic for retrieving the temporary path from the accessible memory; and

the 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.

67. The system of claim 63, wherein the optimal path is calculated, in part, based on:

a next hop to the access point, a path signal quality, and a number of hops to the access point.

68. 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 source routing, comprising:

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.

69. The computer program of claim 68, 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; and

replying to the sending mesh device with an acknowledgement after the message has been transmitted.

70. The computer program of claim 69, further comprising:

storing a temporary path in an accessible memory, wherein the temporary path includes an address of the sending mesh device.

71. The computer program of claim 70, further comprising:

receiving a reply from the next mesh device;

retrieving the temporary path from the accessible memory; and

forwarding the reply to the sending mesh device.

72. The computer program of claim 68, wherein the optimal path is calculated, in part, based on:

a next hop to the access point, a path signal quality, and a number of hops to the access point.

73. A system for transmitting a message over a mesh network via source routing, comprising:

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.

74. The system of claim 73, wherein:

the means for receiving 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; and

the means for receiving 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.

75. The system of claim 74, further comprising:

means for storing a temporary path in an accessible memory, wherein the temporary path includes an address of the sending mesh device.

76. The system of claim 75, further comprising:

means for retrieving the temporary path from the accessible memory; and

the means for receiving 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.

77. The system of claim 73, wherein the optimal path is calculated, in part, based on:

a next hop to the access point, a path signal quality, and a number of hops to the access point.

78. A method for transmitting a message over a mesh network via mesh routing, comprising:

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.

79. The method of claim 78, 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; and

replying to the sending mesh device with an acknowledgement after the message has been transmitted.

80. The method of claim 79, further comprising:

storing a temporary path in an accessible memory, wherein the temporary path includes an address of the sending mesh device.

81. The method of claim 80, further comprising:

receiving a reply from the next mesh device;

retrieving the temporary path from the accessible memory;

forwarding the reply to the sending mesh device.

82. The method of claim 81, wherein the optimal path is calculated, in part, based on:

a next hop to the access point, a path signal quality, and a number of hops to the access point.

83. The method of claim 82, further comprising discovering at least one route within the mesh network via mesh routing, the route discovery comprising:

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.

84. A system for transmitting a message over a mesh network via mesh 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 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.

85. The system of claim 84, wherein:

the receiver is adapted for receiving a message from a sending mesh device for forwarding, and wherein the request to transmit the message to the access point is indicated in a header of the message; and

the receiver of the sending mesh device being adapted to receive a reply with an acknowledgement after the message has been transmitted.

86. The system of claim 85, 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.

87. The system of claim 86, further comprising:

a memory control logic for retrieving the temporary path from the accessible memory; and

the 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.

88. The system of claim 84, wherein the optimal path is calculated, in part, based on:

a next hop to the access point, a path signal quality, and a number of hops to the access point.

89. 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 mesh routing, comprising:

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.

90. The computer program of claim 89, the method 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; and

replying to the sending mesh device with an acknowledgement after the message has been transmitted.

91. The computer program of claim 90, the method further comprising:

storing a temporary path in an accessible memory, wherein the temporary path includes an address of the sending mesh device.

92. The computer program of claim 91, the method further comprising:

receiving a reply from the next mesh device;

retrieving the temporary path from the accessible memory; and

forwarding the reply to the sending mesh device.

93. The computer program of claim 89, wherein the optimal path is calculated, in part, based on:

a next hop to the access point, a path signal quality, and a number of hops to the access point.

94. The computer program of claim 89, wherein the computer program further implements the method of discovering at least one route within the mesh network via mesh routing, the route discovery comprising:

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.

95. A method for route discovery within a mesh network via mesh routing, comprising:

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.

96. The method of claim 95, wherein the optimal path reply includes:

a next hop to the access point, a path signal quality, and a number of hops to the access point.

97. The method of claim 95 further comprising:

responsive to a failure to receive an optimal path reply, replying to the sending mesh device with a failure message.

98. A system for route discovery within a mesh network via mesh routing, 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.

99. 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 comprising:

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.