DESC: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 PRESENT DISCLOSURE
[0002] The embodiments of the present disclosure generally relate to a field of wireless networks, and specifically to a system and a method for determining anomalies in a network cell, and enabling a cellular User Equipment (UE) to connect to another cell of a network.

BACKGROUND OF PRESENT DISCLOSURE
[0003] 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.
[0004] In current 5th Generation (5G) wireless systems, when a cellular User Equipment (UE) receives a Radio Resource Control (RRC) reject message with a cause as “wait” and a predefined particular timer is mentioned in the RRC reject message, and when no other suitable 5G cell is present in a vicinity, the UE may try to connect to the same cell again or may try to connect to a cell on a lower radio access technology. Further, if the cell search operation exceeds a value of the predefined particular timer which is mentioned in the RRC reject message sent to the UE, the UE may attempt to attach to the 5G cell with a fresh start thus receiving another reject message. This process may eventually turn out into an infinite loop. During this condition, the UE may not attach to any of the radio access technologies even though the radio access technologies are available for usage and with good network conditions.
[0005] Considering a scenario where the 5G cells are deployed at distant locations and in overlapping areas with 4G cells, as illustrated in FIG. 1A. During this condition, when the UE tries to connect to the 5G cell in the network, there may be challenges related to interference, handover complexity, resource allocation, backward compatibility, deployment costs, regulatory requirements, and network management complexity. Further, during boot-up or mobility, the UE may try to attach to the cell and may receive the RRC reject message with the cause as “wait_time”, as illustrated in FIG. 1B. As per the cause, the UE may not be able to attach to the same cell for the specific amount of time mentioned in the RRC reject message. The UE may try to find another cell in the same radio access technology or lower radio access technology, and in case the cell search operation excides the time mentioned in the RRC reject message, the UE may try to attach on the same cell on which it has received the RRC reject message. This may trigger an infinite loop where in the UE may try to attach on the same cell and may receive the RRC reject message. The UE hence may not be able to attach on any of cells in the vicinity due to the reject time expiry during the cell search operation.
[0006] There is, therefore, a need in the art for an improved system and a method to determine anomalies in the 5G cell, and connect the cellular UE to another optimal cell in the network.

OBJECTS OF THE PRESENT DISCLOSURE
[0007] Some of the objects of the present disclosure, which at least one embodiment herein satisfies are listed herein below.
[0008] It is an object of the present disclosure to provide a system and a method to determine anomalies of a cell in a network and connect a cellular User Equipment (UE) to an optimal cell of the network.
[0009] It is an object of the present disclosure to provide a system and a method to automatically fine-tune a location of all sites/cell configurations using a radio predictive engine.
[0010] It is an object of the present disclosure to provide a system and a method to resolve a conflict related to a Radio Resource Control (RRC) reject message “wait” and other causes.
[0011] It is an object of the present disclosure to provide a system and a method to blacklist a cell for a predetermined time based on the RRC reject message.
[0012] It is an object of the present disclosure to provide a system and a method to break an infinite loop because of which the UE remains in a detached state.
[0013] It is an object of the present disclosure to provide a dynamic approach in which after an expiration of a blacklist timer, the UE attempts to attach to a previous cell.
[0014] It is an object of the present disclosure to provide a system and a method to enable a UE to attach to a previous cell if anomalies are cleared, thus unloading vicinity cells in a same or lower radio access technologies.

