Prosecution Insights
Last updated: July 17, 2026
Application No. 18/055,610

System and Method for Travel Time Estimation in Real-Time

Final Rejection §102§103
Filed
Nov 15, 2022
Examiner
MILLER, PRESTON JAY
Art Unit
3661
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
Robert Bosch GmbH
OA Round
4 (Final)
56%
Grant Probability
Moderate
5-6
OA Rounds
0m
Est. Remaining
81%
With Interview

Examiner Intelligence

Grants 56% of resolved cases
56%
Career Allowance Rate
35 granted / 63 resolved
+3.6% vs TC avg
Strong +26% interview lift
Without
With
+25.8%
Interview Lift
resolved cases with interview
Typical timeline
3y 0m
Avg Prosecution
25 currently pending
Career history
94
Total Applications
across all art units

Statute-Specific Performance

§101
5.1%
-34.9% vs TC avg
§103
88.7%
+48.7% vs TC avg
§102
2.7%
-37.3% vs TC avg
§112
3.5%
-36.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 63 resolved cases

Office Action

§102 §103
DETAILED ACTION Notice of Pre-AIA or AIA Status 1. The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Status of Claims 2. This office action is in response to Amendments and Remarks filed on 01/27/2026 for application number 18/055,610 filed on 11/15/2022, in which claims 1-20 were previously presented for examination. 3. Claim(s) 23-29 has/have been previously added as new, claim(s) 1, 7, and 14-20 has/have been previously canceled, and claim(s) 3-6, 8, 10-13 and 23 has/have been amended. Accordingly, claim(s) 2-6, 8-13, and 21-29 is/are currently pending. Priority 4. Acknowledgment is made that applicant has not claimed any foreign or domestic priority. Prior Art of Record 5. The Examiner has cited particular paragraphs or columns and line numbers in the references applied to the claims above for the convenience of the applicant. Although the specified citations are representative of the teachings of the art and are applied to specific limitations within the individual claim, other passages and figures may apply as well. It is respectfully requested of the applicant in preparing responses, to fully consider the references in their entirety as potentially teaching all or part of the claimed invention, as well as the context of the passage as taught by the prior art or disclosed by the Examiner. The prompt development of a clear issue requires that the replies of the Applicant meet the objections to and rejections of the claims. Applicant should also specifically point out the support for any amendments made to the disclosure (see MPEP §2163.06). Applicant is reminded that the Examiner is entitled to give the Broadest Reasonable Interpretation (BRI) of the language of the claims. Furthermore, the Examiner is not limited to Applicant’s definition which is not specifically set forth in the claims. SEE MPEP 2141.02 [R-07.2015] VI. PRIOR ART MUST BE CONSIDERED IN ITS ENTIRETY, INCLUDING DISCLOSURES THAT TEACH AWAY FROM THE CLAIMS: A prior art reference must be considered in its entirety, i.e., as a whole, including portions that would lead away from the claimed invention. W.L. Gore & Associates, Inc. v. Garlock, Inc., 721 F.2d 1540, 220 USPQ 303 (Fed. Cir. 1983), cert, denied, 469 U.S. 851 (1984). See also MPEP §2123. Response to Arguments 6. Applicant's arguments filed 01/27/2026 have been fully considered but they are not persuasive. Claim Rejections - 35 USC § 102 7. Applicant argues the amended claim(s) 23 is/are allowable over Nadeem et al. (US-20110156924-A1). Applicant continues, Independent claim 23 recites, inter alia, “generating, via a first wireless transceiver, first communication data upon performing packet sniffing with respect to a mobile communication device that is communicating at the first location, the first communication data including at least (i) a first set of a plurality of timestamp data corresponding to a first set of a plurality of packets communicated by the mobile communication device to timestamp each packet and (ii) identification data of the mobile communication device; generating, via a second wireless transceiver, second communication data upon performing packet sniffing with respect to the mobile communication device that is communicating at the second location, the second communication data including at least (i) a second set of a plurality of timestamp data corresponding to a second set of a plurality of packets communicated by the mobile communication device to timestamp each packet and (ii) the identification data of the mobile communication device;.... generating, via the computer server, travel time data for the mobile communication device with respect to a travel segment defined between the first location and the second location using the first communication data corresponding to the first set of the plurality of packets and the second communication data corresponding to the second set of the plurality of packets; generating aggregated travel time data for the travel segment, the aggregated travel time data including at least the travel time data of the mobile communication device for the travel segment and other travel time data of one or more other mobile communication devices for the travel segment...” These claim features enhance the accuracy and robustness of travel time estimation. For example, the claims indicate that a plurality of timestamp data is derived from a plurality of packets, thereby allowing for more robust and accurate time determinations (e.g., by taking a median, average, or selecting based on other criteria from a collection of packets). Nadeem does not disclose at least these features, as recited. In contrast, Nadeem consistently refers to a single timestamp in association with a single message. For example, at paragraph [0066], which is cited in the rejection, Nadeem discloses that "the central system 215 receives a message from a first roadside unit, for instance unit 206 with a time stamp t1 and a BT ID related to a vehicle which may be called ID_Veh_a and similarly “the central system 215 also receives a message from a second roadside unit, for instance from unit 205 with a timestamp t2 and the BT ID related to the vehicle with ID id_Veh_a.” That is, Nadeem does not disclose a plurality of timestamps corresponding to plurality of packets, as recited in the claims. Also, Nadeem does not disclose packet sniffing with respect to a set of a plurality of packets from a mobile communication device at a given location and then processing that set of the plurality of packets to generate a corresponding set of a plurality of timestamp data. Rather, Nadeem relates to an active inquiry-response system where the roadside unit prompts for a response message by sending an “inquiry message” and then timestamps the single, solicited response message that the roadside unit receives back. See Nadeem at paragraphs [0008], [0053], [0064], and [0085], as well as Nadeem's claims. Nadeem's active, protocol-specific discovery method is different from a passive packet sniffing framework. 8. However, Nadeem in paragraph [0087] states: A roadside system, especially along a busy road, detects multiple Bluetooth devices related to multiple vehicles and timestamp and sends multiple messages with an identifier for each of the Bluetooth device carrying vehicles. Preferably, the roadside system transmits a timestamped message related to a Bluetooth device carrying vehicle to the central system, before the vehicle is detected by the next roadside system. That is, Nadeem suggests multiple messages are sent for each of the Bluetooth device carrying vehicles. Since each message is timestamped, multiple messages for each of the Bluetooth device carrying vehicles is a plurality of timestamps corresponding to plurality of packets, as recited by the amended claims. In regard to passive packet sniffing framework, if the Applicant believes this feature to be a crucial part of their application and they have support for it in their specification, the Examiner strongly encourages them to amend such a feature into the claims, rather than arguing for features the claims simply do not reflect. 9. As such, this argument is unpersuasive. 10. Applicant argues independent claim(s) 8 has/have been amended similar to independent claim 23 and it/they is/are allowable for reasons similar to those presented in favor of patentability of claim 23. 11. This argument is unpersuasive as each independent claim has been fully rejected and for the reasons given above. 12. Applicant argues dependent claim(s) is/are patentable by the virtue of their dependency on one of the independent claims and the additional features recited in the dependent claims. 13. This argument is unpersuasive as each independent claim and dependent claim has been fully rejected and for the reasons given above. Claim Rejections - 35 USC § 102 14. 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. (a)(2) the claimed invention was described in a patent issued under section 151, or in an application for patent published or deemed published under section 122(b), in which the patent or application, as the case may be, names another inventor and was effectively filed before the effective filing date of the claimed invention. 15. Claim(s) 2, 8-9, 23-24, and 27 is/are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Nadeem et al. (US-20110156924-A1). In regards to claim 2 , Nadeem discloses the computer-implemented method of claim 23, wherein the identification data is based on a media access control (MAC) address associated with the mobile communication device. (Nadeem in at least [0059] and [0061] discloses a Traffic Controller (TC) 210 has memory to store data, such as a MAC address or similar ID data derived from data that has been transmitted by a BT device in a vehicle in a discoverable mode.) In regards to claim 8 , Nadeem discloses a system comprising: (Nadeem in at least [0088] discloses the system and methods for determination of a travel time of a single vehicle.) a first wireless transceiver assigned to a first location and setup to perform packet sniffing at the first location, the first wireless transceiver being configured to generate first communication data upon performing packet sniffing with respect to a mobile communication device that is communicating at the first location, the first communication data including at least (i) a first set of a plurality timestamp data corresponding to a first set of a plurality of packets communicated by the mobile communication device such that each packet is timestamped and (ii) identification data of the mobile communication device; (Nadeem in at least Fig. 2, [0055], [0066], and [0087] discloses a receiver is a sniffer or a sniffer-like receiver [i.e., first wireless transceiver] that is enabled to detect identifying properties of a transmitter such as a Bluetooth transmitter [i.e., a mobile communication device]. The central system 215 receives a message [i.e., first communication data] from a first roadside unit [i.e., at the first location], for instance unit 206 with a time stamp t1 [i.e., first set of a plurality timestamp data] and a BT ID [i.e., identification data] related to a vehicle. A roadside system, especially along a busy road, detects multiple Bluetooth devices related to multiple vehicles and timestamp and sends multiple messages with an identifier for each of the Bluetooth device carrying vehicles. Preferably, the roadside system transmits a timestamped message related to a Bluetooth device carrying vehicle to the central system, before the vehicle is detected by the next roadside system. Examiner notes, as mentioned above, Nadeem suggests multiple messages are sent for each of the Bluetooth device carrying vehicles. Since each message is timestamped, multiple messages for each of the Bluetooth device carrying vehicles is a first set of a plurality timestamp data corresponding to a first set of a plurality of packets.) a second wireless transceiver set up to perform packet sniffing at a second location, the second wireless transceiver being configured to generate second communication data upon performing packet sniffing with respect to the mobile communication device at the second location, the second communication data including at least (i) a second set of a plurality of timestamp data corresponding to a second set of a plurality of packets communicated by the mobile communication device to timestamp each packet and (ii) identification data of the mobile communication device; and (Nadeem in at least Fig. 2, [0055], [0066], and [0087] discloses a receiver is a sniffer or a sniffer-like receiver [i.e., second wireless transceiver] that is enabled to detect identifying properties of a transmitter such as a Bluetooth transmitter [i.e., the mobile communication device]. The central system 215 also receives a message [i.e., second communication data] from a second roadside unit [i.e., at the second location], for instance from unit 205 with a time stamp t2 [i.e., second set of a plurality of timestamp data] and the BT ID [i.e., identification data] related to the vehicle. A roadside system, especially along a busy road, detects multiple Bluetooth devices related to multiple vehicles and timestamp and sends multiple messages with an identifier for each of the Bluetooth device carrying vehicles. Preferably, the roadside system transmits a timestamped message related to a Bluetooth device carrying vehicle to the central system, before the vehicle is detected by the next roadside system. Examiner notes, as mentioned above, Nadeem suggests multiple messages are sent for each of the Bluetooth device carrying vehicles. Since each message is timestamped, multiple messages for each of the Bluetooth device carrying vehicles is a second set of a plurality of timestamp data corresponding to a second set of a plurality of packets.) a computer server in data communication with the first wireless transceiver and the second wireless transceiver, the computer server being configured to perform a method that includes: (Nadeem in at least [0085] discloses the remote system will send the collected information to a central system [i.e., remote server]. The central system, based on the collected information from multiple remote or roadside systems, is able to track vehicles for instance traveling between intersections and to calculate travel times between remote systems.) storing the first communication data from the first wireless transceiver in a database system; (Nadeem in at least [0081] discloses the Bluetooth signal [i.e., first communication data] that is received by a system is processed by the system and is stored [i.e., stored in a database] or buffered to be combined with additional data such as a timestamp and a location stamp to be forwarded to the outside world such as another system. The same happens at the second system. It is left to the central system to match the messages from first and second system.) storing the second communication data from the second wireless transceiver in the database system; (Nadeem in at least [0081] discloses the Bluetooth signal [i.e., second communication data] that is received by a system is processed by the system and is stored [i.e., stored in a database] or buffered to be combined with additional data such as a timestamp and a location stamp to be forwarded to the outside world such as another system. The same happens at the second system. It is left to the central system to match the messages from first and second system.) extracting the first communication data and the second communication data via the identification data of the mobile communication device; (Nadeem in at least [0085] discloses the remote system will send the collected information to a central system. The central system, based on the collected information from multiple remote or roadside systems, is able to track vehicles for instance traveling between intersections and to calculate travel times between remote systems. Calculating travel time based on the collected information necessarily requires extracting the first communication data and the second communication data.) generating travel time data for the mobile communication device with respect to a travel segment defined between the first location and the second location using the first communication data corresponding to the first set of the plurality of packets and the second communication data corresponding to the second set of the plurality of packets; (Nadeem in at least [0069] discloses the central system [i.e., computer server] determines the travel time between the two roadside units. Based on the geographical location of these units [i.e., travel segment defined between the first location and the second location] and their known distance the system 215 also determines an average speed of the vehicle between the two roadside locations of the units 205 and 206.) generating aggregated travel time data for the travel segment, the aggregated travel time data including at least the travel time data of the mobile communication device for the travel segment and other travel time data of one or more other mobile communication devices for the travel segment; and (Nadeem in at least [0069] discloses the central system determines the travel time [i.e., aggregated travel time data for the travel segment] between the two roadside units. Based on the geographical location of these units and their known distance the system 215 also determines an average speed of the vehicle between the two roadside locations of the units 205 and 206.) transmitting the aggregated travel time data for visual representation on display technology in response to a request for the aggregated travel time data. (Nadeem in at least Fig. 3 and [0089] discloses the processor has a communication port 1207 to communicate with a network. An instruction set or program is stored in a memory 1202 for executing the methods. The instruction set is provided and combined with the data in a processor 1203, which processes the instructions of 1202 applied to the data of 1201. Any signal resulting from the processor is outputted on a device 1204. Such a device for instance is a display [i.e., display technology]. Such a device is a communication device to transmit output data on a communication channel.) In regards to claim 9 , Nadeem discloses the system of claim 8. Claim 9 recites a system having substantially the same features of claim 2 above, therefore claim 9 is rejected for the same reasons as claim 2. In regards to claim 23 , Nadeem discloses a computer-implemented method comprising: (Nadeem in at least [0088] discloses the system and methods for determination of a travel time of a single vehicle.) generating, via a first wireless transceiver, first communication data upon performing packet sniffing with respect to a mobile communication device that is communicating at the first location, the first communication data including at least (i) a first set of a plurality of timestamp data corresponding to a first set of a plurality of packets communicated by the mobile communication device to timestamp each packet and (ii) identification data of the mobile communication device; (Nadeem in at least Fig. 2, [0055] and [0066] discloses a receiver is a sniffer or a sniffer-like receiver [i.e., first wireless transceiver] that is enabled to detect identifying properties of a transmitter such as a Bluetooth transmitter [i.e., a mobile communication device]. The central system 215 receives a message [i.e., first communication data] from a first roadside unit [i.e., at the first location], for instance unit 206 with a time stamp t1 [i.e., first set of a plurality of timestamp data] and a BT ID [i.e., identification data] related to a vehicle. A roadside system, especially along a busy road, detects multiple Bluetooth devices related to multiple vehicles and timestamp and sends multiple messages with an identifier for each of the Bluetooth device carrying vehicles. Preferably, the roadside system transmits a timestamped message related to a Bluetooth device carrying vehicle to the central system, before the vehicle is detected by the next roadside system. Examiner notes, as mentioned above, Nadeem suggests multiple messages are sent for each of the Bluetooth device carrying vehicles. Since each message is timestamped, multiple messages for each of the Bluetooth device carrying vehicles is a first set of a plurality timestamp data corresponding to a first set of a plurality of packets.) generating, via a second wireless transceiver, second communication data upon performing packet sniffing with respect to the mobile commination device that is communicating at the second location, the second communication data including at least (i) a second set of a plurality of timestamp data corresponding to a second set of a plurality of packets communicated by the mobile connumeration device to timestamp each packet and (ii) the identification data of the mobile connumeration device; (Nadeem in at least Fig. 2, [0055] and [0066] discloses a receiver is a sniffer or a sniffer-like receiver [i.e., second wireless transceiver] that is enabled to detect identifying properties of a transmitter such as a Bluetooth transmitter [i.e., the mobile communication device]. The central system 215 also receives a message [i.e., second communication data] from a second roadside unit [i.e., at the second location], for instance from unit 205 with a time stamp t2 [i.e., second set of a plurality of timestamp data] and the BT ID [i.e., identification data] related to the vehicle. A roadside system, especially along a busy road, detects multiple Bluetooth devices related to multiple vehicles and timestamp and sends multiple messages with an identifier for each of the Bluetooth device carrying vehicles. Preferably, the roadside system transmits a timestamped message related to a Bluetooth device carrying vehicle to the central system, before the vehicle is detected by the next roadside system. Examiner notes, as mentioned above, Nadeem suggests multiple messages are sent for each of the Bluetooth device carrying vehicles. Since each message is timestamped, multiple messages for each of the Bluetooth device carrying vehicles is a second set of a plurality of timestamp data corresponding to a second set of a plurality of packets.) storing the first communication data from the first wireless transceiver in a database system; (Nadeem in at least [0081] discloses the Bluetooth signal [i.e., first communication data] that is received by a system is processed by the system and is stored [i.e., stored in a database] or buffered to be combined with additional data such as a timestamp and a location stamp to be forwarded to the outside world such as another system. The same happens at the second system. It is left to the central system to match the messages from first and second system.) storing the second communication data from the second wireless transceiver in the database system; (Nadeem in at least [0081] discloses the Bluetooth signal [i.e., second communication data] that is received by a system is processed by the system and is stored [i.e., stored in a database] or buffered to be combined with additional data such as a timestamp and a location stamp to be forwarded to the outside world such as another system. The same happens at the second system. It is left to the central system to match the messages from first and second system.) extracting, via a computer server, the first connumeration data and the second communicating data via the identification data of the mobile communication device; (Nadeem in at least [0085] discloses the remote system will send the collected information to a central system. The central system, based on the collected information from multiple remote or roadside systems, is able to track vehicles for instance traveling between intersections and to calculate travel times between remote systems. Calculating travel time based on the collected information necessarily requires extracting the first communication data and the second communication data.) generating, via the computer server, travel time data for the mobile communication device with respect to a travel segment defined between the first location and the second location using the first communication data corresponding to the first set of the plurality of packets and the second communication data corresponding to the second set of the plurality of packets; (Nadeem in at least [0069] discloses the central system [i.e., computer server] determines the travel time between the two roadside units. Based on the geographical location of these units [i.e., travel segment defined between the first location and the second location] and their known distance the system 215 also determines an average speed of the vehicle between the two roadside locations of the units 205 and 206.) generating aggregated travel time data for the travel segment, the aggregated travel time data including at least the travel time data of the mobile communication device for the travel segment and other travel time data of one or more other mobile communication devices for the travel segment; and (Nadeem in at least [0069] discloses the central system determines the travel time [i.e., aggregated travel time data for the travel segment] between the two roadside units. Based on the geographical location of these units and their known distance the system 215 also determines an average speed of the vehicle between the two roadside locations of the units 205 and 206.) transmitting the aggregated travel time data for visual presentation on display technology in response to a request for the aggregated travel time data, (Nadeem in at least Fig. 3 and [0089] discloses the processor has a communication port 1207 to communicate with a network. An instruction set or program is stored in a memory 1202 for executing the methods. The instruction set is provided and combined with the data in a processor 1203, which processes the instructions of 1202 applied to the data of 1201. Any signal resulting from the processor is outputted on a device 1204. Such a device for instance is a display [i.e., display technology]. Such a device is a communication device to transmit output data on a communication channel.) wherein, the first wireless transceiver is assigned to the first location and setup to perform packet sniffing at the first location; (Nadeem in at least Fig. 2, [0055] and [0066] discloses a receiver is a sniffer or a sniffer-like receiver [i.e., first wireless transceiver] that is enabled to detect identifying properties of a transmitter such as a Bluetooth transmitter. The central system 215 receives a message from a first roadside unit [i.e., at the first location], for instance unit 206 with a time stamp t1 and a BT ID related to a vehicle.) the second wireless transceiver is assigned to the second location and setup to perform packet sniffing at the second location. (Nadeem in at least Fig. 2, [0055] and [0066] discloses a receiver is a sniffer or a sniffer-like receiver [i.e., second wireless transceiver] that is enabled to detect identifying properties of a transmitter such as a Bluetooth transmitter. The central system 215 also receives a message from a second roadside unit [i.e., at the second location], for instance from unit 205 with a time stamp t2 and the BT ID related to the vehicle.) In regards to claim 24 , Nadeem discloses the computer-implemented method of claim 23, the first wireless transceiver includes one or more radio frequency transceivers and one or more chipsets to at least generate the first communication data via packet sniffing; and (Nadeem in at least [0051], [0055] and [0066] discloses Bluetooth is a wireless standard and a communications protocol utilizing a 2.4 GHz radio spectrum. A receiver is a sniffer or a sniffer-like receiver [i.e., first wireless transceiver] that is enabled to detect identifying properties of a transmitter such as a Bluetooth transmitter. The sniffer of the first roadside unit necessarily requires a chipset to generate the data.) the second wireless transceiver includes one or more radio frequency transceivers and one or more chipsets to at least generate the second communication data via packet sniffing. (Nadeem in at least [0051], [0055] and [0066] discloses Bluetooth is a wireless standard and a communications protocol utilizing a 2.4 GHz radio spectrum. A receiver is a sniffer or a sniffer-like receiver [i.e., second wireless transceiver] that is enabled to detect identifying properties of a transmitter such as a Bluetooth transmitter. The sniffer of the second roadside unit necessarily requires a chipset to generate the data.) In regards to claim 27 , Nadeem, discloses the system of claim 8. Claim 27 recites a system having substantially the same features of claim 24 above, therefore claim 27 is rejected for the same reasons as claim 24. Claim Rejections - 35 USC § 103 16. 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. 17. Claim(s) 3, 10, and 21-22 is/are rejected under 35 U.S.C. 103 as being unpatentable over Nadeem et al. (US-20110156924-A1) in view of Nekoui et al. (US-20230152471-A1). In regards to claim 3 , Nadeem discloses the computer-implemented method of claim 23, accordingly the rejection of claim 23 is incorporated. Further, Nadeem discloses wherein: the first communication data includes at least (a) the first location data of the first location, (b) the identification data of the mobile communication device location, (c) the first set of the plurality of timestamp data respectively corresponding to the first set of the plurality of packets (Nadeem in at least Fig. 2, [0066] & [0087] discloses the central system 215 receives a message [i.e., first communication data] from a first roadside unit, for instance unit 206 with a time stamp t1 [i.e., first set of the plurality of timestamp data] and a BT ID [i.e., identification data] related to a vehicle. A roadside system, especially along a busy road, detects multiple Bluetooth devices related to multiple vehicles and timestamp and sends multiple messages with an identifier for each of the Bluetooth device carrying vehicles. Preferably, the roadside system transmits a timestamped message related to a Bluetooth device carrying vehicle to the central system, before the vehicle is detected by the next roadside system. Examiner notes, as mentioned above, Nadeem suggests multiple messages are sent for each of the Bluetooth device carrying vehicles. Since each message is timestamped, multiple messages for each of the Bluetooth device carrying vehicles is a first set of a plurality timestamp data corresponding to a first set of a plurality of packets.), the second communication data includes at least (a) the second location data of the second location, (b) the identification data of the mobile communication device, (c) the second set of the plurality of timestamp data respectively corresponding to the second set of the plurality of packets (Nadeem in at least Fig. 2 and [0066] & [0087] discloses the central system 215 also receives a message [i.e., second communication data] from a second roadside unit [i.e., at the second location], for instance from unit 205 with a time stamp t2 [i.e., the second set of the plurality of timestamp data] and the BT ID [i.e., identification data] related to the vehicle. A roadside system, especially along a busy road, detects multiple Bluetooth devices related to multiple vehicles and timestamp and sends multiple messages with an identifier for each of the Bluetooth device carrying vehicles. Preferably, the roadside system transmits a timestamped message related to a Bluetooth device carrying vehicle to the central system, before the vehicle is detected by the next roadside system. Examiner notes, as mentioned above, Nadeem suggests multiple messages are sent for each of the Bluetooth device carrying vehicles. Since each message is timestamped, multiple messages for each of the Bluetooth device carrying vehicles is a second set of a plurality of timestamp data corresponding to a second set of a plurality of packets.), Nadeem is silent on (d) a first set of received signal strength data respectively corresponding to the first set of the plurality of packets; (d) a second set of received signal strength data respectively corresponding to the second set of the plurality of packets. However, Nekoui teaches (d) a first set of received signal strength data respectively corresponding to the first set of the plurality of packets; (Nekoui in at least Fig. 9, [0079]-[0081] teaches remote vehicles (RVs) 904 estimate a location of host vehicle (HV) 902 using a Received Signal Strength Indicator [i.e., first set of received signal strength] which is the received signal strength data respectively corresponding to the first set of the plurality of packets.) (d) a second set of received signal strength data respectively corresponding to the second set of the plurality of packets. ([Nekoui in at least Fig. 9, [0079]-[0081] teaches remote vehicles (RVs) 904 estimate a location of host vehicle (HV) 902 using a Received Signal Strength Indicator which is the received signal strength data respectively corresponding to the second set of the plurality of packets.) It would have been obvious to one of ordinary skill in the art before the effective filing date of the application to modify Nadeem in view of Nekoui with a reasonable expectation of success, as both inventions are directed to the same field of endeavor -- communication systems -- and include the received signal strength indicator with the data and the combination would provide for determining whether time reporting by the navigation system is correct (Nekoui, see at least [0005]). In regards to claim 10 , Nadeem discloses the system of claim 8. Claim 10 recites a system having substantially the same features of claim 3 above, therefore claim 10 is rejected for the same reasons as claim 3. In regards to claim 21 , Nadeem discloses the computer-implemented method of claim 23, accordingly the rejection of claim 23 is incorporated. Nadeem is silent on further comprising: generating a hash code by hashing the identification data associated with the mobile communication device, wherein the first communication data and the second communication data are extracted using the hash code. However, Nekoui teaches generating a hash code by hashing the identification data associated with the mobile communication device, (Nekoui in at least [0064] teaches similar to the functionality described in connection with the transmission by device 310, the controller/processor 359 provides RRC layer functionality associated with system information acquisition, RRC connections, and measurement reporting; PDCP layer functionality associated with header compression / decompression, and security (ciphering [i.e., generating a hash code], deciphering, integrity protection, integrity verification); RLC layer functionality associated with the transfer of upper layer PDUs, error correction through ARQ, concatenation, segmentation, and reassembly of RLC SDUs, re-segmentation of RLC data PDUs, and reordering of RLC data PDUs; and MAC layer functionality associated with mapping between logical channels and transport channels, multiplexing of MAC SDUs onto TBs, demultiplexing of MAC SDUs from TBs, scheduling information reporting, error correction through HARQ, priority handling, and logical channel prioritization.) wherein the first communication data and the second communication data are extracted using the hash code. (Nekoui in at least [0064] teaches similar to the functionality described in connection with the transmission by device 310, the controller/processor 359 provides RRC layer functionality associated with system information acquisition, RRC connections, and measurement reporting; PDCP layer functionality associated with header compression / decompression, and security (ciphering, deciphering [i.e., extracting using the hash code], integrity protection, integrity verification); RLC layer functionality associated with the transfer of upper layer PDUs, error correction through ARQ, concatenation, segmentation, and reassembly of RLC SDUs, re-segmentation of RLC data PDUs, and reordering of RLC data PDUs; and MAC layer functionality associated with mapping between logical channels and transport channels, multiplexing of MAC SDUs onto TBs, demultiplexing of MAC SDUs from TBs, scheduling information reporting, error correction through HARQ, priority handling, and logical channel prioritization.) It would have been obvious to one of ordinary skill in the art before the effective filing date of the application to modify Nadeem in view of Nekoui with a reasonable expectation of success, as both inventions are directed to the same field of endeavor -- communication systems -- and use ciphering/deciphering on the data and the combination would provide for keeping the communication data safe and secure. In regards to claim 22 , Nadeem discloses the system of claim 8. Claim 22 recites a system having substantially the same features of claim 21 above, therefore claim 22 is rejected for the same reasons as claim 21. 18. Claim(s) 4 and 11 is/are rejected under 35 U.S.C. 103 as being unpatentable over Nadeem et al. (US-20110156924-A1) in view of Nekoui et al. (US-20230152471-A1) and further in view of Brinig et al. (US-20160232719-A1). In regards to claim 4 , Nadeem, as modified by Nekoui, teaches the computer-implemented method of claim 3, accordingly the rejection of claim 3 is incorporated. Further, Nekoui teaches wherein the travel time data is generated based on a difference between the second (Nekoui in at least Fig. 13 and [0095] teaches at block 1304, the process 1300 includes determining a navigation system time difference based on the navigation timestamp information at the first instance and the second instance which is generating travel time data.) Nadeem, as modified by Nekoui, does not teach computing a first median timestep based on the first set of timestamp data corresponding to the first set of the plurality of packets transmitted by the mobile communication device at the first location, and computing a second median timestamp based on the second set of timestamp data corresponding to the second set of the plurality of packets transmitted by the mobile communication device at the second location, However, Brinig teaches computing a first median timestep based on the first set of timestamp data corresponding to the first set of the plurality of packets transmitted by the mobile communication device at the first location, and (Brinig in at least [0014] and [0059] teaches the system can identify the set of location data points by determining which location data points (i) are within the first distance or first estimated travel time away from the pickup location, (ii) are within the second distance or second estimated travel time away from the pickup location, (iii) have timestamps between a first time [i.e., first set of the plurality of timestamp data] when the driver device was determined to be within the first distance or first estimated travel time away from the pickup location and a second time when the driver device was determined to be more than a second distance or second estimated travel time away from the pickup location, and/or (iv) are substantially identical or equal to each other. The location extrapolation determines an associated timestamp for the averaged location data point as one that is the median or averaged timestamp of the set.) computing a second median timestamp based on the second set of timestamp data corresponding to the second set of packets transmitted by the mobile communication device at the second location, (Brinig in at least [0014] and [0059] teaches the system can identify the set of location data points by determining which location data points (i) are within the first distance or first estimated travel time away from the pickup location, (ii) are within the second distance or second estimated travel time away from the pickup location, (iii) have timestamps between a first time when the driver device was determined to be within the first distance or first estimated travel time away from the pickup location and a second time [i.e., second set of the plurality of timestamp data] when the driver device was determined to be more than a second distance or second estimated travel time away from the pickup location, and/or (iv) are substantially identical or equal to each other. The location extrapolation determines an associated timestamp for the averaged location data point as one that is the median or averaged timestamp of the set.) It would have been obvious to one of ordinary skill in the art before the effective filing date of the application to modify Nadeem, as already modified by Nekoui, in view of Nekoui and Brinig with a reasonable expectation of success, as both inventions are directed to the same field of endeavor -- communication systems -- and use the median timestamp for generating the travel time and the combination would provide for determining whether time reporting by the navigation system is correct (Nekoui, see at least [0005]) and correcting inaccuracies in trip data while the trip is in progress (Brinig, see at least [0016]). In regards to claim 11 , Nadeem, as modified by Nekoui, teaches the system of claim 10. Claim 11 recites a system having substantially the same features of claim 4 above, therefore claim 11 is rejected for the same reasons as claim 4. 19. Claim(s) 5 and 12 is/are rejected under 35 U.S.C. 103 as being unpatentable over Nadeem et al. (US-20110156924-A1) in view of Nekoui et al. (US-20230152471-A1) and further in view of Neiger et al. (US-20170270790-A1). In regards to claim 5 , Nadeem, as modified by Nekoui, teaches the computer-implemented method of claim 3, accordingly the rejection of claim 3 is incorporated. Further, Nekoui teaches further comprising: wherein the travel time data is generated based on a difference between second time data and the first time data. (Nekoui in at least Fig. 13 and [0095] teaches at block 1304, the process 1300 includes determining a navigation system time difference based on the navigation timestamp information at the first instance and the second instance which is generating travel time data.) Nadeem, as modified by Nekoui, does not teach extracting first time data, the first time data being a last occurring timestamp from among the first set of the plurality of timestamp data; and extracting second time data, the second time data being a first occurring timestamp from among the second set of the plurality of timestamp data, However, Neiger teaches extracting first time data, the first time data being a last occurring timestamp from among the first set of the plurality of timestamp data; and (Neiger in at least [0132] teaches the departure time is determined from a linear interpolation using the location and timestamp of the last vehicle location record “at the stop” and the location and timestamp of the first vehicle location record that is immediately “after the stop” [i.e., last occurring timestamp]. As explained above, the last timestamp at a location and the first timestamp at the next location is used for calculating the departure time which encompasses extracting the last occurring timestamp from among the first set of the plurality of timestamp data and the first occurring timestamp from among the second set of the plurality of timestamp data.) extracting second time data, the second time data being a first occurring timestamp from among the second set of the plurality of timestamp data, (Neiger in at least [0132] teaches the departure time is determined from a linear interpolation using the location and timestamp of the last vehicle location record “at the stop” and the location and timestamp of the first vehicle location record that is immediately “after the stop” [i.e., last occurring timestamp]. As explained above, the last timestamp at a location and the first timestamp at the next location is used for calculating the departure time which encompasses extracting the last occurring timestamp from among the first set of the plurality of timestamp data and the first occurring timestamp from among the second set of the plurality of timestamp data.) It would have been obvious to one of ordinary skill in the art before the effective filing date of the application to modify Nadeem, as already modified by Nekoui, in view of Nekoui and Neiger with a reasonable expectation of success, as both inventions are directed to the same field of endeavor -- communication systems -- and use the timestamp immediately after the stop for generating the travel time and the combination would provide for determining whether time reporting by the navigation system is correct (Nekoui, see at least [0005]) and an improved system that more robustly provides real-time, accurate estimated arrival times for a transit vehicle (Neiger, see at least [0006]). In regards to claim 12 , Nadeem, as modified by Nekoui, teaches the system of claim 10. Claim 12 recites a system having substantially the same features of claim 5 above, therefore claim 12 is rejected for the same reasons as claim 5. 20. Claim(s) 6 and 13 is/are rejected under 35 U.S.C. 103 as being unpatentable over Nadeem et al. (US-20110156924-A1) in view of Nekoui et al. (US-20230152471-A1) and further in view of Rankin et al. (US-20190327579-A1). In regards to claim 6 , Nadeem, as modified by Nekoui, teaches the computer-implemented method of claim 3, accordingly the rejection of claim 3 is incorporated. Further, Nekoui teaches further comprising: wherein the travel time data is generated based on a difference between second time data and the first time data. (Nekoui in at least Fig. 13 and [0095] teaches at block 1304, the process 1300 includes determining a navigation system time difference based on the navigation timestamp information at the first instance and the second instance which is generating travel time data.) Nadeem, as modified by Nekoui, does not teach extracting first time data corresponding to a first identified packet from among the first set of the plurality of packets, the first identified packet communicated by the mobile communication device at the first location with a highest signal strength; and extracting second time data corresponding to a second identified packet from among the second set of the plurality of packets, the second identified packet communicated by the mobile communication device at the second location with a highest signal strength, However, Rankin teaches extracting first time data corresponding to a first identified packet from among the first set of the plurality of packets, the first identified packet communicated by the mobile communication device at the first location with a highest signal strength; and extracting second time data corresponding to a second identified packet from among the second set of the plurality of packets, the second identified packet communicated by the mobile communication device at the second location with a highest signal strength, (Rankin in at least abstract and [0079] teaches systems and methods for detecting and processing spatiotemporal data where the “first” signal is the first sufficiently strong signal over a period of time, and the “last” signal is the last sufficiently strong signal for a period of time. The “strongest” or “max” signal strength for a given detection is identified as the strongest signal that was received between a “first” signal and the corresponding “last” signal). It would have been obvious to one of ordinary skill in the art before the effective filing date of the application to modify Nadeem, as already modified by Nekoui, in view of Nekoui and Rankin with a reasonable expectation of success, as both inventions are directed to the same field of endeavor -- communication systems -- and use the “strongest” or “max” signal strength for a given detection for generating the travel time and the combination would provide for determining whether the first location estimate is accurate based on the second location estimate (Nekoui, see at least [0012]) and automated real-time processing of various spatiotemporal measures, such as wait time and dwell time (Rankin, see at least [0002]). In regards to claim 13 , Nadeem, as modified by Nekoui, teaches the system of claim 10. Claim 13 recites a system having substantially the same features of claim 6 above, therefore claim 13 is rejected for the same reasons as claim 6. 21. Claim(s) 25 and 28 is/are rejected under 35 U.S.C. 103 as being unpatentable over Nadeem et al. (US-20110156924-A1) in view of Yamaguchi (US-20240348706-A1). In regards to claim 25 , Nadeem discloses the computer-implemented method of claim 23, accordingly the rejection of claim 23 is incorporated. Nadeem is silent on wherein the first wireless transceiver and the second wireless transceiver are configured to communicate with the computer server via extensible messaging and presence protocol (XMPP), message queuing telemetry transport (MQTT), or ZeroMQ. However, Yamaguchi teaches wherein the first wireless transceiver and the second wireless transceiver are configured to communicate with the computer server via extensible messaging and presence protocol (XMPP), message queuing telemetry transport (MQTT),or ZeroMQ. (Yamaguchi in at least Fig. 2 and [0071] teaches communication module 206 of the server 200 transmits the traffic information, the information including surrounding topics, and the information regarding the server that are generated by the information generation unit 205 to the second communication module 106 of the client terminal 100, the second communication module 106 has a protocol stack including “MQTT” as the application layer, “TCP” as the transport layer, “IP” as the internet layer, and “WiFi” as the network interface layer.) It would have been obvious to one of ordinary skill in the art before the effective filing date of the application to modify Nadeem in view of Yamaguchi with a reasonable expectation of success, as both inventions are directed to the same field of endeavor -- communication systems -- and use message queuing telemetry transport (MQTT) for communicating with the server and the combination would provide for contributing to a cost reduction by selecting a server communication protocol suitable for various applications of a communication system for automatic driving (Yamaguchi, see at least [0011]). In regards to claim 28 , Nadeem discloses the system of claim 8. Claim 28 recites a system having substantially the same features of claim 25 above, therefore claim 28 is rejected for the same reasons as claim 25. 22. Claim(s) 26 and 29 is/are rejected under 35 U.S.C. 103 as being unpatentable over Nadeem et al. (US-20110156924-A1) in view of Reisinger (US-20240235712-A1). In regards to claim 26 , Nadeem discloses the method of claim 23, accordingly the rejection of claim 23 is incorporated. Nadeem is silent on further comprising: synchronizing a first clock of the first wireless transceiver based on the first location data; and synchronizing a second clock of the second wireless transceiver based on the second location data; However, Reisinger teaches synchronizing a first clock of the first wireless transceiver based on the first location data; and (Reisinger in at least Fig. 1 and [0036] teaches the individual transceiver units TRX [i.e., first wireless transceiver] is synchronized with the apparatus clock 8 [i.e., first clock] and hence works in the same apparatus time zone 9 [i.e., first location data]. Synchronizing based on the time zone is synchronizing based on the location.) synchronizing a second clock of the second wireless transceiver based on the second location data; (Reisinger in at least Fig. 1 and [0036] teaches the individual transceiver units TRX [i.e., second wireless transceiver] is synchronized with the apparatus clock 8 [i.e., second clock] and hence works in the same apparatus time zone 9 [i.e., second location data]. Synchronizing based on the time zone is synchronizing based on the location.) It would have been obvious to one of ordinary skill in the art before the effective filing date of the application to modify Nadeem in view of Reisinger with a reasonable expectation of success, as both inventions are directed to the same field of endeavor -- communication systems -- and synchronize the individual transceiver units with to work based on the time zone and the combination would provide for accurate time synchronization between the device unit and the individual transceiver units (Reisinger, see at least [0004]). In regards to claim 29 , Nadeem discloses the system of claim 8. Claim 29 recites a system having substantially the same features of claim 26 above, therefore claim 29 is rejected for the same reasons as claim 26. Conclusion 23. The prior art made of record and not relied upon is considered pertinent to applicant's disclosure: Alger et al. (US-20050037772-A1) teaches a method as well as a system for determining the travel time of at least one mobile user end device between a starting point and an end point that is spatially separated from it. Finkelstein et al. (US-20160366022-A1) teaches a method for determining the distance between the two network nodes using time of travel and a propagation velocity of signals transmitted through a transmission media via which the network nodes are connected. Resner et al. (US-20070035661-A1) teaches a display that can be programmed to display aggregate travel time. Non-patent Literature Janecek et al. “Cellular data meet vehicular traffic theory: location area updates and cell transitions for travel time estimation” teaches a method for determining vehicle travel times and road congestion inferred from anonymized signaling data collected from a cellular mobile network. Non-patent Literature Thiagarajan et al. “VTrack: accurate, energy-aware road traffic delay estimation using mobile phones” teaches a method for cellular triangulation using position samples from drivers’ phones to monitor traffic delays at a fine spatiotemporal granularity. Non-patent Literature Wan et al. “Mobile Crowd Sensing for Traffic Prediction in Internet of Vehicles” teaches a method for mobile crowd sensing technology to support the creation of dynamic route choices for drivers wishing to avoid congestion. Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to Preston J Miller whose telephone number is (703)756-1582. The examiner can normally be reached Monday through Friday 7:30 AM - 4:30 PM EST. 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, Ramya P Burgess can be reached on (571) 272-6011. 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. /P.J.M./Examiner, Art Unit 3661 /RAMYA P BURGESS/Supervisory Patent Examiner, Art Unit 3661
Read full office action

