Method and protocol for congestion control in a vehicular network

• US 8,233,389 B2
• Filed: 08/19/2009
• Issued: 07/31/2012
• Est. Priority Date: 08/19/2009
• Status: Active Grant

• Current Assignee: Mitsubishi Electric Research Laboratories, Inc. (Mitsubishi Electric Corporation)
• Original Assignee: Mitsubishi Electric Research Laboratories, Inc. (Mitsubishi Electric Corporation)
• Inventors: Yim, Raymond, Ye, Fei, Saito, Masashi, Orlik, Philip V.
• Primary Examiner(s): Yao, Kwang B
• Assistant Examiner(s): LOO, JUVENA W
• Application Number:
  US12/543,944
• Publication Number:
  US 20110044172A1
• Time in Patent Office: 1,077 Days
• Field of Search: 370/229, 370/230, 370/230.1, 370231-235, 370/252, 370/253, 370/254, 370/255, 370/310, 370/310.2
• US Class Current: 370/229
• CPC Class Codes: H04L 47/19 at layers above the network layer network arrangements for networked applications for scheduling or organising the servicing of application requests H04L67/60
• CPC Class Codes: H04L 51/58 Message adaptation for wireless communication
• CPC Class Codes: 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
• CPC Class Codes: H04L 69/321 Interlayer communication protocols or service data unit [SDU] definitions; Interfaces between layers
• CPC Class Codes: H04W 28/0284 detecting congestion or overload during communication monitoring arrangements H04L43/00
• CPC Class Codes: H04W 28/22 Negotiating communication rate
• CPC Class Codes: H04W 4/12 Messaging; Mailboxes; Announcements
• CPC Class Codes: H04W 76/50 for emergency connections
• CPC Class Codes: H04W 8/04 Registration at HLR or HSS [Home Subscriber Server]
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

In a vehicle ad-hoc network (VANET), a transceiver node is arranged in a vehicle. The node includes a protocol stack, which includes an application layer, a link layer; and a congestion control layer arranged between the application layer and the link layer. The congestion layer transfers short messages between the application layer and the link layer. The short messages are defined according to a standard for the VANET, and the congestion layer optimizes a network-wide rate allocation for the short messages.

Claims

1. A node, in a vehicle ad-hoc network (VANET), wherein the node is arranged in a vehicle, wherein the node includes a transmitter, a receiver and a processor for performing steps of a protocol stack, comprising:

a protocol stack, further comprising;

an application layer;

a link layer; and

a congestion control layer arranged between-the application layer and the link layer, wherein the congestion layer is configured to transfer short messages between the application layer and the link layer, and wherein the short messages are defined according to a standard for the VANET, and wherein the congestion layer optimizes a network-wide rate allocation for the short messages, wherein the congestion control layer determines a transmission probability of a short message as a function of a local density, and wherein the local density depends on a number of neighboring vehicles, and data rates used by the neighboring vehicles, and wherein the transmission probability is

e<sup>λ

μ

c0*+λ

μ</sup>

c₀*−

λ

μ

−

1=0,

where μ

is a constant that depends on transmission power, λ

is the local density.

2. The node of claim 1, wherein the short messages are broadcast.

3. The node of claim 1, wherein the protocol stack further comprises:

a physical layer; and

a short message layer arranged between the congestion control layer and the physical layer, wherein the short message layer enable the node to directly control characteristics of the physical layer for the short messages.

4. The node of claim 3, wherein the characteristics include channel number, data rate, transmit power level, and provider service identifier.

5. The node of claim 2, wherein receivers of the broadcast short message do not acknowledge the short messages.

6. The node of claim 1, wherein the short message includes location, velocity, acceleration, and braking condition of the vehicle.

7. The node of claim 1, wherein the congestion control further comprises:

means for storing a status of the node;

a local network information database; and

a buffer configured to store the short messages.

8. The node of claim 7, wherein messages are deleted from the buffer after a predetermined time interval.

9. The node of claim 1, wherein the short message is an update message.

10. The node of claim 1, wherein the short message is an alert message.

11. The node of claim 1, wherein duplicate incoming short messages are deleted.

12. The node of claim 7, wherein the short messages are stored in the buffer when an outgoing message rate is higher than an optimal rate.

13. The node of claim 12, wherein the short messages in the buffer are transferred to the short message layer according to the optimal rate and a priority of the short messages.

14. The node of claim 1 wherein the local density is determined by incoming and outgoing short messages, a probability of idle, successful, and failed reception of the short messages at the node.

15. The node of claim 1, wherein a number of idle, successful and failed packet reception is sent from the link layer to the congestion control layer.

16. A method for transmitting a short message by a node in a vehicle ad-hoc network (VANET), wherein the node is arranged in a vehicle, wherein the node includes a transmitter, a receiver and a processor for performing steps of the method, comprising the steps of:

determining a local density based on a number of neighboring vehicles, and data rates used by the neighboring vehicles;

determining a transmission probability of the short message as a function of a local density

e<sup>λ

μ

c0*+λ

μ</sup>

c₀*−

λ

μ

−

1=0,

where μ

is a constant that depends on transmission power, λ

is the local density; and

transmitting the short message if the transmission probability is above a predetermined threshold.

17. The method of claim 16, further comprising:

determining a probability p of storing the short message in a buffer according to

18. The method of claim 16, further comprising:

determining the local density based on incoming and outgoing short messages, a probability of idle, successful, and failed reception of the short messages at the node.