Abstract: In a secure network where the network characteristics are not known, a call admission control algorithm and a preemption control algorithm based on a destination node informing the source node of the observed carried traffic are used to regulate the amount of traffic that needs to be preempted by the source. The amount of traffic that needs to be preempted is based on the carried traffic measured at the destination node. The traffic to be preempted is based on the priority of the traffic, where the lowest priority traffic is the first to be preempted until the amount of traffic preempted is sufficient to allow the remaining traffic to pass through the network without congestion.

Abstract: Without using additional probing packets, estimates of the narrow link bandwidth and available bandwidth of a network path are computed based on existing traffic. The network can be of different types such as a wireless battlefield network context or a wired or wireless commercial network environment. “Fast packets”, i.e. those packets which do not experience any queuing delay in the network, are identified. Fast packets are identified to resolve end-to-end packet delay into its constituent components (deterministic, transmission and queuing delays), estimate path utilization and eliminate the uncertainty (false alarms) that causes the prior art method to lose its effectiveness. An estimation algorithm computes end-to-end transmission delay and end-to-end deterministic delay of fast packets traveling along a path in a network. Examples of deterministic delay include satellite propagation delays and clock effects.

Abstract: Without using additional probing packets, estimates of the narrow link bandwidth and available bandwidth of a network path are computed based on existing traffic. The network can be of different types such as a wireless battlefield network context or a wired or wireless commercial network environment. “Fast packets”, i.e. those packets which do not experience any queuing delay in the network, are identified. Fast packets are identified to resolve end-to-end packet delay into its constituent components (deterministic, transmission and queuing delays), estimate path utilization and eliminate the uncertainty (false alarms) that causes the prior art method to lose its effectiveness. An estimation algorithm computes end-to-end transmission delay and end-to-end deterministic delay of fast packets traveling along a path in a network. Examples of deterministic delay include satellite propagation delays and clock effects.

Abstract: Without using additional probing packets, estimates of the narrow link bandwidth and available bandwidth of a network path are computed based on existing traffic. The network can be of different types such as a wireless battlefield network context or a wired or wireless commercial network environment. “Fast packets”, i.e. those packets which do not experience any queuing delay in the network, are identified. Fast packets are identified to resolve end-to-end packet delay into its constituent components (deterministic, transmission and queuing delays), estimate path utilization and eliminate the uncertainty (false alarms) that causes the prior art method to lose its effectiveness. An estimation algorithm computes end-to-end transmission delay and end-to-end deterministic delay of fast packets traveling along a path in a network. Examples of deterministic delay include satellite propagation delays and clock effects.

Abstract: Methods and apparatuses for allocating control and data time slots to a plurality of wireless mobile stations in a wireless communication system using time division multiplexing. The methods and apparatuses assign such time slots by first placing the wireless mobile stations into a number of different groups. Then, control time slots and anchor data time slots are assigned to the groups in the uplink and downlink frames of a carrier such that the uplink control time slot for each group is maximally spaced in time relative to the downlink control time slot for the same group. Data time slots are subsequently assigned to a particular mobile station by assigning time slots in the uplink and downlink frames which are as close as possible to the group's uplink or downlink anchor data time slots, as the case may be, according to a “grow from center” technique.

Abstract: In a mobile station-mobile receiver arrangement a method and apparatus for a radio link control (RLC) protocol that allows partial recovery of data for streaming services. The maximum number of retransmissions allowed by the method for each RLC block is a function of the maximum delivery delay required by the streaming service and the round trip delay.

Abstract: Uplinked and downlinked transmissions in an interference-limited system, such as a cellular network, are prioritized and authorized by channel quality/data rate to minimize interference.

Abstract: The location of a mobile wireless communication unit in the service area of a CDMA communications system is predicted utilizing two likelihood functions that define maximum likelihood estimators of the mobile unit's location, based on attribute measurements, such as but not limited to pilot signal strength, being made at the location of the mobile unit and reported back to a base station. One of the likelihood functions comprises a frequentist likelihood function and the other comprises a Bayesian-modified likelihood function. The likelihood functions are based on the assumption that there is an RF model which provides the probability a mobile unit is able to detect one or more attributes associated with an arbitrary base station, given it is located at an arbitrary location within the service area. Each of the likelihoods are also incorporated into a sequential Bayesian procedure which outputs a posterior distribution indicative of the location of the mobile unit.