SUMMARY
[0015] This section is provided to introduce certain objects and 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.
[0016] In an aspect, the present disclosure relates to a system for connecting a user equipment to a network cell. The system includes one or more processors and a memory operatively coupled to the one or more processors. The memory includes processor-executable instructions, which on execution, cause the one or more processors to receive a Radio Resource Control (RRC) connection request to connect to at least one network cell of a plurality of network cells from a user equipment. The one or more processors are to send a RRC reject message to the user equipment based on a plurality of parameters, where the RRC reject message include a predetermined timer. The one or more processors are to restrict connection of the user equipment to the at least one network cell for a predefined time identified in the predetermined timer. The one or more processors are to enable the user equipment to break an infinite loop during the predefined time. In response to the breakage of the infinite loop, the one or more processors are to facilitate connection of the user equipment to the at least one network cell or an optimal cell of the plurality of network cells based on one or more cell conditions.
[0017] In an embodiment, the plurality of parameters may include at least one of a network congestion, a resource limitation, or anomalies in the at least one network cell.
[0018] In an embodiment, the one or more processors may facilitate the connection of the user equipment to the at least one network cell after the expiry of the predetermined timer.
[0019] In an aspect, the present disclosure relates to a method for connecting a user equipment to a network cell. The method includes receiving, by one or more processors, a RRC connection request from a user equipment to connect to at least one network cell of a plurality of network cells. The method includes sending, by the one or more processors, a RRC reject message to the user equipment based on a plurality of parameters, where the RRC reject message includes a predetermined timer. The method includes restricting, by the one or more processors, connection of the user equipment to the at least one network cell based on a predefined time identified in the predetermined timer. The method includes enabling, by the one or more processors, the user equipment to break an infinite loop during the predefined time. In response to the breakage of the infinite loop. The method includes facilitating, by the one or more processor, connection of the user equipment to the at least one network cell or an optimal cell of the plurality of network cells based on one or more cell conditions.
[0020] In an embodiment, the plurality of parameters may include at least one of a network congestion, a resource limitation, or anomalies in the at least one network cell.
[0021] In an embodiment, facilitating, by the one or more processors, connection of the user equipment to the at least one network cell after the expiry of the predetermined timer.
[0022] In an aspect, the present disclosure relates to a user equipment including one or more processors, and a memory operatively coupled to the one or more processors. The memory includes processor-executable instructions, which on execution, cause the one or more processors to send a RRC connection request to connect to at least one network cell of a plurality of network cells to a system. The one or more processors are to receive a RRC reject message from the system based on a plurality of parameters, where the RRC reject message includes a predetermined timer. The one or more processors are to blacklist the at least one network cell for a predefined time identified in the predetermined timer. The one or more processors are to determine an optimal cell from the plurality of network cells during the predefined time. The one or more processors are to break an infinite loop during the predefined time. In response to the breakage of the infinite loop, the one or more processors are to camp on the optimal cell to avail network services.
[0023] In an embodiment, the one or more processors may remove the at least one network cell from the blacklist on the expiry of the predetermined timer.
[0024] In an embodiment, the one or more processors may camp on the at least one network cell based on one or more cell conditions in response to the removal of the at least one network cell from the blacklist.
[0025] In an embodiment, the one or more processors may send the RRC connection request to connect to the at least one network cell to the system during at least one of a boot-up state or a mobility state.
[0026] In an embodiment, the one or more processors may send the RRC connection request to connect to the at least one network cell to the system by entering into the infinite loop.
[0027] In an embodiment, the one or more processors may determine the optimal cell from the plurality of network cells that are available in a same radio access network or in a lower radio access network.

BRIEF DESCRIPTION OF DRAWINGS
[0028] The accompanying drawings, which are incorporated herein, and constitute a part of this disclosure, illustrate exemplary embodiments of the disclosed methods and systems 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 the disclosure of electrical components, electronic components, or circuitry commonly used to implement such components.
[0029] FIGs. 1A and 1B illustrate conventional system for connecting a User Equipment (UE) to a network cell.
[0030] FIG. 2 illustrates an exemplary network architecture (200) for implementing a system, in accordance with an embodiment of the present disclosure.
[0031] FIG. 3 illustrates an example block diagram (300) of a system for connecting a UE to a network cell, in accordance with embodiments of the present disclosure.
[0032] FIG. 4 illustrates an exemplary flow diagram for implementing a method (400) for connecting a UE to a network cell, in accordance with embodiments of the present disclosure.
[0033] FIG. 5 illustrates an exemplary flow diagram for implementing a method (500) for connecting a UE to a network cell, in accordance with embodiments of the present disclosure.
[0034] FIG. 6 illustrates an exemplary computer system (600) in which or with which embodiments of the present disclose may be utilized in accordance with embodiments of the present disclosure.
[0035] The foregoing shall be more apparent from the following more detailed description of the disclosure.

