Abstract: Systems and methods for co-locating a plurality of transceivers capable of operating on the same frequency without interference are provided. The transmissions and/or receptions of the transceivers are coordinated in the time domain such that conflicting sectors are not utilized simultaneously, allowing for the transceivers to be physically located in close proximity without significant intra-system interference. The coordinating programs described herein allow for enhanced efficiency of spectral utilization as well as enhanced quality of service (QoS) through latency controls, rate control and traffic prioritization.

Abstract: A process for communicating utility-related data over at least one network is described. the process includes: collecting utility-related data at a hub device during a first predetermined period of time; securing the utility-related data at the hub device using digital envelopes during the first predetermined period of time; initiating by the hub device an autonomous wake up process during a second predetermined period of time; sending the secure utility-related data over a first network to a designated server via at least one User Datagram protocol (“UDP”) message during the second predetermined period of time; and receiving an acknowledgement of receipt message of the at least one UDP message from the designated server; wherein the first and second predetermined periods of time typically do not overlap, but may overlap.

Abstract: A process for communicating utility-related data over at least one network is described. the process includes: collecting utility-related data at a hub device during a first predetermined period of time; securing the utility-related data at the hub device using digital envelopes during the first predetermined period of time; initiating by the hub device an autonomous wake up process during a second predetermined period of time; sending the secure utility-related data over a first network to a designated server via at least one User Datagram protocol (“UDP”) message during the second predetermined period of time; and receiving an acknowledgement of receipt message of the at least one UDP message from the designated server; wherein the first and second predetermined periods of time typically do not overlap, but may overlap.

Abstract: A process for communicating utility-related data over at least one network is described. the process includes: collecting utility-related data at a hub device during a first predetermined period of time; securing the utility-related data at the hub device using digital envelopes during the first predetermined period of time; initiating by the hub device an autonomous wake up process during a second predetermined period of time; sending the secure utility-related data over a first network to a designated server via at least one User Datagram protocol (“UDP”) message during the second predetermined period of time; and receiving an acknowledgement of receipt message of the at least one UDP message from the designated server; wherein the first and second predetermined periods of time typically do not overlap, but may overlap.

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.

Abstract: Mesh communications based on a plurality of time-slots in which every time slot is associated with communications between a pair of nodes, in which at least one time-slot is associated with communications between a first node and a second node, and in which at least a second time-slot is associated with communications between the first node and a third node. The first node and the second node communicate during the at least one time-slot, while the third node awaits communications with the first node during the second time-slot. If the first node is still communicating with the second node during the second time-slot the first node does not communication with the third node.

Abstract: A process for communicating utility-related data over at least one network is described. the process includes: collecting utility-related data at a hub device during a first predetermined period of time; securing the utility-related data at the hub device using digital envelopes during the first predetermined period of time; initiating by the hub device an autonomous wake up process during a second predetermined period of time; sending the secure utility-related data over a first network to a designated server via at least one User Datagram protocol (“UDP”) message during the second predetermined period of time; and receiving an acknowledgement of receipt message of the at least one UDP message from the designated server; wherein the first and second predetermined periods of time typically do not overlap, but may overlap.

Abstract: Systems and methods for co-locating a plurality of transceivers capable of operating on the same frequency without interference are provided. The transmissions and/or receptions of the transceivers are coordinated in the time domain such that conflicting sectors are not utilized simultaneously, allowing for the transceivers to be physically located in close proximity without significant intra-system interference. The coordinating programs described herein allow for enhanced efficiency of spectral utilization as well as enhanced quality of service (QoS) through latency controls, rate control and traffic prioritization.

Abstract: Mesh communications based on a plurality of time-slots in which every time slot is associated with communications between a pair of nodes, in which at least one time-slot is associated with communications between a first node and a second node, and in which at least a second time-slot is associated with communications between the first node and a third node. The first node and the second node communicate during the at least one time-slot, while the third node awaits communications with the first node during the second time-slot. If the first node is still communicating with the second node during the second time-slot the first node does not communication with the third node.

Abstract: Mesh communications based on a plurality of time-slots in which every time slot is associated with communications between a pair of nodes, in which at least one time-slot is associated with communications between a first node and a second node, and in which at least a second time-slot is associated with communications between the first node and a third node. The first node and the second node communicate during the at least one time-slot, while the third node awaits communications with the first node during the second time-slot. If the first node is still communicating with the second node during the second time-slot the first node does not communication with the third node.

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.

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.

Abstract: Mesh communications based on a plurality of time-slots in which every time slot is associated with communications between a pair of nodes, in which at least one time-slot is associated with communications between a first node and a second node, and in which at least a second time-slot is associated with communications between the first node and a third node. The first node and the second node communicate during the at least one time-slot, while the third node awaits communications with the first node during the second time-slot. If the first node is still communicating with the second node during the second time-slot the first node does not communication with the third node.

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.