Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L12/00—Data switching networks
  • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W36/00—Hand-off or reselection arrangements
  • H04W36/14—Reselecting a network or an air interface
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W48/00—Access restriction; Network selection; Access point selection
  • H04W48/08—Access restriction or access information delivery, e.g. discovery data delivery
  • H04W48/10—Access restriction or access information delivery, e.g. discovery data delivery using broadcasted information

Definitions

• the field of the invention is wireless networks, in particular methods for passing a communication between neighboring base stations that belong to different domains.
• Each Mobile Node will have a unique identity in each domain, illustratively having a portion that identifies the domain, one or more portions that identify sub-portions of the domain and a portion that identifies the individual terminal.
• a wireless network is divided into domains.
• Each domain will have a domain identity, e.g. each ACS (Access Control Server) domain has an ACS Identity.
• Each MN will have a unique MN identifier, e.g. a Link Layer address (LLA).
• LLA Link Layer address
• a MN will receive an identifying label when it is turned on and first makes contact with its local base station and a new identity will be assigned to the MN when the MN moves to a new domain.
• the state of the radio channel may potentially cause the MN to switch back and forth (ping-pong) between these two domains.
• the MN will have to request an assignment and re-assignment of the identifier (MN Identity ping-pong).
• MN Identity ping-pong The procedures to obtain new MN identity may be expensive since it requires over the air signaling, involves delay and may require (re)authentication.
• switching base stations and the associated re-assignment of identifiers may be the cause of a significant amount of system overhead.
• Each domain has its own domain identity which is broadcast in cells throughout the domain as part of the system information.
• the MN stores this broadcasted domain identity and is addressed by its unique MN identity (8-1), which is a combination of the domain identity and a MN identifier, or node identifier, (8-2) for that particular MN, such as a Link Layer Address in current technology; i.e. in paging messages, in delivering the user plane frames, etc.
• MN identity such as a Link Layer Address in current technology; i.e. in paging messages, in delivering the user plane frames, etc.
• the MN identity is statically assigned (through an assigned prefix) such as U-RNTI that is composed of a globally unique SRNC identity and a locally unique s-RNTI (see 3GPP TS 25.401 V6.1.0) that makes the U-RNTI globally unique and inflexible.
• U-RNTI that is composed of a globally unique SRNC identity and a locally unique s-RNTI (see 3GPP TS 25.401 V6.1.0) that makes the U-RNTI globally unique and inflexible.
• this invention provides a MN having means for exchanging messages with at least one base station of a set of base stations in each of at least two overlapping domains.
• the MN is movable between cells corresponding to individual base stations,
• the message exchanging means comprises wireless transceiver means adapted to transmit to and receive message signals from the set of base stations, where the message signals comprise MN identities comprising at least a domain identity and a MN identifier.
• the MN further includes address storage means for storing a domain identity initially received by said MN and subsequently changed; comparison means for comparing said stored domain identity with a domain identity set broadcast by base stations in a domain overlap area, the domain identity set comprising the identity of domains that overlap within said overlap area; and change means within the MN for changing a MN identifier from the stored value to a new value when the domain identity set does not contain the stored domain identity .
• the MN having an old domain identity, is operable to preserve its MN identifier after entering a new domain until such time as it enters a cell of a base station that does not broadcast the stored domain identity.
• the invention provides a MN having circuitry for exchanging messages with at least one base station of a set of base stations in each of at least two overlapping domains, where the MN is movable between cells corresponding to individual base stations.
• the message exchanging circuitry comprises a wireless transceiver adapted to transmit to and receive message signals from the set of base stations, where the message signals comprise MN identities comprising at least a domain identity and a MN identifier.
• the MN further includes a memory for storing a domain identity and MN identifier and a processor coupled to the memory for maintaining the stored MN identifier after entering a new domain until such time as the MN enters a cell of a base station that does not broadcast the stored domain identity.
• the invention provides a computer program product that is embodied on a computer readable medium and that comprises program instructions for causing a MN to exchange message signals with at least one base station of a set of base stations having at least two overlapping domains.
• the program instructions perform operations of using message signals comprising a set of MN identities comprising at least a domain identity and a MN identifier; storing a domain identity; comparing the stored domain identity with domain identities that comprise a domain identity set broadcast by base stations in a domain overlap area and changing a MN identifier from the stored value to a new value only when the broadcast overlap domain identities do not contain the stored domain identity.
• Figure 1 illustrates a set of neighboring domains in a wireless network.
• Figure 2 illustrates portions of a pair of neighboring network domains.
• Figure 3 illustrates a block diagram of a typical base station and MN.
• an aspect of this invention relates to a method of controlling the transition of a wireless communication as a Mobile Terminal passes between more than one domain of a network.
• a further aspect of this invention relates to the retention of identifying parameters of a Mobile Terminal after it passes from a first domain to a neighboring domain, at least until the occurrence of a triggering event.
• the triggering event may occur when the Mobile Terminal has passed away from the domain boundary by some spatial and/or temporal margin.
• each Base Station (BS) or Access Point (AP) broadcasts the identities of the bordering domains, in addition to the identity of its own domain (e.g. the set of its own domain and at least one neighboring domain).
• a Mobile Node (MN), also referred to herein as a Mobile Terminal (MT) receiving multiple domain identities compares the stored domain identity that it has stored when it made contact with its previous domain with the broadcasted domain identities. If one of the broadcasted identities matches the stored domain identities, the MN knows that it is still in the border and can keep it's assigned MN identity (both the domain identity and the local MN identifier).
• the adoption by a MN of a new domain identity is deferred until it has passed out of the border area. This reduces the amount of system overhead devoted to assigning and re-assigning new domain identities.
• Figure 1 illustrates the example of neighboring domains of the preceding paragraph.
• domain 1 having domain identity 1
• domains 4, 5 and 6 will be located in CT.
• the remaining domains 2 and 3 will be located in NY.
• the path taken by the MN (10-i) is from domain 1 through points A, B, C, D, E, F, G and H.
• the solid-lined circles 5 represent the boundaries of domains and the dash-lined circles 7 represent the boundaries where the ping- pong effect is possible.
• box k represents a cell in one of the domains.
• a base station within the overlap area will be considered to be in one domain or another according to an administrative boundary that is not shown in this Figure.
• a base station in the overlap area between circle 1 and circle 2 will broadcast the domain identity of both NJ and NY.
• a base station in the checkered shaded area between points B and D will broadcast three domains - 1 from NJ and 2 from NY.
• a MN coming from NJ along path A - H in that area will keep its NJ identification (and a MN coming from NY will keep its NY identification).
• the MN of our example would switch its domain to NY as it passed point C and would switch back to NJ if it passed through an area in which the signal strength from the local NY base station decreased below threshold, i.e. between C and D.
• the MN traveling from point A to point H will keep its NJ identification up to point D where there is almost no possible MN Identity ping-pong effect, after which it will switch to a NY identification (selecting domain 3 or domain 2). That NY identification will be kept past point E, F until point G, after which it will take a CT identification (i.e. the domain will be 2 or 3, switching to domain 4 when it reaches point G).
• such a base station may communicate with a higher level node (such as an Access Router) that is located in NY or in NJ.
• a call from California to the traveling MN may pass through a NJ chain of nodes or through a NY chain of nodes.
• This Figure does not indicate that relationship.
• the MN is located at point A, the California call will pass down a chain of nodes in NJ.
• the MN switches to a NY base station, (and keeps its NJ domain identity and its NJ MN identifier)
• the packets of the California call will pass initially through a chain of nodes in NJ and will be forwarded to NY at some convenient level in the chain of nodes.
• each MN can keep its assigned MN identity (8-2) in the bordering cells, the uniqueness of the MN identity passing through a kth domain must be assured within the neighboring domains; i.e. the MN identifiers are unique within the neighboring domains (meaning those that overlap with the kth domain).
• the MN identifiers are unique within the neighboring domains (meaning those that overlap with the kth domain).
• contemporary technology uses a LLA.
• the more general term identifier will also be used, which is not necessarily the same as LLA.
• a set of MN identifiers can be assigned to each domain. A larger domain may have a larger share of MN identifiers.
• An optional feature of the invention is that the number of MN identifiers is not fixed.
• the kth domain runs out of MN identifiers, i.e. the number of MN identifiers comes within a domain margin number of the number of MN identifiers in the kth domain, the kth domain can borrow from one of the neighboring domains a temporary subset of MN identifiers. The borrowed MN temporary subset of identifiers will be returned to the domain owner when they are no longer necessary.
• Each LLA in the set is unique within both the neighboring ACS domains and can be reused in non-neighboring ACS domains (the LLA is not necessarily globally unique). If an ACS domain runs out of LLAs, this ACS domain can borrow a subset of LLAs only from a neighboring domain. The borrowed LLAs should be returned to the ACS where they were borrowed.
• Another alternative is to have a centralized LLA manager.
• An ACS requests a LLA (or a set of LLAs) when it is needed to the centralized LLA manager and returns a LLA (or a set of LLAs) to the centralized LLA manager when it is no longer used. If two ACS domains request a LLA (or a set of LLAs) at the same time, the centralized LLA manager must give a different LLA (or a different set of LLAs) to each of the requesting ACS domains. The ACS (or similar manager in a domain) will monitor the number of unallocated MN identifiers.
• the ACS When the number of unallocated identifiers falls below a lower margin, the ACS will request additional identifiers from the centralized LLA manager. Optionally, if the number of unallocated identifiers rises above an upper margin, the ACS may return surplus identifiers to the centralized LLA manager.
• a base station need not concern itself with the domain identity of the MNs that it handles.
• the base station pages and transmits packets to the MN identifier, since the system according to the embodiments of the invention has assured that the MN identifier will be locally unique within neighboring ACS domains.
• the MN monitors the signaling strength of the neighboring cells. When the signaling strength changes, the MN may select another cell. In bordering cells of multiple ACS domains the MN may select a new cell that belongs to the previous ACS domain. Since the selected cell broadcasts the ACS domain identity that matches the stored domain identity in the MN, the MN can retain its LLA.
• the MN does not have to request a MN identity re-assignment. If the MN selects a new cell that belongs to the new ACS domain and is also outside the border area, the new cell broadcasts the new ACS domain identity, which does not match the stored domain identity in the MN. This mismatch between broadcast and stored ACS identity triggers the MN to request a new LLA and to store the new ACS domain identity.
• the MN of the example will be assigned a unique MN identifier in domain 1.
• the base stations in the border area treat the newly added MNs the same as MNs that initiated contact in the new domain; i.e., communicating through the local MN identifier.
• domain 1 assures that the MN identifier is unique. If identifier borrowing is not allowed, the local station simply assigns a number from its assigned set of numbers. If identifier borrowing is allowed, the base station consults domains 2 and 3 (neighboring domains) to assure the uniqueness of the MN identity within these neighboring domains (domains 1 , 2, and 3). Beside the MN identity, the MN will also receive domain identity 1 in the system information. The MN stores the domain identity in its memory.
• domain 1 is allocated MN Identifiers numbers 100 - 199
• domain 2 is allocated MN Identifiers numbers 200-299
• domain 3 is allocated MN Identifiers numbers 300-399
• domain 4 is allocated MN Identifiers numbers 400-499.
• the MN has been assigned MN Identifier number 110.
• the MN moves from domain 1 to domain 2, between points B and D, it retains its old MN identity up to point D.
• the MN moves back to a serving cell that belongs to domain 1 , or the fluctuation of radio signal strength in the bordering cells makes the MN alternate the serving cell within the border area, the MN does not have to do anything.
• the MN keeps the current MN identifier (110) and the current domain identity in its memory.
• the MN receives only domain identity 2 and 3 in the system information. Since there is no domain identity that matches the stored domain identity (1) in the MN, the MN requests a new MN identity and stores the new domain identity in its memory. In this case, the MN selects the first domain identity in the system information (domain 2), corresponding to the domain that will assign a new MN identity. Before assigning a new MN identity, intelligence in domain 2 consults intelligences in the domains 1 , 3 and 4 to assure the uniqueness of the new MN identity within these neighboring domains. Assume further that the MN is assigned a new MN Identity 225. This identity is valid when the MN moves past point F up to point G, or goes back to point D up to point B.
• the MN receives only domain identity 4, which does not match the stored domain identity (2) in the MN. Therefore the MN requests a new MN identity and stores the new domain identity (domain identity 4) in its memory. Assume that the MN is assigned a new MN Identity 435 that is valid when the MN moves past point G up to point I or goes back to point G up to point E.
• the domain can borrow unused MN identifiers from the neighboring domains, e.g. domains 4 and 6. Assume that domain 5 borrows unused MN identifier 110 from domain 6. Although domain 6 is allocated a set of reused MN Identifiers (100-199), similar to domain 1 , the MN identity 110 is still unique within domain 5 and its neighboring domains 4 and 6, since the domain 1 is not a neighboring domain to domain 5. Domain 5 can only borrow from its neighboring domains (e.g. domains 4 and 6) but not from domain 1 or other non- neighboring domains.
• the MN is assigned a new identity (let's say MN identifier 120) by domain 6 and the borrowed MN Identity 110 is returned by domain 5 to domain 6.
• FIG. 2 there is shown a block diagram of portions of two neighboring domains at a boundary 100. This Figure need not represent an actual systems architecture, but is presented to illustrate the different paths over which data flows.
• system 110 On the left of boundary 100, system 110 has on the bottom level a set of MNs 10-1 through 10-n. These MNs are in communication with a set of base stations 12-1 through 12-n. Base stations 12-i receive and send data packets to a level 1 router 14. The level 1 router 14 communicates through a chain of routers to level N router 16.
• counterpart MNs 20-1 through 20-n communicate with base stations 22-1 through 22-n that, in turn, pass data to and from a chain of routers Level 1 through Level N.
• a block 30 labeled Inter-Domain represents a network backbone or other long-haul link.
• Line 130 connecting to block 30 represents data coming in from remote systems.
• the data packets from a California call would come in on line 130 and be routed through the system on the right or on the left.
• MN 10-1 MN 10-1
• it may continue to communicate with station 12-1 for a while, until local signal conditions cause it to switch to the closest base station, station 22-1.
• MN 10-1 While MN 10-1 is in communication with station 12-1 , the data packets from the California call will pass down the chain from Level N unit 16 to Level 1 unit 14 to station 12-1.
• the MN switches to base station 22-1 (while keeping the old identity of MN identifier 110 since base station 22-1 is in the boundary area) the system will forward the data packets to the units on the right of the boundary 100, just as it does with any call that is forwarded.
• the MN When the MN passes out of the boundary area and no longer receives the old domain identity, it will request a new identity in the domain 120 and the system will do the appropriate bookkeeping as it currently does to send the California packets up and down on the right side.
• the invention as described above reduces system overhead.
• the call will be forwarded, i.e. the packets will come from California on line 130, be intercepted and sent to domain 120.
• Horizontal lines 32, 34 and 36 represent an optional feature of the invention in which two neighboring base stations that are in different domains have a direct connection (cable or wireless) that permits inter-BTS (Base Transceiver Station) forwarding packets (outside the standard IP routing system) even when the BTS is in another domain in Figure 2.
• BTS Base Transceiver Station
• a change of the MN identifier is initiated by a comparison within the MN.
• the MN could initiate contact with a local base station using the old stored domain identity and the comparison would be made within the base station; i.e. the base station would compare the domain identity transmitted by the MN with the set of stored domain identities that overlap it. For example, if the base station is in domain 3 (outside the border area) of Figure 1 and is contacted by a MN from domain 1 , it would compare domain 1 with its list of acceptable domains. Since this particular station is outside the border, it will respond with a new MN identity including a domain 3 domain identity and a new MN identifier, together with a command to the MN to adopt the new identity.
• FIG. 3 illustrates in simplified form a base station 12-1 and a MN 10-i that communicate with one another.
• Each block has a transceiver, denoted generally with numeral 310 for sending and receiving RF signals carrying the relevant data.
• the base station transceiver will differ in structure from the MN transceiver, as is known in the art, at least for the reason that the base station transceiver will typically be more powerful.
• Each unit also has storage 320 for storing domain identities, the allowed list of MN identifiers and the like.
• the base station will have stored the set of domain identities that it broadcasts and the MN will store the current domain identity that is uses.
• the hardware that carries out the storage function may well be differently structured in the base station and the MN, since power conservation and non-volatile storage are more important for a MN.
• Each unit will also have data processing hardware (e.g., a CPU 350) to handle the messages received and sent and other functions performed by the unit. It is assumed that the CPUs 350 operate under control of stored programs for executing the methods, procedures and protocols in accordance with the embodiments of this invention.
• the MN will also have a compare module 330 for comparison of the stored domain identity and the broadcast domain identity set and an address change module 340 for changing the MN identifier of that MN from a stored value to a new value when leaving an overlap area.

Landscapes

• Engineering & Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Computer Security & Cryptography (AREA)
• Mobile Radio Communication Systems (AREA)

Applications Claiming Priority (1)

Publications (2)

Family

ID=36647790

Family Applications (1)

Country Status (3)

Families Citing this family (1)

Family Cites Families (7)

• 2005
  • 2005-01-04 EP EP05711273A patent/EP1844599A4/de not_active Withdrawn
  • 2005-01-04 WO PCT/US2005/000244 patent/WO2006073399A1/en not_active Ceased
  • 2005-01-04 KR KR1020077017981A patent/KR101145159B1/ko not_active Expired - Fee Related
  • 2005-01-04 KR KR1020097024246A patent/KR101206169B1/ko not_active Expired - Fee Related

Also Published As

Similar Documents

Legal Events