Abstract: A node within a communication system periodically broadcasts its interference status to neighboring nodes within the communication system. Additionally, the node receives an interference status from all neighboring nodes. If communication is desired with a neighboring node, the node accesses the stored table for the particular neighboring node and determines an optimal time for transmission to the neighboring node. This is accomplished by utilizing the table received from the neighboring node and determining the neighboring node's optimal times for reception.

Abstract: A method and a system for scheduling requests generated for a plurality of mobile devices in a communication network (100) has been disclosed. The requests are generated for a transmission opportunity. The method includes computing a sort metric (302) for each request, based on an information update. A lead-time is then computed (304) with respect to a drop-dead time for each request, based on the sort metric for a time slice. The drop-dead time for a given time slice is the time before which scheduling has to be done so that data can be transmitted during the given time slice. Each request may be considered (306) for allocation in the time slice before the beginning of a next time slice, based on the lead-time.

Abstract: An apparatus and method for determining (410) a quality of channel factor for a base transceiver station (530) of an active set and determining (420) whether the base transceiver station (530) should be assigned to a prefill set at least in part according to a predetermined function of the factor. The predetermined function may include assigning (425) a base transceiver station (530) to the prefill set when the quality of channel factor reaches a predetermined threshold. The quality of channel factor may be determined in various ways including executing (416) an anticipative signal strength algorithm or by monitoring (412) the quality of channel between the mobile station (110) and the base transceiver station (530). Additionally, the primary base transceiver station (120) may be notified (430) of the prefill set such that synchronization signals may be sent (440) to the base transceiver stations of the prefill set.

Abstract: An apparatus and method for monitoring (310) at least one factor relating to a wireless communication system (100) is provided such that a synchronization signal is sent (320) to at least one base transceiver station (130) neighboring a primary base transceiver station (120) at least in part according to a predetermined function of the monitored factor(s). The monitored factor may be any of several factors that weigh on the operation of the wireless communication system. The synchronization signal itself may vary in how it signals to the neighboring base transceiver station(s) (130) to synchronize with the data to be sent to a given mobile station (110) from its primary base transceiver station (120), and the number of synchronization signals sent over a given time may vary according to the predetermined function of the monitored factor(s).

Abstract: At least one transmission condition associated with making a transmission of pre-cache data over a transmission leg (112 or 114) of a network is obtained. A priority for transmitting the pre-cache data is determined using the transmission condition.

Abstract: In a communications system implementing Transmission Control Protocol/Internet Protocol (TCP/IP), an apparatus and method for increasing the number of NAKs transmitted by a receiving device when an RLP error is detected in cases where the link speed into the RLP receiver is high, when the TCP window of the sender approaches the maximum or when the percentage of NAKs for which retransmissions cannot be fulfilled approaches a threshold. In a second aspect of the invention, the apparatus and method increases the number of retransmissions transmitted by a sending device when an RLP NAK is received in cases where the link speed out of the RLP sender is high and the transmission round is the first, when the TCP window of the sender approaches the maximum or when the percentage of NAKs for which retransmissions cannot be fulfilled approaches a threshold.

Abstract: A node within a communication system periodically broadcasts its interference status to neighboring nodes within the communication system. Additionally, the node receives an interference status from all neighboring nodes. If communication is desired with a neighboring node, the node accesses the stored table for the particular neighboring node and determines an optimal time for transmission to the neighboring node. This is accomplished by utilizing the table received from the neighboring node and determining the neighboring node's optimal times for reception.

Abstract: In a communications system implementing Transmission Control Protocol/Internet Protocol (TCP/IP), an apparatus and method for increasing the number of NAKs transmitted by a receiving device when an RLP error is detected in cases where the link speed into the RLP receiver is high, when the TCP window of the sender approaches the maximum or when the percentage of NAKs for which retransmissions cannot be fulfilled approaches a threshold. In a second aspect of the invention, the apparatus and method increases the number of retransmissions transmitted by a sending device when an RLP NAK is received in cases where the link speed out of the RLP sender is high and the transmission round is the first, when the TCP window of the sender approaches the maximum or when the percentage of NAKs for which retransmissions cannot be fulfilled approaches a threshold.

Abstract: A self synchronizing network protocol which allows networks to become self synchronizing. Two pairs of nodes communicate in an ad hoc packet radio network. Packets are communicated over a plurality of frames of time. A known bit field is appended to each packet. A clock at the first pair of nodes (10 and 12) is unavoidably slower than the clock at the second pair of nodes (14 and 16). As a result, packets transmitted from the second pair of nodes (14 and 16) will eventually overlap packets transmitted from the first pair of nodes (10 and 12). Errors in the appended field (17) can be used to detect such an overlap in advance to prevent damage to the payload. The protocol provides for additional channel efficiency, more responsiveness and the ability to grow without a central controller. Further, the ability to accommodate new traffic is increased.

Abstract: A joint assembly for connecting two spaced drive shafts, such as in a submergible pumping system. The joint assembly comprises a connecting shaft having enlarged bodies on each end thereof, a housing surrounding each enlarged body, each housing connectable to one of the drive shafts, lock devices for preventing relative rotational movement of the connecting shaft with respect to the drive shafts, and mechanisms within each housing acting upon the enlarged bodies to bias the connecting shaft into coaxial alignment with the drive shafts. With this joint assembly lateral displacement or "wobble" of the drive shafts is permitted, yet the bias mechanisms tend to restore the drive shafts to coaxial alignment.

Abstract: A joint assembly for use in a drive train permits limited transverse component displacement along at least two axes in response to non-coaxial forces in the drive train. The joint assembly includes a first subunit and a second subunit, each subunit having a transverse C-shaped opening in a first end each thereof. A connecting body has a first transverse cylindrical member extending from a first end thereof and a second transverse cylindrical member extending from an opposite second end of the connecting body. The first transverse cylindrical member is received into the transverse C-shaped opening in the first subunit to permit limited displacement along a first axis parallel to such opening. The second transverse cylindrical member is received into the transverse C-shaped opening in the second subunit to permit limited displacement along a second axis parallel to such opening.