DETAILED ACTION
Continued Examination Under 37 CFR 1.114
A request for continued examination under 37 CFR 1.114, including the fee set forth in 37 CFR 1.17(e), was filed in this application after final rejection. Since this application is eligible for continued examination under 37 CFR 1.114, and the fee set forth in 37 CFR 1.17(e) has been timely paid, the finality of the previous Office action has been withdrawn pursuant to 37 CFR 1.114. Applicant's submission filed on 07/10/2026 has been entered.
Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Claims 1-8, 11-15, 17, 19, 20, 23 and 24 are pending in this office action.
Allowable Subject Matter
Claim 8 is objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims.
Response to Arguments
Applicant's arguments filed 7/10/2026 have been fully considered but they are not persuasive. The reasons set forth below.
Applicant Argues:
On pages 10-12 of the remarks, Applicant argues Li fails to disclose or suggest this feature for at least two fundamental reasons:
(a) First, Li fails to disclose the "Autonomous Time-Triggered Mechanism" (UE-centric determination). Amended claim 1 explicitly requires that the first communication node (UE) determines that a current time is greater than or equal to a start time of the certain operation, which autonomously triggers the RRC layer to execute the operation of exiting the connected state. By contrast, Li discloses a network-controlled state transition. As explicitly stated in Li at paragraph [0046], the transition is triggered by the network sending an "RRC release-NB message" to the UE. Thus, the UE in Li does not make any autonomous determination based on the current time to trigger the RRC release; it merely passively receives and executes the network's command.
(b) Second, Li fails to disclose the "Trigger Timing" (at/after start time versus before start time). Amended Claim 1 requires the RRC layer to execute the operation of exiting the connected state triggered by the specific condition where the current time is greater than or equal to the start time (i.e., at or after the start time).
However, Li teaches that the UE is forced to enter the non-connected state before the start time T4 based on a network command. As explicitly stated in Li at paragraph [0075], "when the core network device indicates the UE to enter the RRC non-connected state before T4 [the start of the coverage hole] ... when the UE enters the RRC non-connected state before T4, it may not perform the cell search starting from T4. The Office Action suggests that Li teaches the UE entering the non-connected state within the set time duration (i.e., within T5-T4) based on paragraph [0049], and thus meets the claimed condition. Applicant respectfully disagrees. Even if the UE in Li enters the non-connected state during the time duration T5-T4, this transition is still dictated by a prior network command (the RRC release message) rather than being dictated by the UE autonomously determining that the current time has reached the start time. A UE in Li completely lacks the specific time-based determination condition (current time > start time) evaluated at the UE side to trigger the RRC layer execution as recited in amended claim 1.
In response, the Examiner respectfully submits:
Regarding (a), Examiner notes that the claim does not explicitly recites “"Autonomous Time-Triggered Mechanism" (UE-centric determination)”.
Li teaches in Fig. 6; [0046], [0049]; [0075] switching RRC connected state to RRC non-connected state/idle before the set timing/execution time based on instruction from the network. Even though the UE receives instruction from the network, the UE stills has to determine not to perform the cell search based on the indication. Also the claim does not positively recite the UE performing the determination autonomously.
Moreover, Li does not explicitly disclose the first communication node makes the determination autonomously. Xu discloses a UE making the determination to disable cell search (XU: Figs. 1 and 3; [0147]-[0148], [0150] UE disabling the cell measurement/search when out of coverage).It would have been obvious to a person having an ordinary skill in the art before the effective filling date of the claimed invention to modify the system of Li wherein the communication node makes the determination autonomously as disclosed by Xu to provide a system of performing cell measurement (Xu: Abstract).
Regarding (b), Examiner notes that the specification in [0085] disclose:
[0085] In an embodiment, when the first communication node is in a connected state, switching the current state of the first communication node based on the execution time information of the certain operation includes at least one of the following: When the current time is greater than or equal to the start time of the certain operation, the RRC layer of the first communication node executes the operation of exiting the connected state, and the first communication node returns to an idle state; when the current time is greater than or equal to the start time of the certain operation, the RRC layer of the first communication node initiates an RRC release procedure, the RRC layer of the first communication node executes the operation of exiting the connected state, and the first communication node returns to an idle state; or when the current time is greater than or equal to the start time of the certain operation, the RRC layer of the first communication node executes the operation of exiting the connected state, the first communication node returns to an idle state, and the RRC layer of the first communication node executes the certain operation.
Hence, according to the specification, the RRC layer performs the exiting the connected state and entering the idle state before performing the execution of the certain operation, i.e. disabling the cell search.
Li teaches in Fig. 6; [0046], [0049]; [0075] switching RRC connected state to RRC non-connected state/idle and not performing cell search after the set timing/start time, i.e. T4 in [0075]; switching to non-connected state at T3 and stop cell search at T4
Claim Rejections - 35 USC § 103
The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action:
A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made.
Claims 1-3, 11, 13-20, 23 and 24 are rejected under 35 U.S.C. 103 as being unpatentable over Li (US 2024/0171962 A1) in view of Xu et al (US 2024/0114372 A1).
Regarding claim 1, Li teaches a communication method, applied to a first communication node, comprising:
determining execution time information of a certain operation, wherein the certain operation is an operation of disabling a cell search; and executing the certain operation based on the execution time information (Li: Figs. 2-3; [0036]-[0037], [0041], [0048] UE/communication node receives indication not to perform cell search under a given time condition/execution time information);
wherein the method further comprises:
switching a current state of the first communication node based on the execution time information of the certain operation (Li: Fig. 6; [0046], [0049]; [0075] switching RRC connected state to RRC non-connected state/idle before the set timing/execution time),
wherein in a case where the first communication node is in a connected state, switching the current state of the first communication node based on the execution time information of the certain operation comprises:
in a case where the first communication node determines that a current time is greater than or equal to a start time of the certain operation, executing, by an RRC layer of the first communication node, an operation of exiting the connected state and returning to an idle state (Li: Fig. 6; [0046], [0049]; [0075] switching RRC connected state to RRC non-connected state/idle and not performing cell search after the set timing/start time, i.e. T4 in [0075]; switching to non-connected state at T3 and stop cell search at T4).
Li does not explicitly disclose the first communication node makes the determination autonomously.
Xu discloses a UE making the determination to disable cell search (XU: Figs. 1 and 3; [0147]-[0148], [0150] UE disabling the cell measurement/search when out of coverage).
It would have been obvious to a person having an ordinary skill in the art before the effective filling date of the claimed invention to modify the system of Li wherein the communication node makes the determination autonomously as disclosed by Xu to provide a system of performing cell measurement (Xu: Abstract).
Regarding claim 20, Li teaches a communication method, the method being applied to a second communication node and comprising: determining execution time information of a certain operation, wherein the certain operation is an operation of disabling a cell search; and sending the execution time information to a first communication node (Li: Figs. 2-3; [0036]-[0037], [0041], [0048] UE/first communication node receives indication not to perform cell search under a given time condition/execution time information from a base station/second communication node);
wherein the execution time information is configured to trigger the first communication node to switch a current state of the first communication node based on the execution time information of the certain operation, wherein in a case where the first communication node is in a connected state (Li: Fig. 6; [0046], [0049]; [0075] switching RRC connected state to RRC non-connected state/idle before the set timing/execution time), the execution time information is configured to trigger the first communication node to perform:
in a case where the first communication node determines that a current time is greater than or equal to a start time of the certain operation, executing, by an RRC layer of the first communication node, an operation of exiting the connected state and returning to an idle state (Li: Fig. 6; [0046], [0049]; [0075] switching RRC connected state to RRC non-connected state/idle and not performing cell search after the set timing/start time, i.e. T4 in [0075]; switching to non-connected state at T3 and stop cell search at T4).
Li does not explicitly disclose the first communication node makes the determination autonomously.
Xu discloses a UE making the determination to disable cell search (XU: Figs. 1 and 3; [0147]-[0148], [0150] UE disabling the cell measurement/search when out of coverage).
It would have been obvious to a person having an ordinary skill in the art before the effective filling date of the claimed invention to modify the system of Li wherein the communication node makes the determination autonomously as disclosed by Xu to provide a system of performing cell measurement (Xu: Abstract).
Regarding claim 2, Li teaches wherein the certain operation comprises one of deactivating an access stratum (AS); stopping a measurement operation; stopping a cell selection or reselection operation; stopping a public land mobile network (PLMN) selection operation; stopping a radio resource control (RRC) procedure initiation operation; or stopping listening to a paging message (Li: [0038]).
Regarding claim 3, Li teaches wherein the execution time information comprises at least one of: a start time of the certain operation and an end time of the certain operation, a start time of the certain operation and a duration of the certain operation, or a time interval of the certain operation, wherein a left end point of the time interval and a right end point of the time interval of the certain operation are a start time of the certain operation and an end time of the certain operation respectively (Li: [0041], [0048]-[0049]).
Regarding claim 11, Li teaches receiving an RRC message carrying the execution time information or system information carrying the execution time information indicated by a second communication node; or receiving a NAS message carrying the execution time information indicated by a core network (Li: Figs. 2-3; [0036]-[0037], [0041], [0048] UE/communication node receives indication not to perform cell search under a given time condition/execution time information).
Regarding claim 13, Li teaches determining a discontinuous-listening cycle parameter, wherein the discontinuous- listening cycle parameter comprises at least one of a discontinuous-listening start time, a discontinuous-listening start time offset value, a discontinuous-listening duration, a length of a discontinuous-listening cycle, or PTW parameters, wherein each PTW parameter of the PTW parameters comprises at least one of: a PTW start time and a PTW duration; or a PTW start time and a PTW end time (Li: Fig. 5; [0042], [0047]-[0049]).
Regarding claim 14, Li teaches wherein determining the discontinuous- listening cycle parameter comprises at least one of: negotiating with a core network about the discontinuous-listening cycle parameter, wherein a cycle corresponding to the discontinuous-listening cycle parameter contains at least two PTWs; negotiating with a core network about at least two discontinuous-listening cycle parameters and listening cyclically based on a cycle corresponding to each discontinuous- listening cycle parameter of the at least two discontinuous-listening cycle parameters, wherein each discontinuous-listening cycle contains one PTW; negotiating with a core network about at least two discontinuous-listening cycle parameters and listening cyclically based on a cycle corresponding to each discontinuous- listening cycle parameter of the at least two discontinuous-listening cycle parameters, wherein each discontinuous-listening cycle contains one PTW, and each discontinuous listening cycle corresponds to one time period; or negotiating with a core network about at least two discontinuous-listening cycle parameters and listening cyclically based on a cycle corresponding to each discontinuous- listening cycle parameter of the at least two discontinuous-listening cycle parameters, wherein each discontinuous-listening cycle contains one PTW, and each discontinuous-listening cycle parameter is associated with one area (Li: Fig. 5; [0070]-[0072]).
Regarding claim 15, Li teaches configuring a relaxed-measurement cycle or a spaced-detection cycle and configuring a detection time period in each relaxed-measurement cycle or each spaced-detection cycle, wherein the detection time period is a time period in which the first communication node performs the cell search (Li: Fig. 5; [0047]-[0049], [0070]-[0072]).
Regarding claim 17, Li teaches wherein in a case where the first communication node is in an inactive state, switching the current state of the first communication node based on the execution time information of the certain operation comprises at least one of: in a case where a current time is greater than or equal to a difference between a start time of the certain operation and a first preset threshold, switching the inactive state of the first communication node to an idle state of the first communication node; in a case where the first communication node is in a cell selection state or in a case where a duration of the cell search reaches a preset duration, switching the inactive state of the first communication node to an idle state of the first communication node; in a case where a duration in which the first communication node executes the certain operation reaches a second preset threshold, switching the inactive state of the first communication node to an idle state of the first communication node; or instructing the first communication node to switch from the inactive state to an idle state based on configuration information of a second communication node in system information or an RRC message (Li: Fig. 6; [0043]-[0046]; [0073]-[0075] switching between PSM mode/inactive and active mode).
Regarding claim 19, Li teaches in a case where the first communication node is in an inactive state, further comprising at least one of: at a start time of the certain operation, executing, by an RRC layer of the first communication node, an operation of deactivating an AS; at a start time of the certain operation, instructing, by a NAS of the first communication node, an RRC layer of the first communication node to execute an operation of deactivating an AS; or at a start time of the certain operation, executing, by an RRC layer of the first communication node, a reply operation of a NAS failure (Li: Fig. 6; [0043]-[0046]; [0073]-[0075] switching between PSM mode/inactive and active mode).
Regarding claim 23, Li teaches a communication device (Li: Figs. 1-3, UE), comprising a communication module, a memory, and at least one processor, wherein the communication module is configured to perform communication interaction between a first communication node, a second communication node, and a core network; the memory is configured to store at least one program; and the at least one processor is configured to perform the method of claim 1 when executing the at least one program (see rejection of claim 1; Fig. 1; management device 13/core network).
Regarding claim 24, Li teaches a non-transitory storage medium storing a computer program which, when executed by a processor, causes the processor to perform the method of claim 1 (See rejection of claim 1).
Claims 4 and 5 are rejected under 35 U.S.C. 103 as being unpatentable over Li (US 2024/0171962 A1) in view of Xu et al (US 2024/0114372 A1) in further view of Skeba et al (US 2014/0179279 A1).
Regarding claim 4, Li teaches wherein determining the execution time information of the certain operation comprises at least one of determining the execution time information of the certain operation based on time information of a coverage hole (Li: [0048], [0060]); determining the execution time information of the certain operation based on time information of coverage holes associated with at least two cells with strongest signal-receiving strength; or determining the execution time information of the certain operation based on time information of coverage holes associated with at least two cells that are top ranked in terms of cell reselection priority and signal-receiving strength.
Li in view of Xu does not explicitly disclose a coverage hole associated with a history camping cell.
Skeba teaches associated with a history camping cell (Skeba: Figs. 1-2; [0019]-[0020] coverage hole associated with route history/history of camping cell).
It would have been obvious to a person having an ordinary skill in the art before the effective filling date of the claimed invention to modify the system of Li in view of Xu wherein the coverage hole is associated with a history camping cell as disclosed by Skeba to provide a system for preventing dropped calls (Skeba: Abstract).
Regarding claim 5, Li in view of Xu and Skeba teaches wherein in a case where an overlap exists among the time information of the coverage holes associated with the at least two cells, the execution time information of the certain operation is determined based on a minimum value of start time of time information of coverage holes associated with the at least two cells and a maximum value of end time of the time information of the coverage holes associated with the at least two cells; or in a case where no overlap exists among the time information of the coverage holes associated with the at least two cells, a union of time information of coverage holes associated with the at least two cells is determined as the execution time information of the certain operation (This limitation has no patentable weight as it refers to the non-selected limitation of “at least two cells” of claim 4).
Claims 6, 7 and 12 are rejected under 35 U.S.C. 103 as being unpatentable over Li (US 2024/0171962 A1) in view of Xu et al (US 2024/0114372 A1) in further view of Skeba et al (US 2014/0179279 A1).
Regarding claim 6, Li in view of Xu does not explicitly disclose reporting, through an RRC layer of the first communication node, the execution time information of the certain operation to a non-access stratum (NAS) of the first communication node, a second communication node, or a core network.
Da Silva teaches reporting, through an RRC layer of the first communication node, the execution time information of the certain operation to a non-access stratum (NAS) of the first communication node, a second communication node, or a core network (Da Silva: Fig. 3; UE sending/reporting the execution of RRC setup via RRCSetupComplete).
It would have been obvious to a person having an ordinary skill in the art before the effective filling date of the claimed invention to modify the system of Li in view of by reporting, through an RRC layer of the first communication node, the execution time information of the certain operation to a non-access stratum (NAS) of the first communication node, a second communication node, or a core network as disclosed by Da Silva to provide a system for resuming paging (Da Silva: Abstract).
Regarding claim 7, Li in view of Xu and Da Silva teaches reporting a certain-operation start indication, a data transmission pause indication, or an access forbidden indication to a NAS of the first communication node in a case where an RRC layer of the first communication node detects that the first communication node is about to enter or has entered a coverage hole; or reporting a certain-operation end indication, a data transmission resume indication, or an access admitted indication to a NAS of the first communication node in a case where an RRC layer of the first communication node detects that the first communication node is about to leave or has left a coverage hole (Da Silva: Figs. 4-5; RRS resume operation).
Regarding claim 12, Li in view of Xu and Da Silva teaches reporting the execution time information of the certain operation to a second communication node or a core network; or reporting the execution time information of the certain operation acquired by the first communication node to a second communication node or a core network (Da Silva: Fig. 3; UE sending/reporting the execution of RRC setup via RRCSetupComplete).
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to KODZOVI ACOLATSE whose telephone number is (571)270-1999. The examiner can normally be reached Monday to Friday 10 am to 6pm.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Avellino Joseph can be reached at (571) 272-3905. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/KODZOVI ACOLATSE/Primary Examiner, Art Unit 2478
Prosecution Insights