FORM 2
THE PATENTS ACT, 1970 (39 OF 1970) & THE PATENT RULES, 2003
COMPLETE SPECIFICATION
(See section 10 and rule 13)
“SYSTEM AND METHOD FOR NEIGHBOUR MANAGEMENT IN A NETWORK”
We, Jio Platforms Limited, an Indian National, of Office - 101, Saffron, Nr. Centre Point, Panchwati 5 Rasta, Ambawadi, Ahmedabad - 380006, Gujarat, India.
The following specification particularly describes the invention and the manner in which it is to be performed.

SYSTEM AND METHOD FOR NEIGHBOUR MANAGEMENT IN A NETWORK
FIELD OF THE INVENTION
[0001] The present disclosure generally relates to the field of wireless communication
systems. More particularly, embodiments of the present disclosure relate to system and method for neighbour management in a network to automate neighbour management of neighbour cells in a cellular cluster in a communication network, to increment a smooth handover of connections between the neighbour cells and to improve overall network performance.
BACKGROUND
[0002] 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 admissions of the prior art.
[0003] Wireless communication technology has rapidly evolved over the past few decades,
with each generation bringing significant improvements and advancements. The first generation of wireless communication technology was based on analog technology and offered only voice services. However, with the advent of the second-generation (2G) technology, digital communication and data services became possible, and text messaging was introduced. Third generation (3G) technology marked the introduction of high-speed internet access, mobile video calling, and location-based services. The fourth generation (4G) technology revolutionized wireless communication with faster data speeds, better network coverage, and improved security. Currently, the fifth generation (5G) technology is being deployed, promising even faster data speeds, low latency, and the ability to connect multiple devices simultaneously. With each generation, wireless communication technology has become more advanced, sophisticated, and capable of delivering more services to its users.
[0004] In a communication network, one or more neighbour cells are deployed in a network
to handle traffic load in a particular area. The one or more neighbour cells can be deployed on Radio Access Network (RAN) Nodes such as, but not limited to, gNodeB, Indoor Small Cell
2

(IDSC), or Outdoor Small Cell (ODSC), etc. The number of the one or more neighbour cells to be employed depends on the overall traffic load of users in such area. This number is needed to be modified to add or delete the number of neighbour cells depending on the increase or decrease of traffic load of the users in such area. For example, Location X includes a total of 5 neighbour cells to handle the traffic load in the communication network. Establishment of a mall at the location X leads to an increase of number of users in the area, thereby leading an increase in the overall traffic near location X. In such case, the number of neighbour cells are needed to be increased to provide a smooth handover of the connections between the neighbour cells. In another example, Location Y includes a total of 5 neighbour cells to handle the traffic load in the communication network. Banning of the location Y by the Government bodies for public use and travel lead to a decrease of number of users in the area, thereby leading a decrease in the overall traffic near location Y. In such case, the number of neighbour cells are needed to be decreased to provide a smooth handover of the connections between the neighbour cells.
[0005] Further, over the period of time various solutions have been developed to improve
the performance of communication devices and to provide automated neighbour management of neighbour cells in a communication network to increment a smooth handover of connections between the neighbour cells and to improve overall network performance. However, there are certain challenges with existing solutions. The existing solutions do not provide an optimized way of admission or deletion of the neighbour cells that leads to: interrupted handover of the connections to the neighbour cells; overload on the existing cells; improper and under-utilization of the neighbour cells in case of extra neighbour cells; and overall communication issues. The existing solutions are silent on the ways to use the automatedly add or delete the neighbour cells.
[0006] Thus, there exists an imperative need in the art to provide the automated neighbour
management of neighbour cells in a communication network to increment a smooth handover of connections between the neighbour cells and to improve overall network performance, which the present disclosure aims to address.

[0007] This section is provided to introduce certain aspects of the present disclosure in a
simplified form that are further described below in the detailed description. This summary is not intended to identify the key features or the scope of the claimed subject matter.
[0008] An aspect of the present disclosure may relate to a method for neighbour
management in a network. The method comprises receiving, by a transceiver unit at a centralized self-organizing network (CSON) server, a neighbour cell addition request for registration of a network node to a cell cluster in the network, wherein the neighbour cell addition request comprises a node identifier associated with the network node. The method further comprises determining, via an analysis unit at the CSON server, a geographical location of the network node based on the node identifier. The method further comprises evaluating via the analysis unit at the CSON server, a distance between the geographical location of the network node and the cell cluster to be below a distance threshold. The method further comprises determining via the analysis unit at the CSON server, a count of a plurality of network nodes included within the cell cluster to be below a count threshold; and registering via a registration unit at the CSON server, the network node to the cell cluster. The method further comprises receiving, via the transceiver unit at the CSON server, a neighbour cell deletion request for removal of the network node from the cell cluster, the neighbour cell deletion request comprising the node identifier. The method further comprises determining, via the analysis unit at the CSON server, a plurality of node parameters to be present in a Neighbour Relation Table (NRT) based on a validation procedure. The method further comprises removing via an elimination unit at the CSON server, the network node from the cell cluster based on the determination of the plurality of node parameters, wherein removing the network node comprises deleting the plurality of node parameters from the NRT.
[0009] In an exemplary aspect of the present disclosure, the method further comprises
updating the NRT associated with the network, wherein updating the NRT comprises adding the plurality of node parameters corresponding to the network node.
[0010] In an exemplary aspect of the present disclosure, the method further comprises
transmitting, to the network node, neighbour cell addition confirmation indicative of the registration of the network node to the cell cluster.

