Method and system for route selection and method for route reconstruction
    1.
    发明申请
    Method and system for route selection and method for route reconstruction 审中-公开
    路线选择方法及系统及路线重建方法

    公开(公告)号:US20050122955A1

    公开(公告)日:2005-06-09

    申请号:US10842108

    申请日:2004-05-10

    IPC分类号: H04L12/28 H04L12/56 H04L12/66

    摘要: A method and system for route selection and a method for route reconstruction. A mobile (or ad hoc) wireless network is divided into several clusters, each comprising a plurality of nodes. A source node in a cluster delivers a data packet to a destination node in accordance with a route table thereof if the destination node is located in the same cluster, and, if not, sends a route request packet to the destination node through a gateway node, determining a routing path to the destination node.

    摘要翻译: 一种路由选择的方法和系统,以及路由重建的方法。 移动(或自组织)无线网络被划分成几个簇,每个簇包括多个节点。 如果目的地节点位于相同的集群中,则集群中的源节点根据其路由表将数据分组传送到目的地节点,如果不是,则通过网关节点向目的节点发送路由请求分组 ,确定到目的地节点的路由路径。

    Method and system for handling mobile database overflow
    2.
    发明授权
    Method and system for handling mobile database overflow 有权
    处理移动数据库溢出的方法和系统

    公开(公告)号:US07107053B2

    公开(公告)日:2006-09-12

    申请号:US10811212

    申请日:2004-03-26

    申请人: Hwa-Chun Lin

    发明人: Hwa-Chun Lin

    IPC分类号: H04Q7/20

    CPC分类号: H04W24/02 H04W8/02

    摘要: A method and system for handling mobile database overflow. First, the VLR determines whether its database is full when a first mobile user sends a registration request to the VLR. The VLR selects a second mobile user as an overflow user and translates the location information thereof into a second location code if the database of the VLR is full. Next, the registration request and the second location code are transferred to an HLR and the value of a first location code of the first mobile user is reset as the predetermined value. Finally, user data of the second mobile user is deleted and user data of the first mobile user is temporarily stored in the VLR.

    摘要翻译: 一种处理移动数据库溢出的方法和系统。 首先,当第一移动用户向VLR发送注册请求时,VLR确定其数据库是否满。 VLR选择第二移动用户作为溢出用户,并且如果VLR的数据库已满,则将其位置信息转换为第二位置代码。 接下来,将注册请求和第二位置码传送到HLR,并将第一移动用户的第一位置码的值重置为预定值。 最后删除第二移动用户的用户数据,并将第一移动用户的用户数据临时存储在VLR中。

    Method and system for handling mobile database overflow
    4.
    发明申请
    Method and system for handling mobile database overflow 有权
    处理移动数据库溢出的方法和系统

    公开(公告)号:US20050143069A1

    公开(公告)日:2005-06-30

    申请号:US10811212

    申请日:2004-03-26

    IPC分类号: H04W8/02 H04W24/02 H04Q7/20

    CPC分类号: H04W24/02 H04W8/02

    摘要: A method and system for handling mobile database overflow. First, the VLR determines whether its database is full when a first mobile user sends a registration request to the VLR. The VLR selects a second mobile user as an overflow user and translates the location information thereof into a second location code if the database of the VLR is full. Next, the registration request and the second location code are transferred to an HLR and the value of a first location code of the first mobile user is reset as the predetermined value. Finally, user data of the second mobile user is deleted and user data of the first mobile user is temporarily stored in the VLR.

    摘要翻译: 一种处理移动数据库溢出的方法和系统。 首先,当第一移动用户向VLR发送注册请求时,VLR确定其数据库是否满。 VLR选择第二移动用户作为溢出用户,并且如果VLR的数据库已满,则将其位置信息转换为第二位置代码。 接下来,将注册请求和第二位置码传送到HLR,并将第一移动用户的第一位置码的值重置为预定值。 最后删除第二移动用户的用户数据,并将第一移动用户的用户数据临时存储在VLR中。

    HEURISTIC ALGORITHM FOR APPLICATION-LAYER MULTICAST WITH MINIMUM DELAY
    5.
    发明申请
    HEURISTIC ALGORITHM FOR APPLICATION-LAYER MULTICAST WITH MINIMUM DELAY 审中-公开
    用于具有最小延迟的应用层多播的智能算法

    公开(公告)号:US20090168775A1

    公开(公告)日:2009-07-02

    申请号:US12143175

    申请日:2008-06-20

    IPC分类号: H04L12/56

    摘要: A heuristic algorithm for calculating a multicast tree with minimum delay is disclosed. In the method, the time required for processing data at a transmitter, the time required for data transmission, and the time required for processing data at a receiver are taken into account. The time for transmitting data from a network terminal to other network terminals via an application-layer multicast is reduced when the present invention is utilized. Efficiency of the application-layer multicast is hence improved.

    摘要翻译: 公开了一种用于计算具有最小延迟的多播树的启发式算法。 在该方法中,考虑在发送机处理数据所需的时间,数据传输所需的时间以及在接收机处理数据所需的时间。 当利用本发明时,通过应用层组播将数据从网络终端发送到其他网络终端的时间减少了。 因此,应用层组播的效率得到改善。

    Method for finding and reserving available bandwidth in multihop mobile wireless networks
    6.
    发明授权
    Method for finding and reserving available bandwidth in multihop mobile wireless networks 失效
    在多跳移动无线网络中查找和保留可用带宽的方法

    公开(公告)号:US06912215B1

    公开(公告)日:2005-06-28

    申请号:US09711942

    申请日:2000-11-15

    IPC分类号: H04B7/212 H04J13/00 H04L12/56

    摘要: A method for finding and reserving bandwidth in multihop mobile wireless networks is disclosed, which first finds the common free slots of all the links on a path, and marks the common free slots as “available” slots. Then, the slots among the common free slots which are not on the same positions in the TDMA frame as the common free slots of the downstream and upstream links for each link are found and marked as “reservable” slots. The current bandwidth of a link is defined as the current number of reservable slots on the link. Next, An iterative process is performed to try to increase the bandwidth of the link having the smallest current bandwidth such that the bandwidth of the path can be increased.

    摘要翻译: 公开了一种在多跳移动无线网络中查找和保留带宽的方法,其首先找到路径上所有链路的公共空闲时隙,并将公共空闲时隙标记为“可用”时隙。 然后,在TDMA帧中不在与每个链路的下游和上游链路的公共空闲时隙相同的公共空闲时隙中的时隙被发现并标记为“可预留”时隙。 链路的当前带宽被定义为链路上当前的可预留时隙数。 接下来,执行迭代处理以尝试增加具有最小当前带宽的链路的带宽,使得可以增加路径的带宽。