公开(公告)号：US07068619B2

公开(公告)日：2006-06-27

申请号：US09847567

申请日：2001-05-02

申请人： Krishna Balachandran ,  Kirk K. Chang ,  Richard Paul Ejzak ,  Wei Luo ,  Sanjiv Nanda

发明人： Krishna Balachandran ,  Kirk K. Chang ,  Richard Paul Ejzak ,  Wei Luo ,  Sanjiv Nanda

IPC分类号： H04Q7/00

CPC分类号： H04L1/1838 ,  H04L1/0068 ,  H04L1/1819 ,  H04L1/189

摘要： 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.

公开(公告)号：US07352714B2

公开(公告)日：2008-04-01

申请号：US10252797

申请日：2002-09-24

申请人： Krishna Balachandran ,  Kirk K. Chang ,  Wei Luo ,  Sanjiv Nanda

发明人： Krishna Balachandran ,  Kirk K. Chang ,  Wei Luo ,  Sanjiv Nanda

IPC分类号： H04B7/212

CPC分类号： H04W72/0446

摘要： 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.

摘要翻译： 在使用时分复用的无线通信系统中，向多个无线移动站分配控制和数据时隙的方法和装置。 所述方法和装置通过首先将无线移动站放置到多个不同的组中来分配这样的时隙。 然后，将控制时隙和锚数据时隙分配给载波的上行链路和下行链路中的组，使得每个组的上行链路控制时隙相对于相同组的下行链路控制时隙在时间上最大间隔 。 随后，通过分配尽可能接近组的上行链路或下行链路锚定数据时隙（根据情况可能）的上行链路和下行链路帧中的时隙，随后将数据时隙分配给特定的移动台。 中心“技术。

公开(公告)号：US06990104B1

公开(公告)日：2006-01-24

申请号：US09632215

申请日：2000-08-03

申请人： Krishna Balachandran ,  Kirk K. Chang ,  Sanjiv Nanda

发明人： Krishna Balachandran ,  Kirk K. Chang ,  Sanjiv Nanda

IPC分类号： H04L12/28

CPC分类号： H04W72/1242 ,  H04L47/24 ,  H04L47/50 ,  H04L47/56 ,  H04L47/6225 ,  H04W24/06 ,  H04W72/1226

摘要： 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.

摘要翻译： 在诸如蜂窝网络的干扰受限系统中的上行链路和下行链路传输被优先化并且被信道质量/数据速率授权以最小化干扰。

公开(公告)号：US06813252B2

公开(公告)日：2004-11-02

申请号：US09738344

申请日：2000-12-15

申请人： Kirk K. Chang ,  Enrique Hernandez-Valencia ,  Wei Luo ,  Sanjiv Nanda

发明人： Kirk K. Chang ,  Enrique Hernandez-Valencia ,  Wei Luo ,  Sanjiv Nanda

IPC分类号： H04L514

CPC分类号： H04B7/2656

摘要： 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.

摘要翻译： 一种时分复用通信方法和系统，其中时间被分成多个帧，并且每个帧被划分成N个数据脉冲串。 所述方法和系统还具有第一多路复用器，通过该第一多路复用器将半速率信道形成为每帧每N个突发周期性出现的一系列脉冲串;第二多路复用器，其中全速率信道形成为连续的两个半速率信道 时隙，以及从第一无线站向第二无线站发送全速率信道的发射机。 在连续时隙上由两个半速率信道提供的全速率信道产生可用于分配通信业务的显着更大的资源池。 对于全速率信道，当使用理想跳频时，系统使用的交织0246/1357方法与已知的0123/4567方法一样好，当非理想跳频或0246/1357方法时， 不使用跳频。

公开(公告)号：US07965644B2

公开(公告)日：2011-06-21

申请号：US12781971

申请日：2010-05-18

申请人： Kirk K. Chang ,  John M. Sucec ,  Harshad Tanna ,  John Lee ,  Sunil Samtani

