Optimal storage scheme for access point coverage data

1. A method, wherein said method is performed by an apparatus, said method comprising:

determining, as a representation of a set of terminal positions, a polygon that encloses all terminal positions of said set of terminal positions, wherein said terminal positions are positions of one or more terminals within a coverage area of a communication node, and wherein said polygon represents said coverage area of said communication node.

2. The method according to claim 1 , wherein said polygon represents a convex hull for said set of terminal positions or is derived from said convex hull by merging at least two adjacent vertices of said convex hull.

3. The method according to claim 1 , wherein said set of terminal positions comprises an old set of terminal positions and at least one new terminal position, and wherein said polygon is determined under consideration of an old polygon, which encloses all terminal positions of said old set of terminal positions, and said at least one new terminal position.

4. The method according to claim 1 , further comprising:

deriving a model for said coverage area of said communication node from said polygon, wherein said model is to be provided to at least one terminal to allow said terminal to perform positioning based on said model.

5. The method according to claim 1 , further comprising:

deriving a model for said coverage area of said communication node from said polygon, wherein said model is to be provided to at least one unit that is configured to receive terminal positions reported by one or more terminals and to filter said terminal positions based on said model to at least temporarily reduce an amount of said received terminal positions, and wherein said set of terminal positions only contains such filtered terminal positions.

6. The method according to claim 1 , further comprising at least one of:

adjusting the number of vertices of said polygon to control a resolution of said representation of said set of terminal positions and/or a storage space required for storing the vertices of said polygon, and estimating a position of said communication node based on information associated with only said vertices of said polygon.

7. A non-transitory readable medium having a program comprising program code for performing the method according to claim 1 , when said program is executed on a processor.

8. An apparatus comprising:

a processor, and

a memory, said memory storing a program comprising program code, said memory and said program configured to, with said processor, cause said apparatus to perform determining, as a representation of a set of terminal positions, a polygon that encloses all terminal positions of said set of terminal positions, wherein said terminal positions are positions of one or more terminals within a coverage area of a communication node, and wherein said polygon represents said coverage area of said communication node.

9. The apparatus according to claim 8 , wherein said polygon represents a convex hull for said set of terminal positions or is derived from said convex hull by merging at least two adjacent vertices of said convex hull.

10. The apparatus according to claim 8 , wherein said set of terminal positions comprises an old set of terminal positions and at least one new terminal position.

11. The apparatus according to claim 10 , wherein said polygon is determined under consideration of an old polygon, which encloses all terminal positions of said old set of terminal positions, and said at least one new terminal position.

12. The apparatus according to claim 11 , wherein said old polygon represents a convex hull for said old set of terminal positions or is derived from said convex hull by merging at least two adjacent vertices of said convex hull.

13. The apparatus according to claim 11 , wherein said polygon is determined as the convex hull of a set of positions that comprises the vertices of said old polygon and said at least one new terminal position, or is derived from said convex hull by merging at least two adjacent vertices of said convex hull.

14. The apparatus according to claim 8 , wherein said memory and said program are further configured to, with said processor, cause said apparatus to perform deriving a model for said coverage area of said communication node from said polygon, wherein said model is to be provided to at least one terminal to allow said terminal to perform positioning based on said model.

15. The apparatus according to claim 8 , wherein said polygon is a model for said coverage area of said communication node and is to be provided to at least one terminal to allow said terminal to perform positioning based on said model.

16. The apparatus according to claim 8 , wherein said memory and said program are further configured to, with said processor, cause said apparatus to perform deriving a model for said coverage area of said communication node from said polygon, wherein said model is to be provided to at least one unit that is configured to receive terminal positions reported by one or more terminals and to filter said terminal positions based on said model to at least temporarily reduce an amount of said received terminal positions, and wherein said set of terminal positions only contains such filtered terminal positions.

17. The apparatus according to claim 8 , wherein said set of terminal positions is obtained from a superset of terminal positions by exclusion of one or more monitored terminal positions, wherein said monitored terminal positions are terminal positions that are considered to be potentially outdated and/or potential outliers with respect to said coverage area.

18. The apparatus according to claim 8 , wherein said memory and said program are further configured to, with said processor, cause said apparatus to perform at least one of adjusting the number of vertices of said polygon to control a resolution of said representation of said set of terminal positions and/or a storage space required for storing the vertices of said polygon, and estimating a position of said communication node based on information associated with only said vertices of said polygon.

19. The apparatus according to claim 8 , wherein said apparatus is at least one of a server, a module, an apparatus embodied in a chip and an apparatus that further comprises at least one of a memory, IP connectivity and a user interface.