Abstract: A time division multiplexed communications method and system in which time is divided into a number of frames and each frame is divided into N data bursts. The method and system further has a first multiplexer by which a half rate channel is formed as a series of bursts that occur periodically every N bursts once per frame, a second multiplexer in which a full rate channel is formed as two half rate channels on consecutive timeslots, and a transmitter transmitting the full rate channel from a first wireless station to a second wireless station. The full rate channel provided by two half rate channels on consecutive timeslots yields a significantly larger resource pool available for assignment of communication traffic. For full rate channels, the interleaving 0246/1357 method that is used by the system is just as good as the known 0123/4567 method when ideal frequency hopping is used, and the 0246/1357 method performs better when non-ideal frequency hopping or no frequency hopping is used.

Abstract: Methods and apparatuses for allocating control and data time slots to a plurality of wireless mobile stations in a wireless communication system using time division multiplexing. The methods and apparatuses assign such time slots by first placing the wireless mobile stations into a number of different groups. Then, control time slots and anchor data time slots are assigned to the groups in the uplink and downlink frames of a carrier such that the uplink control time slot for each group is maximally spaced in time relative to the downlink control time slot for the same group. Data time slots are subsequently assigned to a particular mobile station by assigning time slots in the uplink and downlink frames which are as close as possible to the group's uplink or downlink anchor data time slots, as the case may be, according to a “grow from center” technique.

Abstract: A Universal Mobile Telecommunications System (“UMTS”) is modified to provide location-determining services similar to Wireless-Assisted-GPS (“WAG”) services to mobiles without requiring the deployment of a GPS receiver inside the UMTS network. The resulting network is known as a UMTS Network Assisted GPS (“UNAG”) network. A UNAG network is created by deploying a UNAG server inside a UMTS network. The UNAG server provides WAG-like services to mobiles. Only one UNAG server is needed in an entire system, allowing the cost of the UNAG server to be amortized over a number of Mobile Switching Centers (“MSCs”) in the UMTS network. The UNAG server provides excellent location-prediction accuracy and reduces the amount of time required to determine the location of a mobile in a UMTS network.

Abstract: Unlike earlier methods and systems in which Radio Link Control (RLC) performance was characterized in terms of the throughput, and the size of the higher layer Protocol Data Units (PDUs) or packets to be transferred was ignored, a method and apparatus is provided that is based on the delay of a higher layer PDU or packet. A method and apparatus so based have less delay than a method and apparatus based on employing adaptive coding and modulation to achieve the greatest mean throughput of a data block.

Abstract: The location of a mobile unit in the service area of a CDMA cellular telephone system is predicted from a spatial probability distribution that is generated over a region of sub-cells within the service area. The spatial distribution, and hence the predicted location, is updated sequentially based on RF measurements provided by the mobile unit through the use of a Bayesian-update method.

Abstract: Unlike earlier methods and systems in which Radio Link Control (RLC) performance was characterized in terms of the throughput, and the size of the higher layer Protocol Data Units (PDUs) or packets to be transferred was ignored, a method and apparatus is provided that is based on the delay of a higher layer PDU or packet. A method and apparatus so based have less delay than a method and apparatus based on employing adaptive coding and modulation to achieve the greatest mean throughput of a data block.

Abstract: In a mobile station-mobile receiver arrangement a method and apparatus for a radio link control (RLC) protocol that allows partial recovery of data for streaming services. The maximum number of retransmissions allowed by the method for each RLC block is a function of the maximum delivery delay required by the streaming service and the round trip delay.

Abstract: A time division multiplexed communications method and system in which time is divided into a number of frames and each frame is divided into N data bursts. The method and system further has a first multiplexer by which a half rate channel is formed as a series of bursts that occur periodically every N bursts once per frame, a second multiplexer in which a full rate channel is formed as two half rate channels on consecutive timeslots, and a transmitter transmitting the full rate channel from a first wireless station to a second wireless station. The full rate channel provided by two half rate channels on consecutive timeslots yields a significantly larger resource pool available for assignment of communication traffic. For full rate channels, the interleaving 0246/1357 method that is used by the system is just as good as the known 0123/4567 method when ideal frequency hopping is used, and the 0246/1357 method performs better when non-ideal frequency hopping or no frequency hopping is used.

Abstract: The location of a mobile unit in the service area of a CDMA wireless communications system is determined by a location probability distribution procedure that is based entirely on analytical results derived from an integrated model of the wireless communications system, its RF environment and attribute measurement. The mobile unit measures and reports attribute values of pilot signal strength of all pilot signals visible to the mobile unit at its present location, whereupon a location probability distribution is computed based on a Bayesian probability algorithm including a set of stored model parameters.