发明人： Kirk K. Chang ,  John M. Sucec ,  Harshad Tanna ,  John Lee ,  Sunil Samtani

IPC分类号： H04J3/14

CPC分类号： H04L47/283 ,  H04L43/0858 ,  H04L43/0882 ,  H04L43/106 ,  H04L47/10 ,  H04L47/11 ,  H04L47/14 ,  H04L47/25 ,  H04L47/28

摘要： 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. Then, based on the results of the fast packet identifying algorithm, two logic branches are followed. A first branch calculates utilization and a second branch calculates narrow link bandwidth. The narrow link bandwidth is determined from the packet pair dispersion. The available bandwidth is obtained from the narrow link bandwidth and the utilization. Estimation of available bandwidth for an end-to-end network path allows traffic sources to judiciously regulate the volume of application traffic injected into the network.

摘要翻译： 在不使用附加探测分组的情况下，基于现有流量来计算网络路径的窄链路带宽和可用带宽的估计。 该网络可以是不同类型的，例如无线战场网络环境或有线或无线商业网络环境。 识别“快速分组”，即在网络中没有经历任何排队延迟的分组。 识别快速分组以将端到端分组延迟解析为其组成组件（确定性，传输和排队延迟），估计路径利用率并消除导致现有技术方法失效的不确定性（假警报）。 估计算法计算沿着网络中的路径行进的快速分组的端到端传输延迟和端到端确定性延迟。 确定性延迟的例子包括卫星传播延迟和时钟效应。 然后，基于快速分组识别算法的结果，跟随两个逻辑分支。 第一个分支计算利用率，第二个分支计算窄链路带宽。 窄链路带宽由分组对色散决定。 可用带宽从窄链路带宽和利用率获得。 估计端到端网络路径的可用带宽允许流量源明智地调节注入网络的应用流量。

公开(公告)号：US06263208B1

公开(公告)日：2001-07-17

申请号：US09321729

申请日：1999-05-28

申请人： Kirk K. Chang ,  Daniel R. Jeske ,  Kiran M. Rege

发明人： Kirk K. Chang ,  Daniel R. Jeske ,  Kiran M. Rege

IPC分类号： H04Q720

CPC分类号： H04W64/00 ,  G01S5/0252

摘要： 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.

摘要翻译： 在CDMA无线通信系统的服务区域中的移动单元的位置由完全基于从无线通信系统的集成模型，其RF环境和属性测量得到的分析结果的位置概率分布过程确定。 移动单元测量并报告移动单元在其当前位置可见的所有导频信号的导频信号强度的属性值，由此基于包括一组存储的模型参数的贝叶斯概率算法来计算位置概率分布。

公开(公告)号：US07768933B2

公开(公告)日：2010-08-03

申请号：US11251224

申请日：2005-10-14

申请人： Kirk K. Chang ,  John M. Sucec ,  Harshad Tanna ,  John Lee ,  Sunil Samtani

发明人： Kirk K. Chang ,  John M. Sucec ,  Harshad Tanna ,  John Lee ,  Sunil Samtani

IPC分类号： H04J1/16

CPC分类号： H04L47/283 ,  H04L43/0858 ,  H04L43/0882 ,  H04L43/106 ,  H04L47/10 ,  H04L47/11 ,  H04L47/14 ,  H04L47/25 ,  H04L47/28

摘要： 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. Then, based on the results of the fast packet identifying algorithm, two logic branches are followed. A first branch calculates utilization and a second branch calculates narrow link bandwidth. The narrow link bandwidth is determined from the packet pair dispersion. The available bandwidth is obtained from the narrow link bandwidth and the utilization. Estimation of available bandwidth for an end-to-end network path allows traffic sources to judiciously regulate the volume of application traffic injected into the network.