[0011] In an exemplary aspect of the present disclosure, the network is a Centralized Self-
Organizing Networks (CSON).
[0012] In an exemplary aspect of the present disclosure, the plurality of node parameters
comprises a Physical Cell Identifier (PCI), a Cell Global Identifier (CGI), a Public Land Mobile Network (PLMN) identifier, or a combination thereof.
[0013] In an exemplary aspect of the present disclosure, the validation procedure comprises:
transmitting, by the analysis unit, a validation request to the NRT, wherein the validation request includes a request for determining one of a presence of one or more parameters related to the network node and an absence of the one or more parameters related to the network node in the NRT; receiving, by the analysis unit, the validation response from the NRT, wherein the validation response includes one of the presence and the absence of the one or more parameters related to the network node in the NRT; and determining, by the analysis unit, the plurality of node parameters based on the presence of the one or more parameters related to the network node in the NRT.
[0014] Another aspect of the present disclosure may relate to a system for neighbour
management in a network. The system comprises a centralized self-organizing network (CSON) server, the CSON server further comprises a transceiver unit configured to receive a neighbour cell addition request for a registration of a network node to a cell cluster in the network, wherein the neighbour cell addition request comprises a node identifier associated with the network node. The CSON server further comprises an analysis unit connected at least with the transceiver unit, the analysis unit is configured to: determine a geographical location of the network node based on the node identifier; evaluate a distance between the geographical location of the network node and the cell cluster to be below a distance threshold; and determine a count of a plurality of network nodes included within cell cluster to be below a count threshold. The CSON server further comprises a registration unit configured to register the network node to the cellular cluster. The transceiver unit is further configured to receive a neighbour cell deletion request for removal of the network node from the cell cluster, the neighbour cell deletion request comprising the node identifier. Also, the analysis unit is configured to determine a plurality of node parameters to be present in a Neighbour Relation Table (NRT) based on a validation procedure. The CSON sever further comprises an elimination unit connected with the analysis unit, the elimination unit is configured to remove

the network node from the cell cluster based on the determination of the plurality of node parameters, wherein removing the network node comprises deleting the plurality of node parameters from the NRT.
[0015] Yet another aspect of the present disclosure may relate to a non-transitory computer
readable storage medium storing instructions for neighbour management in a network, the storage medium comprising executable code which, when executed by one or more units of a system comprising a CSON server, causes: a transceiver unit of the CSON server to receive a neighbour cell addition request for a registration of the network node to a cell cluster in the network, wherein the neighbour cell addition comprises a node identifier associated with the network node; an analysis unit of the CSON server to determine a geographical location of the network node based on the node identifier; the analysist unit to evaluate a distance between the geographical location of the network node and the cell cluster to be below a distance threshold; the analysis unit to determine a count of a plurality of network nodes included within cell cluster to be below a count threshold; a registration unit of the CSON server to register the network node to the cellular cluster; the transceiver unit to receive a neighbour cell deletion request for removal of the network node from the cell cluster, the neighbour cell deletion request comprising the node identifier; the analysis unit to determine a plurality of node parameters to be present in a Neighbour Relation Table (NRT) based on a validation procedure; and an elimination unit of the CSON server to remove the network node from the cell cluster based on the determination of the plurality of node parameters, wherein removing the network node comprises deleting the plurality of node parameters from the NRT.
[0016] Another aspect of the present disclosure may relate to a user equipment (UE). The
UE comprises a transceiver unit, the transceiver unit is configured to transmit a neighbour management request to a system, and receive a neighbour management response from the system, wherein the system comprises a centralized self-organizing network (CSON) server. The neighbour management response is generated by the system based on: receiving, by the transceiver unit at the CSON server, a neighbour cell addition request for registration of a network node to a cell cluster in the network, wherein the neighbour cell addition request comprises a node identifier associated with the network node; determining, via an analysis unit at the CSON server, a geographical location of the network node based on the node identifier; evaluating via the analysis unit at the CSON server, a distance between the geographical location of the network node and the cell cluster to be below a distance threshold; determining

via the analysis unit at the CSON server, a count of a plurality of network nodes included within the cell cluster to be below a count threshold; registering via a registration unit, the network node to the cell cluster; receiving, via the transceiver unit at the CSON server, a neighbour cell deletion request for removal of the network node from the cell cluster, the neighbour cell deletion request comprising the node identifier; determining, via the analysis unit at the CSON server, a plurality of node parameters to be present in a Neighbour Relation Table (NRT) based on a validation procedure; and removing via an elimination unit at the CSON server, the network node from the cell cluster based on the determination of the plurality of node parameters, wherein removing the network node comprises deleting the plurality of node parameters from the NRT.
OBJECTS OF THE DISCLOSURE
[0017] Some of the objects of the present disclosure, which at least one embodiment
disclosed herein satisfies are listed herein below.
[0018] It is an object of the present disclosure to provide a system and a method for
automated neighbour management of neighbour cells in a communication network to increment a smooth handover of connections between the neighbour cells and to improve overall network performance.
[0019] It is an object of the present disclosure to provide an optimized way of addition or
deletion of the neighbour cells in a cellular cluster.
[0020] It is an object of the present disclosure to provide a smooth handover of the
connections to the neighbour cells.
[0021] It is also an object of the present disclosure to provide reduced overload on the
existing neighbour cells.
[0022] It is another object of the present disclosure to provide a reduced under-utilization
of the neighbour cells in case of extra neighbour cells.

[0023] It is yet another object of the present disclosure to provide improved overall
communication in the communication network.
DESCRIPTION OF THE DRAWINGS
[0024] 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. Also, the embodiments shown in the figures are not to be construed as limiting the disclosure, but the possible variants of the method and system according to the disclosure are illustrated herein to highlight the advantages of the disclosure. It will be appreciated by those skilled in the art that disclosure of such drawings includes disclosure of electrical components or circuitry commonly used to implement such components.
[0025] FIG. 1 illustrates an exemplary block diagram representing interconnection between
a system and a network entity, in accordance with exemplary implementation of the present disclosure.
[0026] FIG. 2 illustrates an exemplary block diagram of a computing device upon which
the features of the present disclosure may be implemented in accordance with exemplary implementation of the present disclosure.
[0027] FIG. 3 illustrates an exemplary block diagram of a system for neighbour
management in a network, in accordance with exemplary implementations of the present disclosure.
[0028] FIG. 4 illustrates a method flow diagram indicating a method for neighbour
management in a network, in accordance with exemplary implementations of the present disclosure.
[0029] FIG. 5a illustrates an exemplary implementation indicating a method implemented
by a Centralized Self-Organizing Network (CSON) of a Radio Access Network (RAN) to
8

