EP-4736497-A1 - SYSTEM AND METHOD FOR RECURRENCE COVERAGE HOLE DETECTION IN A NETWORK

EP4736497A1EP 4736497 A1EP4736497 A1EP 4736497A1EP-4736497-A1

Abstract

The present disclosure provides a system (108) and a method for coverage hole detection in a network. The system (108) receives a data associated with the one or more computing devices from a server. The data includes value corresponding to radio frequency (RF) parameter from various users. The system (108) visualizes polygon boundaries associated with the data within a predefined grid. Further, the system (108) bifurcates the polygon boundaries into a parent polygon and a child polygon based on an area of intersection between the parent polygon and the child polygon.

Inventors

BHATNAGAR, AAYUSH
KADAM, Hanumant
VERMA, ATUL
SHETTY, MANOJ
CHITALIYA, Dharmesh A
VIRKAR, Sneha
BHATNAGAR, PRADEEP KUMAR

Assignees

Jio Platforms Limited

Dates

Publication Date: 20260506
Application Date: 20240520

Claims (20)

1. A system (108) for detecting a recurrence of coverage holes in a network by analysing coverage hole polygons, said system (108) comprising: a server (202) configured to receive a plurality of data samples from a plurality of user equipments residing in a geographic area defined by a plurality of grids, said server is further configured to store a set of plurality of predetermined old coverage hole polygons covering said plurality of grids; and a processing unit (208) configured to cooperate with said server to receive said plurality of data samples and is further configured to: aggregate said plurality of data samples corresponding to at least one radio-frequency (RF) parameter to generate a value; identify a plurality of points based on said generated value corresponding to said at least one radio-frequency (RF) parameter; generate a plurality of new coverage hole polygons by using said identified plurality of points; determine an intersection of each new coverage hole polygon of the plurality of new coverage hole polygons with a predetermined coverage hole polygon covering a grid; and detect said recurrence of the coverage holes by analysing said determined intersection of said new coverage hole polygon with said predetermined coverage hole polygon.
2. The system (108) as claimed in claim 1, wherein said processing unit (208) is further configured to: calculate an overlapping area between said new coverage hole polygon and said predetermined old coverage hole polygon; and based on said calculated overlapping area assigning an ID to each of said plurality of new coverage hole polygons.
3. The system (108) as claimed in claim 2, wherein said processing unit (208) is further configured to assign an old parent ID corresponding to said predetermined old coverage hole polygon to said new coverage hole polygon if said overlapping area is greater than or equal to a predetermined value.
4. The system (108) as claimed in claim 2, wherein said processing unit (208) is further configured to assign a new child ID to said new coverage hole polygon if said overlapping area is less than said predetermined value.
5. The system (108) as claimed in claim 1, wherein said predetermined value is 70 %.
6. The system (108) as claimed in claim 2, wherein said processing unit (208) is configured to assign a new parent ID to said new coverage hole polygon if said new coverage hole polygon does not intersect with said predetermined old coverage hole polygon or said overlapping area between said new coverage hole polygon and said predetermined old coverage hole polygon is less than 30 %.
7. The system (108) as claimed in claim 1, wherein said processing unit (208) is configured to generate said new coverage hole polygon by following steps: converting each of said identified plurality of points into the polar coordinates; sorting said plurality of polar coordinates either in a counterclockwise direction or in a clockwise direction based on an angle with respect to a centroid to generate an array of sorted polar coordinates; taking a first polar coordinate from said array of sorted polar coordinates as a starting polar coordinate; choosing a second polar coordinate from said array of sorted polar coordinates; determining a distance between said second polar coordinate and said first polar coordinate; connecting said second polar coordinate to said new coverage hole polygon if said determined distance is lesser than a predefined distance; and removing said first polar coordinate and said second polar coordinate from said array of sorted polar coordinates.
8. The system (108) as claimed in claim 7, wherein said processing unit (208) is further configured to choose a new polar coordinate lies before to said second polar coordinate if said determined distance is greater than said predefined distance and considers said new chosen polar coordinate as said second polar coordinate.
9. The system (108) as claimed in claim 1, wherein said at least one RF parameter includes reference signal received power (RSRP), reference signal received quality (RSRQ), received signal strength indicator (RSSI), signal to interference noise ratio (SINR), channel quality index (CQI), physical cell identity (PCI), block error ratio (BLER), downlink throughput, and uplink throughput.
10. The system (108) as claimed in claim 7, wherein said predefined distance is 150 meters.
11. The system (108) as claimed in claim 7, wherein said second polar coordinate is the right most coordinate from said array of sorted polar coordinates with respect to the first polar coordinate.
12. The system (108) as claimed in claim 1, is configured to display said generated plurality of new coverage hole polygons and said intersection between said new coverage hole polygon and said predetermined old coverage hole polygon on a mapping application.
13. The system (108) as claimed in claim 1, wherein said plurality of user equipments includes an indoor user equipment, and an outdoor user equipment.
14. A method (250) of detecting a recurrence of coverage holes in a network by analysing coverage hole polygons, said method (250) comprising: receiving (252) a plurality of data samples from a plurality of user equipments residing in a geographic area defined by a plurality of grids; storing (254) a set of plurality of predetermined old coverage hole polygons covering said plurality of grids; aggregating (256) said plurality of data samples corresponding at least one radio-frequency (RF) parameter to generate a value; identifying (258) a plurality of points based on said generated value corresponding to said at least one RF parameter; generating (260) a plurality of new coverage hole polygons by using said identified plurality of points; determining (262) an intersection of each new coverage hole polygon of the plurality of new coverage hole polygons with a predetermined coverage hole polygon covering a grid; and detecting (264) said recurrence of the coverage holes by analysing said determined intersection of said new coverage hole polygon with said predetermined coverage hole polygon.
15. The method (250) as claimed in claim 14, wherein said step of detecting recurrence includes calculating an overlapping area between said new coverage hole polygon and said predetermined coverage hole polygon; and based on said calculated overlapping area assigning a unique ID to each of said plurality of new coverage hole polygons.
16. The method (250) as claimed in claim 15, further comprising assigning an old polygon ID corresponding to said predetermined coverage hole polygon to said new coverage hole polygon if said overlapping area is greater than or equal to a predetermined value.
17. The method (250) as claimed in claim 15, further comprising assigning a new child ID to said new coverage hole polygon if said overlapping area is less than said predetermined value.
18. The method (250) as claimed in claim 15, wherein said predetermined value is 70 %.
19. The method (250) as claimed in claim 15, further comprising assigning a new parent ID to said new coverage hole polygon if said new coverage hole polygon does not intersect with said predetermined polygon or area of said intersection between said new coverage hole polygon and said predetermined old coverage hole polygon is less than 30 %.
20. The method (250) as claimed in claim 14, wherein said step of generating said plurality of new coverage hole polygons further includes steps of: converting (304) each of said identified number of points into a polar coordinate; sorting (306) each of said converted polar coordinates either in a counterclockwise direction or clockwise direction based on an angle with respect to a centroid for generating an array of sorted polar coordinates; taking (308) a first polar coordinate from said array of sorted polar coordinates as a starting polar coordinate; choosing (310) a second polar coordinate from said array of sorted polar coordinates with respect to the first polar coordinate; determining (312) a distance between said second polar coordinate and said first polar coordinate; connecting (316) said second polar coordinate to said new coverage hole polygon if said determined distance is lesser than a predefined distance; and removing (318) said first polar coordinate and said second polar coordinate from said array of sorted polar coordinates.

