Prosecution Insights
Last updated: April 19, 2026
Application No. 18/409,469

SYSTEMS AND METHODS FOR RELAY SELECTION IN MILLIMETER WAVE NETWORKS

Non-Final OA §102§Other
Filed
Jan 10, 2024
Examiner
HAQUE, ABUSAYEED M
Art Unit
2466
Tech Center
2400 — Computer Networks
Assignee
Indian Institute Of Technology - Bombay
OA Round
1 (Non-Final)
92%
Grant Probability
Favorable
1-2
OA Rounds
2y 5m
To Grant
89%
With Interview

Examiner Intelligence

Grants 92% — above average
92%
Career Allow Rate
581 granted / 634 resolved
+33.6% vs TC avg
Minimal -3% lift
Without
With
+-2.7%
Interview Lift
resolved cases with interview
Typical timeline
2y 5m
Avg Prosecution
26 currently pending
Career history
660
Total Applications
across all art units

Statute-Specific Performance

§101
3.6%
-36.4% vs TC avg
§103
44.0%
+4.0% vs TC avg
§102
29.8%
-10.2% vs TC avg
§112
9.9%
-30.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 634 resolved cases

Office Action

§102 §Other
DETAILED ACTION This office action is a response to an application field on 11/08/2023, in which claims 1-6 are pending and ready for examination. Priority Applicant’s claim for the benefit of a prior-filed application under 35 U.S.C. 119(e) or under 35 U.S.C. 120, 121, 365(c), or 386(c) is acknowledged. Claim Rejections - 35 USC § 102 The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. Claims 1 and 4 are rejected under 35 U.S./C 102 (a)(1) as being anticipated by NGUYEN et al. (hereinafter, “NGUYEN”; 20230396623). In response to claim 1, NGUYEN teaches a method for selecting a relay in millimeter wave (mmWave) networks, the method comprises: computing, by a controller, a first Signal to Noise Ratio (SNR) from at least one source to at least one relay, and a second SNR from the at least one relay to at least one destination (paragraph 40, communication node is equated to a controller, transmitting agent equated to a source node, and receiving agent is equated to a destination, paragraph 41,using a source agent in a relay path is read as using (the source node) as a relay node, paragraph 62, defining end-to-end SNR (SNRE2E) from a source node to a end node explicitly teaches computing, by a controller, a first Signal to Noise Ratio (SNR) from at least one source to at least one relay, and a second SNR from the at least one relay to at least one destination); selecting, by the controller, a relay with a highest Q-value for enabling communication between the at least one source and the at least one destination, if a randomly selected number is more than € (paragraph 58, determining a relay agent based on a Q-table is read as selecting, by the controller, a relay for enabling communication between the at least one source and the at least one destination, “E” is equated to a randomly selected number, initial value of “E” (0.995) is equated to a highest Q-value for enabling communication); selecting, by the controller, a relay randomly for enabling communication between the at least one source and the at least one destination, if the randomly selected number is not more than € (paragraph 58, minimum threshold value 0.005 is equated to the randomly selected number is not more than €,determining a relay agent from an access list based on a Q-table to transition for communicating explicitly teaches this limitation); and communicating, by the at least one source, with the at least one destination via the selected relay (paragraph 58, transitioning for communicating is read as communicating, determining a relay agent from an access list based on a Q-table to transition for communicating explicitly teaches this limitation). In response to claim 4, NGUYEN teaches a controller for selecting a relay in millimeter wave (mmWave) networks, the controller configured for: computing a first Signal to Noise Ratio (SNR) from at least one source to at least one relay, and a second SNR from the at least one relay to at least one destination (paragraph 40, communication node is equated to a controller, transmitting agent equated to a source node, and receiving agent is equated to a destination, paragraph 41,using a source agent in a relay path is read as using (the source node) as a relay node, paragraph 62, defining end-to-end SNR (SNRE2E) from a source node to a end node explicitly teaches computing, by a controller, a first Signal to Noise Ratio (SNR) from at least one source to at least one relay, and a second SNR from the at least one relay to at least one destination); selecting a relay with a highest Q-value for enabling communication between the at least one source and the at least one destination, if a randomly selected number is more than € (paragraph 58, determining a relay agent based on a Q-table is read as selecting, by the controller, a relay for enabling communication between the at least one source and the at least one destination, “E” is equated to a randomly selected number, initial value of “E” (0.995) is equated to a highest Q-value for enabling communication), wherein the at least one source can communicate with the at least one destination via the selected relay (paragraph 58, transitioning for communicating is read as communicating, determining a relay agent from an access list based on a Q-table to transition for communicating explicitly teaches this limitation); and selecting a relay randomly for enabling communication between the at least one source and the at least one destination, if the randomly selected number is not more than € (paragraph 58, minimum threshold value 0.005 is equated to the randomly selected number is not more than €,determining a relay agent from an access list based on a Q-table to transition for communicating explicitly teaches this limitation), wherein the at least one source can communicate with the at least one destination via the selected relay (paragraph 58, transitioning for communicating is read as communicating, determining a relay agent from an access list based on a Q-table to transition for communicating explicitly teaches this limitation). Allowable Subject Matter Claims 2-3 and 5-6 are 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. As for dependent claims 2 and 5, these claims are objected, because there is no prior art in the record that teaches claimed limitation “wherein the method further comprises: selecting, by the controller, a highest Q-value from remaining Q-values, wherein Q-values of the selected relay for enabling communication between the at least one source and the at least one destination is not considered, till all of the at least one source and the at least one destination have a relay assigned to them.” The closet prior art in the record NGUYEN et al. (20230396623) teaches in paragraphs 40-41 about a having communication between two nodes via a relay node, he teaches in paragraph 58 about using a Q-table with a threshold value for selecting an appropriate alternating relay node, and he teaches in paragraph 62 about using a SNR aa a matrix for selecting the alternative relay node, but he fails to teach the above cited limitation. As for dependent claims 3 and 6, these claims are objected, because there is no prior art in the record that teaches claimed limitation “wherein the method further comprises: receiving, by the controller, a reward; updating, by the controller, the Q-value using a Bellman equation; and storing, by the controller, the updated Q-value in a Q-table.” The closet prior art in the record NGUYEN et al. (20230396623) teaches in paragraphs 40-41 about a having communication between two nodes via a relay node, he teaches in paragraph 58 about using a Q-table with a threshold value for selecting an appropriate alternating relay node, and he teaches in paragraph 62 about using a SNR aa a matrix for selecting the alternative relay node, but he fails to teach the above cited limitation. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. US Patent 9055447B2……….column 7, lines 25-61. Any inquiry concerning this communication or earlier communications from the examiner should be directed to ABUSAYEED HAQUE whose telephone number is (571)270-7252. The examiner can normally be reached 9 am -7:30 pm. 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, Faruk Hamza can be reached at 571-272-7969. 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. /ABUSAYEED M HAQUE/Examiner, Art Unit 2466 /CHRISTOPHER M CRUTCHFIELD/Primary Examiner, Art Unit 2466
Read full office action

Prosecution Timeline

Jan 10, 2024
Application Filed
Feb 16, 2026
Non-Final Rejection — §102, §Other (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12604327
COMMUNICATION DEVICE AND COMMUNICATION METHOD
2y 5m to grant Granted Apr 14, 2026
Patent 12598044
PDCCH MONITORING METHOD, PDCCH SENDING METHOD, AND RELATED DEVICE
2y 5m to grant Granted Apr 07, 2026
Patent 12598026
SENSING METHOD AND COMMUNICATION APPARATUS
2y 5m to grant Granted Apr 07, 2026
Patent 12592805
COMMUNICATION METHOD AND APPARATUS
2y 5m to grant Granted Mar 31, 2026
Patent 12588033
RESOURCE TRANSMISSION METHOD, RESOURCE TRANSMISSION APPARATUS, AND COMMUNICATIONS DEVICE
2y 5m to grant Granted Mar 24, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
92%
Grant Probability
89%
With Interview (-2.7%)
2y 5m
Median Time to Grant
Low
PTA Risk
Based on 634 resolved cases by this examiner. Grant probability derived from career allow rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month