perform neighbour cell addition in a cellular cluster, in accordance with exemplary implementations of the present disclosure.
[0030] FIG. 5b illustrates an exemplary implementation indicating a method implemented
by a Centralized Self-Organizing Network (CSON) of a Radio Access Network (RAN) to perform neighbour cell deletion from a cellular cluster, in accordance with exemplary implementations of the present disclosure.
DETAILED DESCRIPTION
[0031] 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 may 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.
[0032] 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.
[0033] 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, processes, and other components may be shown as components in block diagram form in order not to obscure the embodiments in unnecessary detail.
[0034] Also, it is noted that individual embodiments may be described as a process which
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 may 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.
[0035] 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—in a manner similar to the term “comprising” as an open transition word—without precluding any additional or other elements.
[0036] As used herein, a “processing unit” or “processor” or “operating processor” includes
one or more processors, wherein processor refers to any logic circuitry for processing instructions. A processor may be a general-purpose processor, a special purpose processor, a conventional processor, a digital signal processor, a plurality of microprocessors, one or more microprocessors in association with a (Digital Signal Processing) DSP core, a controller, a microcontroller, Application Specific Integrated Circuits, Field Programmable Gate Array circuits, any other type of integrated circuits, etc. The processor may perform signal coding data processing, input/output processing, and/or any other functionality that enables the working of the system according to the present disclosure. More specifically, the processor or processing unit is a hardware processor.
[0037] As used herein, “a user equipment”, “a user device”, “a smart-user-device”, “a smart-
device”, “an electronic device”, “a mobile device”, “a handheld device”, “a wireless communication device”, “a mobile communication device”, “a communication device” may be any electrical, electronic and/or computing device or equipment, capable of implementing the features of the present disclosure. The user equipment/device may include, but is not limited to, a mobile phone, smart phone, laptop, a general-purpose computer, desktop, personal digital assistant, tablet computer, wearable device or any other computing device. Also, the user

device may contain at least one input means configured to receive an input from unit(s) which are required to implement the features of the present disclosure.
[0038] As used herein, “storage unit” or “memory unit” refers to a machine or computer-
5 readable medium including any mechanism for storing information in a form readable by a
computer or similar machine. For example, a computer-readable medium includes read-only
memory (“ROM”), random access memory (“RAM”), magnetic disk storage media, optical
storage media, flash memory devices or other types of machine-accessible storage media. The
storage unit stores at least the data that may be required by one or more units of the system to
10 perform their respective functions.
[0039] Further, in accordance with the present disclosure, it is to be acknowledged that the
functionality described for the various components/units can be implemented interchangeably. While specific embodiments may disclose a particular functionality of these units for clarity, it
15 is recognized that various configurations and combinations thereof are within the scope of the
disclosure. The functionality of specific units as disclosed in the disclosure should not be construed as limiting the scope of the present disclosure. Consequently, alternative arrangements and substitutions of units, provided they achieve the intended functionality described herein, are considered to be encompassed within the scope of the present disclosure.
20
[0040] As used herein “interface” or “user interface refers to a shared boundary across
which two or more separate components of a system exchange information or data. The interface may also be referred to a set of rules or protocols that define communication or interaction of one or more modules or one or more units with each other, which also includes
25 the methods, functions, or procedures that may be called.
[0041] All modules, units, components used herein, unless explicitly excluded herein, may
be software modules or hardware processors, the processors being a general-purpose processor,
a special purpose processor, a conventional processor, a digital signal processor (DSP), a
30 plurality of microprocessors, one or more microprocessors in association with a DSP core, a
controller, a microcontroller, Application Specific Integrated Circuits (ASIC), Field Programmable Gate Array circuits (FPGA), any other type of integrated circuits, etc.
11

[0042] As used herein the transceiver unit includes at least one receiver and at least one
transmitter configured respectively for receiving and transmitting data, signals, information or a combination thereof between units/components within the system and/or connected with the system. 5
[0043] As discussed in the background section, the current known solutions for automated
neighbour management of neighbour cells in a communication network have several
shortcomings such as: un-optimized way of addition or deletion of the neighbour cells;
interrupted handover of the connections to the neighbour cells; overload on the existing cells;
10 improper and under-utilization of the neighbour cells in case of extra neighbour cells; and
overall communication issues.
[0044] The present disclosure aims to overcome the above-mentioned and other existing
problems in this field of technology by providing method and system for neighbour
15 management in a network. The present disclosure prevents any manual intervention related to
a Neighbour Relation Table (NRT) building and manages the complete lifecycle of neighbour addition or modification. The present disclosure encompasses indicating a Centralized Self-Organizing Network (CSON) that a Distributed Self-Organizing Network (DSON) cell wants to be added to a network cluster. Further, the CSON verifies details from a cell database,
20 verifying distance threshold, maximum neighbour allowance, and fetches required attributes
from the cell database to add the DSON in the neighbour cluster. The present disclosure also includes indicating the CSON that a DSON cell wants to be deleted from the network cluster and the CSON verifies details from Cell database DB or NRT to delete the DSON in the neighbour cluster. The DSON cell is an autonomous unit within a network that possesses the
25 capability to self-organize and make decisions based on local information and interactions with
neighbouring cells.
[0045] Hereinafter, exemplary embodiments of the present disclosure will be described with
reference to the accompanying drawings. 30
[0046] FIG. 1 illustrates an exemplary block diagram representing interconnection between
a system [300a] and a network entity [101], in accordance with exemplary implementation of the present disclosure. As shown in FIG. 1, the system [300a] comprises a Centralized Self-organizing Network (CSON) Server [300] and the system [300a] is connected with the network
12