DETAILED DESCRIPTION
[0036] 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 all 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.
[0037] 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.
[0038] 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 to avoid obscuring the embodiments.
[0039] 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.
[0040] 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.
[0041] 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.
[0042] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of 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 and all combinations of one or more of the associated listed items.
[0043] The present disclosure provides a system and a method for connecting a User Equipment (UE) to a network cell. The system may receive a Radio Resource Control (RRC) connection request to connect to at least one network cell of a plurality of network cells from the UE. The system may send a RRC reject message along with a predetermined timer to the UE based on a plurality of parameters. The system may restrict a connection of the UE to the at least one network cell for a predefined time identified in the predetermined timer. The system may enable the UE to break an infinite loop during the predefined time. In response to the breakage of the infinite loop, the system may facilitate connection of the UE to the at least one network cell or an optimal cell of the plurality of network cells based on one or more cell conditions.
[0044] Once the RRC reject message is received by the UE, the UE may blacklist the particular cell for a longer duration or an amount of time specified under 3rd Generation Partnership Project (3GPP) as a maximum cell baring time or based on a vendor implementation. Due to this, the UE may get adequate time to complete cell search and stay in normal service. Post black-listing, the UE may search for another Radio Access Technology (RAT) or if no suitable cell is available in the same RAT, the UE may search for an optimal cell in the lower RATs.
[0045] Once the blacklist timer is expired, the bad cell may be removed from the blacklist and thus the UE may again try to attach on the same cell. This may ensure that other cells are not flooded and the same UE may try to camp on the cell on which it was receiving RRC reject message. Therefore, a user may not face a situation where they are not able to connect to the network despite of having alternate good network conditions in their vicinity. The system may ensure that the UE camps on the optimal cell post getting the RRC reject message and may not get into the infinite loop.
[0046] The terms “blacklist timer” and “predetermined timer are interchangeably represented throughout the specification.
[0047] Various embodiments of the present disclosure will be explained in detail with reference to FIGs. 2-6.
[0048] FIG. 2 illustrates an exemplary network architecture (200) for implementing a system (208), in accordance with an embodiment of the present disclosure.
[0049] As illustrated in FIG. 2, by way of example and not by not limitation, the exemplary network architecture (200) may include a plurality of computing devices (204-1, 204-2…204-N), which may be individually referred as the computing device (204) and collectively referred as the computing devices (204). The computing devices (204) may be associated with a plurality of users (202-1, 202-2…202-N). The plurality of users (202-1, 202-2…202-N) may be individually referred as the user (202) and collectively referred as the users (202).
[0050] It may be appreciated that the computing device (204) may be interchangeably referred to as a user device, a client device, or a UE. The plurality of UEs (204) may include, but not be limited to, cameras, webcams, scanning units, and the like.
[0051] In an embodiment, the UE (204) may include smart devices operating in a smart environment, for example, an Internet of Things (IoT) system. In such an embodiment, the UE (204) may include, but is not limited to, smart phones, smart watches, smart sensors (e.g., mechanical, thermal, electrical, magnetic, etc.), networked appliances, networked peripheral devices, networked lighting system, communication devices, networked vehicle accessories, networked vehicular devices, smart accessories, tablets, smart television (TV), computers, smart security system, smart home system, other devices for monitoring or interacting with or for the users and/or entities, or any combination thereof.
[0052] A person of ordinary skill in the art will appreciate that the computing device, or the user device, or the UE (204) may include, but is not limited to, intelligent, multi-sensing, network-connected devices, that can integrate seamlessly with each other and/or with a central server or a cloud-computing system or any other device that is network-connected.
[0053] In an embodiment, the user device or the UE (204) may include, but is not limited to, a handheld wireless communication device (e.g., a mobile phone, a smartphone, a phablet device, and so on), a wearable computer device (e.g., a head-mounted display computer device, a head-mounted camera device, a wristwatch computer device, and so on), a Global Positioning System (GPS) device, a laptop computer, a tablet computer, or another type of portable computer, a media playing device, a portable gaming system, and/or any other type of computer device with wireless communication capabilities, and the like. In an embodiment, the UE (204) may include, but is not limited to, any electrical, electronic, electromechanical, or an equipment, or a combination of one or more of the above devices such as virtual reality (VR) devices, augmented reality (AR) devices, a laptop, a general-purpose computer, a desktop, a personal digital assistant, a tablet computer, a mainframe computer, or any other computing device, wherein the UE (204) may include one or more in-built or externally coupled accessories including, but not limited to, a visual aid device such as a camera, an audio aid, a microphone, a keyboard, and input devices for receiving input from the user or the entity such as a touch pad, a touch enabled screen, an electronic pen, and the like.
[0054] A person of ordinary skill in the art will appreciate that the UE (204) may not be restricted to the mentioned devices and various other devices may be used.
[0055] In an exemplary embodiment, the UE (204) may communicate with the system (208) through a network (206). The network (206) may include, by way of example but not limitation, 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. The network (206) may include, by way of example but not limitation, one or more of: 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, some combination thereof.
[0056] In an exemplary embodiment, the system (208) may be configured to receive a RRC connection request to connect to at least one network cell of a plurality of network cells from the UE (204). The system (208) may send a RRC reject message to the UE (204) based on a plurality of parameters. The plurality of parameters may include, but not limited to, a network congestion, a resource limitation, and anomalies in the at least one network cell. The RRC reject message may include a predetermined timer. The system (208) may restrict connection of the UE (204) to the at least one network cell for a predefined time (e.g., for a duration of (88*Wait_time) seconds) identified in the predetermined timer. Further, the system (208) may enable the UE (204) to break an infinite loop during the predefined time. In response to the breakage of the infinite loop, the system (208) may facilitate connection of the UE (204) to the at least one network cell or an optimal cell of the plurality of network cells based on one or more cell conditions.
[0057] In an exemplary embodiment, once the UE (204) receives the RRC reject message from the system (208), the UE (204) may blacklist the particular cell for a longer duration or the predefined time identified in the predetermined timer. Post blacklisting, the UE (204) may search for another RAT, or if no suitable cell is available in the same RAT, the UE (204) may search for an optimal cell in the lower RATs and the UE (204) may camp on the optimal cell to avail network services.
[0058] Although FIG. 2 shows exemplary components of the network architecture (200), in other embodiments, the network architecture (200) may include fewer components, different components, differently arranged components, or additional functional components than depicted in FIG. 2. Additionally, or alternatively, one or more components of the network architecture (200) may perform functions described as being performed by one or more other components of the network architecture (200).
[0059] FIG. 3 illustrates an example block diagram (300) of a system (208) for connecting a UE (204) to a network cell, in accordance with an embodiment of the present disclosure.
[0060] In an embodiment, and as shown in FIG. 3, the system (208) may include one or more processors (302). The one or more processors (302) may be implemented as one or more microprocessors, microcomputers, microcontrollers, digital signal processors, central processing units, logic circuitries, and/or any devices that manipulate data based on operational instructions. Among other capabilities, the one or more processors (302) may be configured to fetch and execute computer-readable instructions stored in a memory (304) of the system (208). The memory (304) may store one or more computer-readable instructions or routines, which may be fetched and executed to create or share the data units over a network service. The memory (304) may comprise any non-transitory storage device including, for example, a volatile memory such as a Random-Access Memory (RAM), or a non-volatile memory such as an Erasable Programmable Read-Only Memory (EPROM), a flash memory, and the like.
[0061] In an embodiment, the system (208) may also include an interface(s) (306). The interface(s) (306) may include a variety of interfaces, for example, a variety of interfaces, for example, interfaces for data input and output devices, referred to as I/O devices, storage devices, and the like. The interface(s) (306) may facilitate communication of the system (208) with various devices coupled to it. The interface(s) (306) may also provide a communication pathway for one or more components of the system (208). Examples of such components include, but are not limited to, processing engine(s) (308) and a database (314).
[0062] In an embodiment, the processing engine(s) (308) may be implemented as a combination of hardware and programming (for example, programmable instructions) to implement one or more functionalities of the processing engine(s) (308). In examples, described herein, such combinations of hardware and programming may be implemented in several different ways. For example, the programming for the processing engine(s) (308) may be processor-executable instructions stored on a non-transitory machine-readable storage medium and the hardware for the one or more processors (302) may comprise a processing resource (for example, one or more processors), to execute such instructions. In the present examples, the machine-readable storage medium may store instructions that, when executed by the processing resource, implement the processing engine(s) (308). In such examples, the system (208) may comprise the machine-readable storage medium storing the instructions and the processing resource to execute the instructions, or the machine-readable storage medium may be separate but accessible to the system (208) and the processing resource. In other examples, the processing engine(s) (308) may be implemented by an electronic circuitry.
[0063] In an embodiment, the database (314) may comprise data that may be either stored or generated as a result of functionalities implemented by any of the components of the processors (302) or the processing engine(s) (308) or the system (208).
[0064] In an exemplary embodiment, the processing engine(s) (308) may include one or more engines selected from any of a data ingestion engine (310) and other engines (312). The other engines (312) may include, but are not limited to, a monitoring engine, a determination engine, an identification engine, and the like.
[0065] In an embodiment, the one or more processors (302) may, via the data ingestion engine (310), receive a RRC connection request to connect to network cells from a UE (204). In an embodiment, the one or more processors (302) may, via the data ingestion engine (310), send a RRC reject message along with a predetermined timer to the UE (204) based on a network congestion, a resource limitation, anomalies in the at least one network cell, and so on.
[0066] In an embodiment, the one or more processors (302) may, via the data ingestion engine (310), restrict connection of the UE (204) to the at least one network cell for a predefined time identified in the predetermined timer. In an embodiment, the one or more processors (302) may, via the data ingestion engine (310), enable the UE (204) to break an infinite loop during the predefined time. In response to the breakage of the infinite loop, the one or more processors (302) may facilitate connection of the UE (204) to the at least one network cell or an optimal cell of the plurality of network cells based on one or more cell conditions. The one or more processors (302) may facilitate the connection of the UE (204) to the at least one network cell or the optimal cell after the expiry of the predetermined timer.
[0067] Although FIG. 3 shows exemplary components of the system (208), in other embodiments, the system (208) may include fewer components, different components, differently arranged components, or additional functional components than depicted in FIG. 3. Additionally, or alternatively, one or more components of the system (208) may perform functions described as being performed by one or more other components of the system (208).
[0068] FIG. 4 illustrates an exemplary flow diagram for implementing a method (400) for connecting a UE (204) to a network cell, in accordance with embodiments of the present disclosure.
[0069] Referring to FIG. 4, at 402, during boot-up or mobility of the UE (204), the UE (204) may try to connect to the network cell and enter into an infinite loop.
[0070] At 404, the UE (204) trying to connect to the network cell may receive an RRC reject message with a cause. The cause may be a predetermined timer indicating a predefined time for which the UE (204) may be restricted to attach to the particular cell.
[0071] At 406, in response to receiving the RRC reject message, the UE (204) may be restricted to attach to the particular cell for the predefined time identified in the predetermined timer.
[0072] At 408, the UE (204) may blacklist the particular cell from which the UE (204) had received the RRC reject message. The UE (204) may blacklist the particular cell for the predefined time.
[0073] At 410, in response to blacklisting the particular cell, the UE (204) may not try to connect to the network cell even upon an expiry of the predetermined timer or after the predefined time identified in the predetermined timer.
[0074] At 412, the UE (204) may either search for a different cell or an optimal cell in the same RAT or search in the lower RAT based on the cell conditions.
[0075] At 414, the infinite loop may be broken and hence the UE (204) may connect to the optimal cell or the different cell in the same RAT or the lower RAT to avail network services, without manual intervention from a user (202).
[0076] FIG. 5 illustrates an exemplary flow diagram for implementing a method (500) for connecting a UE (204) to a network cell, in accordance with embodiments of the present disclosure.
[0077] Referring to FIG. 5, at 502, during boot-up or mobility of the UE (204), the UE (204) may try to connect to the network cell and enter into an infinite loop.
[0078] At 504, the UE (204) trying to connect to the network cell may receive a RRC reject message with a cause. The cause may be a predetermined timer indicating a predefined time for which the UE (204) may be restricted to attach to the particular cell.
[0079] At 506, in response to receiving the RRC reject message, the UE (204) may be restricted to attach to the particular cell for the predefined time identified in the predetermined timer.
[0080] At 508, the UE (204) may blacklist the particular cell from which the UE (204) had received the RRC reject message. The UE (204) may blacklist the particular cell for the predefined time.
[0081] At 510, in response to blacklisting the particular cell, the UE (204) may not try to connect to the network cell even upon an expiry of the predetermined timer or after the predefined time identified in the predetermined timer.
[0082] At 512, the UE (204) may either search for a different cell or an optimal cell in the same RAT or in the lower RAT based on the cell conditions.
[0083] At 514, the infinite loop may be broken, and hence the UE (204) may connect to the optimal cell or the different cell in the same RAT or the lower RAT to avail network services.
[0084] At 516, the UE (204) may remove the particular cell from the blacklist on the expiry of the predetermined timer. The UE (204) may revert or connect to the particular cell on the expiry of the predetermined timer or after the predefined time. Post expiration of predetermined timer, the UE (204) may able to camp on the particular cell in response to the removal of the particular cell from the blacklist. Therefore, the other cells may be unloaded with additional users.
[0085] FIG. 6 illustrates an exemplary computer system (600) in which or with which embodiments of the present disclose may be utilized in accordance with embodiments of the present disclosure.
[0086] As shown in FIG. 6, the computer system (600) may include an external storage device (610), a bus (620), a main memory (630), a read-only memory (640), a mass storage device (650), a communication port(s) (660), and a processor (670). A person skilled in the art will appreciate that the computer system (600) may include more than one processor (670) and communication ports (660). The processor (670) may include various modules associated with embodiments of the present disclosure. The communication port(s) (660) 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 ports(s) (660) may be chosen depending on a network, such as a Local Area Network (LAN), Wide Area Network (WAN), or any network to which the computer system (600) connects.
[0087] In an embodiment, the main memory (630) may be a Random Access Memory (RAM), or any other dynamic storage device commonly known in the art. The read-only memory (640) may be any static storage device(s) e.g., but not limited to, a Programmable Read Only Memory (PROM) chip for storing static information e.g., start-up or basic input/output system (BIOS) instructions for the processor (670). The mass storage device (650) may be any current or future mass storage solution, which can be used to store information and/or instructions. Exemplary mass storage solutions include, but are not limited to, Parallel Advanced Technology Attachment (PATA) or 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).
[0088] In an embodiment, the bus (620) may communicatively couple the processor(s) (670) with the other memory, storage, and communication blocks. The bus (620) may be, e.g., a Peripheral Component Interconnect (PCI)/PCI Extended (PCI-X) bus, Small Computer System Interface (SCSI), 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 (670) to the computer system (600).
[0089] In another embodiment, operator and administrative interfaces, e.g., a display, keyboard, and cursor control device may also be coupled to the bus (620) to support direct operator interaction with the computer system (600). Other operator and administrative interfaces can be provided through network connections connected through the communication port(s) (660). Components described above are meant only to exemplify various possibilities. In no way should the aforementioned exemplary computer system (600) limit the scope of the present disclosure.
[0090] 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 is to be implemented merely as illustrative of the disclosure and not as a limitation.

