# US 2010/0074114 A1 · Achieving High-Rate Multi-Hop Data Delivery in Vehicular Networks

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0074114 A1
- Document ID: US20100074114A1
- Status: Published application
- Kind: A1
- Application number: 12/563,420
- Filed: 2009-09-21
- Published: 2010-03-25
- Earliest claimed: 2008-09-19
- Assignees: Telcordia Technologies, Inc.
- Inventors: Ratul K. Guha; Wai Chen; Jasmine Chennikara-Varghese; Stephanie Demers
- Web page: https://patentgrep.com/patent/US20100074114A1

## CPC

- H04L 45/125: based on throughput or bandwidth
- H04L 45/44: Distributed routing
- H04L 67/12: specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method for high rate data delivery in a multi-hop vehicular network comprises at each source vehicle, initiating a packet having a flow tag, assigning an identifier of the content and the current location to the flow tag, and forwarding the packet; at each destination vehicle, setting a flow request and broadcasting at the current intersection; further on movement, setting the flow request at the new intersection, and at each intersection, selecting a header vehicle at the intersection, computing backlog and congestion indicators and listening for broadcasts with a matrix and the flow requests at the header vehicle, determining if the matrix is present, updating the matrix in accordance with the backlog and congestion indicators if the matrix is present, initializing the matrix and estimating the delay on the outgoing road segments if the matrix is not present, forwarding the packet flow, and broadcasting the matrix from the header vehicle.

## Claims

### Claim 1

A method for high rate data delivery in a multi-hop vehicular network having a plurality of vehicles and a plurality of intersections, said method comprising steps of:
at each source vehicle:
initiating a packet having a flow tag;
assigning an identifier of the content and the current
location to the flow tag; and
forwarding the packet;
at each destination vehicle:
setting a flow request and broadcasting at the current intersection; and
on movement of the destination vehicle, setting the flow request at the new intersection;
at each intersection:
selecting a header vehicle at the intersection;
computing a backlog indicator and a congestion indicator and listening for broadcasts with a matrix and the flow requests at the header vehicle;
determining if the matrix is present;
updating the matrix in accordance with the backlog and congestion indicators if the matrix is present;
initializing the matrix and estimating the delay on the outgoing road segments if the matrix is not present;
forwarding the packet flow; and
broadcasting the matrix from the header vehicle.

### Claim 2 (depends on 1)

The method according to claim 1, wherein the step of forwarding at the source vehicle is done without knowledge of destination location or recipient information.

### Claim 3 (depends on 1)

The method according to claim 1, wherein the step of selecting is performed based on random countdown and vehicle ID.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the step of broadcasting is performed when the header vehicle leaves the intersection and periodically thereafter.

### Claim 5 (depends on 1)

The method according to claim 1, wherein the matrix includes the backlog indicator and a forwarding component.

### Claim 6

A computer readable medium having computer readable program for operating on a computer for high rate data delivery in a multi-hop vehicular network having a plurality of vehicles and a plurality of intersections, said program comprising instructions that cause the computer to perform the steps:
at each source vehicle:
initiating a packet having a flow tag;
assigning an identifier of the content and the current
location to the flow tag; and
forwarding the packet;
at each destination vehicle:
setting a flow request and broadcasting at the current intersection; and
on movement of the destination vehicle, setting the flow request at the new intersection;
at each intersection:
selecting a header vehicle at the intersection;
computing a backlog indicator and a congestion indicator and listening for broadcasts with a matrix and the flow requests at the header vehicle;
determining if the matrix is present;
updating the matrix in accordance with the backlog and congestion indicators if the matrix is present;
initializing the matrix and estimating the delay on the outgoing road segments if the matrix is not present;
forwarding the packet flow; and
broadcasting the matrix from the header vehicle.

### Claim 7 (depends on 6)

The method according to claim 6, wherein the step of forwarding at the source vehicle is done without knowledge of destination location or recipient information.

### Claim 8 (depends on 6)

The program according to claim 6, wherein the step of selecting is performed based on random countdown and vehicle ID.

### Claim 9 (depends on 6)

The program according to claim 6, wherein the step of broadcasting is performed when the header vehicle leaves the intersection and periodically thereafter.

### Claim 10 (depends on 6)

The program according to claim 6, wherein the matrix includes the backlog indicator and a forwarding component.
