Distributed traffic navigation using vehicular communication

• US 8,589,073 B2
• Filed: 12/23/2009
• Issued: 11/19/2013
• Est. Priority Date: 08/10/2009
• Status: Active Grant

• Current Assignee: Telcordia Technologies Incorporated (Telefonaktiebolaget LM Ericsson)
• Original Assignee: Telcordia Technologies Incorporated (Telefonaktiebolaget LM Ericsson)
• Inventors: Guha, Ratul K., Chen, Wai
• Primary Examiner(s): To, Tuan C.
• Assistant Examiner(s): Mahne, Kevin P
• Application Number:
  US12/646,277
• Publication Number:
  US 20110035146A1
• Time in Patent Office: 1,427 Days
• Field of Search: 701/117, 701/118, 701/119, 701/301, 701/342, 701/414, 701/416, 701/420, 701/437, 701/553, 701/517, 701/532, 701/201, 701/422, 701/423, 340/902, 340/905, 340/990, 340/992, 370/229, 370/238, 370/315, 370/342, 370/392
• US Class Current: 701/527
• CPC Class Codes: G08G 1/09675 where a selection from the received information takes place in the vehicle
• CPC Class Codes: G08G 1/096791 where the origin of the information is another vehicle
• CPC Class Codes: G08G 1/096822 where the segments of the route are transmitted to the vehicle at different locations and times

Abstract

A method for distributed traffic navigation in a vehicular network is presented. At each vehicle entering the network, information associated with the vehicular network is acquired and stored, and destination addresses are broadcasted as route requests. At each vehicle in the network, the stored information is updated through vehicle to vehicle communication. At each junction, a header vehicle is selected for listening for broadcasts to determine the presence of a matrix. If the matrix is not present, the matrix is initialized based on the stored information of the header vehicle. The header vehicle further estimates travel time on the road segments based on the matrix, calculates a backlog indicator based on the segment travel time and the route requests. The header vehicle further updates the matrix and generates a route based on the matrix. The matrix is broadcasted from the header vehicle.

Claims

1. A method for distributed traffic navigation in a vehicular network, the vehicular networking comprising a plurality of road segments connected through a plurality of road junctions and a plurality of vehicles operating on the road segments, the method comprising steps of:

at each vehicle entering the vehicular network;

acquiring and storing information associated with the vehicular network;

generating a destination address; and

broadcasting the destination address as a route request;

at each vehicle in the vehicular network;

updating the stored information through communication with at least one communicable vehicle; and

at each junction;

selecting a header vehicle;

the header vehicle listening for broadcasts to determine the presence of an existing matrix;

the header vehicle initializing a new matrix based on the stored information of the header vehicle, when the existing matrix is not present;

the header vehicle estimating travel time on the road segments based on the new matrix when the existing matrix is not present or based on the existing matrix when the existing matrix is present;

the header vehicle computing a backlog indicator based on the travel time on the road segments and each route request from all vehicles;

the header vehicle updating the new matrix when the existing matrix is not present or updating the existing matrix when the existing matrix is present, wherein the updating is based on the backlog indicator;

the header vehicle generating a route and assigning a route to neighboring vehicles based on the updated matrix; and

the header vehicle broadcasting the updated matrix.

2. The method according to claim 1, further comprising assigning the route to at least one neighboring vehicle.

3. The method according to claim 1, further comprising obtaining data associated with a location of the junction at each junction.

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

5. The method according to claim 1, wherein the step of broadcasting the destination address as a route request is performed periodically.

6. The method according to claim 1, wherein the step of broadcasting the updated matrix at the header vehicle is performed at periodic intervals until the header vehicle arrives at a different junction.

7. The method according to claim 1, further comprising:

at each vehicle leaving the vehicular network, broadcasting an exit message.

8. A computer readable medium having a computer readable program for operating on a computer system for distributed traffic navigation in a vehicular network, the vehicular networking comprising a plurality of road segments connected through a plurality of road junctions and a plurality of vehicles operating on the road segments, the program comprising instructions that cause the computer system to perform the steps of:

at each vehicle entering the vehicular network;

acquiring and storing information associated with the vehicular network;

generating a destination address; and

broadcasting the destination address as a route request;

at each vehicle in the vehicular network;

updating the stored information through communication with at least one communicable vehicle; and

at each junction;

selecting a header vehicle;

the header vehicle listening for broadcasts to determine the presence of an existing matrix;

the header vehicle initializing a new matrix based on the stored information of the header vehicle, when the existing matrix is not present;

the header vehicle estimating travel time on the road segments based on the new matrix when the existing matrix is not present or based on the existing matrix when the existing matrix is present;

the header vehicle computing a backlog indicator based on the travel time on the road segments and each route request from all vehicles;

the header vehicle updating the new matrix when the existing matrix is not present or updating the existing matrix when the existing matrix is present, wherein the updating is based on the backlog indicator;

the header vehicle generating a route and assigning a route to neighboring vehicles based on the updated matrix; and

the header vehicle broadcasting the updated matrix.

9. The computer readable medium according to claim 8, wherein the program of instructions further causes the computer system to assign the route to at least one neighboring vehicle.

10. The computer readable medium according to claim 8, wherein the program of instructions further causes the computer system to obtain data associated with a location of the junction at each junction.

11. The computer readable medium according to claim 8, wherein the step of selecting is performed based on a random countdown timer and a vehicle ID.

12. The computer readable medium according to claim 8, wherein the step of broadcasting the destination address as a route request is performed periodically.

13. The computer readable medium according to claim 8, wherein the step of broadcasting the updated matrix at the header vehicle is performed at periodic intervals until the header vehicle arrives at a different junction.

14. The computer readable medium according to claim 8, wherein the program of instructions further causes the computer system to perform the steps of:

at each vehicle leaving the vehicular network, broadcasting an exit message.