Prosecution Timeline

Show 1 earlier event
Oct 16, 2024
Non-Final Rejection mailed — §102, §103
Mar 17, 2025
Response Filed
Apr 25, 2025
Final Rejection mailed — §102, §103
Aug 25, 2025
Request for Continued Examination
Aug 29, 2025
Response after Non-Final Action
Oct 27, 2025
Non-Final Rejection mailed — §102, §103
Jan 27, 2026
Response Filed
Apr 09, 2026
Final Rejection mailed — §102, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12681491
METHOD AND SYSTEM FOR AUTONOMOUS EXPLORATION AND SCANNING
1y 7m to grant Granted Jul 14, 2026
Patent 12670679
OPTICAL ALIGNMENT METHOD AND SYSTEM FOR TRANSPARENT DISPLAYS TO OVERCOME PARALLAX
2y 5m to grant Granted Jun 30, 2026
Patent 12663795
A SYSTEM FOR COLLISION PREVENTION
3y 11m to grant Granted Jun 23, 2026
Patent 12662112
DRIVING ASSISTANCE DEVICE, DRIVING ASSISTANCE METHOD, AND STORAGE MEDIUM
3y 4m to grant Granted Jun 23, 2026
Patent 12663329
METHOD AND SYSTEM FOR ESTIMATION OF MASS AND A CENTER OF GRAVITY OF A TRUCK-TRAILER
2y 1m to grant Granted Jun 23, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

5-6
Expected OA Rounds
56%
Grant Probability
81%
With Interview (+25.8%)
3y 0m (~0m remaining)
Median Time to Grant
High
PTA Risk
Based on 63 resolved cases by this examiner. Grant probability derived from career allowance 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