Method and apparatus for ad-hoc network broadcast communication

• US 8,289,186 B2
• Filed: 10/31/2006
• Issued: 10/16/2012
• Est. Priority Date: 11/18/2005
• Status: Active Grant

• Current Assignee: Hitachi Solutions Limited (Hitachi, Ltd.)
• Original Assignee: Hitachi, Ltd.
• Inventors: Osafune, Tatsuaki
• Primary Examiner(s): Wu, Daniel
• Assistant Examiner(s): Tang, Son M
• Application Number:
  US11/591,318
• Publication Number:
  US 20070117525A1
• Time in Patent Office: 2,177 Days
• Field of Search: 340/426.16, 340991-994, 340901-904, 340435-438, 701/301, 701/300, 701/93, 701/96
• US Class Current: 340/903
• CPC Class Codes: G08G 1/161 Decentralised systems, e.g. inter-vehicle communication
• CPC Class Codes: G08G 1/20 Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
• CPC Class Codes: H04W 28/06 Optimizing the usage of the radio link, e.g. header compression, information sizing , discarding information system modifying transmission characteristic according to link quality by modifying frame length H04L1/0007; dynamic adaptation of the packet size for flow control or congestion control H04L47/365
• CPC Class Codes: H04W 4/026 using orientation information, e.g. compass
• CPC Class Codes: H04W 4/027 using movement velocity, acceleration information
• 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/46 for vehicle-to-vehicle communication [V2V]
• CPC Class Codes: H04W 48/08 Access restriction or access information delivery, e.g. discovery data delivery signalling during connection H04W76/00
• CPC Class Codes: H04W 64/00 Locating users or terminals or network equipment for network management purposes, e.g. mobility management
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: H04W 92/18 between terminal devices

Abstract

The present invention relates to a method and apparatus for reducing the number of packets in a vehicle-to-vehicle multi-hop broadcast communication. The method determines a position data comprising a position, a velocity and a direction of a receiving vehicle (1, 2, 3, 4), receives a position data comprising position, velocity and direction from sending vehicles (1, 2, 3, 4), and calculates a relative position between the receiving vehicle (1, 2, 3, 4) and the sending vehicle (1, 2, 3, 4). Next, a density of vehicles is calculated from the calculated relative positions. The position data of the receiving vehicle (1, 2, 3, 4) is periodically sent, and the time for periodically sending the position data of the receiving vehicle (1, 2, 3, 4) is set in accordance with the calculated density of vehicles.

Claims

1. A method for wireless communication between nodes including a node moving on a road comprising the steps of:

obtaining a node data of the first node including a position, a velocity and a moving direction of the first node;

receiving a node data of at least one second node including a position, a velocity and a moving direction from the at least one second node with using wireless communication;

calculating at lease one relative position between the first node and the at least one second node based on the node data of the first node and the node data of the at least one second node;

determining whether the road of the moving direction of the first node is congested or not, and a density of nodes when the road of the moving direction of the first node is congested, based on the node data of the at least one second node, the at least one relative position, the velocity of the first node, and the moving directions of the first node and the second node; and

starting a sending process of the node data of the first node and/or the node data of the at least one second node with a frequency set to be decreased inversely proportional to the density of nodes.

2. The method according to claim 1,

wherein the congestion determining step includes the steps of,

calculating the density of nodes in the road of the moving direction of the first node, based on the at least one relative position, and the moving directions of the first node and at least one of the second nodes;

and

detecting a congestion based on the velocity of the first node, and the density of nodes in the road of the moving direction of the first node.

3. The method according to claim 1,

wherein the determining step is executed when the first node receives a predetermined number of packets from the at least one second node going the same moving direction as the first node, the first node receives the packets from the at least one second node in front and the at least one second node behind, and the velocity of the first node is below a predetermined threshold.

4. The method according to claim 1,

the method further comprising the steps of:

stopping a retransmission of the node data of the second node, the relative position of which is larger than a predetermined threshold.

5. The method according to claim 1,

wherein the first node has a node data database for storing the node data of the at least one second node to be transmitted, and

wherein the node data of the at least one second node includes a node ID of a node from which the position, the velocity, and moving direction included in the node data are obtained, and a timestamp for indicating a sending time of the node data from the node having the node ID,

the method further comprising the steps of:

determining whether the node data that the second node obtains from a third node is one received first or not, with comparing the node ID and the timestamp of the node data stored in the node data database and the node ID and the timestamp of the node data which the second node obtains from the third node; and

storing the node data, when the node data is determined one first received.

6. The method according to claim 5,

the method further comprising the steps of:

determining whether the node data is eliminated from the node data database or not, in accordance with the relative position of the third node which sent the node data stored in the node data database to the second node, and the relative position of the first node to the third node, when the node data is not one received first.

7. The method according to claim 6,

the method further comprising the step of:

renewing the node data obtained by the second node and stored in the node data database with the node data received from the third node when the elimination determining step decides that the node data is not eliminated.

8. An apparatus for wireless communication between nodes included in a first node, the apparatus comprising:

a position determining unit for determining a node data of the first node including a position, a velocity and a moving direction of the first node;

a receiving unit for receiving a node data of at least one second node including a position, a velocity and a moving direction from the at least one second node with using wireless communication;

a calculating unit for calculating at least one relative position between the first node and the at least one second node based on the node data of the first node and the node data of the at least one second node, and determining whether the road of the moving direction of the first node is congested or not, and a density of nodes when the road of the moving direction of the first node is congested, based on the node data of the at least one second node, the at least one relative position, the velocity of the first node, and the moving directions of the first node and the second node; and

a sending unit for starting a sending process of the node data of the first node and/or the node data of the at least one second node with a frequency set to be decreased inversely proportional to the density of nodes.

9. The apparatus according to claim 8,

wherein the calculating unit determines whether the road of the moving direction of the first node is congested or not, with calculating the density of nodes in the road of the moving direction of the first node, based on the at least one relative position, and the moving directions of the first node and the at least one of second nodes, and detecting a congestion based on the velocity of the first node, and the density of nodes in the road of the moving direction of the first node.

10. The apparatus according to claim 8,

wherein the calculating unit determines whether the road of the moving direction of the first node is congested or not, when the first node receives a predetermined number of packets from the at least one second node going the same moving direction as the first node, the first node receives the packets from the at least one second node in front and the at least one second node behind, and velocity of the first node is below a predetermined threshold.

11. The apparatus according to claim 8,

wherein the sending unit stops a retransmission of the node data of the second node, the relative position calculated of which is larger than a predetermined threshold.

12. The apparatus according to claim 8,

the apparatus further comprising:

a node data database for storing the node data of the at least one second node to be transmitted, the node data of the at least one second node including a node ID of a node from which the position, the velocity, and moving direction included in the node data are obtained, and a timestamp for indicating a sending time of the node data from the node having the node ID,

wherein the receiving unit receives the node data, determines whether the node data that the second node obtains from a third node is one received first or not, with comparing the node ID and the timestamp of the node data stored in the node data database and the node ID and the timestamp of the node data which the second node obtains from the third node, and stores the node data when the node data is determined one first received.

13. The apparatus according to claim 12,

wherein the receiving unit determines whether the node data is eliminated from the node data database or not, in accordance with a relative position of the node which sent the node data stored in the node data database to the second node, and the relative position of the first node to the third node, when the node data is not one received first.

14. The apparatus according to claim 13,

wherein the receiving unit renews the node data obtained by the second node and stored in the node data database with the node data received from the third node when the elimination determining step decides that the node data is not eliminated.