Closest user terminal search method for a telecommunication network and service node applying such a method

• US 8,036,684 B2
• Filed: 07/29/2005
• Issued: 10/11/2011
• Est. Priority Date: 07/29/2005
• Status: Active Grant

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Hendriks, Jozef Henricus Petrus, Zwaal, Hugo, Reitsma, Erik Jan
• Primary Examiner(s): RAMPURIA, SHARAD K
• Application Number:
  US11/996,715
• Publication Number:
  US 20090006376A1
• Time in Patent Office: 2,265 Days
• Field of Search: 4554561-457, 4554041-4042, 455517-519, 455/41.2
• US Class Current: 455/456.5
• CPC Class Codes: H04W 4/02 Services making use of location information
• CPC Class Codes: H04W 4/022 with dynamic range variability
• CPC Class Codes: H04W 4/08 User group management

Abstract

Service node for a telecommunication network (15) and method for determining a group of n user terminals (21) which are closest to a point of interest (22). First, a search range with an upper limit (24) is set. Then in an iterative manner, a current search cell of the set of cells (1-10) is determined and the search cell is queried for user data. The user terminals (21) are added to a set of found user terminals, and if the set of found user terminals comprises n or more user terminals (21), the upper limit (24) of the search range is adjusted to the n^th lowest distance. This is repeated until no further possible cell (1-10) can be determined. The set of criteria can be set and matched with obtained user data to find a closest user terminal (21) having a specific role.

Claims

1. A method of determining a group of n user terminals in a telecommunication network which are closest to a point of interest, n being an integer value, the method comprising:

a) determining a set of cells of the network, each having an associated distance range to the point of interest with a minimum and maximum value, and setting a search range with an upper limit;

b) determining a current search cell of the set of cells which has the lowest minimum value lower than the upper limit;

c) querying the current search cell for user data associated with user terminals in the current search cell, adding the user terminals to a set of found user terminals, and if the set of found user terminals comprises n or more user terminals, adjusting the upper limit of the search range to the n^th lowest distance between each of the user terminals in the group and the point of interest;

d) repeating the steps b) and c) until no further cell having a minimum value lower than the upper limit can be determined; and

e) determining the group of n closest user terminals as the n user terminals in the queried cells having the n lowest distances to the point of interest.

2. The method according to claim 1, in which setting the search range comprises setting the upper limit equal to a predetermined maximum value.

3. The method according to claim 1, in which the current search cell comprises one or more cells having an equal minimum value.

4. The method according to claim 1, in which the user data comprises position data, and the position data is used to calculate the distance between the user terminal and the point of interest.

5. The method according to claim 1, in which the minimum value of a cell is adapted to exclude an overlapping area of a further cell closer to the point of interest.

6. The method according to claim 1, in which a user terminal comprises a terminal with a fixed and known location.

7. The method according to claim 1, in which a user terminal in a cell is only added to the set of found user terminals if the associated user data obtained from the current search cell matches a set of criteria.

8. The method according to claim 7, in which the method is performed in parallel for a number of different sets of criteria, using the same current search cell for each of the different sets of criteria.

9. A service node for a telecommunication network comprising a set of cells with a predetermined coverage area servicing user terminals, in which the service node is connected to an application server executing an application for determining a group of n user terminals which are closest to a point of interest in the predetermined coverage area, n being an integer value, the service node comprising:

means for connecting to a first network unit arranged to obtain information from the telecommunication network for determining a distance range to the point of interest with a minimum and maximum value for each one of the set of cells and a second network unit arranged to query a cell for user data associated with the user terminals being serviced in the cell; and

means associated with the service node for;

a) setting a search range with an upper limit;

b) determining a current search cell of the set of cells which has the lowest minimum value lower than the upper limit;

c) querying the second network unit for user data associated with user terminals in the current search cell, adding the user terminals to a set of found user terminals, and if the set of found user terminals comprises n or more user terminals adjusting the upper limit of the search range to the n^th lowest distance between each of the user terminals in the group and the point of interest;

d) repeating the steps b) and c) until no further cell having a minimum value lower than the upper limit can be determined; and

e) determining the group of n closest user terminals as the n user terminals in the queried cells having the n lowest distances to the point of interest.

10. The service node according to claim 9, in which the service node is arranged to set the upper limit equal to a predetermined maximum value.

11. The service node according to claim 9, in which the current search cell comprises one or more cells having an equal minimum value.

12. The service node according to claim 9, in which the second network unit is arranged to obtain user data which comprises position data, and in which the service node is further arranged to use the position data to calculate the distance between the user terminal and the point of interest.

13. The service node according to claim 9, in which the service node is further arranged to adapt the minimum value of a cell to exclude an overlapping area of a further cell closer to the point of interest.

14. The service node according to claim 9, in which a user terminal comprises a terminal with a fixed and known location.

15. The service node according to claim 9, in which the service node is further arranged to add a user terminal to the set of found user terminals if the associated user data obtained from the second network unit matches a set of criteria.

16. The service node according to claim 15, in which the service node is arranged to execute multiple searches in parallel for a number of different sets of criteria, using the same current search cell for each of the different sets of criteria.