entity [101]. The system [300a] is implemented for neighbour management in a network. Further, detailed functionality of the system [300a] is explained in the description of FIG.3 as provided below.
5 [0047] FIG. 2 illustrates an exemplary block diagram of a computing device [200] (or
referred to herein as a computer system [200]) upon which the features of the present disclosure
may be implemented in accordance with exemplary implementation of the present disclosure.
In an implementation, the computing device [200] may implement a method for neighbour
management in a network utilising the system [300a]. In another implementation, the
10 computing device [200] itself implements the method for neighbour management in a network
using one or more units configured within the computing device [200], wherein said one or more units are capable of implementing the features as disclosed in the present disclosure.
[0048] The computing device [200] may include a bus [202] or other communication
mechanism for communicating information, and a hardware processor [204] coupled with bus [202] for processing information. The hardware processor [204] may be, for example, a general-purpose microprocessor. The computing device [200] may also include a main memory [206], such as a random-access memory (RAM), or other dynamic storage device, coupled to the bus [202] for storing information and instructions to be executed by the processor [204]. The main memory [206] also may be used for storing temporary variables or other intermediate information during execution of the instructions to be executed by the processor [204]. Such instructions, when stored in non-transitory storage media accessible to the processor [204], render the computing device [200] into a special-purpose machine that is customized to perform the operations specified in the instructions. The computing device [200] further includes a read only memory (ROM) [208] or other static storage device coupled to the bus [202] for storing static information and instructions for the processor [204].
[0049] A storage device [210], such as a magnetic disk, optical disk, or solid-state drive is
provided and coupled to the bus [202] for storing information and instructions. The computing
30 device [200] may be coupled via the bus [202] to a display [212], such as a cathode ray tube
(CRT), Liquid crystal Display (LCD), Light Emitting Diode (LED) display, Organic LED (OLED) display, etc. for displaying information to a computer user. An input device [214], including alphanumeric and other keys, touch screen input means, etc. may be coupled to the bus [202] for communicating information and command selections to the processor [204].
13

Another type of user input device may be a cursor controller [216], such as a mouse, a trackball,
or cursor direction keys, for communicating direction information and command selections to
the processor [204], and for controlling cursor movement on the display [212]. This input
device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis
5 (e.g., y), that allow the device to specify positions in a plane.
[0050] The computing device [200] may implement the techniques described herein using
customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the computing device [200] causes or programs the computing
10 device [200] to be a special-purpose machine. According to one implementation, the techniques
herein are performed by the computing device [200] in response to the processor [204] executing one or more sequences of one or more instructions contained in the main memory [206]. Such instructions may be read into the main memory [206] from another storage medium, such as the storage device [210]. Execution of the sequences of instructions contained
15 in the main memory [206] causes the processor [204] to perform the process steps described
herein. In alternative implementations of the present disclosure, hard-wired circuitry may be used in place of or in combination with software instructions.
[0051] The computing device [200] also may include a communication interface [218]
20 coupled to the bus [202]. The communication interface [218] provides a two-way data
communication coupling to a network link [220] that is connected to a local network [222]. For
example, the communication interface [218] may be an integrated services digital network
(ISDN) card, cable modem, satellite modem, or a modem to provide a data communication
connection to a corresponding type of telephone line. As another example, the communication
25 interface [218] may be a local area network (LAN) card to provide a data communication
connection to a compatible LAN. Wireless links may also be implemented. In any such
implementation, the communication interface [218] sends and receives electrical,
electromagnetic or optical signals that carry digital data streams representing various types of
information.
30
[0052] The computing device [200] can send messages and receive data, including program
code, through the network(s), the network link [220] and the communication interface [218]. In the Internet example, a server [230] might transmit a requested code for an application program through the Internet [228], the ISP [226], the local network [222], the host [224] and
14

the communication interface [218]. The received code may be executed by the processor [204] as it is received, and/or stored in the storage device [210], or other non-volatile storage for later execution.
5 [0053] Referring to FIG. 3, an exemplary block diagram of a system [300a] for neighbour
management in a network, is shown, in accordance with the exemplary implementations of the present disclosure. The system [300a] comprises a Centralized Self-Organizing Network (CSON) server [300] and the CSON server [300] further comprises at least one transceiver unit [302], at least one analysis unit [304], at least one registration unit [306], and at least one
10 elimination unit [308]. Also, all of the components/ units of the system [300a] are assumed to
be connected to each other unless otherwise indicated below. Also, in FIG. 3 only a few units are shown, however, the system [300a] may comprise multiple such units or the system [300a] may comprise any such numbers of said units, as required to implement the features of the present disclosure. Further, in an implementation, the system [300a] may be in communication
15 with a server or a network entity [101].
[0054] As used herein “CSON” may correspond to a network architecture where the control
and optimization functions for multiple base stations or access points are centralized in a single entity or location.
20
[0055] The system [300a] is configured for the neighbour management in the network, with
the help of the interconnection between the components/units of the system [300a]. Neighbour management in a network refers to the processes and protocols used to manage and maintain relationships between adjacent or neighbouring network elements, such as nodes, or cells.
25
[0056] More specifically, for the neighbour management, initially, the transceiver unit [302]
of the system [300a] receives a neighbour cell addition request for a registration of a network node to a cell cluster in the network. The neighbour cell addition request comprises a node identifier associated with the network node. The network node may be located within the
30 coverage area of the transceiver unit [302] and the network node may be a node of a
neighbouring cell or base station. More specifically, the network node herein may correspond to any device or entity that forms part of the network infrastructure and plays a role in transmitting, receiving, or processing data. The network node may include base stations, access points, routers, switches, and other network elements.
15