ADVANTAGES OF THE PRESENT DISCLOSURE
[0091] The present disclosure provides a system and a method to determine anomalies of a cell in a network and connect a cellular User Equipment (UE) to another working cell of the network.
[0092] The present disclosure automatically fine-tunes location of all sites/cell configurations using a radio predictive engine.
[0093] The present disclosure efficiently resolves a conflict related to a Radio Resource Control (RRC) reject message “wait” and other causes.
[0094] The present disclosure blacklists a cell based on a RRC reject message.
[0095] The present disclosure breaks an infinite loop because of which a UE remains in a detached state.
[0096] The present disclosure provides a dynamic approach where after expiration of a predetermined timer, a UE attempts to attach to a previous cell.
[0097] The present disclosure enables a UE to connect to a previous cell if anomalies are cleared, thus unloading vicinity cells in a same Radio Access Technology (RAT) or lower RAT.
[0098] The present disclosure ensures that a UE never goes out of service and provides continuous user data in spite of receiving a RRC reject message from a particular cell.
[0099] The present disclosure minimizes manual intervention for selection of a cell.
[00100] The present disclosure enables a UE to switch to an airplane mode, a device reboot mode, or to a lower RAT, thereby achieving better Key Performance Indicators (KPI) and user experience.
,CLAIMS:1. A system (208) for connecting a user equipment (204) to a network cell, the system (208) comprising:
one or more processors (302); and
a memory (304) operatively coupled to the one or more processors (302), wherein the memory (304) comprises processor-executable instructions, which on execution, cause the one or more processors (302) to:
receive a Radio Resource Control (RRC) connection request to connect to at least one network cell of a plurality of network cells from a user equipment (204);
send a RRC reject message to the user equipment (204) based on a plurality of parameters, wherein the RRC reject message comprises a predetermined timer;
restrict connection of the user equipment (204) to the at least one network cell for a predefined time identified in the predetermined timer;
enable the user equipment (204) to break an infinite loop during the predefined time; and
in response to the breakage of the infinite loop, facilitate connection of the user equipment (204) to the at least one network cell or an optimal cell of the plurality of network cells based on one or more cell conditions.
2. The system (208) as claimed in claim 1, wherein the plurality of parameters comprises at least one of: network congestion, resource limitation, or anomalies in the at least one network cell.
3. The system (208) as claimed in claim 1, wherein the one or more processors (302) are to facilitate the connection of the user equipment (204) to the at least one network cell after the expiry of the predetermined timer.
4. A method for connecting a user equipment (204) to a network cell, the method comprising:
receiving, by one or more processors (302), a Radio Resource Control (RRC) connection request from a user equipment (204) to connect to at least one network cell of a plurality of network cells;
sending, by the one or more processors (302), a RRC reject message to the user equipment (204) based on a plurality of parameters, wherein the RRC reject message comprises a predetermined timer;
restricting, by the one or more processors (302), connection of the user equipment (204) to the at least one network cell based on a predefined time identified in the predetermined timer;
enabling, by the one or more processors (302), the user equipment (204) to break an infinite loop during the predefined time; and
in response to the breakage of the infinite loop, facilitating, by the one or more processors (302), connection of the user equipment (204) to the at least one network cell or an optimal cell of the plurality of network cells based on one or more cell conditions.
5. The method as claimed in claim 4, wherein the plurality of parameters comprises at least one of: network congestion, resource limitation, or anomalies in the at least one network cell.
6. The method as claimed in claim 4, wherein facilitating, by the one or more processors (302), the connection of the user equipment (204) to the at least one network cell after the expiry of the predetermined timer.
7. A user equipment (204), comprising:
one or more processors; and
a memory operatively coupled to the one or more processors, wherein the memory comprises processor-executable instructions, which on execution, cause the one or more processors to:
send a Radio Resource Control (RRC) connection request to connect to at least one network cell of a plurality of network cells to a system (208);
receive a RRC reject message from the system (208) based on a plurality of parameters, wherein the RRC reject message comprises a predetermined timer;
blacklist the at least one network cell for a predefined time identified in the predetermined timer;
determine an optimal cell from the plurality of network cells during the predefined time;
break an infinite loop during the predefined time; and
in response to the breakage of the infinite loop, camp on the optimal cell to avail network services.
8. The user equipment (204) as claimed in claim 7, wherein the one or more processors are to remove the at least one network cell from the blacklist on the expiry of the predetermined timer.
9. The user equipment (204) as claimed in claim 8, wherein the one or more processors are to camp on the at least one network cell based on one or more cell conditions, in response to the removal of the at least one network cell from the blacklist.
10. The user equipment (204) as claimed in claim 7, wherein the one or more processors are to send the RRC connection request to connect to the at least one network cell to the system (208) during at least one of: a boot-up state or a mobility state.
11. The user equipment (204) as claimed in claim 7, wherein the one or more processors are to send the RRC connection request to connect to the at least one network cell to the system (208) by entering into the infinite loop.
12. The user equipment (204) as claimed in claim 7, wherein the one or more processors are to determine the optimal cell from the plurality of network cells that are available in a same radio access technology or in a lower radio access technology.