IP Library Granted Patent US 12,651,528
Granted Patent B1
US 12,651,528 · App. 18/780,578 · Granted Jun 9, 2026

Selective inclusion of data in transport protocol expert group frames

Inventors: Jeffrey Lee Littlejohn (Cincinnati, OH); Charles Kirkendall (Cincinnati, OH); Amit Deshpande (Cincinnati, OH)
Assignee: iHeartMedia Management Services, Inc.
G08G1/0125G08G1/091
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,651,528
App. No.
18/780,578
Granted
Jun 9, 2026
Kind
B1
Abstract

A method includes establishing a primary bounding area corresponding to a first geographic broadcast area of a traffic message, the primary bounding area associated with a first set of road classes; establishing a first sub-bounding area nested within the primary bounding area, the first sub-bounding area corresponding to a second geographic area smaller than the first geographic broadcast area, and being associated with a second set of road classes different than the first set of road classes. A traffic message associated with a road having an assigned road class is received, and the traffic message is inserted into a Transport Protocol Experts Group frame transmitted within the first sub-bounding area in response to determining that the road and the assigned road class are associated with either the first sub-bounding area or the primary bounding area.

Claims (60)

1 . A method, comprising:

establishing a primary bounding area corresponding to a first geographic broadcast area of a traffic message, the primary bounding area associated with a first set of road classes;

establishing a first sub-bounding area nested within the primary bounding area, the first sub-bounding area corresponding to a second geographic area smaller than the first geographic broadcast area, and being associated with a second set of road classes different than the first set of road classes;

receiving a traffic message associated with a road having an assigned road class; and

inserting the traffic message into a Transport Protocol Experts Group frame transmitted within the first sub-bounding area in response to determining that the road and the assigned road class are associated with either the first sub-bounding area or the primary bounding area.

2 . The method of claim 1 , further comprising:

establishing a second sub-bounding area nested within the primary bounding area and lying at least partially outside the first sub-bounding area, the second sub-bounding area corresponding to a third geographic area smaller than the first geographic broadcast area and being associated with a third set of road classes different than the first set of road classes; and

inserting the traffic message into a first Transport Protocol Experts Group frame transmitted within the first sub-bounding area and into a second Transport Protocol Experts Group frame transmitted within the second sub-bounding area in response to determining that the road and the assigned road class are associated with both the first sub-bounding area and the second sub-bounding area.

3 . The method of claim 1 , further comprising:

establishing a plurality of sub-bounding areas nested within the primary bounding area, wherein each of the plurality of sub-bounding areas are associated with sets of road classes that exclude at least one road class included in the first set of road classes; and

inserting the traffic message into Transport Protocol Experts Group frames transmitted within each of the plurality of sub-bounding areas in response to determining that the road and the assigned road class are included in the first set of road classes.

4 . The method of claim 3 , further comprising:

using information indicating a geographic location of the road to determine whether the road is associated with the plurality of sub-bounding areas.

5 . The method of claim 1 , further comprising:

excluding the traffic message from a particular Transport Protocol Experts Group frame being transmitted throughout the primary bounding area in response to determining that the road or the assigned road class are not associated with the primary bounding area, even if the road and the assigned road class are associated with the first sub-bounding area.

6 . The method of claim 1 , further comprising:

determining that the road is not associated with the first sub-bounding area in response to the traffic message being associated with a portion of the road located outside the first sub-bounding area.

7 . The method of claim 1 , further comprising:

obtaining traffic incident data from the traffic message; and

wherein inserting the traffic message into a Transport Protocol Experts Group frame includes inserting at least a portion of the traffic incident data into the Transport Protocol Experts Group frame.

8 . A processing device, comprising:

a memory configured to store a program of instructions; and

a processor coupled to the memory, the processor configured to execute the program of instructions to

establish a primary bounding area corresponding to a first geographic broadcast area of a traffic message, the primary bounding area associated with a first set of road classes;

establish a first sub-bounding area nested within the primary bounding area, the first sub-bounding area corresponding to a second geographic area smaller than the first geographic broadcast area, and being associated with a second set of road classes different than the first set of road classes;

receive a traffic message associated with a road having an assigned road class; and

insert the traffic message into a Transport Protocol Experts Group frame transmitted within the first sub-bounding area in response to determining that the road and the assigned road class are associated with either the first sub-bounding area or the primary bounding area.

9 . The processing device of claim 8 , wherein the processor configured to execute the program of instructions to:

establish a second sub-bounding area nested within the primary bounding area and lying at least partially outside the first sub-bounding area, the second sub-bounding area corresponding to a third geographic area smaller than the first geographic broadcast area and being associated with a third set of road classes different than the first set of road classes; and