摘要翻译： 在不使用附加探测分组的情况下，基于现有流量来计算网络路径的窄链路带宽和可用带宽的估计。 该网络可以是不同类型的，例如无线战场网络环境或有线或无线商业网络环境。 识别“快速分组”，即在网络中没有经历任何排队延迟的分组。 识别快速分组以将端到端分组延迟解析为其组成组件（确定性，传输和排队延迟），估计路径利用率并消除导致现有技术方法失效的不确定性（假警报）。 估计算法计算沿着网络中的路径行进的快速分组的端到端传输延迟和端到端确定性延迟。 确定性延迟的例子包括卫星传播延迟和时钟效应。 然后，基于快速分组识别算法的结果，跟随两个逻辑分支。 第一个分支计算利用率，第二个分支计算窄链路带宽。 窄链路带宽由分组对色散决定。 可用带宽从窄链路带宽和利用率获得。 估计端到端网络路径的可用带宽允许流量源明智地调节注入网络的应用流量。

公开(公告)号：US06701153B1

公开(公告)日：2004-03-02

申请号：US09628011

申请日：2000-07-28

申请人： Kirk K. Chang ,  On-Ching Yue

发明人： Kirk K. Chang ,  On-Ching Yue

IPC分类号： H04Q720

CPC分类号： H04W64/00

摘要： 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.

摘要翻译： 修改通用移动电信系统（“UMTS”）以向移动台提供类似于无线辅助GPS（“WAG”）服务的位置确定服务，而不需要在UMTS网络内部署GPS接收机。 所得到的网络被称为UMTS网络辅助GPS（“UNAG”）网络。 通过在UMTS网络内部署UNAG服务器来创建UNAG网络。 UNAG服务器为手机提供类似WAG的服务。 在整个系统中只需要一个UNAG服务器，允许UNAG服务器的成本通过UMTS网络中的多个移动交换中心（“MSC”）进行分摊。 UNAG服务器提供优异的位置预测精度，并减少确定UMTS网络中移动站位置所需的时间量。

公开(公告)号：US06564065B1

公开(公告)日：2003-05-13

申请号：US09294997

申请日：1999-04-20

申请人： Kirk K. Chang ,  Byron H. Chen ,  Tung C. Chiang ,  John Freidenfelds ,  Daniel R. Jeske ,  Kiran M. Rege

发明人： Kirk K. Chang ,  Byron H. Chen ,  Tung C. Chiang ,  John Freidenfelds ,  Daniel R. Jeske ,  Kiran M. Rege

IPC分类号： H04Q720

CPC分类号： H04W64/00

摘要： 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.

摘要翻译： CDMA移动电话系统的服务区域中的移动单元的位置是根据服务区域内的子单元区域产生的空间概率分布进行预测的。 基于通过使用贝叶斯更新方法由移动单元提供的RF测量，空间分布以及因此预测位置被顺序地更新。

公开(公告)号：US09438516B2

公开(公告)日：2016-09-06

申请号：US13104489

申请日：2011-05-10

申请人： Kirk K. Chang ,  Gi Tae Kim ,  John Unger ,  John Sucec ,  Sunil Samtani

发明人： Kirk K. Chang ,  Gi Tae Kim ,  John Unger ,  John Sucec ,  Sunil Samtani

IPC分类号： H04J3/14 ,  H04L12/801 ,  H04L12/54 ,  H04L12/851 ,  H04L12/927 ,  H04L12/911

CPC分类号： H04L47/10 ,  H04L47/11 ,  H04L47/2408 ,  H04L47/2433 ,  H04L47/245 ,  H04L47/70 ,  H04L47/805 ,  H04L47/822

摘要： 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.

摘要翻译： 在网络特性不知道的安全网络中，使用基于通知源节点的所观察到的携带业务的目的地节点的呼叫接纳控制算法和抢占控制算法来规范需要被抢占的业务量 来源。 需要抢占的流量大小取决于在目的地节点处测量的携带流量。 要抢占的流量是基于流量的优先级，其中优先级最低的流量是首先被抢占的流量，直到被抢占的流量足以允许剩余流量通过网络而不拥塞。