Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: There is disclosed a double-threshold admission control method in cluster-based micro/picocellular wireless networks. The method provides a cluster level threshold and cell level threshold. When the number of occupied channels in the cluster is less than the cluster level threshold and the number of occupied channels in the cell is less than the cell level threshold the mobile user is admitted to enter a cell. Otherwise, the mobile user is refused to enter the cell.