DESC:
FORM 2
THE PATENTS ACT, 1970
(39 of 1970)
&
THE PATENTS RULES, 2003

COMPLETE SPECIFICATION
(See section 10 and rule 13)
1. TITLE OF THE INVENTION
SYSTEM AND METHOD OF CARRYING OUT OUTAGE CAUSING CHANGES WITHOUT SERVICE OUTAGE
2. APPLICANT(S)
Name Nationality Address
JIO PLATFORMS LIMITED IN Office-101, Saffron, Nr. Centre Point, Panchwati 5 Rasta, Ambawadi, Ahmedabad - 380006, Gujarat, India.

3. PREAMBLE TO THE DESCRIPTION
The following specification particularly describes the invention and the manner in which it is to be performed.

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 THE DISCLOSURE
[0002] The present disclosure relates generally to the field of telecommunications. In particular, the present disclosure relates to systems and methods for performing at least one planned operation in a plurality of network cells.
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 ‘network site (cell site)’ is a physical location where equipment like towers, antennas, base stations, or servers are installed to enable mobile, internet, or data communication. The towers or base stations may be referred to as nodes that communicate with a user equipment by transmitting and receiving radio signals. The network site has a control unit, radio cabinets, antennas, a power plant, and data terminals. The cell site further includes a coverage area, a wireless radio transmitter, and a wireless radio receiver.
[0005] The expression ‘coverage area’ used hereinafter in the specification refers to a geographic area associated with a node where the customers are receiving signals and services from the node.
[0006] The expression ‘coverage overlap’ used hereinafter in the specification refers to a geographic area where more than one node can service the customers due to coverage areas overlapping each other. The coverage overlap also facilitates the handover of calls from one node to another node as a customer moves about.
[0007] The expression ‘customer’ used hereinafter in the specification refers to a person who uses cellular services like voice calls, data service, email, streaming media, video calls, etc., with the help of a cell phone/tablet or any other device.
[0008] The expression ‘service outage’ used hereinafter in the specification refers to a period when the customer is not able to avail of the above-mentioned services due to a lack of sufficient signal strength and or good signal quality.
[0009] The expression ‘database or a graph database’ used hereinafter in the specification refers to a database that stores data along with inter-relations of each data point.
[0010] The expression ‘node’ used hereinafter in the specification refers to a data point (or entity) in a graph database that has certain properties. In graph theory, a graph has two kinds of elements: vertices or nodes, which represent elements and edges, and which represent relationships between elements. In the disclosure, the node may be a part of the network site.
[0011] The expression ‘edge’ used hereinafter in the specification refers to a pointer that defines a relation between two nodes of a graph database.
[0012] The expression ‘group’ used hereinafter in the specification refers to a group of nodes in a graph database.
[0013] These definitions are in addition to those expressed in the art.
BACKGROUND OF THE DISCLOSURE
[0014] The following description of 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 be used only to enhance the understanding of the reader with respect to the present disclosure, and not as admissions of prior art.
[0015] Mobile networks have evolved from 1G to 6G, bringing significant advancements in connectivity, data speeds, and capabilities, enabling new applications and services. In a typical cellular radio system, user equipments (UEs) communicate via a radio access network (RAN) to one or more core networks. The radio access network (RAN) covers a geographical area which is divided into cell areas, with each cell area being served by a base station, e.g., a base station (BS). A cell is a geographical area where radio coverage is provided by the radio base station equipment at a base station site (node). The base stations communicate with the user equipment units (UE) within range of the base stations. In the radio access network, several base stations are typically connected (e.g., by landlines or microwave) to a radio network controller (RNC) (also sometimes termed a base station controller (BSC)).
[0016] In order to ensure base station controller economy, operation reliably, efficiently, and safely, and support up-to-date business and characteristics, upgrade the software or the hardware of the base station controller. When an operator/vendor releases a software revision (e.g., a software release) for the base station nodes of its network, all the base stations of the operator's network must undergo software update (e.g., software upgrade). The software updates typically require that a base station will be out of service for the duration of the update. Generally, a radio base station can only be taken out of service during fixed or time-established maintenance windows. Similarly, changes in parameter values for base station configuration also require rebooting or restarting services to apply the new configurations. Other scenarios, such as hardware replacements, network optimization tasks, application of new configurations, security patch installations, and system diagnostics, also necessitate node reboots or service restarts. These scenarios result in temporary interruptions in network services, causing dissatisfaction among end customers and potential revenue losses for service providers.
[0017] When a cellular network undergoes a software upgrade or a change in certain parameter values, there is a temporary interruption in service, also known as a service outage. This is because the node needs to be rebooted, or the service needs to be restarted in order for the new values to take effect. During the service outage, an end customer is unable to access the network services, which can cause dissatisfaction and loss of revenue for the service provider.
[0018] Therefore, there is a need for a system that overcomes the limitations of the prior art and eliminates service outages by intelligently restarting the services or rebooting the nodes.
SUMMARY OF THE DISCLOSURE
[0019] In an exemplary embodiment, a system for continuing cellular service during a planned operation is described. The system includes an input module configured to receive a request including information related to the planned operation, and a database configured to store grouping rules, network site information, program instructions, and the received request, wherein the network site information includes nodes, parameters such as distance between nodes, coverage areas, and transmission power levels.
[0020] The system includes a processing unit configured to process the received request using the stored grouping rules and network site information to generate groups of nodes. The groups are generated such that neighboring nodes are from different groups. The processing unit is configured to assign a group value as assigned identifiers to the group of nodes, wherein nodes of corresponding group are assigned a defined group value and neighboring nodes have different group values. In aspects, a group value is assigned as an assigned identifier to a first node, wherein the group value is the smallest available group value and is assigned the value of 1, assign a group value to each neighbor of the first node, starting with the smallest available group value, increment the group value until group value of the neighbor node is unequal with the assigned group value of any of the neighbor nodes.
[0021] The system further includes an element management system (EMS) configured to perform the planned operation on each group.
[0022] In some embodiments, wherein the database is configured to store network site information including coverage overlap data and neighbor relationships.
[0023] In some embodiments, the processing unit is configured to process a group formation that minimizes the number of groups.
[0024] In some embodiments, the EMS is configured to reboot or update nodes within each group to maintain service availability for customers.
[0025] In some embodiments, the processing unit is configured to assign group values based on the smallest available group value and avoids assigning the same group value to neighboring nodes.
[0026] In some embodiments, the processing unit is configured to update group assignments dynamically based on the coverage overlap, the grouping rules and network topology.
[0027] In some embodiments, the processing unit is configured to store a neighbor dictionary where each node maps to a list of its neighbors.
[0028] In some embodiments, the processing unit (112) is configured to determine a node relationship with other node based on latitude and longitude values, identify the neighboring nodes based on the node relationship, and store the node relationships in the dictionary mapping
[0029] In another exemplary embodiment, a method for continuing cellular service during a planned operation at a network site is described. The method includes receiving, by an input module, a request related to the planned operation and storing, at a database, a dictionary mapping each node to a list of its neighbors, grouping rules, network site information, program instructions, and the request. The dictionary is also referred to as neighbor dictionary.
[0030] The method further includes processing, by the processing unit, the received request and generate groups of node, such that neighboring nodes are from different groups, based at least on stored grouping rules, network coverage and the network site information, assigning, group values as assigned identifiers to the group of nodes, wherein nodes of corresponding group are assigned a defined group value and neighboring nodes have different group values. In aspects, the group value is assigned as an assigned identifier to a first node, wherein the group value is the smallest available group value 1. Further the group value is assigned to each neighbor of the first node, starting with the smallest available group value, and incrementing the group value until group value of the neighbor node is unequal to the assigned group value of any neighbor node.
[0031] The method further includes performing the request related planned operations on each group, ensuring service continuity through coverage overlap by rebooting or restarting nodes assigned with the same group value together.
[0032] In some embodiments, the input module receives various types of request related planned operations, including software updates and parameter changes.
[0033] In some embodiments, the database stores network site information including coverage overlap data and neighbor relationships.
[0034] In some embodiments, the method includes processing, by the processing unit, a group formation that minimizes the number of groups.
[0035] In some embodiments, the method includes assigning, by the processing unit, group values as an assigned identifier based on the smallest available group value and assigning the different group value to neighboring nodes. The group value may be a numeral-based identifier or a color-based identifier.
[0036] In some embodiments, the method includes updating, by the processing unit, group assignments dynamically based on the coverage overlap, the grouping rules and network topology.
[0037] In some embodiments, the method determining, by the processing unit a node relationship with other node based on latitude and longitude values of each node, identifying the neighboring nodes based on the node relationship; and storing the node relationships in the dictionary mapping.
[0038] In some embodiments, the method includes storing, by the processing unit, a neighbor dictionary where each node maps to a list of its neighbors.
[0039] The programming includes further instructions to execute instructions stored in the database to process the received request and generate groups of nodes, assign a group value to a first node, wherein the group value is the smallest available group value, assign a group value to each neighbor of the first node, starting with the smallest available group value, and increment the group value until group value of the neighbor node is unequal to the assigned group value of any neighbor node.
[0040] The programming includes further instructions to perform the planned operation on each group, ensuring service continuity through coverage overlap by rebooting or restarting nodes assigned with the same group value together.
OBJECTS OF THE DISCLOSURE
[0041] Some of the objects of the present disclosure, which at least one embodiment herein satisfies, are as follows:
[0042] An object of the present disclosure is to provide a system and a method that performs at least one planned operation in a plurality of or nodes, thereby eliminating total service outages.
[0043] Another object of the present disclosure is to provide a system and a method that intelligently restarts the services at the nodes or reboots the nodes.
[0044] Yet another object of the present disclosure is to provide a system and a method that is configured to generate a plurality of groups of the plurality of nodes based on coverage overlap.
[0045] Still another object of the present disclosure is to provide a system and a method that is applicable to all wireless networks irrespective of different generations of wireless communication e.g., 2G, 3G, GSM/ CDMA/ WCDMA, 4G, 5G, 6G, etc.
[0046] Other objects and advantages of the present disclosure will be more apparent from the following description, which is not intended to limit the scope of the present disclosure.
BRIEF DESCRIPTION OF DRAWINGS
[0047] The accompanying drawings, which are incorporated herein, and constitute a part of this disclosure, illustrate exemplary embodiments of the disclosed methods and systems in which like reference numerals refer to the same parts throughout the different drawings. Components in the drawings are not necessarily to scale, emphasis instead being placed upon clearly illustrating the principles of the present disclosure. Some drawings may indicate the components using block diagrams and may not represent the internal circuitry of each component. It will be appreciated by those skilled in the art that disclosure of such drawings includes disclosure of electrical components, electronic components or circuitry commonly used to implement such components.
[0048] FIG. 1A illustrates an exemplary architecture of a system for performing at least one planned operation in network sites, in accordance with embodiments of the present disclosure.
[0049] FIG. 1B illustrates a block diagram of a system for performing at least one planned operation in a network site, in accordance with an embodiment of the present disclosure.
[0050] FIG. 2 illustrates an exemplary representation of a coverage overlap existing between the nodes, in accordance with an embodiment of the present disclosure.
[0051] FIG. 3 illustrates an exemplary representation of the plurality of nodes of the network site in a network, in accordance with an embodiment of the present disclosure.
[0052] FIG. 4 illustrates an exemplary representation of interconnection between the nodes, in accordance with an embodiment of the present disclosure.
[0053] FIG. 5 illustrates an exemplary representation of assigning a first group value to a first node in the network, in accordance with an embodiment of the present disclosure.
[0054] FIG. 6 illustrates an exemplary representation of assigning a second group value in the network, in accordance with an embodiment of the present disclosure.
[0055] FIG. 7 illustrates an exemplary representation of assigning a third group value in the network, in accordance with an embodiment of the present disclosure.
[0056] FIG. 8 illustrates an exemplary representation of assigning a fourth group value in the network, in accordance with an embodiment of the present disclosure.
[0057] FIG. 9 illustrates an exemplary representation of group assignment cycle in the network, in accordance with an embodiment of the present disclosure.
[0058] FIG. 10 is a flowchart for a method for avoiding cellular service outage during planned operation at a network site, in accordance with an embodiment of the present disclosure.
[0059] FIG. 11 illustrates an exemplary computer system in which or with which embodiments of the present disclosure may be implemented.
[0060] The foregoing shall be more apparent from the following more detailed description of the disclosure.
LIST OF REFERENCE NUMERALS
100 – Network Architecture
102 –System
104 –Network
106 – Centralized Server
108-1, 108-2…108-N – User Equipments
110-1, 110-2…110-N – Users
112 – Processing Unit
114 – Input Module
116 – Database
118 – Element Management System (EMS)
120 – Plurality of Network Sites
DETAILED DESCRIPTION OF THE DISCLOSURE
[0061] In the following description, for the purposes of explanation, various specific details are set forth in order to provide a thorough understanding of embodiments of the present disclosure. It will be apparent, however, that embodiments of the present disclosure may be practiced without these specific details. Several features described hereafter can each be used independently of one another or with any combination of other features. An individual feature may not address any of the problems discussed above or might address only some of the problems discussed above. Some of the problems discussed above might not be fully addressed by any of the features described herein. Example embodiments of the present disclosure are described below, as illustrated in various drawings in which like reference numerals refer to the same parts throughout the different drawings.
[0062] The ensuing description provides exemplary embodiments only, and is not intended to limit the scope, applicability, or configuration of the disclosure. Rather, the ensuing description of the exemplary embodiments will provide those skilled in the art with an enabling description for implementing an exemplary embodiment. It should be understood that various changes may be made in the function and arrangement of elements without departing from the spirit and scope of the disclosure as set forth.
[0063] Specific details are given in the following description to provide a thorough understanding of the embodiments. However, it will be understood by one of ordinary skill in the art that the embodiments may be practiced without these specific details. For example, circuits, systems, networks, processes, and other components may be shown as components in block diagram form in order not to obscure the embodiments in unnecessary detail. In other instances, well-known circuits, processes, algorithms, structures, and techniques may be shown without unnecessary detail in order to avoid obscuring the embodiments.
[0064] Also, it is noted that individual embodiments may be described as a process that is depicted as a flowchart, a flow diagram, a data flow diagram, a structure diagram, or a block diagram. Although a flowchart may describe the operations as a sequential process, many of the operations can be performed in parallel or concurrently. In addition, the order of the operations may be re-arranged. A process is terminated when its operations are completed but could have additional steps not included in a figure. A process may correspond to a method, a function, a procedure, a subroutine, a subprogram, etc. When a process corresponds to a function, its termination can correspond to a return of the function to the calling function or the main function.
[0065] The word “exemplary” and/or “demonstrative” is used herein to mean serving as an example, instance, or illustration. For the avoidance of doubt, the subject matter disclosed herein is not limited by such examples. In addition, any aspect or design described herein as “exemplary” and/or “demonstrative” is not necessarily to be construed as preferred or advantageous over other aspects or designs, nor is it meant to preclude equivalent exemplary structures and techniques known to those of ordinary skill in the art. Furthermore, to the extent that the terms “includes,” “has,” “contains,” and other similar words are used in either the detailed description or the claims, such terms are intended to be inclusive like the term “comprising” as an open transition word without precluding any additional or other elements.
[0066] Reference throughout this specification to “one embodiment” or “an embodiment” or “an instance” or “one instance” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present disclosure. Thus, the appearances of the phrases “in one embodiment” or “in an embodiment” in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
[0067] The terminology used herein is to describe particular embodiments only and is not intended to be limiting the disclosure. As used herein, the singular forms “a”, “an”, and “the” are intended to include the plural forms as well, unless the context indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. As used herein, the term “and/or” includes any combinations of one or more of the associated listed items. It should be noted that the terms “mobile device”, “user equipment”, “user device”, “communication device”, “device” and similar terms are used interchangeably for the purpose of describing the invention. These terms are not intended to limit the scope of the invention or imply any specific functionality or limitations on the described embodiments. The use of these terms is solely for convenience and clarity of description. The invention is not limited to any particular type of device or equipment, and it should be understood that other equivalent terms or variations thereof may be used interchangeably without departing from the scope of the invention as defined herein.
[0068] While considerable emphasis has been placed herein on the components and component parts of the preferred embodiments, it will be appreciated that many embodiments can be made and that many changes can be made in the preferred embodiments without departing from the principles of the disclosure. These and other changes in the preferred embodiment as well as other embodiments of the disclosure will be apparent to those skilled in the art from the disclosure herein, whereby it is to be distinctly understood that the foregoing descriptive matter is to be interpreted merely as illustrative of the disclosure and not as a limitation.
[0069] When a cellular network undergoes a planned operation, such as including, but not limited to software upgrade or a change in certain parameter values, there is a temporary interruption in service, also known as Service Outage. This is because the node (site) needs to be rebooted, or the service needs to be restarted in order for the new values to take effect. During the service outage, the end customer is unable to access the network services, which can cause dissatisfaction and loss of revenue for the service provider.
[0070] Accordingly, there is a need for systems and methods providing at least one planned operation (restart, reboot, reset, system update) in a plurality of nodes in a network site.
[0071] To address such issues, the present disclosure aims to eliminate total service outages by intelligently restarting the services provided by the network site or rebooting the nodes (sites). The intelligent restart feature ensures that the services are restarted in such a way that the end customer experiences minimal disruption. The rebooting of nodes is done in a way that ensures that the service outages is reduced or, in some cases, even eliminated. The present disclosure may be configured to have improvement over the traditional approach of rebooting the nodes and restarting the services, which often caused extended service outages. The present disclosure may provide a more efficient and reliable way of upgrading and updating the cellular network, ensuring that customers experience minimal disruption to their service. The present disclosure is a valuable tool for cellular network providers who want to deliver a better service to their customers while minimizing the impact of service outages.
[0072] Hereinafter, exemplary embodiments of the present disclosure will be described with reference to the accompanying drawings.
[0073] FIG. 1A illustrates an exemplary architecture 100 of a system (102) for for performing at least one planned operation in a plurality of nodes in a network site, in accordance with embodiments of the present disclosure. The system is mainly configured for avoiding cellular service outage during a planned operation at the network site including a network restart or continuing cellular service during network site restarts.
[0074] Referring to FIG. 1A the network architecture (100) is implemented for performing at least one planned operation in a plurality of nodes in the network site. In an embodiment, the system (102) is connected to a network (104), which is further connected to at least one computing devices 108-1, 108-2, … 108-N (collectively referred as computing device 108, herein) associated with one or more users 110-1, 110-2, … 110-N (collectively referred as user (110), herein). The computing device (108) may be personal computers, laptops, tablets, wristwatch, or any custom-built computing device integrated within a modern diagnostic machine that can connect to a network as an IoT (Internet of Things) device. In an embodiment, the computing device (108) may also be referred to as User Equipment (UE) or user device. Accordingly, the terms “computing device” and “User Equipment” may be used interchangeably throughout the disclosure. In an aspect, the user (110) is a network operator or a field engineer. Further, the network (104) can be configured with a centralized server 106 that stores compiled data.
[0075] In an embodiment, the system (102) may receive at least one input data from the user (110) via the at least one computing devices (108). In an aspect, the user (110) may be configured to initiate a test sequence for executing a plurality of performance tests on a cellular site, through an application interface of a mobile application installed in the computing devices (108). The mobile application may be configured to communicate with the network analysis server. In some examples, the mobile application may be a software or a mobile application from an application distribution platform. Examples of application distribution platforms include the App Store for iOS provided by Apple, Inc., Play Store for Android OS provided by Google Inc., and such application distribution platforms. In an embodiment, the computing device (108) may transmit the at least one captured data packet over a point-to-point or point-to-multipoint communication channel or network (104) to the system (102).
[0076] In an embodiment, the computing device (108) may involve collection, analysis, and sharing of data received from the system (102) via the network (104).
[0077] In an exemplary embodiment, the network (104) may include, but not be limited to, at least a portion of one or more networks having one or more nodes that transmit, receive, forward, generate, buffer, store, route, switch, process, or a combination thereof, etc. one or more messages, packets, signals, waves, voltage or current levels, some combination thereof, or so forth. In an exemplary embodiment, the network (104) may include, but not be limited to, a wireless network, a wired network, an internet, an intranet, a public network, a private network, a packet-switched network, a circuit-switched network, an ad hoc network, an infrastructure network, a Public-Switched Telephone Network (PSTN), a cable network, a cellular network, a satellite network, a fiber optic network, or some combination thereof.
[0078] In an embodiment, the system is configured to avoid cellular service outage during a planned operation including site restarts by utilizing a group formation algorithm that uses coverage overlap between the cell sites and also to minimize a number of groups needed to achieve planned operation. The system includes an input module (114), a database (116), a processing unit (112), and an element management system (102) (EMS (118)). The input module (114) is configured to receive a request. The request may be from a server, an operator or the system itself based on the planned operation. The request, which may include details such as the type of planned operation, the time for executing the operation, and the type of update to be installed.
[0079] The database (116) is configured to store a dictionary mapping each node to a list of its neighbors, a predefined set of grouping rules, and network site information, including distance between nodes (120), coverage areas, and transmission power levels. In examples, each geographical location (latitude and longitude) of the nodes is identified from data of network site information. Further, the distance between the nodes is determined based on latitude and longitude of each node. In examples, haversine distance calculation is performed to determining the distance based on longitude and latitude, which accounts for curvature of earth and geographical surfaces. In an aspect, a neighbor relationship is created between nodes if the calculated distance between their geographical coordinates is less than or equal to a predefined threshold (for example, 3 km). For each node, distances to all other nodes are calculated and neighbor nodes are determined. The determined relationships are stored in dictionary. The dictionary is also interchangeably referred to as neighbor dictionary. Additionally, the database (116) stores program instructions and the requests received from the input module (114). The program instructions include a method to generate groups of nodes (120) in accordance with the grouping rules.
[0080] In an embodiment, the processing unit (112) is configured to fetch and execute computer-readable instructions stored in the database (116). The processing unit (112) processes the received request using the predefined set of grouping rules, network coverage and the network site information to generate a plurality of groups of the nodes (120), such that neighboring nodes are from different groups. The processing unit (112) carries out the grouping based on several factors, including predefined grouping rules, network coverage parameters, and the specific information related to the network site. The stored grouping rules provide guidelines or constraints that dictate how nodes should be categorized to prevent interference or overlap. Additionally, network coverage considerations ensure during planned operations the user is supported with optimal connectivity and performance across the network. Information about the network site, such as the physical locations of nodes or their operational characteristics, further provides information in the grouping process, ensuring that the assignments align with the broader goals of efficient resource allocation and conflict avoidance. The grouping ensures that neighboring nodes are placed in distinct groups while meeting the operational requirements of the network. The grouping rules and network coverage ensures that users latched to a defined node are covered by neighboring nodes by virtue of coverage overlap, thereby avoiding service outages during planned operation including site restarts and continuing the services during the site restarts.
[0081] The processing unit (112) assigns group values as assigned identifiers to the group of nodes. To elaborate with an example, the processing unit (112) assigns a group value as an assigned identifier to a first node, where the group value is the smallest available value (e.g., 1). The group value refers to the assigned identifier, such as a number or colour, used to classify nodes within a cellular network during the reboot or restart operations. In aspects, nodes of corresponding group are assigned a defined group value and neighboring nodes have different group values. For example, nodes within the same group are assigned a defined shared group value, while neighboring nodes, those which are within a defined proximity or meet certain adjacency criteria (referred to as neighbor)—are assigned different group values. This assignment is performed so that no two directly connected or nearby nodes share the same group, effectively to prevent outage experience to the end user. By assigning defined group values to neighboring nodes, the system maintains order and avoids conflicts while adhering to the defined grouping rules. The grouping mechanism is implemented to ensure that nodes which are not immediate neighbours and do not have overlapping coverage are rebooted together and providing continuing network services.
[0082] In some examples, for each neighbor of the first node, the processing unit (112) begins with assigning the smallest available group value, and no neighboring nodes share the same group value. If a neighbor node belongs to an existing group, the processing unit (112) increments until group value of the neighbor node is unequal with the assigned group value of any neighbor node.
[0083] The processing unit (112) then updates the group assignments dictionary in the database (116) and transmits the generated groups to the EMS (118). The EMS (118) is configured to manage the telecommunications network elements associated with each network site and perform the planned operation on each group sequentially, in parallel or in any manner.
[0084] In an example, the EMS (118) may reboot or restart the nodes assigned with the same group value together, ensuring service continuity through coverage overlap. Once these nodes are rebooted, the EMS (118) takes the next group value and reboots those nodes. This rebooting ensures that a service will be available to customers despite some nodes being rebooted.
[0085] In an example, the EMS (118) may reboot or restart the nodes assigned with the same group (either identified by a color or a number) together, ensuring service continuity through coverage overlap. For instance, in color-based grouping, a group of nodes assigned the same color (e.g., white, yellow, orange and green) would be restarted simultaneously. For example, a group of nodes with assigned color white would be restarted simultaneously, while groups with assigned colour of yellow, orange and green would continue to operate to provide network coverage for the user. The groups are formed such that when one group is restarted, other groups ensure coverage for the user.
[0086] Similarly, in number-based grouping, nodes assigned the same group number (e.g., 1, 2, 3) are rebooted together. Once all nodes in a particular group (color or number) are rebooted, the EMS (118) proceeds to reboot the nodes in the next group. This process ensures that service continuity is maintained by leveraging the systematic grouping of nodes based on their non-neighboring property. Whether using colors or numbers for grouping, the principle remains the same: nodes assigned the same group (color or number) are non-neighboring and, therefore, do not overlap in their coverage areas.
[0087] While a set or group of non-neighboring nodes with the same assigned group (color or number) is being restarted, coverage to the User Equipment (UE) or user is maintained by the neighboring nodes or sites. These neighboring nodes, which belong to different groups (with different colors or numbers), remain operational and temporarily handle the coverage responsibilities. This ensures that users experience uninterrupted service even during the rebooting process of specific nodes.
[0088] By grouping nodes based on their non-neighboring groups, using either colors or numbers, the EMS (118) systematically prevents conflicts in coverage. This ensures that only non-overlapping nodes are rebooted together, maintaining service availability for customers despite some nodes undergoing maintenance. The process is repeated iteratively for each group, minimizing downtime while optimizing resource management.
[0089] The present disclosure minimizes unnecessary group creation by prioritizing existing groups and reusing them, thereby reducing the total number of groups and the overall time required for the operation. This method ensures non-neighboring constraints within each group by checking neighbor assignments before assigning new groups.
[0090] In an embodiment, the processing unit (112) creates a cluster having at least one node from each of the generated groups based on coverage overlap. This cluster formation further enhances the robustness of the network during planned operations.
[0091] The system provides an efficient and intelligent way to perform planned site restarts without causing service outages, significantly improving customer satisfaction and maintaining critical connectivity and voice services.
[0092] Although FIG. 1A shows exemplary components of the system (102) (102), in other embodiments, the system may include fewer components, different components, differently arranged components, or additional functional components than depicted in FIG. 1A. Additionally, or alternatively, one or more components of the system may perform functions described as being performed by one or more other components of the system (102) (102).
[0093] FIG. 1B illustrates a block diagram of a system for performing at least one planned operation in a plurality of network sites (120), in accordance with an embodiment of the present disclosure. The system (102) may include an input module (114), a database (116), a processing unit (112), and an element management system (102) (EMS (118)).
[0094] The input module (114) may be configured to receive a request. The request may be from a server, an operator or from the system itself based on the planned operation. In an example, the input module (114) may be an interfacing unit that is configured to receive the request. For example, the request may include a type of planned operation to be performed, a time of executing the planned operation, a type of update to be installed, and like.
[0095] The database (116) is configured to store a predefined set of grouping rules and a set of information associated with each node. In an example, the set of information includes distance between two nodes (120), coverage area, and a transmission power level. The distance between the two nodes is obtained, for example, from the latitude and longitude information of each of the nodes.
[0096] The database (116) is configured to store program instructions. The database (116) is configured to store the request received from the input module (114). The program instructions include a program that implements a method to generate a plurality of groups in accordance with embodiments of the present disclosure and may implement other embodiments described in this specification. The database (116) may be configured to store preprocessed data, and the predefined set of parameters. The database (116) may include any computer-readable medium known in the art including, for example, volatile memory, such as Static Random Access Memory (SRAM) and Dynamic Random Access Memory (DRAM) and/or nonvolatile memory, such as Read Only Memory (ROM), erasable programmable ROM, flash memories, hard disks, optical disks, and magnetic tapes. In an example, the database (116) may be configured to store a list (neighbour dictionary) where each node maps to a list of its neighbours.
[0097] The processing unit (112) may be configured to fetch and execute computer-readable instructions stored in the database (116). The processing unit (112) may be configured to execute a sequence of instructions of the method to generate a plurality of groups, which may be embodied in a program or software. The instructions can be directed to the processing unit (112), which may subsequently program or otherwise be configured to implement the methods of the present disclosure. In some examples, the processing unit (112) is configured to control and/or communicate with large databases (116), perform high-volume transaction processing, and generate reports from large databases (116). The processing unit (112) may be implemented as one or more microprocessors, microcomputers, microcontrollers, digital signal processors, central processing units (112), state machines, logic circuitries, and/or any devices that manipulate signals based on operational instructions.
[0098] The processing unit (112) may be configured to cooperate with the input module (114) to receive the request. The processing unit (112) may be configured to cooperate with the database (116) to process the received request using the predefined set of grouping rules and the set of information associated with each node to generate a plurality of groups of the plurality of nodes (120). The grouping rules include a consideration that users latched to a defined node are not affected by the outage of that node and are covered by the neighboring nodes, at least by virtue of coverage overlap. The grouping rules may cover, for example, grouping second-order neighbors together, lower density sites, higher density sites, considering inter-relations of nodes, and such exemplary considerations. The second-order neighbor is a node that is connected to one of the first node's neighbors but is not directly connected to the original node.
[0099] In an operative aspect for generating the plurality of groups, the processing unit (112) may be configured to assign a group value to each node in the network. For example, a first node may be assigned with a first group value (having a value of 1). The processing unit (112) may be configured to assign a different group value to each neighbour of the first node. For each node that is neighbour of the first node: the processing unit (112) may be configured to assign a group value to it starting with the smallest available group value 1. The processing unit (112) may be configured to check if any of its neighbours belong to an existing group value (in this example, value is 1). If a neighbour belongs to the same group (i.e. having same group value), the processing unit (112) may be configured to increment the current group number until group value of the neighbor node is unequal to the assigned group value of any neighbor node. To elaborate, assigning unique group values to nodes in a network involves an incremental and systematic process to prevent conflicts with neighboring nodes. In an example, each node starts with the lowest possible group value, for example, 1. The processing unit evaluates whether any of the node's neighbors already have the same group value. If a match is found, the group value is incremented by 1, and evaluation is repeated. The evaluation and incrementing are iterative process until the processing unit (112) ensures that the group value of the current node is distinct from all its neighbors. The goal of the processing unit (112) is to achieve conflict-free assignments while keeping the range of group values as small as possible.
[00100] In an operative aspect for generating the plurality of groups, the processing unit (112) may be configured to assign a group color to each node in the network. For example, a first node may be assigned with a first group color (having a color of white). In examples, the colors may have a defined order of value. For example, white may have the lowest value, followed with yellow, orange, green, etc. The processing unit (112) may be configured to assign a different group color to each neighbor of the first node. For each node that is a neighbor of the first node: the processing unit (112) may be configured to assign a group color to it, starting with the group color having lowest value (e.g., white color). The processing unit (112) may be configured to check if any of its neighbors belong to an existing group color (in this example, color is white). If a neighbor belongs to the same group (i.e., having the same group color), the processing unit (112) may be configured to upgrade the color by incrementing the current group color until the group color of the neighbor node is distinct from the assigned group color of any neighbor node (for example, color yellow).
[00101] To elaborate, assigning unique group colors to nodes in a network involves an incremental and systematic process to prevent conflicts with neighboring nodes. In an example, each node starts with the lowest possible group color, for example, white. The processing unit evaluates whether any of the node's neighbors already have the same group color. If a match is found, the group color is upgraded by yellow, and evaluation is repeated. The evaluation and incrementing are iterative processes until the processing unit (112) ensures that the group color of the current node is distinct from all its neighbors.
[00102] For instance, let us consider a scenario where the current node has three neighbors with group values 1, 3, and 4. Initially, the processing unit (112) assigns a current node to a group value of 1. However, the processing unit (112) identifies that one of its neighbors already has this value. Consequently, the processing unit (112) increments the group value to 2. The processing unit (112) then verifies whether any of the neighbors have been assigned a group value of 2. Since no neighbor has this value, the group value of 2 is finalized for the current node. This ensures the current node’s group value is unique within its local neighborhood.
[00103] In another example, imagine a more complex network where a node has neighbors with group values of 1, 2, 4, and 5. The processing unit (112) begins with a current node with a group value of 1, which is already taken by a neighbor. The processing unit (112) increments the group value of the current node to 2. However, on evaluation, the processing unit (112) determines that the assigned value is also assigned to another neighbor. The processing unit (112) further increments the value to 3, which is not used by any neighbor. Therefore, the current node is assigned a group value of 3. Through this process, the processing unit (112) demonstrates the robustness of the approach in accommodating larger networks with more densely connected nodes. In some aspects, for nodes belonging to same groups may be provided with same group values.
[00104] In aspects, the aforementioned process is particularly efficient in scenarios where the network topology is dynamic and dense and there is a need for planned operation. For example, in group allocation for wireless nodes for planned operation, each node is assigned a group value that does not interfere with its neighbors. Such unique group value assignment ensures smooth communication and minimizes interference. This approach can be applied in other areas as well. For example, in graph colouring problems, where nodes represent entities and edges represent constraints, the aforementioned process ensures conflict-free assignments with minimal computational overhead.
[00105] Moreover, this incremental assignment strategy ensures scalability. Even in networks with a high number of nodes and connections, the process maintains a systematic approach to avoid conflicts. By starting from the lowest group value and incrementing only, when necessary, the range of group values remains limited, optimizing resource utilization. Thus, this is particularly advantageous in applications where the number of available group values is constrained.
[00106] Through this systematic approach, the process ensures consistency and efficiency, making it suitable for various practical applications in other areas of telecommunication including, but is not limited to network routing, distributed computing, and resource allocation in telecommunications. By iteratively evaluating and incrementing the group value, the process ensures that no two connected nodes share the same value, fostering harmonious operation across the network.
[00107] The processing unit (112) may be configured to assign a chosen group to the current node and update the group assignments dictionary in the database (116). The processing unit (112) may be configured to find a minimum value (minimum number of groups) in the group assignments dictionary. The processing unit (112) may be configured to transmit each group in a list to the EMS (118).
[00108] In an embodiment, the processing unit (112) may be configured to create a cluster having at least one node from each of the plurality of groups. In an embodiment, the processing unit (112) may be configured to generate the cluster based on a coverage overlap between the plurality of nodes (120). In an embodiment, the processing unit (112) may be configured to store a list of neighboring nodes (120) associated with each node in the database (116).
[00109] The element management system (EMS (118)) is configured to manage one or more of a specific type of telecommunications network element (NE) associated with each node. Typically, the EMS (118) manages the functions and capabilities within each NE. The element management system (EMS (118)) may be configured to receive the generated plurality of groups from the processing unit (112). The element management system (EMS (118)) may be configured to perform the planned operation according to the received plurality of groups. In an example, the at least one planned operation may include a restart operation, a reboot operation, a reset operation, and an update operation. In an embodiment, the EMS (118) may be configured to perform the planned operation on each generated group in a sequence.
[00110] For example, the EMS (118) may be configured to take the nodes having the same group value and reboot them together. Once these nodes are rebooted, the EMS (118) may be configured to take the next group value and reboot them together. The EMS (118) may be configured to ensure that a service will be available to customers in geography due to coverage overlap despite some nodes being rebooted.
[00111] The present disclosure may be configured to avoid unnecessary group creation by prioritizing existing groups and reusing them. In an aspect, the present disclosure may be configured to minimize the number of groups by starting with the smallest available group for each node. The present disclosure may be configured to ensure non-neighboring constraints within each group by checking for neighbor assignments before assigning new groups.
[00112] The method of performing the at least one planned operation in the plurality of node (120) may include the following steps:
• Step 1: Connect to the database to store nodes, latitudes and longitudes associated with the nodes and connections associated with each node.
• Step 2: A function is configured to add nodes to the database using its latitude (how far north or south) and longitude (how far east or west). Another function is configured to connect two nodes.
• Step 3: List of locations is generated along with latitude and longitude of the nodes.
• Step 4: Create a list of nodes with their corresponding locations and add the list to the database.
• Step 5: Neighboring nodes are identified by determining for each node how far the node is from the other nodes. If two points are close enough (e.g., 3 kilometers, 100 kilometers, etc.), the nodes are connected as neighbors in the database.
• Step 6: Distance between the nodes is determined using, for example, a Haversine formula that considers the Earth’s round shape and geography. This provides the distance between the nodes, for example, in kilometers.
• Step 7: Group nodes together by assigning each node to a group, node connected as neighbors belong to the same or nearby groups. Each node gets the smallest group number that is not already used by its neighbor nodes.
• Step 8: Process the received request using the stored grouping rules and the network site information to generate groups of networked nodes (120).
• Step 9: Process the received request using the stored grouping rules and the network site information to generate groups of network nodes (120).
• Step 10: Assign a group value as an assigned identifier to a first node, wherein the group value is a smallest available group value.
• Step 11: Assign the group value to each neighbor of the first node, starting with the smallest available group value 1.
• Step 12: Increment the group value until group until value of the neighbor node is unequal to the assigned group value of any neighbor node.
• Step 13: Perform the planned operation on each group.
[00113] In some embodiments, the computer program product is configured to continue cellular service during the planned operation including site restarts or avoid cellular service outage during the site restarts. The computer program product is stored on a non-transitory computer-readable medium and comprises instructions that, when executed by one or more processors, enable the system (102) to carry out method steps systematically and ensure planned operations are executed without causing service outages.
[00114] Initially, the input module (114) receives a request related to a planned operation. This request may include details such as the type of operation to be performed, the nodes involved, and the timeframe for execution. The input module (114) facilitates the reception and transmission of this request to the processing unit (112).
[00115] Upon receiving the request, the processing unit (112) stores the request in a database (116). The database (116) is configured to store a dictionary that maps each node to a list of its neighbors. Additionally, the database (116) contains grouping rules, network site information, program instructions, and the received request. The network site information includes relevant details such as geographical positioning, neighboring site relationships, and coverage areas.
[00116] The processing unit (112) executes instructions stored in the database (116) to process the received request and generate groups of nodes (120). The grouping process is conducted according to predefined grouping rules that account for coverage overlaps between sites. This ensures that during planned operations, customers latched onto one node are seamlessly transitioned to neighboring nodes without experiencing service disruption.
[00117] The processing unit (112) assigns a group value to a first node. The processing unit (112) assigns the smallest available group value, with the initial group value starting at 1. This step ensures efficient grouping and prepares the system for sequential or parallel execution of operations.
[00118] The processing unit (112) proceeds by assigning group values to each neighbor of the first node, beginning with the smallest available group value. If a neighboring node already belongs to an existing group, the processing unit (112) increments the group value until an available value is identified. This process ensures that no neighboring nodes share the same group value, thereby minimizing potential conflicts during planned operations.
[00119] Once group assignments are completed, the element management system (EMS) (118) performs the planned operation on each group sequentially, in parallel or in any manner. In examples, nodes with the same group value are rebooted or restarted together. In examples, the sequential execution provides that service continuity is maintained by leveraging coverage overlap, allowing nodes in overlapping areas to continue providing service while their neighboring nodes are rebooted.
[00120] FIG. 2 illustrates an exemplary representation (200) of a coverage overlap existing between the plurality of nodes (120), in accordance with an embodiment of the present disclosure. As shown in FIG. 2, a customer lies in the coverage overlap of a node 1, a node 2, and a node 3. In the coverage overlap, the customer is able to be configured to receive radio signals from all three node (120) (node 1, node 2, and node 3). In case any node goes under planned operation (upgradation), the consumer is able to receive signals from the other two network nodes due to the virtue of overlap; thereby, no service outage can be felt by the consumer. The coverage overlap helps in smooth handover and movement of customers from one area to another, as shown in FIG. 2. The present disclosure aims to utilize the coverage overlap to intelligently switch of selected group of sites such that no service outage is observed by the customers.
[00121] FIG. 3 illustrates an exemplary representation (300) of the plurality of nodes (302) in a network.
[00122] FIG. 4 illustrates an exemplary representation (400) of interconnection between a node (network node) and its neighboring nodes(120) (network nodes), in accordance with an embodiment of the present disclosure. As shown in FIG. 4, each node has a different distance from its neighboring node. The present disclosure may be configured to generate the plurality of groups of the node (120) based on the distance (coverage), such that the network sites (120) of different groups are able to provide the coverage overlap such that a number of planned operations can be executed without degrading service available to the customer.
[00123] FIG. 5 illustrates an exemplary representation (500) of assigning a first group value to a first node (a first node) (502) in the network in accordance with an embodiment of the present disclosure. During a first group assignment, a random node (cell site) (also known as the first node) may be chosen, and a value may be assigned to it. For example, a value of 1 may be assigned to the first group.
[00124] FIG. 6 illustrates an exemplary representation (600) of assigning a second group value to a second node (604) in the network, in accordance with an embodiment of the present disclosure. As shown in FIG. 6, after the first group assignment, the node (602) may belong to the first group (having value 1). Then, different groups are assigned to the next network neighboring nodes (120). In an aspect, the group values may be assigned based on the distance between the neighboring node and the first node (602). For example, a first neighboring node (604) may be labeled with a second group (having value 2).
[00125] FIG. 7 illustrates an exemplary representation (700) of assigning a third group value to a third node (706) in the network, in accordance with an embodiment of the present disclosure. As shown in FIG. 7, after the first group assignment, the node (702) may belong to the first group (having value 1). Then, different group values are assigned to the next network's neighboring nodes (120). For example, a first neighboring node (704) may be labeled with a second group (having value 2), and a second neighboring node (706) may be labeled with a third group (having value 3).
[00126] FIG. 8 illustrates an exemplary representation (800) of assigning a fourth group value to a fourth node (808) in the network, in accordance with an embodiment of the present disclosure. As shown in FIG. 8, after the first group assignment, the node (802) may belong to the first group (having value 1). Then, different groups are assigned to the next network neighboring nodes (120). For example, a first neighboring node (804) may be labeled with a second group (having value 2), a second neighboring node (806) may be labeled with a third group (having value 3), and a third neighboring node (808) may be labeled with a fourth group (having value 4).
[00127] FIG. 9 illustrates an exemplary representation (900) of the group assignment cycle in the network in accordance with an embodiment of the present disclosure. In a first group assignment cycle, as shown in FIG. 9, the node (902) may belong to the first group (having value 1). Then, a first neighboring node (904) may be labeled with a second group (having value 2), a second neighboring node (906) may be labeled with a third group (having value 3) and a third neighboring node (908) may be labeled with a fourth group (having value 4). In the next group assignment cycle, the second neighboring node (906) checks if any of its neighbors (node (902), node (908), node (912), node (916)) belong to the existing group value. For example, the network node (902) is assigned with the first group, and the node (908) is assigned with the fourth group. So, if the node (904) determines that node (912) is not assigned with any group value, then the smallest available group value (value 1) may be assigned to the node (912). The node (904) determines that node (916) is not assigned with any group value, then the next available group value (value 3) may be assigned to the node (916). In summary, if a neighbor belongs to the group, the processing unit (112) may be configured to increase the current group number none of its neighbors has the same group number. Finally, the group values may be assigned the chosen group to the current node and update the group assignments in the database (116).
[00128] FIG. 10 illustrates a method (1000) for continuing cellular service during a planned operation including site restart or to prevent cellular service outage during site restarts. The method (1000) utilizes a group formation algorithm that leverages the coverage overlap between cell sites to intelligently form groups of sites and also to minimize a number of groups needed to achieve planned operation.
[00129] The first step in the method (1000), in step 1002, involves receiving, by an input module (114), a request related to a planned operation, at step (1002). The request may include information, such as the type of planned operation, the time for executing the operation, and the type of update to be installed.
[00130] In the next step, a processing unit (112) stores a dictionary mapping each node to a list of its neighbors, a list of nodes, grouping rules, network site information, program instructions, and the request, in the database (116), at step (1004). The database (116) is configured to hold all the necessary data and instructions required for the execution of the method.
[00131] The processing unit (112) processes the received request and generate groups of nodes, at step (1006). In some aspects, the processing unit (112) generates groups of nodes such that neighboring nodes are from different groups, based at least on stored grouping rules, network coverage and the network site information. The processing involves using the predefined set of grouping rules and network site information to intelligently form groups based on the coverage overlap.
[00132] The method (1000) proceeds in step (1008), by assigning, by the processing unit (112), group values are assigned as assigned identifiers to the group of nodes. In aspects nodes of corresponding group are assigned a defined group value and neighboring nodes have different group values.
[00133] The method (1000), in step (1010) involves performing, by an element management system (EMS) (118), the planned operation on each group sequentially, in parallel or in any manner, ensuring service continuity through coverage overlap by rebooting or restarting nodes assigned with the same group value together, at step (1014). This rebooting or restarting ensures that while some nodes are being rebooted, other nodes in the overlapping coverage area continue to provide service, thus preventing any service outage.
[00134] The method (1000) provides an efficient and intelligent approach to perform the planned operation including site restarts without causing service outages, thereby significantly improving customer satisfaction and maintaining critical connectivity and voice services. The systematic grouping and rebooting ensure minimal disruption and optimal network performance during maintenance operations.
[00135] FIG. 11 illustrates an exemplary computer system (1100) in which or with which embodiments of the present disclosure may be implemented. For example, the system (102), centralized server (106), the UE (108), etc., may be implemented using the exemplary computer system (1100), As shown in the FIG. 11, the computer system (1100) may include an external storage device (1110), a bus (1120), a main memory (1130), a read only memory (1140), a mass storage device (1150), a communication port (1160), and a processor (1170). A person skilled in the art will appreciate that the computer system (1100) may include more than one processor (1170) and the communication ports (1160). The processor (1170) may include various modules associated with embodiments of the present disclosure.
[00136] In an embodiment, the external storage device (1110) may be any device that is commonly known in the art such as, but not limited to, a memory card, a memory stick, a solid-state drive, a hard disk drive (HDD), and so forth.
[00137] In an embodiment, the bus (1120) may be communicatively coupled with the processor(s) (1170) with the other memory, storage, and communication blocks. The bus (1120) may be, e.g., a Peripheral Component Interconnect (PCI)/PCI Extended (PCI-X) bus, a Small Computer System Interface (SCSI), a Universal Serial Bus (USB) or the like, for connecting expansion cards, drives and other subsystems as well as other buses, such a front side bus (FSB), which connects the processor (1170) to the computer system (1100).
[00138] In an embodiment, the main memory (1130) may be a Random-Access Memory (RAM), or any other dynamic storage device commonly known in the art. The Read-only memory (1140) may be any static storage device(s) e.g., but not limited to, a Programmable Read Only Memory (PROM) chips for storing static information e.g., start-up or Basic Input/Output System (BIOS) instructions for the processor (1170).
[00139] In an embodiment, the mass storage device (1150) may be any current or future mass storage solution, which may be used to store information and/or instructions. Exemplary mass storage solutions include, but are not limited to, a Parallel Advanced Technology Attachment (PATA) or a Serial Advanced Technology Attachment (SATA) hard disk drives or solid-state drives (internal or external, e.g., having Universal Serial Bus (USB) and/or Firewire interfaces), one or more optical discs, Redundant Array of Independent Disks (RAID) storage, e.g., an array of disks (e.g., SATA arrays).
[00140] Further, the communication port (1160) may be any of an RS-232 port for use with a modem-based dialup connection, a 10/100 Ethernet port, a Gigabit or 10 Gigabit port using copper or fiber, a serial port, a parallel port, or other existing or future ports. The communication port (1160) may be chosen depending on the network (108), such a Local Area Network (LAN), Wide Area Network (WAN), or any network to which the computer system (1100) connects.
[00141] Optionally, operator and administrative interfaces, e.g., a display, a keyboard, a joystick, and a cursor control device, may also be coupled to the bus (1120) to support a direct operator interaction with the computer system (1100). Other operator and administrative interfaces may be provided through network connections connected through the communication port (1160). Components described above are meant only to exemplify various possibilities. In no way should the aforementioned exemplary computer system (1100) limit the scope of the present disclosure.
[00142] The present disclosure introduces significant technical advancements that enhance the functionality and reliability of wireless networks during the planned operation including site restarts. The present disclosure enables the execution of planned operations across multiple nodes without causing service outages, ensuring continuous service availability for end-users even during maintenance activities. The present disclosure incorporates an intelligent mechanism to restart services or reboot nodes, allowing for seamless transitions and minimizing disruptions by strategically managing the rebooting process based on real-time network conditions. Additionally, the system generates multiple groups of network nodes based on coverage overlap, ensuring that users remain connected to the network even when certain nodes are undergoing maintenance. Furthermore, the present disclosure is applicable to all wireless networks, irrespective of the generation of wireless communication technology, including 2G, 3G, GSM, CDMA, WCDMA, and future generations. This versatility makes the system a robust solution for various types of wireless networks, significantly improving network performance and reliability.
[00143] While considerable emphasis has been placed herein on the preferred embodiments, it will be appreciated that many embodiments can be made and that many changes can be made in the preferred embodiments without departing from the principles of the disclosure. These and other changes in the preferred embodiments of the disclosure will be apparent to those skilled in the art from the disclosure herein, whereby it is to be distinctly understood that the foregoing descriptive matter to be implemented merely as illustrative of the disclosure and not as limitation.
ADVANTAGES OF THE PRESENT DISCLOSURE
[00144] The present disclosure performs at least one planned operation in a plurality of nodes, thereby eliminating total service outage. The present disclosure intelligently restarts the services at the nodes or rebooting the nodes.
[00145] The present disclosure is configured to generate a plurality of groups of the plurality of nodes based on coverage overlap.
[00146] The service upgradation requires a minimal defined time and thus during planned operation (for example, outage/upgradation) in one set/group of nodes, the network coverage is provided by neighbour nodes for the planned operation.
[00147] A least defined number of distinct groups ensures there is no total service outage due to the grouping as disclosed in the disclosure.
[00148] The minimal defined number of groups can help the upgradation process or solving service outage problem in lesser time by affecting only a minimal number of nodes, and also without losing total services for all nodes.
[00149] The present disclosure is applicable to all wireless networks irrespective of different generations of wireless communication e.g., 2G, 3G, 4G, 5G, 6G, Global System for Mobile Communications (GSM)/ Code-division multiple access (CDMA) / Wideband Code Division Multiple Access (WCDMA), etc.
,CLAIMS:CLAIMS
1. A system (102) for continuing cellular service during a planned operation at a network site, the system (102) comprising:
an input module (114) configured to receive a request including information related to the planned operation;
a database (116) configured to store grouping rules, network site information, program instructions, and the received request, wherein the network site information includes nodes, parameters such as distance between nodes (120), coverage areas, and transmission power levels;
a processing unit (112) configured to:
process the received request using the stored grouping rules, network coverage and the network site information to generate groups of nodes (120) such that neighboring nodes are from different groups;
assign group values as assigned identifiers to the group of nodes, wherein nodes of corresponding group are assigned a defined group value and neighboring nodes have different group values; and
an element management system (EMS (118)) configured to perform the planned operation on each group.
2. The system (102) as claimed in claim 1, wherein the database (116) is configured to store the network site information including coverage overlap data and neighbor relationships.
3. The system (102) as claimed in claim 1, wherein the processing unit (112) is configured to process a group formation that minimizes a number of groups.
4. The system (102) as claimed in claim 1, wherein the EMS (118) is configured to reboot or update nodes (120) within each group to maintain service availability for customers.
5. The system (102) as claimed in claim 1, wherein the processing unit (112) is configured to assign a different group value to neighboring nodes based on the smallest available group value, wherein the group value may be a numeral-based identified or a color-based identified.
6. The system (102) as claimed in claim 1, wherein the processing unit (112) is configured to update group assignments dynamically based on the coverage overlap, the grouping rules and network topology.
7. The system (102) as claimed in claim 1, wherein the processing unit (112) is configured to:
determining, by the processing unit (112), a node relationship with other node based on latitude and longitude values;
identifying the neighboring nodes based on the node relationship; and
storing the node relationships in the dictionary mapping.

