Abstract: A visualization tool for displaying the geographic location and connectivity of nodes within a network. More specifically, a method and apparatus determines a geographic position of each node in a plurality of nodes within a data network; determines an icon to represent each node in the plurality of nodes; overlays each of the icons onto a geographically accurate map, where each icon is position at the geographic position for the node represented by the icon; determines node connectivity; and overlays, upon the geographically accurate map, a graphical link between pairs of icons representing node connectivity. In this manner, a network operator is provided a geographically accurate view of a data network including nodes and the connectivity of the nodes.

Abstract: Network channel access protocol is disclosed. More particularly, a distributed, locally determined, channel access protocol that adapts to load, avoids interference and controls access by a group of nodes to a set of shared channels is disclosed. Shared channel space is divided into a number of communication slots that are repeated at a predetermined interval. Permission to use a slot to communicate between any two nodes is dynamically adjusted by the channel access protocol, which locally: (i) estimates load to neighboring nodes; (ii) allocates or deallocates slot usage to adapt to load and avoid interference; and (iii) asserts and advertises slot usage within an interference area about itself.

Abstract: Network channel access protocol is disclosed. More particularly, a distributed, locally determined, channel access protocol that adapts to load, avoids interference and controls access by a group of nodes to a set of shared channels is disclosed. Shared channel space is divided into a number of communication slots that are repeated at a predetermined interval. Permission to use a slot to communicate between any two nodes is dynamically adjusted by the channel access protocol, which locally: (i) estimates load to neighboring nodes; (ii) allocates or deallocates slot usage to adapt to load and avoid interference; and (iii) asserts and advertises slot usage within an interference area about itself.

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: Network channel access protocol is disclosed. More particularly, a distributed, locally determined, channel access protocol that adapts to load, avoids interference and controls access by a group of nodes to a set of shared channels is disclosed. Shared channel space is divided into a number of communication slots that are repeated at a predetermined interval. Permission to use a slot to communicate between any two nodes is dynamically adjusted by the channel access protocol, which locally: (i) estimates load to neighboring nodes; (ii) allocates or deallocates slot usage to adapt to load and avoid interference; and (iii) asserts and advertises slot usage within an interference area about itself.

Abstract: A mesh network routing protocol for optimizing network data transmission capacity using a cost analysis based upon a links proximity to the gateway or other bandwidth constrained node. Specifically, the protocol computes a plurality of routing costs associated with each data path, compares the routing costs, and then selects the data path associated with the lowest routing cost for the transmission of data. Each link in each of the paths is weighted in view of its proximity to an ingress/egress point to the mesh network or other bandwidth constrained node or link of the network.

Abstract: A method and apparatus for admitting an additional node into a communications network that uses a scheduled communications protocol. Specifically, the node detects the presence of a network, establishes a communication link with a node already present on the network using a unicast messaging protocol, and then communicates pre-admission information to the node on the network. After pre-admission is complete, the new node is admitted to the network.

Abstract: Network channel access protocol is disclosed. More particularly, a distributed, locally determined, channel access protocol that adapts to load, avoids interference and controls access by a group of nodes to a set of shared channels is disclosed. Shared channel space is divided into a number of communication slots that are repeated at a predetermined interval. Permission to use a slot to communicate between any two nodes is dynamically adjusted by the channel access protocol, which locally: (i) estimates load to neighboring nodes; (ii) allocates or deallocates slot usage to adapt to load and avoid interference; and (iii) asserts and advertises slot usage within an interference area about itself.

Abstract: Network channel access protocol is disclosed. More particularly, a distributed, locally determined, channel access protocol that adapts to load, avoids interference and controls access by a group of nodes to a set of shared channels is disclosed. Shared channel space is divided into a number of communication slots that are repeated at a predetermined interval. Permission to use a slot to communicate between any two nodes is dynamically adjusted by the channel access protocol, which locally: (i) estimates load to neighboring nodes; (ii) allocates or deallocates slot usage to adapt to load and avoid interference; and (iii) asserts and advertises slot usage within an interference area about itself.