[0057] The node identifier may correspond to a unique identifier assigned to each base
station or access point within the network. The node identifier may include but is not limited
to, Mobile Station International Subscriber Directory Number (MSISDN), Cell Identity’s
5 (IDs), and International Mobile Subscriber Identity (IMSI), and International Mobile
Equipment Identity (IMEI).
[0058] The cell cluster may correspond to a grouping or aggregation of neighbouring cells
that are managed and optimized collectively as a single entity.
10
[0059] The neighbour cell addition request is a request initiated by a user equipment or the
network node such as a base station or access point, to admit a neighbouring cell into the network's Neighbour Relation Table (NRT). The NRT is a database or table containing information about neighbouring cells and their characteristics.
15
[0060] The transceiver unit [302] further causes a server at the network to transmit, to the
network node, neighbour cell addition confirmation indicative of the registration of the network node to the cell cluster. The network is a Centralized Self-Organizing Network (CSON), and the server is the CSON server [300].
20
[0061] The system [300a] further comprises the analysis unit [304] which is communicably
coupled with the transceiver unit [302]. The analysis unit [304] is configured to analyse the received neighbour cell addition request. The analysis unit [304] may be any processor or analysis engine or analysis module at the CSON server [300].
25
[0062] The analysis unit [304] is configured to determine a geographical location of the
network node based on the node identifier. Further, the analysis unit [304] evaluates a distance between the geographical location of the network node and the cell cluster to be below a distance threshold. It is to be noted that the distance threshold is configurable.
30
[0063] In an exemplary implementation, once a center point of the cell cluster is determined,
the analysis unit [304] determines if a distance between the geographical location of the network node and the center point of the cell cluster is below a distance threshold. Also, a center of the cell cluster refers to the geographical midpoint of all the base stations (cells)
16

within that cell cluster, or it could be defined by a specific reference point within the cluster. Each network node and cell cluster is typically associated with geographical coordinates. The location of the network node and the cell cluster can be determined by geographical coordinates. 5
[0064] The analysis unit [304] is configured to determine a count of a plurality of network
nodes included within a cell cluster to be below a count threshold. The analysis unit [304] is
further configured to update the NRT associated with the network wherein to update the NRT,
the analysis unit [304] causes the network to add the plurality of node parameters
10 corresponding to the network node. It is to be noted that the count threshold is configurable.
[0065] For example, let's consider a scenario where a cellular network covers a suburban
area with multiple cell clusters. The analysis unit [304] monitors the network and counts the
number of PLMNs connected to each cell cluster. If the count of PLMNs within a particular
15 cluster is below, say, 10 (the count threshold), it indicates that the cluster has spare capacity
and can accommodate more PLMNs without causing congestion.
[0066] In response to this, the analysis unit [304] updates the NRT by adding the parameters
of new PLMNs that join the network within this cluster. This ensures that the network's
20 registration table stays up to date with the latest information about connected PLMNs,
facilitating efficient management and allocation of network resources.
[0067] Further, the registration unit [306] is configured to register the network node to the
cellular cluster. The cellular cluster is a number of cells grouped together. 25
[0068] In one implementation, the transceiver unit [302] is configured to receive a
neighbour cell deletion request for removal of the network node from the cell cluster, the neighbour cell deletion request comprising the node identifier.
30 [0069] The neighbour cell deletion request may correspond to a request initiated by a
network node, such as a base station or access point, to remove a neighbouring cell from the network's Neighbour Relation Table (NRT).
17

[0070] The analysis unit [304] is configured to determine a plurality of node parameters to
be present in the NRT based on a validation procedure.
[0071] Upon reception of the neighbour cell deletion request, the analysis unit [304]
5 configured to determine a plurality of node parameters to be present in the NRT based on the
validation procedure. The plurality of node parameters comprises Physical Cell Identifier (PCI), Cell Global Identifier (CGI), Public Land Mobile Network (PLMN) identifier, or a combination thereof.
10 [0072] To perform the validation procedure the analysis unit [304] is configured to: (1)
transmit, a validation request to the NRT, wherein the validation request includes a request for determining one of a presence of one or more parameters related to the network node and an absence of the one or more parameters related to the network node in the NRT; (2) receive, the validation response from the NRT, wherein the validation response includes one of the
15 presence and the absence of the one or more parameters related to the network node in the
NRT; and (3) determine, the plurality of node parameters based on the presence of the one or more parameters related to the network node in the NRT. The presence of the one or more parameters indicates that the parameters related to the network node are detected, exist, or are available in the NRT. On the other hand, the absence of the one or more parameters indicates
20 that the parameters related to the network node are not detected or are not available in the NRT.
[0073] In an implementation, the validation procedure is a set of steps or rules used to ensure
that certain conditions are met before a particular action can be taken or data can be accepted as valid. In the context of the analysis unit [304] and its function within a cellular network, the
25 validation procedure is used to verify the correctness and integrity of node parameters before
they are accepted into the NRT or before certain network operations are performed. The validation procedure may include verifying the presence of parameters such as the PCI, CGI, and PLMN identifier in the NRT. After confirming the presence of required parameters, the validation procedure ensures that each parameter is valid. This involves checking whether the
30 values of the parameters adhere to predefined rules or constraints. For example, the PCI should
be a unique identifier within the network, the CGI should be globally unique, and the PLMN identifier should correspond to a valid mobile network operator. The validation procedure might check whether the PCI and CGI values correspond to the same cell or whether the PLMN identifier matches the operator of the cell. Finally, based on the outcome of the validation
18