Description

SYSTEM AND METHOD FOR RECURRENCE COVERAGE HOLE DETECTION IN A NETWORK RESERVATION OF RIGHTS [0001] A portion of the disclosure of this patent document contains material, which is subject to intellectual property rights such as but are not limited to, copyright, design, trademark, integrated circuit (IC) layout design, and/or trade dress protection, belonging to Jio Platforms Limited (JPL) or its affiliates (hereinafter referred as owner). The owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all rights whatsoever. All rights to such intellectual property are fully reserved by the owner. FIELD OF INVENTION [0002] The present disclosure generally relates to systems and methods for optimal performance in a wireless telecommunications network. More particularly, the present disclosure relates to a system and a method for coverage hole in a network. DEFINITION [0003] As used in the present disclosure, the following terms are generally intended to have the meaning as set forth below, except to the extent that the context in which they are used to indicate otherwise. [0004] The expression ‘plurality of data samples’ used hereinafter in the specification refers to a data samples that transmits by a user device towards a network node. In an aspect, the data sample includes information regarding the various radio frequency (RF) parameters. Data samples related to RF parameters encompass various aspects such as frequency, bandwidth, power levels, modulation, noise figure, spectrum analysis, propagation characteristics, and bit error rate. Data samples provides insights into the operation, performance, and characteristics of a network, aiding in tasks such as signal analysis, troubleshooting, and system optimization. [0005] The expression ‘predetermined old coverage hole polygon’ used hereinafter in the specification refers to a coverage hole polygon that is determined during a first iteration of detecting the coverage hole. The process of detecting a coverage hole polygon is performed in a plurality of iterations. In an aspect of the specification, during the second iteration of detecting the coverage hole, the coverage hole polygon of the previous iteration is considered as the predetermined old coverage hole polygon. During the second iteration, the recently detected coverage hole is known as a new coverage hole polygon. To differentiate and manage the detected coverage hole polygons, a unique ID is assigned to each one. The ID assigned to the old coverage hole polygon is known as the parent ID, and the ID assigned to the new coverage hole polygon is known as the child ID. If a coverage-challenged area is split during the next generation cycle, the original area is marked as a parent polygon (old coverage hole polygon), and the split area is marked as a child polygon (new coverage hole polygon). [0006] The expression ‘coverage hole’ used hereinafter in the specification refers to an area or zone within a wireless communication network where the signal strength or quality is significantly lower or completely absent. Identifying coverage holes is crucial to ensure seamless connectivity and optimal network performance. [0007] These definitions are in addition to those expressed in the art. BACKGROUND OF THE INVENTION [0008] The following description of the related art is intended to provide background information pertaining to the field of the disclosure. This section may include certain aspects of the art that may be related to various features of the present disclosure. However, it should be appreciated that this section is used only to enhance the understanding of the reader with respect to the present disclosure, and not as admission of the prior art. [0009] Several coverage challenges need to be addressed in a wireless telecommunications network. The signal strength of a wireless network decreases as it travels through various materials such as walls, ceilings, and floors. This may result in areas with poor signal coverage or even complete dead zones. Further, wireless signals may reflect off surfaces and create multipath interferences, which may result in signal distortion, signal cancellation, and reduced coverage. High- density environments such as large buildings or crowded public areas may strain network capacity and lead to congestion, resulting in reduced coverage and slower speeds. Limited budgets may limit the number and placement of sites, resulting in areas with poor coverage. [0010] There is, therefore, a need in the art to provide a system and a method that can mitigate the problems associated with the prior arts. OBJECTS OF THE INVENTION [0011] It is an object of the present disclosure to provide a system and a method that provides early detection by actively monitoring and tracking problems. This allows for timely intervention and prevents