Systems and methods for multi-beam optic-wireless vehicle communications

• US 8,068,463 B2
• Filed: 07/23/2008
• Issued: 11/29/2011
• Est. Priority Date: 07/23/2007
• Status: Expired due to Fees

• Current Assignee: Telcordia Technologies Incorporated (Telefonaktiebolaget LM Ericsson), Toyota Infotechnology Center Co., Ltd. (Toyota Motor Corporation)
• Original Assignee: Telcordia Technologies Incorporated (Telefonaktiebolaget LM Ericsson), Toyota Infotechnology Center USA, Inc. (Toyota Motor Corporation)
• Inventors: Guha, Ratul K., Lee, John, Vuyyuru, Rama, Chen, Wai, Onishi, Ryokichi
• Primary Examiner(s): CHRISS, ANDREW W
• Application Number:
  US12/178,338
• Publication Number:
  US 20090310608A1
• Time in Patent Office: 1,224 Days
• Field of Search: 370/312
• US Class Current: 370/334
• CPC Class Codes: H04L 45/48 Routing tree calculation
• CPC Class Codes: H04W 4/06 Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
• CPC Class Codes: H04W 4/90 Services for handling of emergency or hazardous situations, e.g. earthquake and tsunami warning systems [ETWS]
• CPC Class Codes: H04W 40/06 based on characteristics of available antennas
• CPC Class Codes: H04W 76/50 for emergency connections
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

The present invention offers systems and methods for effective multiple-hop routing, multicasting and media access control for vehicle group communications that employ directional wireless radio technology. Multi-beam optic-wireless media and streamlined operations provide low-overhead communications among vehicles. Systems and methods are provided to maintain a quasi-stationary group of neighboring vehicles, enable high-throughput on-demand switching among multiple vehicles, enable group coding in the vehicle group to achieve higher throughput, and enable dynamic adjustment of link to maintain desirable vehicle group. The proposed solution builds upon the conception of a MAC-free wireless operation and quasi-stationary vehicular switched network to achieve ultra-low-overhead and high-throughput vehicle communications.

Claims

1. A method for transmitting a data packet across a Vehicular Ad-hoc Network (VANET) having a plurality of vehicles, each of which having a plurality of directional antennas, the method comprising:

receiving at a first vehicle a data packet from a first neighbor vehicle via an incoming directional radio link from one of the plurality of directional antennas;

checking if the data packet is a duplicate data packet;

transferring the data packet to a second antenna of the plurality of antennas; and

forwarding the data packet to a second neighbor vehicle via a second outgoing radio link from said second antenna of the plurality of antennas;

wherein the data packet further comprises a header including a Source ID, Sequence Number, and Recipient Information for the data packet, the method further comprising;

generating a Switched Packet List (SPL), said SPL including the source ID, sequence number, acknowledgement status, and packet cache for each data packet;

determining a source and a scope of the data packet; and

adding the data packet to the SPL.

2. The method of claim 1, wherein the scope of the data packet includes any combination of a time-to-live of the packet or a maximum hop count of the data packet, the method further comprising discarding the data packet if the scope of the data packet is exceeded.

3. The method of claim 2, further comprising discarding the data packet if it is determined that the packet cache for the data packet already exists in the SPL.

4. The method of claim 3, further comprising:

awaiting for an acknowledgement from the second neighbor vehicle via the plurality of outgoing radio links;

retransmitting the data packet if said acknowledgement is not received; and

recording the acknowledgement status in the SPL when acknowledgement is received.

5. The method of claim 4, further comprising discarding the data packet from an outgoing link if acknowledgement has already been received.

6. The method of claim 5, further comprising:

generating a switching table showing status of all direct radio links between all vehicles in the network; and

generating a spanning tree comprising information on each outgoing link.

7. The method of claim 6, wherein the switching table comprises a source field, incoming field, and outgoing field;

and wherein the source field is the source of the spanning tree and incoming and outgoing fields are obtained by the outgoing links in the spanning tree.

8. The method of claim 5, further comprising forwarding the data packet only to selected neighbor vehicles.

9. The method of claim 8, further comprising generating a Neighboring Information Table (NIT) comprising immediate neighbors for the first vehicle and associated active links for each immediate neighbor and neighbors of each immediate neighbor.

10. The method of claim 9, further comprising generating a Switching Table showing status of incoming and outgoing direct radio links between the first vehicle and a plurality of neighbor vehicles, wherein the outgoing radio links are determined based on a comparison of the NIT of the first vehicle and the NIT of a second neighbor vehicle.

11. The method of claim 10, further comprising:

receiving a packet from the first neighbor vehicle;

receiving the NIT of said second neighbor vehicle via the direct radio link between the first vehicle and the second neighbor vehicle;

comparing said NIT of the second neighbor vehicle with the first vehicle'"'"'s own NIT; and

forwarding the packet only to the neighbors of the first vehicle out of the plurality of neighbor vehicles that are not present on the NIT of the second neighbor vehicle.

12. A method for transmitting a data packet across a Vehicular Ad-hoc Network (VANET) having a plurality of vehicles, each of which having a plurality of directional antennas, the method comprising:

receiving at a first vehicle a data packet from a first neighbor vehicle via an incoming directional radio link from one of the plurality of directional antennas;

checking if the data packet is a duplicate data packet;

splitting the data packet into a plurality of blocks;

randomly selecting coefficients from a finite field;

taking a linear combination of the blocks with said coefficients;

embedding the coefficients in the data packet to form a coded block;

transmitting the coded block to a second antenna of the plurality of antennas; and

forwarding the coded block to a second neighbor vehicle via a second outgoing radio link from said second antenna of the plurality of antennas; and

decoding the coded block at the second neighbor vehicle through a matrix inversion operation in a finite field.

13. The method of claim 12, further comprising:

encoding blocks of a data packet at the first vehicle to form group coded data packet;

accumulating and relaying said group coded data packet at an intermediate vehicle; and

accumulating and decoding the group coded data packet at a destination vehicle.