Forbidden tracking area optimization for private/home networks
First Claim
1. A method comprising:
- determining by an apparatus whether access verification is to be done using an identifier of a first length or is to be done using an identifier of a second length;
examining a node address by the apparatus;
performing by the apparatus access verification by comparing a field of the received node address against a locally stored access list, wherein the field compared against the locally stored access list is of either the first or the second length, depending on whether a determination was made to do access verification using an identifier of the first length or a determination was made to do access verification using an identifier of the second length; and
adding by the apparatus at least the compared field of the node address to a locally stored list of cell selection candidate nodes for the case where the access list comprises a list of allowed identifiers, or excluding the compared field of the node address from the locally stored list of cell selection candidate nodes for the case where the access list comprises a list of restricted identifiers.
4 Assignments
0 Petitions
Accused Products
Abstract
Access verification is adaptively done using an identifier of a first or a second length, by comparing a field of a node address that has the determined first or second length against a locally stored access list. At least the compared field of the node address is either added to a locally stored list of cell selection candidate nodes where the access list is allowed identifiers, or excluded from it where the access list is restricted identifiers. The node identifier is in three sections. The first section is service type, which the UE can use to determine whether or not it is restricted/allowed. The first length is the length of the second section, which is a service area ID of a group of network nodes. The second length is the length of the second section plus the third section, which identifies one node of the group of network nodes.
13 Citations
22 Claims
-
1. A method comprising:
-
determining by an apparatus whether access verification is to be done using an identifier of a first length or is to be done using an identifier of a second length; examining a node address by the apparatus; performing by the apparatus access verification by comparing a field of the received node address against a locally stored access list, wherein the field compared against the locally stored access list is of either the first or the second length, depending on whether a determination was made to do access verification using an identifier of the first length or a determination was made to do access verification using an identifier of the second length; and adding by the apparatus at least the compared field of the node address to a locally stored list of cell selection candidate nodes for the case where the access list comprises a list of allowed identifiers, or excluding the compared field of the node address from the locally stored list of cell selection candidate nodes for the case where the access list comprises a list of restricted identifiers. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. An apparatus comprising:
-
a receiver configured to receive a node address; a processor configured to determine whether access verification is to be done using an identifier of a first length or is to be done using an identifier of a second length, and further configured to perform access verification by comparing a field of the received node address against a locally stored access list, wherein the field compared against the locally stored access list is of either the first or the second length, depending on whether a determination was made to do access verification using an identifier of the first length or a determination was made to do access verification using an identifier of the second length; and a local memory to which the processor adds at least the compared field of the node address to a list of cell selection candidate nodes for the case where the access list comprises a list of allowed identifiers, or from which the processor excludes the compared field of the node address from the list of cell selection candidate nodes for the case where the access list comprises a list of restricted identifiers. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. A non-transitory computer readable memory embodying a program of machine-readable instructions, execution of which by a digital data processor causes the performance of actions comprising:
-
determining whether access verification is to be done using an identifier of a first length or is to be done using an identifier of a second length; receiving a node address; performing the access verification by comparing a field of the received node address against a locally stored access list, wherein the field compared against the locally stored access list is of either the first or the second length, depending on whether a determination was made to do access verification using an identifier of the first length or a determination was made to do access verification using an identifier of the second length; and adding at least the compared field of the node address to a locally stored list of cell selection candidate nodes for the case where the access list comprises a list of allowed identifiers, or excluding the compared field of the node address from the locally stored list of cell selection candidate nodes for the case where the access list comprises a list of restricted identifiers.
-
-
22. An apparatus comprising:
-
receiving means for receiving a node address; processing means for determining whether access verification is to be done using an identifier of a first length or is to be done using an identifier of a second length, and for performing access verification by comparing a field of the received node address against a locally stored access list, wherein the field compared against the locally stored access list is of either the first or the second length, depending on whether a determination was made to do access verification using an identifier of the first length or a determination was made to do access verification using an identifier of the second length; and memory means for adding at least the compared field of the node address to a list of cell selection candidate nodes for the case where the access list comprises a list of allowed identifiers, or for excluding the compared field of the node address from the list of cell selection candidate nodes for the case where the access list comprises a list of restricted identifiers.
-
Specification