Abstract: A planar antenna that facilitates directional communication to a mesh network. The antenna is housed in a relatively small, planar package that can easily be attached to a window pane to enable the antenna to communicate with a neighboring rooftop mounted node of the mesh network. The package contains an M by N element phased array, where M and N are integers greater than one. The array is driven by microwave signals supplied from a P-angle phase shifting circuit, where P is an integer greater than one. Thus, the antenna synthesizes a single main beam and the antenna's main beam can be electrically “pointed” in one of P directions. In one embodiment of the invention, the array comprises 40 physical elements (8×5 elements) and has three selectable directions (i.e., the phase shifters provide +90, 0 and ?90 degree shifts that move the beam left 45 degrees, center and right 45 degrees).

Abstract: A planar antenna that facilitates directional communication to a mesh network. The antenna is housed in a relatively small, planar package that can easily be attached to a window pane to enable the antenna to communicate with a neighboring rooftop mounted node of the mesh network. The package contains an M by N element phased array, where M and N are integers greater than one. The array is driven by microwave signals supplied from a P-angle phase shifting circuit, where P is an integer greater than one. Thus, the antenna synthesizes a single main beam and the antenna's main beam can be electrically “pointed” in one of P directions. In one embodiment of the invention, the array comprises 40 physical elements (8×5 elements) and has three selectable directions (i.e., the phase shifters provide +90, 0 and −90 degree shifts that move the beam left 45 degrees, center and right 45 degrees).

Abstract: Method and apparatus for providing a wireless mesh network and network node are described. More particularly, a network having network node neighborhoods is described. A node comprises a multi-sectored antenna and a transceiver controller. Nodes are configured for installation without antenna pointing and without pre-coordination with the network. Software architecture for the node is also described.

Abstract: Network channel access protocol is disclosed. More particularly, a distributed, locally determined, channel access protocol that adapts to load, avoids interference and controls access by a group of nodes to a set of shared channels is disclosed. Shared channel space is divided into a number of communication slots that are repeated at a predetermined interval. Permission to use a slot to communicate between any two nodes is dynamically adjusted by the channel access protocol, which locally: (i) estimates load to neighboring nodes; (ii) allocates or deallocates slot usage to adapt to load and avoid interference; and (iii) asserts and advertises slot usage within an interference area about itself.

Abstract: Method and apparatus for providing a wireless mesh network and network node are described. More particularly, a network having network node neighborhoods is described. A node comprises a multi-sectored antenna and a transceiver controller. Nodes are configured for installation without antenna pointing and without pre-coordination with the network. Software architecture for the node is also described.

Abstract: Network channel access protocol is disclosed. More particularly, a distributed, locally determined, channel access protocol that adapts to load, avoids interference and controls access by a group of nodes to a set of shared channels is disclosed. Shared channel space is divided into a number of communication slots that are repeated at a predetermined interval. Permission to use a slot to communicate between any two nodes is dynamically adjusted by the channel access protocol, which locally: (i) estimates load to neighboring nodes; (ii) allocates or deallocates slot usage to adapt to load and avoid interference; and (iii) asserts and advertises slot usage within an interference area about itself.

Abstract: Network channel access protocol is disclosed. More particularly, a distributed, locally determined, channel access protocol that adapts to load, avoids interference and controls access by a group of nodes to a set of shared channels is disclosed. Shared channel space is divided into a number of communication slots that are repeated at a predetermined interval. Permission to use a slot to communicate between any two nodes is dynamically adjusted by the channel access protocol, which locally: (i) estimates load to neighboring nodes; (ii) allocates or deallocates slot usage to adapt to load and avoid interference; and (iii) asserts and advertises slot usage within an interference area about itself.

Abstract: Network channel access protocol is disclosed. More particularly, a distributed, locally determined, channel access protocol that adapts to load, avoids interference and controls access by a group of nodes to a set of shared channels is disclosed. Shared channel space is divided into a number of communication slots that are repeated at a predetermined interval. Permission to use a slot to communicate between any two nodes is dynamically adjusted by the channel access protocol, which locally: (i) estimates load to neighboring nodes; (ii) allocates or deallocates slot usage to adapt to load and avoid interference; and (iii) asserts and advertises slot usage within an interference area about itself.