insert the traffic message into a first Transport Protocol Experts Group frame transmitted within the first sub-bounding area and into a second Transport Protocol Experts Group frame transmitted within the second sub-bounding area in response to determining that the road and the assigned road class are associated with both the first sub-bounding area and the second sub-bounding area.

10 . The processing device of claim 8 , wherein the processor configured to execute the program of instructions to:

establish a plurality of sub-bounding areas nested within the primary bounding area, wherein each of the plurality of sub-bounding areas are associated with sets of road classes that exclude at least one road class included in the first set of road classes; and

insert the traffic message into Transport Protocol Experts Group frames transmitted within each of the plurality of sub-bounding areas in response to determining that the road and the assigned road class are included in the first set of road classes.

11 . The processing device of claim 10 , wherein the processor configured to execute the program of instructions to:

use information indicating a geographic location of the road to determine whether the road is associated with the plurality of sub-bounding areas.

12 . The processing device of claim 8 , wherein the processor configured to execute the program of instructions to:

exclude the traffic message from a particular Transport Protocol Experts Group frame being transmitted throughout the primary bounding area in response to determining that the road or the assigned road class are not associated with the primary bounding area, even if the road and the assigned road class are associated with the first sub-bounding area.

13 . The processing device of claim 8 , wherein the processor configured to execute the program of instructions to:

determine that the road is not associated with the first sub-bounding area in response to the traffic message being associated with a portion of the road located outside the first sub-bounding area.

14 . The processing device of claim 8 , wherein the processor configured to execute the program of instructions to:

obtain traffic incident data from the traffic message; and

wherein inserting the traffic message into a Transport Protocol Experts Group frame includes inserting at least a portion of the traffic incident data into the Transport Protocol Experts Group frame.

15 . A non-transitory computer readable medium, comprising:

at least one instruction to establish a primary bounding area corresponding to a first geographic broadcast area of a traffic message, the primary bounding area associated with a first set of road classes;

at least one instruction to establish a first sub-bounding area nested within the primary bounding area, the first sub-bounding area corresponding to a second geographic area smaller than the first geographic broadcast area, and being associated with a second set of road classes different than the first set of road classes;

at least one instruction to receive a traffic message associated with a road having an assigned road class; and

at least one instruction to insert the traffic message into a Transport Protocol Experts Group frame transmitted within the first sub-bounding area in response to determining that the road and the assigned road class are associated with either the first sub-bounding area or the primary bounding area.

16 . The non-transitory computer readable medium of claim 15 , further comprising:

at least one instruction to establish a second sub-bounding area nested within the primary bounding area and lying at least partially outside the first sub-bounding area, the second sub-bounding area corresponding to a third geographic area smaller than the first geographic broadcast area and being associated with a third set of road classes different than the first set of road classes; and

at least one instruction to insert the traffic message into a first Transport Protocol Experts Group frame transmitted within the first sub-bounding area and into a second Transport Protocol Experts Group frame transmitted within the second sub-bounding area in response to determining that the road and the assigned road class are associated with both the first sub-bounding area and the second sub-bounding area.

17 . The non-transitory computer readable medium of claim 15 , further comprising:

at least one instruction to establish a plurality of sub-bounding areas nested within the primary bounding area, wherein each of the plurality of sub-bounding areas are associated with sets of road classes that exclude at least one road class included in the first set of road classes; and

at least one instruction to insert the traffic message into Transport Protocol Experts Group frames transmitted within each of the plurality of sub-bounding areas in response to determining that the road and the assigned road class are included in the first set of road classes.

18 . The non-transitory computer readable medium of claim 15 , further comprising:

at least one instruction to exclude the traffic message from a particular Transport Protocol Experts Group frame being transmitted throughout the primary bounding area in response to determining that the road or the assigned road class are not associated with the primary bounding area, even if the road and the assigned road class are associated with the first sub-bounding area.

19 . The non-transitory computer readable medium of claim 15 , further comprising:

at least one instruction to determine that the road is not associated with the first sub-bounding area in response to the traffic message being associated with a portion of the road located outside the first sub-bounding area.

20 . The non-transitory computer readable medium of claim 15 , further comprising:

at least one instruction to obtain traffic incident data from the traffic message; and

wherein inserting the traffic message into a Transport Protocol Experts Group frame includes inserting at least a portion of the traffic incident data into the Transport Protocol Experts Group frame.

