Abstract: A method of selecting linked metric measurements from at least one of open loop and closed loop measurements is disclosed. The method includes sending by a first node a first radio communication and receiving by a second node the first radio communication over a communication link. The method also includes estimating by a second node dynamics of the communication channel using at least one of the variance and mean deviation of linked metric measurements. The link metric measurements are at least one of symbol error rate (SER), packet error rate (PER), frame error rate (FER), bit error rate (BER), signal to noise ration (SNR), and received signal strength (RSS). The method also includes the use of the above link metric measurements by the second node as Open Loop metrics and the sending back of these metrics to the first node for use a Closed Loop metrics by the first node. The method also includes categorizing the dynamics of the communications channel into one of at least two groups based on the estimate.

Abstract: A communications system is disclosed. The communication system includes a plurality of transceiver nodes configured to utilize a time division multiple access structure to communicate between the transceiver nodes. Each of the transceiver nodes generates congestion metric information based on the utilization of a link to each of its neighbors. A time division multiple access structure that includes a plurality of time slots during which the transceiver nodes are configured to communicate data cells is also disclosed. The data cells are transmitted from a transmission queue. The data cells include routing information and the congestion metric information.

Abstract: A method of establishing an arterial sub-network of nodes in a communications network is disclosed. According to the method, the one-hop neighbor sets of each node are compared with the one-hop neighbor sets of the neighbors of each node, and a set of rules are applied to determine whether or not each node is to be part of the arterial sub-network.

Abstract: A method of adapting a communication link in a network of radio communication nodes is disclosed, The method includes sending by a first node a first radio communication, The method also includes receiving by a second node the first radio communication, Further, the method includes estimating by the second node the dynamics of the communications channel, Further still, the method includes categorizing the dynamics of the communications channel into one of at least two groups, based on the estimate, Yet further still the method includes selecting, based on the chosen group, the use of either closed loop link adaption or open loop adaption of communication link parameters.

Abstract: A method of communicating over a network of nodes is disclosed. According to the method, it is determined whether a first node forms part of an interconnected sub-network within the network. Broadcast slots are assigned to the first node if the first node is part of the sub-network. The first node is permitted to use the assigned broadcast slots to broadcast data to other nodes. Nodes within one hop of the first node but not forming part of the sub-network are permitted to use an assigned broadcast slot if the first node is not using the broadcast slot.

Abstract: A method of communicating over a network of nodes using a plurality of broadcast channels. Each channel facilitates the transmission and reception of data during cycles of time divided into discrete time frames. Each frame is divided into a plurality of slots. Each node in the network is configured to broadcast, to other nodes within one hop of said node, on a common bootstrap channel during a first bootstrap slot, slot assignment information relating to any of the broadcast channels. Each node is assigned to communicate over a broadcast channel that is one of the plurality of broadcast channels. Each node broadcasts, on its assigned channel during a second bootstrap slot, slot assignment information relating to the assigned broadcast channel to other nodes within one hop of said node and on said assigned channel. Each node communicates according to the slot assignment information.

Abstract: A method of communicating over a network of nodes using a plurality of time slots is disclosed. According to the method, at least one of the plurality of time slots are assigned to a first node. The first node communicates, to neighboring nodes within one hop of the first node, which time slots assigned to the first node are scheduled to be used by the first node. Each neighboring node determines whether it has a need to use more time slots than it has been assigned. Each neighboring node communicates its respective need to the first node. At least one of the neighboring nodes is permitted to use one of the unscheduled time slots.

Abstract: A method of selecting linked metric measurements from at least one of open loop and closed loop measurements is disclosed. The method includes sending by a first node a first radio communication and receiving by a second node the first radio communication over a communication link. The method also includes estimating by a second node dynamics of the communication channel using at least one of the variance and mean deviation of linked metric measurements. The link metric measurements are at least one of symbol error rate (SER), packet error rate (PER), frame error rate (FER), bit error rate (BER), signal to noise ration (SNR), and received signal strength (RSS). The method also includes the use of the above link metric measurements by the second node as Open Loop metrics and the sending back of these metrics to the first node for use a Closed Loop metrics by the first node. The method also includes categorizing the dynamics of the communications channel into one of at least two groups based on the estimate.

Abstract: A method of determining transmission parameters for a wireless transceiver is disclosed. According to the method, a state table is loaded into a transceiver. The state table includes a plurality of states, each of which has a set of transmission parameters associated therewith. Based upon characteristics of the signals received from a signal source, the transceiver is assigned a first state. The received signals are received and processed using the set of transmission parameters associated with the first state. It is determined whether an observed behavior of the received signals exceeds a threshold associated with the first one of the plurality of states. The transceiver is assigned a second state when the behavior exceeds the threshold. The received signals are received and processed using the set of transmission parameters associated with the second state.