8. The system (102) as claimed in claim 1, wherein for assigning the group values the processing unit (112) is further configured to:
assign a group value to a first node, wherein the group value is a smallest available group value;
assign a group value to each neighbor of the first node, starting with the smallest available group value; and
increment the group value until group value of the neighbor node is unequal to the assigned group value of any neighbor node.

9. A method (1000) for continuing cellular service during a planned operation at a network site, the method (1000) comprising:
receiving, by an input module (114), a request related to the planned operation;
storing, at a database (116) by a processing unit (112), a dictionary mapping each node to a list of its neighbors, a list of nodes, grouping rules, network site information, program instructions, and the request;
processing, by the processing unit (112), the received request to generate groups (120), such that neighboring nodes are from different groups, based at least on stored grouping rules, network coverage and the network site information;
assigning, by the processing unit (112), group values as assigned identifiers to the group of nodes, wherein nodes of corresponding group are assigned a defined group value and neighboring nodes have different group values; and
performing, by element management system (EMS (118)), the planned operation on each group.
10. The method (1000) as claimed in claim 9, wherein the input module (114) receives various types of request related planned operations, including software updates and parameter changes.
11. The method (1000) as claimed in claim 9, wherein the database (116) stores the network site information including coverage overlap data and neighbor relationships.
12. The method (1000) as claimed in claim 9, comprises processing, by the processing unit (112), a group formation that minimizes a number of groups.
13. The method (1000) as claimed in claim 9, comprises assigning, by the processing unit (112), assign a different group value to neighboring nodes based on the smallest available group value, wherein the group value may be a numeral-based identifier or a color-based identifier.
14. The method (1000) as claimed in claim 9, comprises updating, by the processing unit (112), group assignments dynamically based on the coverage overlap, the grouping rules and network topology.
15. The method (1000) as claimed in claim 9, comprises:
determining, by the processing unit (112), a node relationship with other node based on latitude and longitude values of each node;
identifying the neighboring nodes based on the node relationship; and
storing the node relationships in the dictionary mapping.
16. The method (1000) as claimed in claim 9, wherein assigning the group values further comprises:
assigning, by the processing unit (112), a group value to a first node, wherein the group value is a smallest available group value;
assigning, by the processing unit (112), a group value to each neighbor of the first node, starting with the smallest available group value; and
incrementing, by the processing unit (112), the group value until group value of the neighbor node is unequal to the assigned group value of any neighbor node.