公开(公告)号：US6141552A

公开(公告)日：2000-10-31

申请号：US971441

申请日：1997-11-17

申请人： Andrew Sendonaris ,  Hongyi Chen ,  Nikhil Jain ,  Seshagri Madhavapeddy ,  Sairam Subramanian

发明人： Andrew Sendonaris ,  Hongyi Chen ,  Nikhil Jain ,  Seshagri Madhavapeddy ,  Sairam Subramanian

IPC分类号： H04W16/18 ,  H04Q7/00

CPC分类号： H04W16/18

摘要： The mobility of mobile subscribers within a wireless digital communications system is estimated based on highway maps and traffic data. Cells within the network are modelled as nodes connected by edges where neighboring cells are connected by roads. Each edge has two edge weight components representing traffic flow from one cell to the other and vice versa. The edge weight components are calculated from terrain factors based on the size or capacity of the roads connecting the two cells and the total traffic within the subject cell, which information may be obtained from commercial geographic databases and/or government agencies. The resulting edge weight represents an expected number of handoffs between the two cells. The problem of partitioning cells among available switches within the network is thus reduced to the purely mathematical problem of minimizing the total edge weights of edges intersected by the partition boundaries. Existing mathematical optimization techniques for optimizing node-edge systems may therefore be applied to reduce the total number of expected inter-switch handoffs as mobile subscribers pass from cell to cell within the network.

摘要翻译： 基于高速公路地图和交通数据估计无线数字通信系统内移动用户的移动性。 网络内的小区被建模为通过边缘连接的节点，其中相邻小区通过道路连接。 每个边缘具有两个边缘权重分量，表示从一个小区到另一个小区的业务流量，反之亦然。 基于连接两个小区的道路的大小或容量以及主体小区内的总流量，从地形因子计算边缘权重分量，该信息可以从商业地理数据库和/或政府机构获得。 所得到的边缘权重表示两个单元之间的预期切换次数。 因此，将网络内的可用交换机之间的小区划分成一个问题，从而减少了将分区边界相交的边缘的总边缘权重最小化的纯数学问题。 因此，用于优化节点边缘系统的现有数学优化技术可以被应用于当移动用户从网络中的小区传送到小区时，减少预期的交换机间切换的总数。