WO1993013631A1 - Universal personal communication system and tracing system therefor - Google Patents

Universal personal communication system and tracing system therefor Download PDF

Info

Publication number
WO1993013631A1
WO1993013631A1 PCT/US1992/010529 US9210529W WO9313631A1 WO 1993013631 A1 WO1993013631 A1 WO 1993013631A1 US 9210529 W US9210529 W US 9210529W WO 9313631 A1 WO9313631 A1 WO 9313631A1
Authority
WO
WIPO (PCT)
Prior art keywords
layer
communication unit
address
node
portable communication
Prior art date
Application number
PCT/US1992/010529
Other languages
French (fr)
Inventor
Zhonghe Wang
Original Assignee
Motorola, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Motorola, Inc. filed Critical Motorola, Inc.
Priority to CA002127273A priority Critical patent/CA2127273C/en
Priority to KR1019940702308A priority patent/KR940704106A/en
Priority to EP93900912A priority patent/EP0619930A4/en
Priority to KR1019940702308A priority patent/KR0144431B1/en
Publication of WO1993013631A1 publication Critical patent/WO1993013631A1/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
    • H04W8/08—Mobility data transfer
    • H04W8/085—Mobility data transfer involving hierarchical organized mobility servers, e.g. hierarchical mobile IP [HMIP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W60/00—Affiliation to network, e.g. registration; Terminating affiliation with the network, e.g. de-registration

Definitions

  • This invention relates generally to universal personal communication systems.
  • a universal personal communication system is a system enabling anyone to communicate instantly with anyone else anywhere in the world.
  • One of the crucial problems of such a system would be locating millions of moving customers in an efficient manner.
  • the existing techniques for locating moving customers in the system are paging and registration using a central database. Considering the large number of customers in a global system, the first technique, if applied without knowledge of the location of the customers is impractical.
  • the registration technique which records all the movements of customers in a central database, is also impractical because the task of keeping track of such a huge number of users would be immense.
  • a communication system includes a plurality of organizational layers, a plurality of portable communication units, and a plurality of base stations.
  • Each layer comprises a plurality of nodes.
  • the plurality of nodes comprises a plurality of base stations in the first layer, and a plurality of communication services nodes in the higher layers.
  • Each communication services node includes a database possibly containing information on the locations of one or more portable communication units.
  • the databases constitute a distributed database containing information on the locations of the portable communication units within the system.
  • FIG. 1 is a hierarchical structure for a communication system in accordance with the invention.
  • FIG. 2 is a flow chart of a process carried out at a node for locating a portable communication unit in accordance with the invention.
  • FIG. 3 is a possible address structure in accordance with the invention.
  • FIG. 4 is a possible database of a node at layer k.
  • FIG. 5 is an example of an address chain for a customer of class 5 or 6, before moving.
  • FIG. 6 is a flow chart for nodes receiving a message M1.
  • FIG. 7 is a flow chart for nodes receiving a message M2.
  • FIG. 8 is a flow chart for nodes receiving a message 3.
  • FIG. 9 is a flow chart for nodes receiving a message M4.
  • FIG. 10 is an example of an address chain after moving for a customer of class 5 or 6.
  • FIG. 1 there is shown a hierarchical structure for a communication system 100 in accordance with the invention.
  • the covered area of the communication system 100 is organized into a hierarchical structure having several layers.
  • the highest layer may be the earth 102 followed by country 104, state 106, area code 108, city 110, and the lowest layer (Layer 1) is a primary layer that comprises a plurality independent paging regions (cells) 112.
  • Each layer 1 cell comprises one or more base stations.
  • Layer 1 may comprise a radio telephone communication * system (e.g., Digital European Cordless Telephone). Not losing generality, from now on layer 1 cells shall be referred to as base **" 5 stations.
  • Each region of layer "/" (except the lowest layer) consists of several regions of layer ⁇ i- 1. n .
  • Each block in layers 2 through 6 is a communication service node representing a switching station having computing and memory means (i.e., all layers >1 are
  • the memory means comprises a database for tracking the location of customers (i.e., users of portable communication units that are registered in the system).
  • FIG. 2 there is shown a flow chart illustrating a process for receiving a connection request for a layer / node.
  • connection request packet is received at node in layer /.
  • the connection request packet sent by a calling communication unit, requests a connection between the calling communication unit and a called (portable) communication unit 1.
  • the call request packet comprises a code identifying the called portable
  • step 122 the system keeps track of the possible connections (i.e., bookkeeping).
  • decision 124 a determination is made as to whether (1) the connection request is received at the first layer and (2) the connection request was not received directly from a portable
  • decision 124 If the determination of decision 124 is affirmative, the called party is paged (if it is a portable) or rung (if it is a fixed telephone) (step 126). In decision 128, it is determined whether a connection confirmation signal is received from the called communication unit within a predetermined
  • step 130 If the determination made in decision 128 is affirmative, the connection is successful (step 130). If it is negative, the connection attempt fails (step 132).
  • connection request was received in the first layer. If decision 134 is affirmative, the connection request is passed to its parent node in layer two (step 136). The process then continues to the stop step (144) for that node.
  • a further decision 138 is made to determine whether there is any information relating to the called party in the database corresponding to the current node. If decision 138 is affirmative, the connection request is passed to the next node along the address chain (step 140). If the determination in step 138 is negative, the connection request is passed to the next node along the path to the home address of the called party (step 142). Following either step 140 or 142, the process stops (step 144) for the node passing on the connection request, and begins at step 120) for the next node receiving the connection request.
  • FIG. 3 there is shown a set of possible address structures for portable communication units. These address structures include a field for each of the layers.
  • the home address is the registered address of the portable communication unit (i.e., the same as a telephone number). The incoming calls will find the portable communication unit in this address unless it has moved to another area or if it has been turned off.
  • the physical address is the address where the portable communication unit can be actually reached.
  • two physical addresses are needed: (1) the current address, which indicates the physical address of the base station to which the portable unit is locking; and (2) the new address, which indicates the physical address of the desired new base station. In the case of a fixed subscriber, the physical address is always identical to the home address.
  • the physical address of portable communication unit is obtained in the messages broadcasted from the port.
  • HA/ is the home address of customer "f and "Add/" is the current address field for customer ti ⁇ I J -
  • a customer is classified by the number of the lowest layer that covers all the service areas of the customer.
  • a service area is any area that the customer selects to be reached at.
  • the home address of a customer must be in one of the service areas.
  • the service areas are chosen by customers and the associated information is stored in the portable communication units. The information may also be
  • the classification pc of a portable communication unit is derived easily from its service areas as follows: Define SAj be the address of the ith service area of the portable communication unit which contains all the layer addresses from the service area and up with all the
  • the address information field may contain one of the following three entries: (1) an "out" mark which indicates that the native portable communication unit is outside the covered region;
  • a customer does not necessarily communicate on the portable communication unit, but the movement of the portable communication unit is traced by the system.
  • a customer is active when the power of the portable communication unit is on.
  • a class 0 customer is defined to be reached only at home address (i.e., a fixed telephone).
  • Fig 5 there is shown a diagram illustrating an example of an address chain before moving for a portable communication unit 24 of class 5 or 6.
  • the called party (unit 24) has a home address in cell 1 ,d, and a current address at cell 8,d.
  • the communication unit 20, located in cell 2,c places a call to communication unit 24.
  • the communication unit 20 merely dials the home address number of the called party.
  • the calling party's connection request is received by an base station at cell 2,c, and it is passed on to the Boynton node in layer 2.
  • the corresponding database is searched for an entry relating to the called party. In this case an entry is found in the database.
  • the entry contains the home address (HA) of the called party and an "out" indication.
  • the call is then forwarded along the address chain to the "407" node of layer 3, where the database also contains the home address of the called party and an "out” indication.
  • the connection request is further traced up through the Florida node of layer 4, also indicating that the called party is "out”.
  • the database indicates that the portable 24 is in Georgia.
  • the tracing then continues to the Georgia node, where the area code 404 is indicated. Therefore, the tracing process continues to the 404 node, where "Atlanta" is indicated.
  • the call for the called party is made from a calling communication unit 22 (also a portable in this example) located at cell 9,c. Accordingly, the call is received at the base station in cell 9,c, and is passed on to the Athens node in layer 2. There is no entry relating to the called party in the Athens database. Therefore, the connection request is passed on to the next node toward the home address of the called party (i.e., the "404" node).
  • the database at the "404" node contains an an entry (HA, Atlanta) indicating that the called party is in Atlanta.
  • the connection request is accordingly passed on to the Atlanta node where the exact location of the portable 24 is determined to be in the 8,d cell, and the requested connection is made.
  • the problem remaining is how to maintain the databases.
  • the database updating process is initiated by portable communication units.
  • Each base station continuously transmits its subsystem identification information.
  • an active portable communication unit is able to select a desired base station (e.g., the strongest base) and lock on to it.
  • a desired base station e.g., the strongest base
  • up to two messages may be transmitted to the associated bases to update address chains.
  • the address of the base to which the portable communication unit is locking is called the current address and the address of the base of the new strongest base is called new address.
  • nn * is in terms of the new address of the portable communication unit and the address of the ith layer node at which the M message was received
  • hn * is in terms of the home address of the portable communication unit and the address of the ith layer node at which the M message was received.
  • the layer difference index C n h(D True if the new address and the home address of the portable communication unit are the same at the ith layer, otherwise C n h(D - False.
  • Cnh(4) True
  • C n h(3) False, if the portable communication unit find a new strongest port (new address) in Jacksonville and registered (home address) somewhere in Boynton Beach.
  • the other layer difference indexes are defined in the same manner. The value of all the layer difference numbers and layer difference indexes are derived easily from the addresses. Definitions:
  • Tum_on True, if not Active (t) and Active(t+ ⁇ t), or False otherwise.
  • Turn_off True, if Active(t) and not Active(t+ ⁇ t), or False, otherwise.
  • An active portable monitors the environment for base signals.
  • the portable determines (1) whether the current and new addresses are both inside the service area (i.e., whether INc and INn are true), and (2) whether the new address and the current address are not the same at the first layer (i.e, whether a paging boundary is crossed, or Cnc(1) is false). If the current and new addresses are both inside the service area, and the new address and the current address are not the same at the first layer, the portable communication unit transmits a message (M1) if the new and home address are different at the first layer.
  • M1 message
  • the portable communication unit If the current and new address are both inside the service area, and the new address and the current address are not the same at the first layer, and the portable communication unit is not in the registered position (i.e., the current address is not the home address), it transmits a second message (M2) to the current port. The portable communication unit then continues monitoring the environment.
  • M2 second message
  • the portable also determines whether it is outside its home address, and whether the following additional conditions are met: (1) it is in its service area and turned off, (2) it is inside its service area but moving outside of its service area, or (3) there exist unsuitable usage conditions. If the above determination is affirmative, the portable transmits a message (M3) to the current port. The portable communication unit then continues monitoring the environment.
  • the portable also determines whether (1) the portable is not at its home address, and (2) it is activated (i.e., turned on) inside its service area or it is moving into a service area. If those conditions are met, a fourth message (M4) is sent to the new port and the portable communication unit continues to monitor the environment.
  • M4 fourth message
  • the base station After receiving these M messages, the base station transmits them immediately to its layer 2 parent node.
  • the logic of the process employed at each of the nodes of layer i after receiving M messages is as follows.
  • step 300 a first message M1 is received in a node in layer /.
  • a decision 302 is then made determining whether i is less than or equal to the number of the highest layer where the new and current addresses of the portable communication unit are different (i.e., whether i ⁇ R n c)-
  • step 306 the message M1 is sent to its layer / +1 parent communication service node when the determination of step 302 is affirmative.
  • decision 307 it is determined whether / is greater than one.
  • the process is stopped (320) for the node in layer one.
  • a further decision 310 is made determining whether there is an entry for the portable communication unit in the database of the layer / node.
  • step 310 When the determination of step 310 is affirmative, a decision 312 is made determining whether the new address and the home address of the portable communication unit are the same at the /-1 layer.
  • step 312 When the determination of step 312 is affirmative, the entry relating to the portable communication unit at the database of the layer / node is removed in step 316, and the process stops
  • step 312 When the determination of step 312 is negative, the /- 1 layer address relating to the portable communication unit is updated and the process stops (320) for the layer i node.
  • step 302 When the determination of step 302 is negative, a further decision 304 is made to determine whether / is equal to the sum of one and the number of the highest layer where the new address and the current address of the portable communication unit are different.
  • step 304 When the determination of step 304 is affirmative, the process continues at decision 307. When the determination of step 304 is negative, it is determined (in step 308) that an error exists.
  • step 310 When the determination of step 310 is negative, a new entry will be added in the database at the layer i node with the layer i-
  • step 340 the second message M2 is received in a base station or a communication service node in layer / * .
  • step 342 it is determined whether i is less than the number of the highest layer where the new address and the current address of the portable communication unit are different.
  • step 342 the process proceeds to step 345.
  • the determination of step 342 is affirmative, the M2 message is sent to its layer i+1 parent node in step 344.
  • decision 345 it is determined whether / ' is greater than 1.
  • a further decision 346 is made to determine whether the current address and the home address of the portable communication unit are the same at layer /.
  • the process stops (352) for the layer i node.
  • step 346 When the determination of step 346 is affirmative, a new entry relating to the portable communication unit with an "out" mark is added (in step 348) in the database at the layer / node. The out mark indicates that the portable communication unit is not at its home address. The process then stops (352) for the layer i communication services node. When the determination of step 346 is negative, a further decision 347 is made to determine whether the first layer is the highest layer where the current address and the new address of the portable communication unit are different.
  • step 347 When the determination of step 347 is negative, the entry relating to the portable communication unit in the database of the layer i node is removed in step 350, and the process for the layer i communication services node is stopped (352). When the determination of step 347 is affirmative, the process for the layer i communication services node stops (352).
  • step 360 the third message M3 is received in a node in layer .
  • decision 361 it is determined whether i is greater than one. When decision 361 is negative, the third message is sent to its second layer parent node, and the process stops (372) for the node in layer one. When the determination of decision 361 is affirmative, a further decision 362 is made determining whether the current address of the portable communication unit and the address of the node, at which the third message was received, are the same at layer i, and whether i is less than or equal to the number of the highest layer where the current address and the home address of the portable communication unit are different.
  • step 370 the entry relating to the portable communication unit is removed from the database of the node in which the third message was received, and the process stops (372) for the layer i communication services node.
  • decision 362 is negative, a further decision 366 is made to determine whether the home address of the portable communication unit and the address of the node in which the third message was received are the same at layer i, and whether i is greater than two.
  • decision 366 is affirmative, the third message is sent to its layer i-1 child node along the path leading to the home address of the portable communication unit, and the process continues at step 370.
  • decision 366 is negative, the process continues at step 370.
  • a layer i node receives an 4 message.
  • decision 401 it is determined whether i is greater than one. If decision 401 is affirmative, a further decision 402 is made to determine if i equals two, and if the new address of the portable communication unit and the address of the node at which the fourth message was received, are the same at layer i. If decision 402 is negative, a decision 408 is made. If decision 402 is affirmative, a decision 404 is made.
  • decision 404 the layer i node will make an authentication test to determine whether the customer (portable communication unit) is authentic. If decision 404 is negative, the process stops (406) for the layer i node. If decision 404 is affirmative, the process continues at decision 408.
  • decision 408 it is determined whether the new address of the portable communication unit and the address of the node at which the fourth message was received, are the same at layer i. When decision 408 is negative, the process continues at decision 414. When decision 408 is affirmative, a further decision 410 is made determining whether i is less than or equal to the number of the highest layer where the new address and the home address of the portable communication unit are different.
  • step 410 When the determination of step 410 is affirmative, the fourth message is sent to its layer i+1 parent node in step 415, and the process continues at step 416. When the determination of step 410 is negative, a further decision 411 is made determining whether i is greater than two.
  • step 411 If decision 411 is affirmative the fourth message is sent to the layer i-1 child communication services node along a path leading to home address of the portable communication unit. Then the process continues at step 416. If decision 411 is negative, the process continues at step 416. In step 416, an entry with the layer i-1 address of the portable communication unit is added in the database of the node, and the process stops for the layer i communication services node.
  • decision 414 it is determined whether the home address of the portable communication unit and the address of the node at which the fourth message was received, are the same at layer i. If decision 414 is negative then it is determined in step 420 that there is an error, and the process stops.
  • step 414 When the determination of step 414 is affirmative, a further determination is made as to whether i is greater than two in decision 417 . If decision 417 is affirmative, the fourth message is sent (422) to the the layer i-1 child communication services node along a path leading to home address of the portable communication unit, and the process continues at step 418. If decision 417 is negative, the process continues at step 418. In step 418, a new entry relating to the portable communication unit with an "out" mark is entered in the database at the layer i node, and the process stops for the layer i communication services node. The out mark indicates that the portable communication unit is not at its home address.
  • the user of portable communication unit 24 has a home address as follows: (USA, Florida, 407, Boynton, 1 ,d).
  • the portable 24 is moving from 8,d to 9,d (indicated by the portable's phantom image 24').
  • the portable 24 has a current address as follows: (USA, Georgia, 404, Atlanta, 8,d), and a new address as follows: (USA, Georgia, 404, Athens, 9,d).
  • the portable 24 moves out of cell 8,d, it transmits a message M1 to the base station in cell 9,d, and an M2 message to the base station at cell 8,d.
  • the base station at 9,d when the base station at 9,d receives the M1 message, it is transmitted to the Athens node.
  • the Athens node When the Athens node receives the M1 message it will send the message to node 404, and add an entry indicating that the portable unit 24 is currently in cell 9,d. Then the 404 node updates the entry to indicate that the current address for unit 24 is now in Athens.
  • a communication system in accordance with the invention provides a distributed database including location information relating to portable communication units within the system, and processes for tracing the portable communication units and for updating their locations, thus avoiding the necessity of maintaining a single database for the whole system.

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)

Abstract

A communication system (100) includes a plurality of organizational layers (102, 104, 106, 108, 110), a plurality of portable communication units (20, 22, 24), and a plurality of base stations (112). Each layer comprises a plurality of nodes. The plurality of nodes includes a plurality of base stations (112) in the first layer, and a plurality of communication services nodes organized into higher layers (102, 104, 106, 108, 110). Each communication services node includes a database possibly containing information on the locations of one or more portable communication units (24). The databases constitute a distributed database containing information on the locations of some of the portable communication units (24) within the system (100), and a tracing strategy is realized by the transmission of control messages (306) informing the system of a moving portable communication unit's (24) location. The system tries to set up a connection (120) to the home address of the called portable communication unit. If there is information on the called unit (24), its location is indicated by the address chain (138) in the distributed database.

Description

UNIVERSAL PERSONAL COMMUNICATION SYSTEM AND TRACING SYSTEM THEREFOR
Technical Field
This invention relates generally to universal personal communication systems.
Background A universal personal communication system is a system enabling anyone to communicate instantly with anyone else anywhere in the world. One of the crucial problems of such a system would be locating millions of moving customers in an efficient manner. The existing techniques for locating moving customers in the system are paging and registration using a central database. Considering the large number of customers in a global system, the first technique, if applied without knowledge of the location of the customers is impractical. The registration technique, which records all the movements of customers in a central database, is also impractical because the task of keeping track of such a huge number of users would be immense. Thus, a need exists for a system for efficiently tracking customers in a universal personal communication system.
Summary of the Invention
Briefly, according to the invention, a communication system includes a plurality of organizational layers, a plurality of portable communication units, and a plurality of base stations. Each layer comprises a plurality of nodes. The plurality of nodes comprises a plurality of base stations in the first layer, and a plurality of communication services nodes in the higher layers. Each communication services node includes a database possibly containing information on the locations of one or more portable communication units. The databases constitute a distributed database containing information on the locations of the portable communication units within the system. In another aspect of the invention, a method for establishing a connection between a calling and a called communication unit in the above-mentioned communication system is provided. An active portable communication unit in one of its service areas will be located by the system when a calling communication unit initiates a connection request.
In still another aspect of the invention, a method for updating the databases in the communication services node by transmission of some control messages.
Brief Description of the Drawings
FIG. 1 is a hierarchical structure for a communication system in accordance with the invention.
FIG. 2 is a flow chart of a process carried out at a node for locating a portable communication unit in accordance with the invention.
FIG. 3 is a possible address structure in accordance with the invention.
FIG. 4 is a possible database of a node at layer k. FIG. 5 is an example of an address chain for a customer of class 5 or 6, before moving.
FIG. 6 is a flow chart for nodes receiving a message M1.
FIG. 7 is a flow chart for nodes receiving a message M2.
FIG. 8 is a flow chart for nodes receiving a message 3. FIG. 9 is a flow chart for nodes receiving a message M4.
FIG. 10 is an example of an address chain after moving for a customer of class 5 or 6.
Detailed Description of the Preferred Embodiment Referring to FIG. 1 , there is shown a hierarchical structure for a communication system 100 in accordance with the invention. The covered area of the communication system 100 is organized into a hierarchical structure having several layers. The highest layer may be the earth 102 followed by country 104, state 106, area code 108, city 110, and the lowest layer (Layer 1) is a primary layer that comprises a plurality independent paging regions (cells) 112. Each layer 1 cell comprises one or more base stations. Layer 1 may comprise a radio telephone communication * system (e.g., Digital European Cordless Telephone). Not losing generality, from now on layer 1 cells shall be referred to as base **" 5 stations. Each region of layer "/" (except the lowest layer) consists of several regions of layer ~i- 1.n.
Each block in layers 2 through 6 (the secondary layers) is a communication service node representing a switching station having computing and memory means (i.e., all layers >1 are
10 intelligent layers). The memory means comprises a database for tracking the location of customers (i.e., users of portable communication units that are registered in the system).
Referring to FIG. 2, there is shown a flow chart illustrating a process for receiving a connection request for a layer / node. In
15 step 120, a connection request packet is received at node in layer /. The connection request packet, sent by a calling communication unit, requests a connection between the calling communication unit and a called (portable) communication unit 1. The call request packet comprises a code identifying the called portable
20 unit. In step 122 the system keeps track of the possible connections (i.e., bookkeeping).
In decision 124, a determination is made as to whether (1) the connection request is received at the first layer and (2) the connection request was not received directly from a portable
25 communication unit. If the determination of decision 124 is affirmative, the called party is paged (if it is a portable) or rung (if it is a fixed telephone) (step 126). In decision 128, it is determined whether a connection confirmation signal is received from the called communication unit within a predetermined
30 period of time. If the determination made in decision 128 is affirmative, the connection is successful (step 130). If it is negative, the connection attempt fails (step 132).
If the determination in decision 124 is negative, then a further decision 134 is made to determine whether the
35 connection request was received in the first layer. If decision 134 is affirmative, the connection request is passed to its parent node in layer two (step 136). The process then continues to the stop step (144) for that node.
If decision 134 is negative a further decision 138 is made to determine whether there is any information relating to the called party in the database corresponding to the current node. If decision 138 is affirmative, the connection request is passed to the next node along the address chain (step 140). If the determination in step 138 is negative, the connection request is passed to the next node along the path to the home address of the called party (step 142). Following either step 140 or 142, the process stops (step 144) for the node passing on the connection request, and begins at step 120) for the next node receiving the connection request.
Referring to FIG. 3, there is shown a set of possible address structures for portable communication units. These address structures include a field for each of the layers.
There are two kinds of addresses used in the system: (1) home addresses; and (2) physical addresses. The home address is the registered address of the portable communication unit (i.e., the same as a telephone number). The incoming calls will find the portable communication unit in this address unless it has moved to another area or if it has been turned off. The physical address is the address where the portable communication unit can be actually reached. When hand over (or handoff) happens, two physical addresses are needed: (1) the current address, which indicates the physical address of the base station to which the portable unit is locking; and (2) the new address, which indicates the physical address of the desired new base station. In the case of a fixed subscriber, the physical address is always identical to the home address. The physical address of portable communication unit is obtained in the messages broadcasted from the port.
Referring to FIG. 4, there is shown a representation of a possible database of a node. "HA/ is the home address of customer "f and "Add/" is the current address field for customer ti ΛI J - A customer is classified by the number of the lowest layer that covers all the service areas of the customer. A service area is any area that the customer selects to be reached at. The home address of a customer must be in one of the service areas. The
- > 5 symbol "pc" is used to denote the class of the customer.
Referring again to FIG. 1 , for example pc = 4, if customer 1 wants to be reached anywhere in area code 404 and Savannah because the lowest level common node (Georgia) is at layer 4. If customer 2 wants to be reached anywhere in area code 407,
10 Atlanta and California, the pc will be 5 because the lowest level common node (U.S.A.) is at layer 5. Also, pc = 2 if customer 3 wants to be reached only in Boynton. The service areas are chosen by customers and the associated information is stored in the portable communication units. The information may also be
15 stored elsewhere (e.g., for credit purposes). The classification pc of a portable communication unit is derived easily from its service areas as follows: Define SAj be the address of the ith service area of the portable communication unit which contains all the layer addresses from the service area and up with all the
20 lower addresses filled with "don't care" marks '?'. For example, if the second service area of a portable communication unit is Florida, the SA2 of the customer will be {U.S.A., Florida,?,?,?}. Also, if the third service area of the customer is Atlanta, the SA3 will be {U.S.A., Georgia, 404, Atlanta,?}. Define Qjj to be the
25 highest layer where the address of the ith and the jth service area of a customer are different. For customer 1 , for example, 3. Suppose no more than M service areas are chosen by each customer. Then the customer class is: pc = 1 + max Qij
30 , M
There are three kinds of entities in the database of layer / with each entry associated with an active customer of class / or higher: (1) portable communication units which registered in the ith layer region and are now outside the region (i.e..native customers that are outside the covered area);
(2) the portable communication unit which registered outside the ith layer region and is now inside the region (i.e., a foreign customer having a home address outside and a current address inside the covered area); and
(3) portable communication units which registered in the ith layer region and are now inside the region, but in a different ϊ-1 layer region from where they registered (i.e., a native customer having a different current address from its home address at the next lower layer).
The address information field may contain one of the following three entries: (1) an "out" mark which indicates that the native portable communication unit is outside the covered region;
(2) the physical address of the i-1 layer for the foreign portable communication unit; and
(3) physical address of ϊ-1 layer for the native portable communication unit.
In this system an active customer does not necessarily communicate on the portable communication unit, but the movement of the portable communication unit is traced by the system. A customer is active when the power of the portable communication unit is on. To reduce the burden on the system, it is possible to charge customers in terms of the number of tracing messages for their portable communication units. A class 0 customer is defined to be reached only at home address (i.e., a fixed telephone). Referring to Fig 5, there is shown a diagram illustrating an example of an address chain before moving for a portable communication unit 24 of class 5 or 6. In this example, the called party (unit 24) has a home address in cell 1 ,d, and a current address at cell 8,d. In a first case, the communication unit 20, located in cell 2,c, places a call to communication unit 24. The communication unit 20 merely dials the home address number of the called party. The calling party's connection request is received by an base station at cell 2,c, and it is passed on to the Boynton node in layer 2.
At the Boynton node, the corresponding database is searched for an entry relating to the called party. In this case an entry is found in the database. The entry contains the home address (HA) of the called party and an "out" indication. The call is then forwarded along the address chain to the "407" node of layer 3, where the database also contains the home address of the called party and an "out" indication. Thus, the connection request is further traced up through the Florida node of layer 4, also indicating that the called party is "out". Then, in the USA node of layer 5 the database indicates that the portable 24 is in Georgia. The tracing then continues to the Georgia node, where the area code 404 is indicated. Therefore, the tracing process continues to the 404 node, where "Atlanta" is indicated. Searching in the Atlanta database reveals the precise location of the portable communication unit 24, and the requested connection is made. Referring again to FIG. 5, in a second case the call for the called party is made from a calling communication unit 22 (also a portable in this example) located at cell 9,c. Accordingly, the call is received at the base station in cell 9,c, and is passed on to the Athens node in layer 2. There is no entry relating to the called party in the Athens database. Therefore, the connection request is passed on to the next node toward the home address of the called party (i.e., the "404" node). The database at the "404" node contains an an entry (HA, Atlanta) indicating that the called party is in Atlanta. The connection request is accordingly passed on to the Atlanta node where the exact location of the portable 24 is determined to be in the 8,d cell, and the requested connection is made.
The problem remaining is how to maintain the databases. The database updating process is initiated by portable communication units. Each base station continuously transmits its subsystem identification information. By monitoring this information from the surrounding bases, an active portable communication unit is able to select a desired base station (e.g., the strongest base) and lock on to it. Whenever a new strongest base is found, up to two messages may be transmitted to the associated bases to update address chains. The address of the base to which the portable communication unit is locking is called the current address and the address of the base of the new strongest base is called new address.
In order to update the tracing chains it is required to introduce the layer difference numbers RCh. Rnc. and Rnh and the layer difference indexes CCh(i). Cnc( . C--ιh(i) and chn%( where the subscript ch indicates that the difference is in terms of the current address and the home address and nh is in terms of the new address and the home address. The above-mentioned addresses are portable communication unit addresses. Similarly, nn* is in terms of the new address of the portable communication unit and the address of the ith layer node at which the M message was received and hn* is in terms of the home address of the portable communication unit and the address of the ith layer node at which the M message was received. The layer difference number RC is the number of the highest layer where the current address and the home address of the portable communication unit are different. For example in FIG. 1 , Rc = 4 if a portable communication unit is located (current address) somewhere in Atlanta (col. 7) and is registered (home address) somewhere in Boynton Beach (col. 1 or 2). The other layer difference numbers are defined in the same manner.
The layer difference index Cnh(D = True if the new address and the home address of the portable communication unit are the same at the ith layer, otherwise Cnh(D - False. For example (see FIG. 1) Cnh(4) = True, and Cnh(3) = False, if the portable communication unit find a new strongest port (new address) in Jacksonville and registered (home address) somewhere in Boynton Beach. The other layer difference indexes are defined in the same manner. The value of all the layer difference numbers and layer difference indexes are derived easily from the addresses. Definitions:
Active(t)=True, if the portable communication unit is active at time t, or False, otherwise.
Tum_on=True, if not Active (t) and Active(t+Δt), or False otherwise.
Turn_off=True, if Active(t) and not Active(t+Δt), or False, otherwise.
Define SA = Ui=1 M area (SAj), where area (SAj) is the ith service area represented by the address SAj. Also define: INC =
True, if current address SA, or False, otherwise,
INn = True, if new address *≡ SA, or False, otherwise. The basic ideas of the algorithm that portable communication units employ are as follows.
An active portable monitors the environment for base signals. The portable determines (1) whether the current and new addresses are both inside the service area (i.e., whether INc and INn are true), and (2) whether the new address and the current address are not the same at the first layer (i.e, whether a paging boundary is crossed, or Cnc(1) is false). If the current and new addresses are both inside the service area, and the new address and the current address are not the same at the first layer, the portable communication unit transmits a message (M1) if the new and home address are different at the first layer. If the current and new address are both inside the service area, and the new address and the current address are not the same at the first layer, and the portable communication unit is not in the registered position (i.e., the current address is not the home address), it transmits a second message (M2) to the current port. The portable communication unit then continues monitoring the environment.
The portable also determines whether it is outside its home address, and whether the following additional conditions are met: (1) it is in its service area and turned off, (2) it is inside its service area but moving outside of its service area, or (3) there exist unsuitable usage conditions. If the above determination is affirmative, the portable transmits a message (M3) to the current port. The portable communication unit then continues monitoring the environment.
The portable also determines whether (1) the portable is not at its home address, and (2) it is activated (i.e., turned on) inside its service area or it is moving into a service area. If those conditions are met, a fourth message (M4) is sent to the new port and the portable communication unit continues to monitor the environment. The foregoing discussion may be represented by the following case statement:
Case Beg in
INc & INn & not Cnc(1): Send M1 to new port if not Cnh(1)
Send M2 to current port if not Cch(1) not Cch(1) & [INc & Turn_off) or (INc & not INn) or unsuitable usage]: Send M3 to current port not Cnh(1) & [(INc & Turn_on) or (INn & not INc)]:
Send M4 to new port End
There are five fields in each of the M messages: (1) message type, (2) current address, (3) new address, (4) home address, and (5) pc.
After receiving these M messages, the base station transmits them immediately to its layer 2 parent node. The logic of the process employed at each of the nodes of layer i after receiving M messages is as follows.
Referring to FIG. 6, there is shown a flow chart for nodes receiving M1 messages. In step 300 a first message M1 is received in a node in layer /. A decision 302 is then made determining whether i is less than or equal to the number of the highest layer where the new and current addresses of the portable communication unit are different (i.e., whether i< Rnc)- In step 306, the message M1 is sent to its layer / +1 parent communication service node when the determination of step 302 is affirmative.
Then in decision 307 it is determined whether / is greater than one. When the determination of step 307 is negative, the process is stopped (320) for the node in layer one. When decision
307 is affirmative, a further decision 310 is made determining whether there is an entry for the portable communication unit in the database of the layer / node.
When the determination of step 310 is affirmative, a decision 312 is made determining whether the new address and the home address of the portable communication unit are the same at the /-1 layer.
When the determination of step 312 is affirmative, the entry relating to the portable communication unit at the database of the layer / node is removed in step 316, and the process stops
(320) for the communication service node in layer /.
When the determination of step 312 is negative, the /- 1 layer address relating to the portable communication unit is updated and the process stops (320) for the layer i node. When the determination of step 302 is negative, a further decision 304 is made to determine whether / is equal to the sum of one and the number of the highest layer where the new address and the current address of the portable communication unit are different. When the determination of step 304 is affirmative, the process continues at decision 307. When the determination of step 304 is negative, it is determined (in step 308) that an error exists.
When the determination of step 310 is negative, a new entry will be added in the database at the layer i node with the layer i-
1 new address of the portable communication unit stored in the address field in step 318, and the process is stopped (320) for the layer i communication services node.
Referring to FIG. 7, there is shown a flow-chart for nodes receiving M2 messages. In step 340, the second message M2 is received in a base station or a communication service node in layer /*.
In decision 342 it is determined whether i is less than the number of the highest layer where the new address and the current address of the portable communication unit are different. When the determination of step 342 is negative, the process proceeds to step 345. When the determination of step 342 is affirmative, the M2 message is sent to its layer i+1 parent node in step 344. Then in decision 345 it is determined whether /' is greater than 1. When the determination of step 345 is affirmative, a further decision 346 is made to determine whether the current address and the home address of the portable communication unit are the same at layer /. When the determination of step 345 is negative, the process stops (352) for the layer i node.
When the determination of step 346 is affirmative, a new entry relating to the portable communication unit with an "out" mark is added (in step 348) in the database at the layer / node. The out mark indicates that the portable communication unit is not at its home address. The process then stops (352) for the layer i communication services node. When the determination of step 346 is negative, a further decision 347 is made to determine whether the first layer is the highest layer where the current address and the new address of the portable communication unit are different.
When the determination of step 347 is negative, the entry relating to the portable communication unit in the database of the layer i node is removed in step 350, and the process for the layer i communication services node is stopped (352). When the determination of step 347 is affirmative, the process for the layer i communication services node stops (352).
Referring to FIG. 8, there is shown a flow-chart for nodes receiving M3 messages. In step 360, the third message M3 is received in a node in layer . In decision 361 , it is determined whether i is greater than one. When decision 361 is negative, the third message is sent to its second layer parent node, and the process stops (372) for the node in layer one. When the determination of decision 361 is affirmative, a further decision 362 is made determining whether the current address of the portable communication unit and the address of the node, at which the third message was received, are the same at layer i, and whether i is less than or equal to the number of the highest layer where the current address and the home address of the portable communication unit are different. When decision 362 is affirmative, the M3 message is sent to its layer i+1 parent node in step 364. Then in step 370 the entry relating to the portable communication unit is removed from the database of the node in which the third message was received, and the process stops (372) for the layer i communication services node. When decision 362 is negative, a further decision 366 is made to determine whether the home address of the portable communication unit and the address of the node in which the third message was received are the same at layer i, and whether i is greater than two. When decision 366 is affirmative, the third message is sent to its layer i-1 child node along the path leading to the home address of the portable communication unit, and the process continues at step 370. When decision 366 is negative, the process continues at step 370.
Referring to FIG. 9, there is shown a flowchart for nodes receiving M4 messages. In step 400 a layer i node receives an 4 message. In decision 401 it is determined whether i is greater than one. If decision 401 is affirmative, a further decision 402 is made to determine if i equals two, and if the new address of the portable communication unit and the address of the node at which the fourth message was received, are the same at layer i. If decision 402 is negative, a decision 408 is made. If decision 402 is affirmative, a decision 404 is made.
In decision 404, the layer i node will make an authentication test to determine whether the customer (portable communication unit) is authentic. If decision 404 is negative, the process stops (406) for the layer i node. If decision 404 is affirmative, the process continues at decision 408.
In decision 408 it is determined whether the new address of the portable communication unit and the address of the node at which the fourth message was received, are the same at layer i. When decision 408 is negative, the process continues at decision 414. When decision 408 is affirmative, a further decision 410 is made determining whether i is less than or equal to the number of the highest layer where the new address and the home address of the portable communication unit are different.
When the determination of step 410 is affirmative, the fourth message is sent to its layer i+1 parent node in step 415, and the process continues at step 416. When the determination of step 410 is negative, a further decision 411 is made determining whether i is greater than two.
If decision 411 is affirmative the fourth message is sent to the layer i-1 child communication services node along a path leading to home address of the portable communication unit. Then the process continues at step 416. If decision 411 is negative, the process continues at step 416. In step 416, an entry with the layer i-1 address of the portable communication unit is added in the database of the node, and the process stops for the layer i communication services node.
In decision 414 it is determined whether the home address of the portable communication unit and the address of the node at which the fourth message was received, are the same at layer i. If decision 414 is negative then it is determined in step 420 that there is an error, and the process stops.
When the determination of step 414 is affirmative, a further determination is made as to whether i is greater than two in decision 417 . If decision 417 is affirmative, the fourth message is sent (422) to the the layer i-1 child communication services node along a path leading to home address of the portable communication unit, and the process continues at step 418. If decision 417 is negative, the process continues at step 418. In step 418, a new entry relating to the portable communication unit with an "out" mark is entered in the database at the layer i node, and the process stops for the layer i communication services node. The out mark indicates that the portable communication unit is not at its home address.
Referring to FIG. 10, there is shown an example of an address chain for a customer of class 5 or 6 (after moving), in this example, the user of portable communication unit 24 has a home address as follows: (USA, Florida, 407, Boynton, 1 ,d). The portable 24 is moving from 8,d to 9,d (indicated by the portable's phantom image 24'). Thus, the portable 24 has a current address as follows: (USA, Georgia, 404, Atlanta, 8,d), and a new address as follows: (USA, Georgia, 404, Athens, 9,d). As the portable 24 moves out of cell 8,d, it transmits a message M1 to the base station in cell 9,d, and an M2 message to the base station at cell 8,d.
According to the invention, when the base station at 9,d receives the M1 message, it is transmitted to the Athens node. When the Athens node receives the M1 message it will send the message to node 404, and add an entry indicating that the portable unit 24 is currently in cell 9,d. Then the 404 node updates the entry to indicate that the current address for unit 24 is now in Athens.
Thus a communication system in accordance with the invention provides a distributed database including location information relating to portable communication units within the system, and processes for tracing the portable communication units and for updating their locations, thus avoiding the necessity of maintaining a single database for the whole system.

Claims

Cla im s :
"I. A communication system comprising: a plurality of portable and stationary communication units; a plurality of nodes including: a plurality of base stations organized into a f i rst layer; and a plurality of communication service nodes organized into a plurality of higher layers; each portable communication unit including a home address and a physical address associated therewith; each physical address comprising a current address and a new address; and each communication service node having a database associated therewith, each base station and each communication service node having a unique parent node at each higher level.
2. In a communication system comprising a plurality of portable communication units, a plurality of base stations organized into a first layer, and a plurality of communication service nodes organized into a plurality of higher layers, each portable communication unit including a home address and a physical address associated therewith, each physical address comprising a current address and a new address, and each communication service node in a layer, other than the first, having a database associated therewith, each base station and each lower layer communication service node having a unique parent node in each of the higher levels, a process for establishing a connection between a calling communication unit and a called communication unit comprising the steps of: (a) receiving a connection request, at a base station or communication service node in layer /, the connection request requesting the establishment of a communication link between the calling communication unit and the called communication unit; (b) determining whether layer is in the first layer, and whether the connection request was received from a portable communication unit;
(c) calling the called communication unit when the connection request was received by a communication service node in the first layer, and the connection request was not received directly from a portable communication unit;
(d) determining whether a connection confirmation has been received from the called communication unit within a predetermined period;
(e) establishing the communication link when connection confirmation has been received from the called communication unit within a predetermined period and stopping the process for the first layer node; and (f) reporting a communication failure to the communication system, when the determination of step (d) is negative and stopping the process for the first layer node.
3. The process of claim 2, further comprising the steps of: (g) determining whether layer /' is the first layer, when it is determined in step (b) that the connection request was received directly from a portable communication unit, or that i is greater than one; and
(h) passing the connection request to its second layer parent communication service node, when the determination of step (g) is affirmative and stopping the process for the first layer node.
4. The process of claim 3, further comprising the step of: (i) determining whether there is an entry relating to the called communication unit in the database of the communication service node receiving the connection request, if it is determined in step (g) that layer / is not the first layer.
5. The process of claim 3, further comprising the steps of: (I) passing the connection request to the communication service node or the base station whose address is indicated in the address field of the associated item in the database, when the the determination of step (i) is affirmative and stopping the process for the layer i node; and
(k) passing the connection request to the next layer node along the path leading to the called communication unit's home address, when the the determination of step (i) is negative and stopping the process for the layer i node.
6. In a communication system comprising a plurality of portable and stationary communication units each operating in a service area defined by a user of a communication unit, a plurality of nodes including a plurality of base stations which form a first layer for the communication system, and a plurality of communication service nodes organized into a plurality of higher layers, each portable communication unit including a home address and a physical address associated therewith, each physical address comprising a current address and a new address, each communication service node comprises a database of portable communication unit addresses, and each base station and lower layer communication service node having a unique parent node in each of the higher levels, a process for maintaining each database comprising the steps of: (a) transmitting a first message with a portable communication unit to a base station in a second cell as the portable communication unit moves out of a first cell and into the second cell and when: the current address and the new address of the portable communication unit are within the service area of the portable communication unit; the new address and the home address of the portable communication unit are not the same at the first layer; the first message including the current address, the new address and the home address for informing the base station in the second cell, that the portable communication unit is going to lock to the base station;
(b) transmitting a second message with a portable communication unit to a base station in the first cell when the portable communication unit moves out of the first cell and into the second cell, and when the current address and the new address of the portable communication unit are within the service area of the portable communication unit, and the current address and the home address of the portable communication unit are not the same at the first layer; the second message including the current address, the new address, and the home address of the portable communication unit for informing the base station in the first cell that the portable is leaving the first cell.
7. The process of claim 6, further comprising the step of:
(c) transmitting a third message with a portable communication unit to a base station that the portable communication unit is locked on to, when the portable is not in its home address and any one of the following conditions occurs: there is an unsuitable usage of the portable communication unit; the portable is turned off inside its service area; and the portable communication unit is moving out of its service area; the third message including the current address, and the home address of the portable communication unit, and the third message informing the system that the portable communication unit is leaving the communication system.
8. The communication system of claim 6, further comprising the step of:
(d) transmitting a fourth message with a portable communication unit to a selected base station within its service area when: the portable's home address is not within the selected cell; and the portable is moving into the selected cell from an area that is not in a service area for the portable, or the portable communication unit is activated inside its service area; the fourth message including the new address, and the home address of the portable communication unit, and the fourth message informing the system that the portable communication unit is entering the communication system.
9. The process of claim 6, wherein the first message is received in a node in layer /, and step (a) further comprises the steps of:
(a1) determining whether i is less than or equal to the number of the highest layer where the new and current addresses of the portable communication unit are different;
(a2) sending the first message to its layer / +1 parent communication service node when the determination of step (a1) is affirmative; (a3) determining whether / is greater than one;
(a4) determining whether there is an entry for the portable communication unit in the database of the layer / node, when the determination of step (a3) is affirmative;
(a5) determining whether the new address and the home address of the portable communication unit are the same at the /- 1 layer, when the determination of step (a4) is affirmative;
(a6) removing an entry relating to the portable communication unit at the database of the layer /' node when the determination of step (a5) is affirmative, and stopping the process for the communication service node in layer /; and
(a7) stopping the process for the communication service node in layer t", when the determination of step (a3) is negative.
10. The process of claim 9, further comprising the steps of (a8) determining whether / is equal to the sum of one and the number of the highest layer where the new address and the current address of the portable communication unit are different, when the determination of step (a1) is negative;
(a9) proceeding to step (a3) when the determination of step (a8) is affirmative; and (a10) determining that an error exists when the determination of step (a8) is negative.
11. The process of claim 10 further comprising the following step, after step (a5): (a11 ) updating the -1 layer address relating to the portable communication unit when the determination of step (a5) is negative, and the process stops for the layer i node.
12. The process of claim 11 , further comprising the following steps:
(a12) adding a new entry with the address indicating the layer i-1 new address of the portable communication unit, and stopping the process for the layer i communication services node, when the determination of step (a4) is negative.
13. The process of claim 6, wherein the second message is received in a base station or a communication service node in layer /, and step (b) further comprises the steps of:
(b1 ) determining whether i is less than the number of the highest layer where the new address and the current address of the the portable communication unit are different;
(b2) sending the second message to its layer / +1 parent node, when the determination of step (b1 ) is affirmative; (b3) determining whether / is greater than 1 ; (b4) determining whether the current address and the home address of the portable communication unit are the same at layer /, when the determination of step (b3) is affirmative; and
(b5) adding a new entry relating to the portable communication unit with an out mark in the database at the layer / node, the out mark indicating that the portable communication unit is not at its home address, when the determination of step (b4) is affirmative, and stopping the process for the layer i communication services node.
14. The process of claim 13, further comprising the following step, after step (b1 ):
(b6) proceeding to step (b3) when the determination of step (b1) is negative.
15. The process of claim 14, further comprising the following steps, after step (b4):
(b7) determining whether the first layer is the highest layer where the current address and the new address of the portable communication unit are different, when the determination of step (b-4) is negative; and (b8) removing an entry relating to the portable communication unit in the database of the layer i node, and stopping the process for the layer i communication services node when the determination of step (b7) is negative;
(b9) stopping the process for the layer i communication services node when the determination of step (b7) is affirmative; and
(b10) stopping the process for the layer i communication services node when the determination of step (b3) is negative.
16. The process of claim 7, wherein the third message is received in a node in layer /, and step (c) further comprises the steps of:
(d) determining whether i is greater than one;
(c2) determining whether the current address and the address of the node, at which the third message was received, are the same at layer i, and whether i is less than or equal to the number of the highest layer where the current address and the home address of the portable communication unit are different, when the determination of step (d) is affirmative; (c3) sending the third message to its parent communication services node at the i+1 layer, when the determination of step (c2) is affirmative; and
(c4) removing an entry relating to the portable communication unit from the database of the node in which the third message was received, and stopping the process for the layer i communication services node.
17. The process of claim 16 further comprising the following steps, after step (c2):
(c5) determining whether the home address of the portable communication unit and the address of the node in which the third message was received are the same at layer i, and whether i is greater than two, when the determination of step (c2) is negative; and
(c6) sending the third message to its layer i-1 child node along the path leading to the home address of the portable communication unit, and proceeding to step (c4) when the determination of step (c5) is affirmative.
18. The process of claim 17 further comprising the following step, after step (d):
(c7) sending the third message to its second layer parent node, and stopping the process for the node in the first layer when the determination of step (d) is negative.
19. The process of claim 8, wherein the node is in layer i, and step (d) further comprises the following steps:
(d1 ) determining whether i is greater than one; (d2) determining whether i equals two, and whether the new address of the portable communication unit and the address of the node at which the fourth message was received, are the same at layer i when the determination of step (d1 ) is affirmative;
(d3) determining whether the portable communication unit is authentic when the determination of step (d2) is affirmative; (d4) determining whether the new address of the portable communication unit and the address of the node at which the fourth message was received, are the same at layer i, when the determination of step (d3) is affirmative; (d5) determining whether i is less than or equal to the number of the highest layer where the new address and the home address of the portable communication unit are different, when the determination of step (d4) is affirmative;
(d6) sending the fourth message to its layer i+1 parent node, when the determination of step (d5) is affirmative;
(d7) adding an entry with the layer i-1 address of the portable communication unit, and stopping the process for the layer i communication services node; and
(d8) determining whether i is greater than two when the determination of step (d5) is negative; and
(d9) proceeding to step (d7) when step (d8) is negative.
20. The method of claim 19 further comprising the following steps, after step (d8): (d10) sending the fourth message to the layer i-1 child communication services node along a path leading to the home address of the portable communication unit, and proceeding to step (d7), when the determination of step (d8) is affirmative.
21. The process of claim 20, further comprising the following step, after step ( d1):
(d11) sending the fourth message to its second layer parent communication services node, and stopping the process for the first layer communication services node, when the determination of step (d1) is negative.
22. The process of claim 21 further comprising the following step, after steps (d4):
(d12) determining whether the home address of the portable communication unit and the address of the node at which the fourth message was received, are the same at layer i, when the determination of step (d4) is negative;
(d13) determining whether i is greater than two when the determination of step (d12) is affirmative; (d14) sending the fourth message to the the layer i-1 child communication services node along a path leading to home address of the portable communication unit, when the determination of step (d13) is affirmative; and
(d15) adding a new entry relating to the portable communication unit with an out mark in the database at the layer i node, and stopping the process for the layer i node, the out mark indicating that the portable communication unit is not at its home address.
23. The process of claim 22 further comprising the following step, after step (d2):
(d16) proceeding to step (d4) when the determination of step (d2) is negative.
24. The process of claim 23 further comprising the following step, after step (d12):
(d17) determining that an error has occurred when the determination of step (d12) is negative.
25. The process of claim 24 further comprising the following step, after step (d13):
(d18) proceeding to step (d15) when the determination of step (d13) is negative.
26. The process of claim 27 further comprising the following step, after step (d3):
(d19) stopping the process for layer i, when the determination of step (d3) is negative.
PCT/US1992/010529 1992-01-03 1992-12-07 Universal personal communication system and tracing system therefor WO1993013631A1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
CA002127273A CA2127273C (en) 1992-01-03 1992-12-07 Universal personal communication system and tracing system therefor
KR1019940702308A KR940704106A (en) 1992-01-03 1992-12-07 UNIVERSAL PERSONAL COMMUNICATION SYSTEM AND TRACING SYSTEM THEREFOR
EP93900912A EP0619930A4 (en) 1992-01-03 1992-12-07 Universal personal communication system and tracing system therefor.
KR1019940702308A KR0144431B1 (en) 1992-01-03 1992-12-07 Universal personal communication system and tracing system therefor

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US817,018 1986-01-08
US07/817,018 US5274845A (en) 1992-01-03 1992-01-03 Universal personal communication system and tracing system therefor

Publications (1)

Publication Number Publication Date
WO1993013631A1 true WO1993013631A1 (en) 1993-07-08

Family

ID=25222181

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1992/010529 WO1993013631A1 (en) 1992-01-03 1992-12-07 Universal personal communication system and tracing system therefor

Country Status (7)

Country Link
US (1) US5274845A (en)
EP (1) EP0619930A4 (en)
KR (2) KR0144431B1 (en)
CN (1) CN1030160C (en)
CA (1) CA2127273C (en)
MX (1) MX9207582A (en)
WO (1) WO1993013631A1 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0614322A1 (en) * 1993-01-21 1994-09-07 AT&T Corp. Directory structure for large scale telecommunications network allowing location of roaming mobile subscribers
US5608410A (en) * 1993-05-07 1997-03-04 Associated Rt, Inc. System for locating a source of bursty transmissions cross reference to related applications
US5694393A (en) * 1993-11-11 1997-12-02 U.S. Philips Corporation Communications system
EP1113691A1 (en) * 1999-12-28 2001-07-04 NTT DoCoMo, Inc. Location managing method for managing location of mobile station in mobile wireless packet communication system and mobile wireless packet communication system

Families Citing this family (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5539922A (en) * 1992-01-03 1996-07-23 Motorola, Inc. Multiple tree hierarchical portable communication system and method
US5787349A (en) * 1992-02-27 1998-07-28 Nec Corporation Control signaling network, radio base station and mobile switching center
CA2105710A1 (en) * 1992-11-12 1994-05-13 Raymond Joseph Leopold Network of hierarchical communication systems and method therefor
EP0624993B1 (en) * 1993-04-05 2003-12-03 Motorola, Inc. Distributed multi-outlet paging
US5490203A (en) * 1993-07-26 1996-02-06 Bell Communications Research Inc. Method and system utilizing a location caching strategy to locate nomadic users in a communication services system
CA2134729C (en) * 1993-11-01 1999-09-07 Thomas E. Buss Location dependent information receiving device and method
US5649289A (en) * 1995-07-10 1997-07-15 Motorola, Inc. Flexible mobility management in a two-way messaging system and method therefor
US5920803A (en) * 1995-09-05 1999-07-06 Motorola, Inc. Method and apparatus for message delivery in a communication system having orbiting transmitters
US5956637A (en) * 1996-02-20 1999-09-21 Telefonaktiebolaget L M Ericsson (Publ) Subscriber database management in a mobile telecommunications system
EP0888078A2 (en) * 1996-03-18 1999-01-07 PEITZ GmbH Circuit arrangement for a telecommunication switching system, in particular a telephone switching system, and method of producing the telecommunication connections
JP2894316B2 (en) * 1997-03-24 1999-05-24 日本電気株式会社 Communication terminal, subscriber calling method and mobility information updating method
USD403487S (en) * 1997-04-06 1999-01-05 Med-Eng Systems Inc. Groin protector for a body suit
US6188887B1 (en) 1997-11-26 2001-02-13 Telefonaktiebolaget Lm Ericsson (Publ) Distributed data storage and delivery in a cellular telephone network
DE19980294D2 (en) * 1998-02-09 2000-07-06 Krone Management Technologie G System and method, in particular for establishing telecommunications connections
US8706630B2 (en) * 1999-08-19 2014-04-22 E2Interactive, Inc. System and method for securely authorizing and distributing stored-value card data
US8655309B2 (en) * 2003-11-14 2014-02-18 E2Interactive, Inc. Systems and methods for electronic device point-of-sale activation
US20060231611A1 (en) * 2005-03-23 2006-10-19 Chakiris Phil M Radio frequency identification purchase transactions
US7472822B2 (en) 2005-03-23 2009-01-06 E2Interactive, Inc. Delivery of value identifiers using short message service (SMS)
US20060230278A1 (en) * 2005-03-30 2006-10-12 Morris Robert P Methods,systems, and computer program products for determining a trust indication associated with access to a communication network
US20060230279A1 (en) * 2005-03-30 2006-10-12 Morris Robert P Methods, systems, and computer program products for establishing trusted access to a communication network
US20060265737A1 (en) * 2005-05-23 2006-11-23 Morris Robert P Methods, systems, and computer program products for providing trusted access to a communicaiton network based on location
TWI446782B (en) * 2008-08-07 2014-07-21 Wistron Corp Mobile communication system and related management method, mobile device and server device
US20110137740A1 (en) 2009-12-04 2011-06-09 Ashmit Bhattacharya Processing value-ascertainable items
WO2011084648A2 (en) * 2009-12-16 2011-07-14 Giftango Corporation Systems and methods for generating a virtual value item for a promotional campaign
US10068287B2 (en) 2010-06-11 2018-09-04 David A. Nelsen Systems and methods to manage and control use of a virtual card
CN102523249A (en) * 2011-11-24 2012-06-27 哈尔滨工业大学 Distributed long-distance simulation system and simulation method based on Web

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4644347A (en) * 1983-08-10 1987-02-17 Motorola, Inc. Multiple frequency message system
US4891638A (en) * 1987-10-30 1990-01-02 Motorola, Inc. Nationwide display pager with location readout

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS55109042A (en) * 1979-02-14 1980-08-21 Nec Corp Selective individual calling system
JP2946517B2 (en) * 1989-02-03 1999-09-06 日本電気株式会社 Routing method and routing table update method
DE3921637C2 (en) * 1989-06-30 1995-02-09 Siemens Ag Circuit arrangement for telecommunication switching systems, in particular telephone switching systems, with mobile subscriber stations and a hierarchically arranged double star switching network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4644347A (en) * 1983-08-10 1987-02-17 Motorola, Inc. Multiple frequency message system
US4891638A (en) * 1987-10-30 1990-01-02 Motorola, Inc. Nationwide display pager with location readout

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
IEEE, 1990, KOHIYAMA et al., "Advanced Personal Communication System", pp. 161-166, see figure 2 and pp. 163-164. *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0614322A1 (en) * 1993-01-21 1994-09-07 AT&T Corp. Directory structure for large scale telecommunications network allowing location of roaming mobile subscribers
US5608410A (en) * 1993-05-07 1997-03-04 Associated Rt, Inc. System for locating a source of bursty transmissions cross reference to related applications
US5694393A (en) * 1993-11-11 1997-12-02 U.S. Philips Corporation Communications system
EP1113691A1 (en) * 1999-12-28 2001-07-04 NTT DoCoMo, Inc. Location managing method for managing location of mobile station in mobile wireless packet communication system and mobile wireless packet communication system
US6785552B2 (en) 1999-12-28 2004-08-31 Ntt Docomo, Inc. Location managing method for managing location of mobile station in mobile wireless packet communication system and mobile wireless packet communication system

Also Published As

Publication number Publication date
CN1075836A (en) 1993-09-01
EP0619930A4 (en) 1995-09-13
MX9207582A (en) 1994-07-29
CN1030160C (en) 1995-10-25
CA2127273C (en) 2000-04-18
KR940704106A (en) 1994-12-12
EP0619930A1 (en) 1994-10-19
KR0144431B1 (en) 1998-08-17
US5274845A (en) 1993-12-28

Similar Documents

Publication Publication Date Title
US5274845A (en) Universal personal communication system and tracing system therefor
Ho et al. Dynamic hierarchical database architecture for location management in PCS networks
US5539922A (en) Multiple tree hierarchical portable communication system and method
Hac et al. Locating strategies for personal communication networks, a novel tracking strategy
EP0512962B1 (en) Cellular communications network including subscriber interrogation points and corresponding method for communicating
US5613199A (en) Mobile communication system and a mobile station paging method
CA2440121A1 (en) Flexible user distribution between user&#39;s serving entities
US6343215B1 (en) ANSI 41 dialed number validation
JP2000184447A (en) Mobile communication system and clone terminal detecting method
US5519697A (en) ISDN-served cell-site stations with means for distributing calls to mobile switching systems
KR19990053595A (en) Database Access Method in Home Location Register of Communication Switching System
KR20010021114A (en) Method and apparatus for efficiently paging a mobile terminal in a wireless network
Ng et al. Distributed architectures and databases for intelligent personal communication networks
Mao et al. A distributed database architecture for global roaming in next-generation mobile networks
WO1998043450A1 (en) Method of preventing data inconsistency between master exchange data and backup exchange data
JP2001211258A (en) TRANSLATION PATTERN MAPPING METHOD IN No.7 GATE STATION SIGNAL NETWORK
Imielinski et al. Querying locations in wireless environments
CN101378540B (en) Method and system for implementing number portability business, and number portability data-base
CA2236692C (en) A communications addressing network and terminal therefor
Lo et al. Adaptive region-based location management for PCS systems
RU2157597C1 (en) Method for limiting mobile user call in switched radio telephone network according international standard protocol is-41c
US5588039A (en) Mobile communication system capable of avoiding local congestion
US20010038691A1 (en) Method of establishing a connection, as well as exchange and communications network
Suh et al. An algorithm to reduce call delivery costs in the personal communication systems
Mitra et al. Query processing in a cellular network-a database approach

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): BR CA JP KR

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH DE DK ES FR GB GR IE IT LU MC NL PT SE

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 2127273

Country of ref document: CA

WWE Wipo information: entry into national phase

Ref document number: 1993900912

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1993900912

Country of ref document: EP

WWW Wipo information: withdrawn in national office

Ref document number: 1993900912

Country of ref document: EP