Abstract: A type of channel access, Clique Activated Multiple Access (CAMA), is disclosed which allows neighboring nodes to form cliques for the purpose of supporting a broadcast channel. CAMA operates using only local knowledge, meaning it can scale to large networks. It also has the potential of requiring less channel resources than node allocation. In addition, it would lend itself well to an application like push-to-talk voice where only one transmitter per neighborhood is active (except for relay nodes.

Abstract: A method and apparatus for managing communication resources between nodes of a network is disclosed. The network utilizes both dynamic and static assignment of communication time slots. The invention includes a plurality of dynamic nodes wherein communication is accomplished as a result of a node's dynamic assignment to itself of specific time slots from a time multiplex structure. At least one static node is also included in the network. The static node does not participate in the dynamic assignment protocol. Instead, a time slot in said time multiplex structure is pre-assigned for communication with the static node. A dynamic node can serve as a surrogate for a static node, relaying communications between the dynamic and static portions of the network.

Abstract: A protocol disclosed for managing an adaptive broadcast channel in a network having nodes communicating via scheduled time slots on a time multiplex basis. The protocol is suitable for use with a dynamic assignment protocol such as USAP. The protocol permits the use of transmitter based broadcasts and receiver directed broadcasts during the same frame. Further, embodiments for implementing explicit and implicit reservation schemes are disclosed. Further still, a technique for increasing efficiency through implementation of an optimized receiver directed broadcast schedule is disclosed.

Abstract: A protocol for assignment, by an assigning node, of slots for full duplex communication in a dynamic distributed, multi-channel, time division environment is disclosed. The protocol is suitable for use with a dynamic assignment protocol such as USAP. The protocol can identify slots available for allocation for unicast communications or for allocation for broadcast communications. Nodes of the network share communication slot scheduling information. A node having data to communicate can examine the shared information and thereby identify those communication slots that are available for full-duplex communication with a selected neighboring node.

Abstract: A method and apparatus for the receiver directed assignment of receive slots in a dynamic assignment communication system. The apparatus including a memory component storing communication assignment data for a plurality of time slots in a time multiplex structure and a processor component capable of identifying a set of available time slots from the plurality of time slots. The apparatus being capable of assigning itself a receive slot, which can be a broadcast receive slot, from the set of available time slots. The method involves establishing a network wherein network communication is accomplished via assignment of specific time slots of a time multiplex structure. The method further involves determining a set of available time slots suitable for reception, by a receiving node, of a communication from a neighboring node, the receiving node then assigning to itself a receive slot from the set of available time slots.

Abstract: Scheduling techniques for communication applications using receiver directed broadcast schemes are disclosed. The invention includes techniques for the implicit reservation of receive slots and techniques for the optimization of receiver directed broadcast schedules. The implicit reservation scheme includes the mechanics of implicit reservation. Implicitly reserved slots can be reclaimed by their owners. Further, simultaneous implicit reservations can be identified and resolved. Procedures are also provided for determining the number of channels and slots required to optimize a receiver directed broadcast schedule for a neighborhood of a given number of nodes.

Abstract: An communication scheme is disclosed. A collection of data samples is gathered and stored. One or more communication slot opportunities for the participant are identified in the time division communication scheme. Gathered data can be retrieved by an agent at a time just prior to communication. The agent can retrieve data according to a priority scheme. The retrieved data can then be loaded into a packet and transmitted in the communication slot opportunity to which its agent is related. The agents can be queued instead of the actual data to be communicated. Further, agents can be queued such that each level in the queue relates to a different communication slot opportunity. In addition, a plurality of agents can be activated to gather data to be communicated in a single communication slot.

Abstract: A method and system for managing communication resources between nodes in a network, and more particularly to a dynamic distributed multi-channel time division multiple access (TDMA) slot assignment method is presented. The method and apparatus include a set of higher level heuristics that enable the wireless channel access scheme to address predetermined characteristics of the wireless channel access system. These predetermined heuristics include using bootstrap slots, adaptive broadcast cycles, channelized neighborhoods, neighbor segregation, frame fitting, hard circuits, and soft circuits.

Abstract: A method and system for managing communication resources between nodes in a network, and more particularly to a dynamic distributed multi-channel time division multiple access (TDMA) slot assignment method is presented. The method and apparatus include a set of higher level heuristics that enable the wireless channel access scheme to address predetermined characteristics of the wireless channel access system. These predetermined heuristics include using bootstrap slots, adaptive broadcast cycles, channelized neighborhoods, standby slots, speculation slots, neighbor segregation, hard circuits, and soft circuits.

Abstract: A method and system for managing communication resources between nodes in a network, and more particularly to a dynamic distributed multi-channel time division multiple access (TDMA) slot assignment method is presented. The method and apparatus include a set of higher level heuristics that enable the wireless channel access scheme to address predetermined characteristics of the wireless channel access system. These predetermined heuristics include using bootstrap slots, adaptive broadcast cycles, channelized neighborhoods, standby slots, speculation slots, neighbor segregation, hard circuits, and soft circuits.

Abstract: A heuristic logical neighborhooding technique is applied to dynamic wireless networking. Logical neighborhooding, provides for the formation of logical neighborhoods across a plurality of channels when such need arises due to increased network density. The technique utilizes a time division multiple access structure including bootstrap slots, broadcast slots, and traffic slots.