procedure, the request to add or update node parameters is either confirmed or rejected. If the parameters pass validation, they are accepted into the NRT. If not, the request is denied, and appropriate feedback is provided to the requester.
5 [0074] The Physical Cell Identifier may correspond to a unique identifier assigned to each
cell which helps the mobile devices distinguish between different cells when they are communicating with the network.
[0075] The Cell Global Identifier herein may correspond to a globally unique identifier
10 assigned to each cell within a cellular network and consists of a combination of a Mobile
Country Code (MCC), a Mobile Network Code (MNC), and a Location Area Code (LAC).
[0076] The PLMN may correspond to a mobile operator's cellular network in a specific
country. Each PLMN has a unique code that identifies a specific mobile network operator's
15 network within a geographical area. The PLMN comprises the MCC and the MNC, providing
a standardized format for identifying mobile networks globally.
[0077] Furthermore, the elimination unit [308] is connected with the transceiver unit [302]
and the analysis unit [304]. The elimination unit [308] is configured to remove the network
20 node from the cell cluster based on the determination of the plurality of node parameters. Also,
the process of removing the network node comprises deleting the plurality of node parameters from the NRT. This way the network node gets deleted from the cell cluster.
[0078] Referring to FIG. 4, an exemplary flow diagram of a method [400] for neighbour
25 management in a network, in accordance with exemplary implementations of the present
disclosure is shown. In an implementation the method [400] is performed by the system [300a].
Further, in an implementation, the system [300a] may be present at a network end to implement
the features of the present disclosure. The system [300a] comprises a centralized self-
organizing network (CSON) server [300]. Also, as shown in Figure 4, the method [400] starts
30 at step [402] at the centralized self-organizing network (CSON) server [300].
[0079] At step [404], the method [400] as disclosed by the present disclosure comprises
receiving, by a transceiver unit [302] at a centralized self-organizing network (CSON) server [300], a neighbour cell addition request for registration of a network node to a cell cluster in
19

the network, wherein the neighbour cell addition request comprises a node identifier associated with the network node. In one implementation the network is the CSON.
[0080] The transceiver unit [302] further causes a server at the network for transmitting, to
5 the network node, neighbour cell addition confirmation indicative of the registration of the
network node to the cell cluster. The server is the CSON server [300].
[0081] The analysis unit [304] is communicably coupled with the transceiver unit [302].
The analysis unit [304] analyse the received neighbour cell addition request. The analysis unit
10 [304] may be any processor or analysis engine or analysis module at the CSON server [300].
[0082] At step [406], the method [400] as disclosed by the present disclosure comprises
determining, via an analysis unit [304] at the CSON server [300], a geographical location of the network node based on the node identifier.
[0083] At step [408], the method [400] as disclosed by the present disclosure comprises
evaluating via the analysis unit [304] at the CSON server [300], a distance between the geographical location of the network node and the cell cluster to be below a distance threshold. It is to be noted that the distance threshold is configurable.
[0084] At step [410], the method [400] as disclosed by the present disclosure comprises
determining via the analysis unit [304] at the CSON server [300], a count of a plurality of network nodes included within the cell cluster to be below a count threshold. It is to be noted that the count threshold is configurable.
[0085] At step [412], the method [400] comprises registering via a registration unit [306] at
the CSON server [300], the network node to the cell cluster. The cellular cluster refers to a number of cells grouped together.
30 [0086] At step [414], the method [400] as disclosed by the present disclosure comprises
receiving, via the transceiver unit [302] at the CSON server [300], a neighbour cell deletion request for removal of the network node from the cell cluster, the neighbour cell deletion request comprising the node identifier.
20

[0087] At step [416], the method [400] as disclosed by the present disclosure comprises
determining, via the analysis unit [304] at the CSON server [300], a plurality of node
parameters to be present in a Neighbour Relation Table (NRT) based on a validation procedure.
The CSON server [300] is configured to perform validation at its end, check if the neighbour
5 can be added in the NRT and sends the response back to a Distributed Self-Organizing Network
(DSON).
[0088] The validation procedure comprises transmitting, by the analysis unit [304], a
validation request to the NRT, wherein the validation request includes: (1) a request for
10 determining one of a presence of one or more parameters related to the network node and an
absence of the one or more parameters related to the network node in the NRT; (2) receiving, by the analysis unit [304], the validation response from the NRT, wherein the validation response includes one of the presence and the absence of the one or more parameters related to the network node in the NRT; and (3) determining, by the analysis unit [304], the plurality of
15 node parameters based on the presence of the one or more parameters related to the network
node in the NRT.
[0089] Upon reception of the neighbour cell deletion request, the analysis unit [304]
determine a plurality of node parameters to be present in the NRT based on a validation
20 procedure. The plurality of node parameters comprises Physical Cell Identifier (PCI), Cell
Global Identifier (CGI), Public Land Mobile Network (PLMN) identifier, or a combination thereof.
[0090] At step [418], the method [400] as disclosed by the present disclosure comprises
25 removing via an elimination unit [308] at the CSON server [300], the network node from the
cell cluster based on the determination of the plurality of node parameters, wherein removing the network node comprises deleting the plurality of node parameters from the NRT.
[0091] The elimination unit [308] is connected with the transceiver unit [302] and the
30 analysis unit [304]. The elimination unit [308] removes the network node from the cell cluster
based on the determination of the plurality of node parameters. Also, the process of removing the network node comprises deleting the plurality of node parameters from the NRT. This way the network node gets deleted from the cell cluster.
21

[0092] The method further comprises updating the NRT associated with the network,
wherein updating the NRT comprises adding the plurality of node parameters corresponding to the network node.
5 [0093] Thereafter, the method terminates at step [420].
[0094] FIG. 5a illustrates an exemplary implementation indicating a method [500a]
implemented by a Centralized Self-Organizing Network (CSON) of the Radio Access Network
(RAN) to perform neighbour cell addition in a cellular cluster, in accordance with exemplary
10 implementations of the present disclosure.
[0095] At step [502], the method comprises indicating the CSON [300] that a Distributed
Self-Organizing Network (DSON) cell is to be added to the cellular cluster by initiating a
trigger for addition by an Operations, Administration and Maintenance (OAM) Manager [500].
15 The OAM Manager [500] is a data-driven framework that manages OAM tests and templates,
and enables test-suite creation, configuration, execution, and result collection.
[0096] At step [504], the method comprises performing validation by the CSON [300] to
check if such DSON cell can be added in a Neighbour Relation Table (NRT) or not by
20 comparing from the details mentioned in a Cell database (DB).
[0097] At step [504], the method leads to step [510] and comprises sharing back details to
the OAM-Manager [500], in case of failure of the validation by CSON [300]. Also, in case of
positive validation at step [504], the method encompasses verifying at step [506] that if the
25 DSON cell is within the pre-defined distance threshold of the cellular cluster. For example, if
the pre-defined distance threshold of the cellular cluster is 500 meters and a distance between the DSON cell and the cellular cluster is 450 meters, the method then verifies that the DSON cell is within the pre-defined distance threshold of the cellular cluster (i.e., within 500 meter).
30 [0098] At step [508], the method encompasses verifying if the cellular cluster is within the
pre-defined maximum neighbour count. Thereafter leads to step [510] and comprises sharing back details to the OAM-Manager [500] in case of failure of the verification of the DSON cell being within the pre-defined distance. Else the method leads to step 512.
22

