Distributed method for minimum delay multi-hop data delivery in vehicular networks
First Claim
1. A method comprising:
- receiving a packet flow from a source vehicle at a header vehicle, wherein the packet flow includes packets that are labeled with destination coordinates and a location of the source vehicle;
computing a backlog indicator at the header vehicle at an intersection, wherein the backlog indicator represents an amount of packet flow backlog at the intersection;
updating network information regarding the intersection with the backlog indicator;
forwarding the packet flow based at least in part on the network information; and
broadcasting the network information from the header vehicle.
5 Assignments
0 Petitions
Accused Products
Abstract
An inventive method for data delivery in a multi-hop vehicular network with multiple vehicles and intersections is presented. The method comprises, at each source vehicle, initiating packet flow, labeling packets with destination coordinates and a current location, and forwarding the packet flow, and at each intersection, selecting a header vehicle, computing a backlog indicator and listening for broadcasts with a matrix and delay information, updating the matrix in accordance with the backlog indicator if the matrix is present, otherwise initializing the matrix, forwarding the packet flow, and broadcasting the matrix from the header vehicle. In one embodiment, selection of the header vehicle is performed based on random countdown and vehicle ID. The method converges to the optimal (lowest latency) state irrespective of the initial starting point of the network and continues to tend towards the optimal state even as the network conditions alter.
33 Citations
20 Claims
-
1. A method comprising:
-
receiving a packet flow from a source vehicle at a header vehicle, wherein the packet flow includes packets that are labeled with destination coordinates and a location of the source vehicle; computing a backlog indicator at the header vehicle at an intersection, wherein the backlog indicator represents an amount of packet flow backlog at the intersection; updating network information regarding the intersection with the backlog indicator; forwarding the packet flow based at least in part on the network information; and broadcasting the network information from the header vehicle. - View Dependent Claims (2, 3, 4, 13, 14, 15, 16)
-
-
5. A non-transitory computer-readable medium having computer-instructions stored thereon, the instructions comprising:
-
instructions to receive, at a header vehicle, a packet flow, wherein the packet flow includes packets that are labeled with destination coordinates and a location of a source vehicle; instructions to compute a backlog indicator at an intersection, wherein the backlog indicator represents an amount of packet flow backlog at the intersection; instructions to update network information regarding the intersection with the backlog indicator; instructions to forward the packet flow based at least in part on the network information; and instructions to broadcast the network information from the header vehicle. - View Dependent Claims (6, 7, 8, 9, 10, 11, 12)
-
-
17. A system comprising:
-
a memory configured to store a packet flow that is received from a source vehicle, wherein the packet flow includes packets that are labeled with destination coordinates and a location of the source vehicle; and a processor operatively coupled to the memory and configured to; compute a backlog indicator at an intersection, wherein the backlog indicator represents an amount of packet flow backlog at the intersection; update network information regarding the intersection with the backlog indicator; forward the packet flow based at least in part on the network information; and broadcast the network information. - View Dependent Claims (18, 19, 20)
-
Specification