Assignments (6)
PATENT SECURITY AGREEMENT Recorded Dec 29, 2024
From: IHEARTMEDIA MANAGEMENT SERVICES, INC.
To: BANK OF AMERICA, N.A.
Reel/Frame 069795/0912 →
PATENT SECURITY AGREEMENT Recorded Dec 28, 2024
From: IHEARTMEDIA MANAGEMENT SERVICES, INC.
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION
Reel/Frame 069793/0758 →
PATENT SECURITY AGREEMENT Recorded Dec 28, 2024
From: IHEARTMEDIA MANAGEMENT SERVICES, INC.
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION
Reel/Frame 069794/0248 →
PATENT SECURITY AGREEMENT Recorded Dec 27, 2024
From: IHEARTMEDIA MANAGEMENT SERVICES, INC.
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION
Reel/Frame 069792/0335 →
PATENT SECURITY AGREEMENT Recorded Dec 23, 2024
From: IHEARTMEDIA MANAGEMENT SERVICES, INC.
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION
Reel/Frame 069762/0453 →
PATENT SECURITY AGREEMENT Recorded Dec 22, 2024
From: IHEARTMEDIA MANAGEMENT SERVICES, INC.
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION
Reel/Frame 069752/0941 →
Continuity (7)
Continuation 18217700 · Jul 3, 2023
Continuation 17492762 · Oct 4, 2021
Continuation 16819312 · Mar 16, 2020
Continuation 16288822 · Feb 28, 2019
Continuation 16110539 · Aug 23, 2018
Continuation 15917934 · Mar 12, 2018
Continuation 15162951 · May 24, 2016
References Cited (68)
US 6990407B1 · Mbekeani et al. · 2006 [cited by applicant]
US 7031983B2 · Israni · 2006 [cited by examiner]
US 7139659B2 · Mbekeani et al. · 2006 [cited by applicant]
US 7251558B1 · McGrath · 2007 [cited by applicant]
US 7269503B2 · McGrath · 2007 [cited by applicant]
US 7307513B2 · Shutter et al. · 2007 [cited by applicant]
US 7403537B2 · Allison et al. · 2008 [cited by applicant]
US 7640015B2 · Connelly et al. · 2009 [cited by applicant]
US 9026346B2 · Choi · 2015 [cited by applicant]
US 9116917B1 · Ekwall · 2015 [cited by examiner]
US 9177471B2 · Hinz · 2015 [cited by applicant]
US 9251703B1 · Mbekeani · 2016 [cited by examiner]
US 9401100B2 · Forsblom · 2016 [cited by examiner]
US 9903635B2 · Eicher et al. · 2018 [cited by applicant]
US 9916756B2 · Littlejohn et al. · 2018 [cited by applicant]
US 9997069B2 · Bennett et al. · 2018 [cited by applicant]
US 9998434B2 · Verzun et al. · 2018 [cited by applicant]
US 10089866B2 · Littlejohn et al. · 2018 [cited by applicant]
US 10255802B2 · Littlejohn et al. · 2019 [cited by applicant]
US 10692366B2 · Littlejohn et al. · 2020 [cited by applicant]
US 11138871B2 · Littlejohn et al. · 2021 [cited by applicant]
US 11735036B2 · Littlejohn · 2023 [cited by examiner]
US 20020141491A1 · Corts et al. · 2002 [cited by applicant]
US 20080275629A1 · Yun · 2008 [cited by applicant]
US 20090125219A1 · Lee et al. · 2009 [cited by applicant]
US 20100114465A1 · Kim et al. · 2010 [cited by applicant]
US 20130328941A1 · Carbonneau et al. · 2013 [cited by applicant]
US 20170061792A1 · Dang et al. · 2017 [cited by applicant]
US 20170243485A1 · Rubin et al. · 2017 [cited by applicant]
US 20170345293A1 · Littlejohn et al. · 2017 [cited by applicant]
US 20180204448A1 · Littlejohn et al. · 2018 [cited by applicant]
US 20180365985A1 · Littlejohn et al. · 2018 [cited by applicant]
US 20180375677A1 · Deshpande et al. · 2018 [cited by applicant]
US 20190197884A1 · Littlejohn et al. · 2019 [cited by applicant]
US 20200219385A1 · Littlejohn et al. · 2020 [cited by applicant]
US 20220028256A1 · Littlejohn et al. · 2022 [cited by applicant]
Schneebauer et al., On-The-Fly Location Referencing Methods for Establishing Traffic Information Services, 2007, IEEE, p. 1-8 (Year: 2007). [cited by examiner]
Mangharam et al., Bounded-Latency Alerts in Vehicular Networks, 2007, IEEE, p. 55-60 (Year: 2007). [cited by examiner]
Taysi et al., Routing Protocols for GeoNet: A Survey, 2012, IEEE, p. 939-954 (Year: 2012). [cited by examiner]
Aezladen et al., Efficient Location-Based Decision-Supporting Content Distribution to Mobile Groups, 2012, IEEE, p. 1514-1526 (Year: 2012). [cited by examiner]
Berlin et al., Direction based Hazard Routing Protocol (DH RP) for disseminating road hazard information using road side infrastructures in VANETs, 2014, Internet, p. 1-17. [cited by applicant]
Burfeind, Mark; INRIX TPEG Connect “Optimizes Delivery and Reduces Costs of Providing Dynamic Traffic Info to Connected Vehicles and Devices”; Jul. 28, 2010, 2 pages, http:f/inrix.c:om/press/2656/. [cited by applicant]
Chen et al., Broadcasting safety information in vehicular networks: issues and approaches, 2010, IEEE, p. 20-25. [cited by applicant]
Chisalita et al., A context-based vehicular communication protocol, 2004, IEEE, p. 2820-2824 (Year: 2004). [cited by applicant]
Cho et al., An efficient transmission of traffic and traveler information using digital multimedia broadcasting network, :2005, IEEE, p. 2749-2752 (Year: 2005). [cited by applicant]
Cho et al., Real Time Traffic Information Service Using Terrestrial Digital Multimedia Broadcasting System, 2006, EEE, p. 550-556 (Year: 2006). [cited by applicant]
Cui el al., Extraction of traffic information from social media interactions: Methods and experiments, 2014, IEEE, p. 1549-1554 (2014). [cited by applicant]
Dressier et al., Requirements and objectives for secure Traffic Information Systems, 2008, IEEE, p. 808-814. [cited by applicant]
Francis, Dave, TISA-building standards in Automotive Traffic Information Services, Taiwan Telematics 2012, Nov. 8, 2012, 34 pages. [cited by applicant]
Francis, Dave; TPEG Digital Radio Traffic Data, Next generation of Traffic and Travel Information Services; May 3, 2016; 23 pages. [cited by applicant]
Gardiner, P.A.O.; Implementing TPEG and Multimedia Services for Digital Radio, British Broadcasting Corporation. JK, Dec. 1999; 6 pages. [cited by applicant]
Jeong et al., A novel TPEG application for location based service using terrestrial-DMB. 2006, IEEE, p. 281-286 (2006). [cited by applicant]
Jiang et al., Research on Accessibility pattern of China at City Level Based on Land Traffic Networtc:, 2011, IEEE, p. 187-191 (2011). [cited by applicant]
Lin et al .. Fountain coding for efficientTPEG data reception on data carousel transmission, 2009, IEEE. p. 486-491 Year: 2009. [cited by applicant]
Lopez, Telematic services for interactive traffic information: the Spanish case, 1995, IEEE, p. 224-228 (Year: 1995). [cited by applicant]
Mangharam et al., Bounded-Latency Alerts in Vehicular Networtc:s, 2007, IEEE, p. 55-60 (Year: 2007). [cited by applicant]
Marks. Bev. TPEG—an introduction to the growing family of standards and specifications for fraffic and Travel Information services, Jun. 10, 2009, 53 pages. [cited by applicant]
Nzouonla et al., VAN ET Routing on City Roads Using Real-Time Vehicular Traffic Information, 2009, IEEE. p. 3609-3626 (Year: 2009). [cited by applicant]
Pocovi et al. Automation for On-Road Vehicles: Use Cases and Requirements for Radio Design, 2015, IEEE, p. 1-5 (2015). [cited by applicant]
Schneebauer el al., On-The-Fty Location Referencing Methods for Establishing Traffic Information Services, 2007, IEEE, p. 14-21 (2007). [cited by applicant]
TPEG Analyser (Nov. 2015). Retrieved from http://wecantpeg.com/tpeg-analyser.html; 4 pages. [cited by applicant]
Unbehaun et al., Broadcasting Traffic Information over Bursty Channels, 2006, IEEE, p. 1-6 (Year: 2006). [cited by applicant]
Wanichayapong et al., Social-based traffic information extraction and classification, 2011, IEEE, pg. (Year: 2011). [cited by applicant]
We Can TPEG! (Oct. 2015). Retrieved from http://wecantpeg.com/TPEG_Analyser_ 4_ 1.pdf; 2 pages. [cited by applicant]
Yang et al. A real-time road traffic information system based on a peer-to-peer approach, 2008, IEEE, 513-518. [cited by applicant]
Barros et al., Short-term real-time traffic prediction methods: A survey, 2015, IEEE, p. 132-139 (Year: 2015). [cited by applicant]
Djahel et al., A Communications-Oriented Perspective on Traffic Management Systems for Smart Cities: Challenges and Innovative Approaches, 2014, IEEE, p. 125-151 (Year: 2014). [cited by applicant]
Araghi et al., A comparative study of k-NN and hazard-based models for incident duration prediction, 2014, IEEE, p. 1608-1613 ( Year: 2014). [cited by applicant]