[0099] At step [512], the method comprises registering the DSON cell in the cellular cluster
if the existing number of neighbours in the cellular cluster is less than the pre-defined maximum neighbour count and fetch required attributes like Bandwidth allocation from the cell DB etc.
5 [0100] FIG. 5b illustrates an exemplary implementation indicating a method [500b]
implemented by a Centralized Self-Organizing Network CSON of the Radio Access Network (RAN) to perform neighbour cell deletion from a cellular cluster, in accordance with exemplary implementations of the present disclosure.
10 [0101] As shown in FIG. 5b, the method comprises: indicating the CSON [300] by the
Operations, Administration, and Maintenance (OAM) Manager [500] that a Distributed Self-Organizing Network (DSON) cell wants to be deleted from the cellular cluster by initiating a trigger of deletion.
15 [0102] The method further comprises performing validation by the CSON [300] to check if
such DSON cell is present in a Neighbour Relation Table (NRT).
[0103] The method comprises deleting the DSON cell from the cellular cluster if the DSON
cell was present in the NRT and sharing the details back to the OAM-Manager [500]; and if
20 not, alerting the OAM-Manager [500] that there was a deletion failure of the DSON cell from
the cellular cluster.
[0104] The present disclosure further discloses a non-transitory computer readable storage
medium storing instructions for method for neighbour management in a network, the storage
25 medium comprising executable code which, when executed by one or more units of a system
[300a] comprising a CSON server [300], causes to: a transceiver unit [302] of the CSON server [300] to receive a neighbour cell addition request for a registration of the network node to a cell cluster in the network, wherein the neighbour cell addition request comprises a node identifier associated with the network node; an analysis unit [304] of the CSON server [300]
30 to determine a geographical location of the network node based on the node identifier; the
analysis unit [304] to evaluate a distance between the geographical location of the network node and the cell cluster to be below a distance threshold; the analysis unit [304] to determine a count of a plurality of network nodes included within cell cluster to be below a count threshold; a registration unit [306] of the CSON server [300] to register the network node to
23

the cellular cluster; the transceiver unit [302] to receive a neighbour cell deletion request for
removal of the network node from the cell cluster, the neighbour cell deletion request
comprising the node identifier; the analysis unit [304] is to determine a plurality of node
parameters to be present in a Neighbour Relation Table (NRT) based on a validation procedure;
5 and an elimination unit [308] of the CSON server [300] to remove the network node from the
cell cluster based on the determination of the plurality of node parameters, wherein removing the network node comprises deleting the plurality of node parameters from the NRT.
[0105] Another aspect of the present disclosure may relate to a user equipment (UE). The
10 UE comprises a transceiver unit [302], the transceiver unit [302] is configured to transmit a
neighbour management request to a system [300a], and receive a neighbour management response from the system [300a], wherein the system [300a] comprises a centralized self-organizing network (CSON) server [300]. The neighbour management response is generated by the system [300a] based on: receiving, by the transceiver unit [302] at the CSON server
15 [300], a neighbour cell addition request for registration of a network node to a cell cluster in
the network, wherein the neighbour cell addition request comprises a node identifier associated with the network node; determining, via an analysis unit [304] at the CSON server [300], a geographical location of the network node based on the node identifier; evaluating via the analysis unit [304] at the CSON server [300], a distance between the geographical location of
20 the network node and the cell cluster to be below a distance threshold; determining via the
analysis unit [304] at the CSON server [300], a count of a plurality of network nodes included within the cell cluster to be below a count threshold; registering via a registration unit [306], the network node to the cell cluster; receiving, via the transceiver unit [302] at the CSON server [300], a neighbour cell deletion request for removal of the network node from the cell cluster,
25 the neighbour cell deletion request comprising the node identifier; determining, via the analysis
unit [304] at the CSON server [300], a plurality of node parameters to be present in a Neighbour Relation Table (NRT) based on a validation procedure; and removing via an elimination unit [308] at the CSON server [300], the network node from the cell cluster based on the determination of the plurality of node parameters, wherein removing the network node
30 comprises deleting the plurality of node parameters from the NRT.
[0106] As is evident from the above, the present disclosure provides a technically advanced
solution for the neighbour management of neighbour cells in a communication network to
24

increment a smooth handover of connections between the neighbour cells and to improve an overall network performance. Various advantages of the present disclosure comprise:
• optimized way of addition or deletion of the neighbour cells in a cellular cluster;
• smooth handover of the connections to the neighbour cells; 5 • reduced overload on the existing neighbour cells;
• reduced under-utilization of the neighbour cells in case of extra neighbour cells; and
• improved overall communication in the communication network.
[0107] While considerable emphasis has been placed herein on the disclosed
10 implementations, it will be appreciated that many implementations can be made and that many
changes can be made to the implementations without departing from the principles of the present disclosure. These and other changes in the implementations of the present disclosure will be apparent to those skilled in the art, whereby it is to be understood that the foregoing descriptive matter to be implemented is illustrative and non-limiting.
25

