Communication protocol for a wireless mesh architecture

• US 8,644,271 B2
• Filed: 02/25/2008
• Issued: 02/04/2014
• Est. Priority Date: 08/07/2003
• Status: Active Grant

• Current Assignee: Trilliant Networks Incorporated
• Original Assignee: Trilliant Networks Incorporated
• Inventors: Rich, Mark J., Frei, Randy, Gordon, Paul
• Primary Examiner(s): Moore, Ian N
• Assistant Examiner(s): ZUNIGA ABAD, JACKIE
• Application Number:
  US12/072,238
• Publication Number:
  US 20080310346A1
• Time in Patent Office: 2,171 Days
• Field of Search: None
• US Class Current: 370/338
• CPC Class Codes: H04W 72/12 Wireless traffic scheduling
• CPC Class Codes: H04W 74/06 using polling
• CPC Class Codes: H04W 84/12 WLAN [Wireless Local Area Networks]

Abstract

A wireless mesh communication protocol that dynamically assigns communication time-slots and frequencies to mesh nodes. A first node is established as a PC that sequentially polls other nodes. A second node responds at a predetermined time with information that includes database records, and then a third node responds similarly. The second node is then established as the PC and the first node is polled during dynamically allocated time-slots and on a frequency that depend on the second node'"'"'s database records. The third node is then established as a PC and acts similarly. In both cases the first node responds by sending information and data records. The first node is then re-established as the PC. The first node then polls the second and third nodes at times and frequencies that depend on the first node'"'"'s database records.

Claims

1. A mesh network for providing data communications amongst a plurality of nodes, comprising:

a source node for producing a first polling information and a second polling information, wherein the source node is a polling coordinator, wherein the first polling information and the second polling information form a portion of source node database information;

a first node for processing the first polling information to update first node database information; and

a second node for processing the second polling information to update second node database information, wherein a portion of the first node database information, a portion of the second node database information and a portion of the source database information combine to form a shared database that is accessible by a plurality of nodes comprising the source node, the first node and the second node,

wherein each node of the plurality of nodes is assigned to act as the polling coordinator or a polled node on a node by node basis semi-autonomously, based on knowledge by the node of other nodes within an interference area according to a schedule stored in the shared database, where the schedule comprises polling time and frequencies and is updated when a scheduling conflict is identified, which conflict is identified when two nodes within the interference area are scheduled to simultaneously act as the polling coordinator, and wherein the polling time and frequency relate to future times and frequencies at which the nodes are assigned to one of either be polled or act as a polling coordinator.

2. The mesh network of claim 1, wherein the first node updates a first cost routing record using the first polling information and the second node updates a second cost routing record using the second polling information.

3. The mesh network of claim 1, wherein the first node compares the first polling information with the first node database information to produce first responsive information and the second node compares the second polling information with second node database information to produce second responsive information.

4. The mesh network of claim 1, wherein the first node communicates the first responsive information to the source node to update a source node cost routing record.

5. The mesh network of claim 4, wherein the second node communicates the second responsive information to the source node, wherein the first responsive information and the second responsive information is used to update the source node cost routing record.

6. The mesh network of claim 1, wherein the source node database information indicates a number of source allocated time-slots.

7. The mesh network of claim 6, wherein the source node deallocates a portion of the number of source allocated time-slots based on the first responsive information and the second responsive information.

8. The mesh network of claim 6, wherein the source node determines a number of available time-slots based on the source node database information.

9. The mesh network of claim 8, wherein the source node selects a portion of the number of available time-slots to use to communicate at least one of the first polling information or said second polling information, updates the source node database information and communicates the selected portion of the number of available time-slots to the first node and the second node.

10. The mesh network of claim 1, wherein the source node admits a third node into the mesh network by producing a third polling information at a predetermined third time using a portion of the source node database information, wherein the third node creates a third node database information using the third polling information.

11. A method of communicating within a mesh network, comprising:

producing a first polling information and a second polling information at a source node, wherein the source node is a polling coordinator, wherein the first polling information and the second polling information form a portion of source node database information;

updating a first node database information using the first polling information; and

updating a second node database information using the second polling information, wherein a portion of the first node database information, a portion of the second node database information and a portion of the source database information combine to form a shared database that is accessible by a plurality of nodes comprising the source node, the first node and the second node,

wherein each node of the mesh network is assigned to act as the polling coordinator or a polled node on a node by node basis semi-autonomously, based on knowledge by the node of other nodes within an interference area according to a schedule stored in the shared database, where the schedule comprises polling time and frequencies and is updated when a scheduling conflict is identified, which conflict is identified when two nodes within the interference area are scheduled to simultaneously act as the polling coordinator, and wherein the polling time and frequency relate to future times and frequencies at which the nodes are assigned to one of either be polled or act as a polling coordinator.

12. The method of claim 11 further comprising updating a first cost routing record using the first polling information and a second cost routing record using the second polling information.

13. The method of claim 11 further comprising:

comparing the first polling information with the first node database information to produce first responsive information; and

comparing the second polling information with second node database information to produce second responsive information.

14. The method of claim 13 further comprising communicating the first responsive information to the source node to update a source node cost routing record.

15. The method of claim 14 further comprising communicating the second responsive information to the source node, wherein the first responsive information and the second responsive information is used to update the source node cost routing record.

16. The method of claim 11, wherein the source node database information indicates a number of source allocated time-slots.

17. The method of claim 16, wherein reallocating the source allocated timeslots based on first responsive information and second responsive information.

18. The method of claim 16 further comprising determining a number of available time-slots based on the source node database information.

19. The method of claim 18 further comprising:

selecting a portion of the number of available time-slots to use to communicate at least one of the first polling information or the second polling information; and

updating the source node database information; and

communicating the selected portion of the number of available time-slots to the first node and the second node.

20. The method of claim 11, further comprising:

producing a third polling information at a predetermined third time using a portion of the source node database information to admit the third node into a mesh network;

communicating the third polling information to a third node; and

creating a third node database information using the third polling information.