We Claim:
1. A method for neighbour management in a network, the method comprising:
- receiving, by a transceiver unit [302] at a centralized self-organizing network (CSON) server [300], a neighbour cell addition request for registration of a network node to a cell cluster in the network, wherein the neighbour cell addition request comprises a node identifier associated with the network node;
- determining, via an analysis unit [304] at the CSON server [300], a geographical location of the network node based on the node identifier;
- evaluating via the analysis unit [304] at the CSON server [300], a distance between the geographical location of the network node and the cell cluster to be below a distance threshold;
- determining via the analysis unit [304] at the CSON server [300], a count of a plurality of network nodes included within the cell cluster to be below a count threshold;
- registering, via a registration unit [306] at the CSON server [300], the network node to the cell cluster;
- receiving, via the transceiver unit [302] at the CSON server [300], a neighbour cell deletion request for removal of the network node from the cell cluster, the neighbour cell deletion request comprising the node identifier;
- determining, via the analysis unit [304] at the CSON server [300], a plurality of node parameters to be present in a Neighbour Relation Table (NRT) based on a validation procedure; and
- removing via an elimination unit [308] at the CSON server [300], the network node from the cell cluster based on the determination of the plurality of node parameters, wherein removing the network node comprises deleting the plurality of node parameters from the NRT.
2. The method as claimed in claim 1, further comprising updating the NRT associated
with the network, wherein updating the NRT comprises adding the plurality of node
parameters corresponding to the network node.
26

3. The method as claimed in claim 1, further comprising transmitting, to the network node, neighbour cell addition confirmation indicative of the registration of the network node to the cell cluster.
4. The method as claimed in claim 1, wherein the network is a Centralized Self-Organizing Networks (CSON).
5. The method as claimed in claim 1, wherein the plurality of node parameters comprises a Physical Cell Identifier (PCI), a Cell Global Identifier (CGI), a Public Land Mobile Network (PLMN) identifier, or a combination thereof.
6. The method as claimed in claim 1, wherein the validation procedure comprises:

- transmitting, by the analysis unit [304], a validation request to the NRT, wherein the validation request includes a request for determining one of a presence of one or more parameters related to the network node and an absence of the one or more parameters related to the network node, in the NRT;
- receiving, by the analysis unit [304], a validation response from the NRT, wherein the validation response includes one of the presence and the absence of the one or more parameters related to the network node in the NRT; and
- determining, by the analysis unit [304], the plurality of node parameters based on the presence of the one or more parameters related to the network node in the NRT.
7. A system [300a] for neighbour management in a network, the system [300a] comprising
a centralized self-organizing network (CSON) server [300], the CSON server [300]
further comprising:
- a transceiver unit [302] configured to receive a neighbour cell addition
request for a registration of a network node to a cell cluster in the network,
27

wherein the neighbour cell addition request comprises a node identifier associated with the network node;
- an analysis unit [304] connected at least with the transceiver unit [302], the
analysis unit is configured to:
o determine a geographical location of the network node based on the
node identifier, o evaluate a distance between the geographical location of the network
node and the cell cluster to be below a distance threshold, and o determine a count of a plurality of network nodes included within
cell cluster to be below a count threshold;
- a registration unit [306], configured to register the network node to the
cellular cluster,
wherein the transceiver unit [302] is configured to receive a neighbour cell deletion request for removal of the network node from the cell cluster, the neighbour cell deletion request comprising the node identifier, and
wherein the analysis unit [304] is configured to determine a plurality of node parameters to be present in a Neighbour Relation Table (NRT) based on a validation procedure; and
- an elimination unit [308] connected with the analysis unit [304], the
elimination unit [308] is configured to remove the network node from the
cell cluster based on the determination of the plurality of node parameters,
wherein removing the network node comprises deleting the plurality of node
parameters from the NRT.
8. The system [300a] as claimed in claim 7, wherein the analysis unit [304] is further configured to update the NRT associated with the network wherein to update the NRT, the analysis unit [304] causes the network to add the plurality of node parameters corresponding to the network node.
9. The system [300a] as claimed in claim 7, wherein the transceiver unit [302] further causes the network to transmit, to the network node, neighbour cell addition confirmation indicative of the registration of the network node to the cell cluster.

10. The system [300a] as claimed in claim 7, wherein the network is Centralized Self-Organizing Networks (CSON).
11. The system [300a] as claimed in claim 7, wherein the plurality of node parameters comprises Physical Cell Identifier (PCI), Cell Global Identifier (CGI), Public Land Mobile Network (PLMN) identifier, or a combination thereof.
12. The system [300a] as claimed in claim 7, wherein to perform the validation procedure the analysis unit [304] is configured to:

- transmit, a validation request to the NRT, wherein the validation request includes a request for determining one of a presence of one or more parameters related to the network node and an absence of the one or more parameters related to the network node in the NRT;
- receive, a validation response from the NRT, wherein the validation response includes one of the presence and the absence of the one or more parameters related to the network node in the NRT; and
- determine the plurality of node parameters based on the presence of the one or more parameters related to the network node in the NRT.
13. A user equipment (UE) comprising:
- a transceiver unit [302] configured to:
o transmit a neighbour management request to a system [300a], and receive a neighbour management response from the system [300a],
wherein the system [300a] comprises a centralized self-organizing
network (CSON) server [300], and the neighbour management response
is generated by the system [300a] based on:
o receiving, by the transceiver unit [302] at the CSON server [300], a neighbour cell addition request for registration of a network node to a cell cluster in a network, wherein the neighbour cell addition request comprises a node identifier associated with the network node,
o determining, via an analysis unit [304] at the CSON server [300], a geographical location of the network node based on the node identifier,
29

o evaluating via the analysis unit [304] at the CSON server [300], a distance between the geographical location of the network node and the cell cluster to be below a distance threshold,
o determining via the analysis unit [304] at the CSON server [300], a count of a plurality of network nodes included within the cell cluster to be below a count threshold,
o registering via a registration unit [306], the network node to the cell cluster,
o receiving, via the transceiver unit [302] at the CSON server [300], a neighbour cell deletion request for removal of the network node from the cell cluster, the neighbour cell deletion request comprising the node identifier,
o determining, via the analysis unit [304] at the CSON server [300], a plurality of node parameters to be present in a Neighbour Relation Table (NRT) based on a validation procedure, and
o removing via an elimination unit [308] at the CSON server [300], the network node from the cell cluster based on the determination of the plurality of node parameters, wherein removing the network node comprises deleting the plurality of node parameters from the NRT.