CN106304237B - Terminal vehicle communication method based on wireless protocol - Google Patents

Terminal vehicle communication method based on wireless protocol Download PDF

Info

Publication number
CN106304237B
CN106304237B CN201610630896.0A CN201610630896A CN106304237B CN 106304237 B CN106304237 B CN 106304237B CN 201610630896 A CN201610630896 A CN 201610630896A CN 106304237 B CN106304237 B CN 106304237B
Authority
CN
China
Prior art keywords
node
vehicle
message
nodes
messages
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201610630896.0A
Other languages
Chinese (zh)
Other versions
CN106304237A (en
Inventor
谢欣霖
陈波
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chengdu Zhida Science And Technology Co Ltd
Original Assignee
Chengdu Zhida Science And Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chengdu Zhida Science And Technology Co Ltd filed Critical Chengdu Zhida Science And Technology Co Ltd
Priority to CN201610630896.0A priority Critical patent/CN106304237B/en
Publication of CN106304237A publication Critical patent/CN106304237A/en
Application granted granted Critical
Publication of CN106304237B publication Critical patent/CN106304237B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention provides a terminal vehicle communication method based on a wireless protocol, which comprises the following steps: and arranging tour vehicle-mounted nodes, driving along a predefined route, continuously sending messages in the driving process, broadcasting the received messages by road side nodes, and receiving corresponding messages when the vehicle nodes pass through the tour node network coverage range. The invention provides a terminal vehicle communication method based on a wireless protocol, which is suitable for the condition that the topological structure of a vehicle-mounted network is frequently changed, improves the throughput of the network and reduces the network congestion.

Description

Terminal vehicle communication method based on wireless protocol
Technical Field
The invention relates to a vehicle-mounted network, in particular to a terminal vehicle communication method based on a wireless protocol.
Background
In order to improve the efficiency of traffic transportation and reduce the consumption speed of resources, an intelligent traffic system is inevitably adopted in a vehicle research and development link, and the inter-vehicle network also becomes a hot topic for optimizing modern traffic. People can utilize wireless communication equipment equipped on vehicles to complete direct or indirect communication between vehicle nodes, and meanwhile, the vehicle nodes can also realize wireless communication with roadside fixed communication equipment on corresponding wireless communication channels, so that the purpose that a network between vehicles completes transmission, processing and interaction processes of various transmission information in an intelligent traffic system is achieved. From the aspect of improving service convenience, the driver can collect various information broadcasted by other vehicles, so that some nearby service points can be conveniently found. Meanwhile, the electronic toll collection system is adopted, so that the waiting time of the vehicle in payment can be greatly shortened. After the equipment arranged on the two sides of the road and the information carried by the vehicle act together, related departments can make full use of the information to carry out intelligent dispatching on traffic.
However, vehicles themselves are moving at high speed, and the urban road has large limitation on the vehicles, the topology of the network is very variable, the communication time between each node is short, the conventional inter-vehicle communication method cannot be well adapted to the dynamic characteristic that the topological structure of the vehicle-mounted network is frequently changed in real time, and therefore, the high-quality performance is not brought into play in the aspects of network characteristics such as the improvement of the throughput of the network. Network congestion often results when there are too many nodes in the vehicle.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a terminal vehicle communication method based on a wireless protocol, which comprises the following steps:
and arranging tour vehicle-mounted nodes, driving along a predefined route, continuously sending messages in the driving process, broadcasting the received messages by road side nodes, and receiving corresponding messages when the vehicle nodes pass through the tour node network coverage range.
Preferably, the messages in the network all have unique message id numbers, and after the target node R receives the message, if the target node R judges that the message has not been received before, the id numbers of the messages are stored in the broadcast table; if the target node R searches the same id number of the received information in the broadcast table of the target node R, the information is received, the information is determined to be redundant information and is directly discarded, otherwise, the target node R processes the data as follows;
according to the position information acquired by the GPS, the vehicle node judges whether the vehicle node is located in a vehicle node dense area; if target node R is located in a dense area of vehicle nodes or R belongs to a roadside node, R is delayed WD1Then, the received message is forwarded; if the location of the receiving node R is not in the vehicle node dense area but the source node S is in the vehicle node dense area, then R discards the message; if the source node S is not a vehicle node dense area node, then R will be its own direction DRDirection D to last hop source node SSContinuing the comparison, if their moving directions are the same, at delay WD2Then, sending the message, and if the direction of the message is opposite, giving up forwarding;
wherein WD1＝(1-Pd)×Tp
WD2＝(1-Pd)×2Tp
TpRepresents a minimum duration between one-hop broadcasts;
Pd＝ds-r/dmaxas probability related to distance, ds-rDistance between source node and target node for the last forwarding, dmaxIs the maximum value within the node coverage.
Compared with the prior art, the invention has the following advantages:
the invention provides a terminal vehicle communication method based on a wireless protocol, which is suitable for the condition that the topological structure of a vehicle-mounted network is frequently changed, improves the throughput of the network and reduces the network congestion.
Drawings
FIG. 1 is a flow chart of a method of wireless protocol based end vehicle communication in accordance with an embodiment of the present invention.
Detailed Description
A detailed description of one or more embodiments of the invention is provided below along with accompanying figures that illustrate the principles of the invention. The invention is described in connection with such embodiments, but the invention is not limited to any embodiment. The scope of the invention is limited only by the claims and the invention encompasses numerous alternatives, modifications and equivalents. In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. These details are provided for the purpose of example and the invention may be practiced according to the claims without some or all of these specific details.
One aspect of the invention provides a wireless protocol-based end vehicle communication method. FIG. 1 is a flow chart of a method for wireless protocol based end vehicle communication in accordance with an embodiment of the present invention.
The vehicle-mounted node application layer management module collects data in a wireless network, analyzes the source and the type of the data, and realizes the receiving and sending management of upper layer message information, and the setting and the interception of coding rules. The route management module is responsible for the selection of a route mechanism, routing requests, interception response, maintenance and the like. The access management module exists between the routing layer and the MAC layer and is responsible for obtaining data at the routing layer while assigning random destination addresses to it and then passing these address information into the MAC layer. The wireless transmission module is used for managing the transmitting antenna and the receiving antenna, correspondingly processes the data in a simulation mode according to the coding result of the data, transmits the data in the queue in a corresponding transmission channel through the antenna, and controls and manages the data through the transmission performance of the data.
For the message distribution of the application layer management module, the embodiment of the invention expands the selection range of the relay node, and simultaneously adopts position estimation to obtain the characteristics of low time delay and low load of message broadcasting.
The vehicle transmits a beacon message to the adjacent node, and when the difference between the estimated position and the actual position of the vehicle exceeds a set error threshold, a periodic transmission mode and a condition-driven transmission mode are adopted at the same time. Through the beacon message, vehicles in the network can acquire the position information of the adjacent nodes, and the adjacent table is continuously updated.
The vehicle acquires the position information of the vehicle through a GPS, and the current running speed s and the current direction theta of the vehicle are calculated by combining the historical record of the movement of the vehicle and the current position information.
And extracting the vehicle node ID in the beacon message, and judging whether the vehicle sending the beacon is in the adjacency list of the current vehicle. If the node is the adjacent node of the current vehicle, updating the adjacent table; otherwise, the vehicle sending the beacon message is added into the adjacency list.
Vehicle position information, vehicle direction information, vehicle speed information, and timestamp information in the beacon message are extracted. Estimating a current time t of an adjacent node2Position (X)p，Yp)。
Xp＝X+s×(t2-t1)×cos(θ)
Yp＝Y+s×(t2-t1)×sin(θ)
Wherein (X, Y) and t1Is the position information and time stamp carried by the last received beacon before the adjacent vehicle was estimated. And s and θ are vehicle speed and direction information in the beacon that was last received before the vehicle performed the estimation.
The current vehicle calculates the effective time of the communication link between the current node and the adjacent node according to the estimated position of the adjacent vehicle.
The vehicle compares the estimated position of the adjacent point with the position of itself, and classifies the positional relationship into one of the following four categories: the front direction is the same, the back direction is the same, the front direction is reverse and the back direction is reverse.
The current vehicle calculates the distance D between itself and its neighboring nodes:
D＝((Xv-Xp)2+((Yv-Yp))2)1/2
herein (X)v，Yv) Indicating the coordinate position of the current vehicle, (X)pAnd Yp) Is an estimated coordinate value of the position of the adjacent node.
The position estimation process stops until the current vehicle receives a new beacon message and resumes.
When a certain vehicle has an abnormal event with high priority, the abnormal vehicle immediately generates an abnormal message, and selects a forwarding node for broadcasting. And after other vehicle nodes receive the abnormal message, judging whether the abnormal message needs to be broadcasted or not. If one of the other vehicle nodes is selected as a forwarding node, the message needs to be forwarded.
If the vehicle nodes exist behind the abnormal vehicle in the same direction, the abnormal vehicle selects the farthest vehicle as a direct successor node and selects the next farthest vehicle as a second successor node. And if the vehicle exists behind the abnormal vehicle in the reverse direction, selecting the farthest vehicle as a direct successor node, and selecting the second farthest vehicle as a second successor node. If a vehicle exists in the reverse front of the abnormal vehicle, the nearest vehicle is selected as a direct successor node, and the next nearest vehicle is selected as a second successor node. If the situations are not met, the abnormal vehicle stores the abnormal message until the new vehicle enters the wireless information coverage range of the new vehicle, and then the abnormal vehicle selects and forwards the abnormal message again according to the situations.
After the abnormal vehicle selects the forwarding node, the abnormal message is distributed from the forwarding node R to other nodes in two conditions according to the position relation between the forwarding node and the abnormal vehicle node. And selecting the vehicles R in the same direction as the current vehicle as forwarding nodes, detecting the position of the R after receiving the abnormal message, and broadcasting the copied abnormal message as confirmation information if the position of the R exceeds the boundary of the area where the abnormal vehicle is located. And if the position of the forwarding node R is still positioned in the boundary of the area where the abnormal vehicle is positioned, the forwarding node R selects the optimal subsequent node through judgment.
(a) If vehicles running in the same direction exist behind the running direction of the forwarding node, the forwarding node R selects the farthest vehicle as the preferred next node, and selects the next farthest vehicle as the second selection of the forwarding node.
(b) If there are vehicle nodes in the opposite driving direction, the current forwarding node selects the farthest vehicle as the direct successor node and selects the next farthest node as the second successor node.
(c) If the two conditions are not met, the forwarding node broadcasts an abnormal message once as confirmation, then a storage forwarding mechanism is used for caching the abnormal message, and meanwhile the current position of the forwarding node is detected. If the forwarding node is found to pass through the abnormal vehicle, the forwarding node terminates the forwarding process, otherwise, the forwarding node selects the next forwarding node to forward the abnormal message when encountering other vehicles.
When the reverse vehicle R is selected as a forwarding node, after receiving the abnormal message, the forwarding node detects the position of the forwarding node, and if the abnormal message exceeds the boundary of the area where the abnormal vehicle is located, the forwarding node R only needs to broadcast repeated abnormal messages for confirmation; otherwise, the forwarding node selects the next node according to the following procedure.
(a) If there is no vehicle node in the reverse rear of the forwarding node R, it selects the vehicle node farthest in the reverse front and the vehicle node second farthest in the reverse front as the first choice and the second choice of the subsequent relay.
(b) If there is a vehicle node in the same direction forward of R, the farthest vehicle and the next farthest vehicle are selected to be the direct successor node and the second successor node, respectively.
(c) If the two conditions are not met, the forwarding node broadcasts the copied abnormal message as confirmation information, then switches to a store-and-forward mode, and carries out position detection. If the relay vehicle exceeds the boundary of the area where the abnormal vehicle is located, the forwarding is terminated, otherwise, the forwarding node continues to select the next node. And when the forwarding node or the subsequent forwarding node receives the abnormal message, selecting a different vehicle as the next forwarding node.
On the basis of the forwarding mode, the data transmission is further realized by the aid of the tour vehicle-mounted nodes with the preset routes, and the vehicle nodes are helped to distribute data to one or more target nodes. The tour vehicle-mounted node runs along a predefined route, continuously sends messages in the running process, the roadside node broadcasts the received messages, and the vehicle node receives the corresponding messages when passing through the tour node coverage range. The messages in the network all have unique message id numbers, and after the target node R receives the message, if the target node R judges that the message has not been received before, the id numbers of the messages are stored in a broadcast table. If the target node R searches the same id number of the received information in the broadcast table of the target node R, the information is received, the information is determined to be redundant information and is directly discarded, otherwise, the target node R carries out the next processing on the data.
And judging whether the vehicle node is positioned in a vehicle node dense area or not by the vehicle node according to the position information acquired by the GPS. If target node R is located in a dense area of vehicle nodes or R belongs to a roadside node, R is delayed WD1And then, forwarding the received message. If the location of the receiving node R is not in the vehicle node dense area but the source node S is in the vehicle node dense area, R discards the message. If the source node S is not a vehicle node dense area node, then R will be its own direction DRDirection D to last hop source node SSContinuing the comparison, if their moving directions are the same, at delay WD2And then, sending the message. If it is determined that their direction is opposite, forwarding is aborted.
Wherein WD1＝(1-Pd)×Tp
WD2＝(1-Pd)×2Tp
TpRepresenting the minimum duration between one hop broadcasts.
Pd＝ds-r/dmaxAs probability related to distance, ds-rDistance between source node and target node for the last forwarding, dmaxIs the maximum value within the node coverage.
The route management module divides the communication process between the source node and the target node into a route request, a receiving response and a coding interception.
When a node receives a route request message, a route table entry is first created or updated. It is then checked whether a route request packet for the same source IP address and route request ID message is received within a predefined interval and, if so, the route request packet currently received is ignored. When the received routing request is not ignored, the hop count in the routing request is increased by 1, then the reverse path of the source node is searched in the routing table, and a new reverse routing table entry is created by using the longest matching principle, or the original routing table entry is updated by using the source node ID in the routing request. When a reverse path is created or updated, the following operations are performed:
(1) the route request message source node ID is compared with the corresponding destination node ID in the reverse route, and if the former is larger than the latter, the former is substituted for the latter.
(2) The valid ID value of the routing entry is set to true.
(3) The next of the routing entries is set to the node that transmitted the routing request to that node.
When a node receives a routing response, the previous routing entry is searched in the routing table, and a new entry which does not contain a valid ID is created. The node then increments the number of hops in the route response by 1. The destination node ID in the route response is compared to the existing ID. If the current node is not the source node in the routing response, the routing table is consulted to decide the successor of the routing response. If the link of the routing response sent by the node has errors or is unidirectional, the node enables the receiver of the routing response to reply with a response signal.
Any node forwarding the routing response adds the successor of the routing response to the routing entry predecessor table to the target node, and modifies the lifetime of the source node path to be a larger value of the existing lifetime at the same time. The route response is to intercept and judge through the broadcast packet of the route response, and if so, the route of the current flow in the route response and the interception node information are stored. And judging whether to operate next step or not by the message request in the routing layer and the related judgment condition in the control layer.
The judgment condition of the code interception is as follows:
k messages p to be sent in node queue1，p2，…，pkThe corresponding successor node is v1，v2，…，vkCoding the message to obtain a coded messageBroadcasting the encoded message p to the node set v1，v2，…，vk. If at v1，v2，…，vkIn preparation for receiving the message piNode v ofiHas sensed the division piAll other messages and one of two conditions is satisfied:
node viIs a message PjIs not equal to i, or
Node viHas intercepted the message Pj，j≠i；
Then node viWill buffer the message p within a certain timejTo obtain more coding.
In the encoding process, when the wireless channel is effective, the node takes out the head message from the output queue and checks whether the head message can be encoded with other initial messages in the queue. And if the encoding can be carried out, broadcasting the initial messages to each adjacent node after carrying out AND operation on the initial messages. If the encoding is not available, the node directly broadcasts the initial message without waiting for a matchable initial message. If the forwarding node does not receive the receiving report sent by the adjacent node, the node calculates the arrival rate of the link between the subsequent nodes by using a routing protocol, estimates the possibility that the subsequent node stores a certain initial message according to the arrival rate, and determines whether to carry out network coding according to the possibility.
If a certain forwarding node carries out the coding of the AND of n messages once, the probability that the successor receiving node of the nth message intercepts a certain other message i is PiProbability P that the receiving node can decode correctlyDEqual to the probability that the node can listen to the other n-1 initial messages participating in the encoding:
PD＝P1×P2×…×Pn-1
at this time, the decodable probability P of the successor node set of the n initial messages is judgedDWhether or not more than a threshold is satisfiedPG. If the threshold constraint is met, the node initiates a routing request process and broadcasts a routing request message to the network, wherein the message contains a target node ID, a coding ID, a source node address and a target node address. When the intermediate node receives the routing request message, the intermediate node firstly broadcasts the routing request message sent by the source node, then progressively modifies the encoding ID in the packet, broadcasts the message to a subsequent node set with encoding, and adds an address list of the node set into a packet header. If different routing requests are received on one node, firstly, the size of the ID of the target node is judged for updating the routing; if the target node IDs are the same, the path with the code is judged according to the code ID. After the routing request packet received by the target node is received, the routing response is directly fed back to the source node according to the original route, and the route with the code from the source node to the target node is established.
In a vehicle-mounted network, because a network topology structure changes constantly, communication links are uncertain and often discontinuous, and two states exist: when nodes u, v are in communication range with each other, the links are connected and transmittable; if not, the link is not connected.
(1) Each node u in the network initializes a respective local cluster set CuFrequent access set FuTime duration W (u, v) of encounter of nodes u and v and local population frequent visit set Lu。
(2) When nodes u and v meet, the nodes exchange local information with each other, including a group set, a frequent visit set and a local group frequent visit set. Judging whether the node v belongs to CuIf it belongs to jump 7, if it does not belong to turn 3.
(3) Statistical node v frequent visit set FvNumber of nodes num common to u group set, if number of common nodes num>K-1, wherein K is a preset threshold value, adding a node v into a u group set, and v frequently accessing a set FvJoining u local population frequent Access set Lu. If num<K-1 is changed to 6.
(4) Taking out the ith node v in the node v colony setiStatistical node i frequent visit set FviAnd u population set CuCommon node InumIf I isnumMore than or equal to K-1, node viAdd u population set, viFrequent access set FviJoining u local population frequent Access set Lu. If Inum<K-1 is then changed to 5.
(5) Judging whether i is larger than the size of the group set of the node v, and if so, turning to 7; if not, go to 4.
(6) Calculating the cumulative encounter duration W (u, v) of the nodes u and v, and judging whether W (u, v) exists or not>T and T are preset threshold values, if yes, the node v is added into the u group set, and v frequently visits the set FvJoining u local population frequent Access set Lu. If not, go to 7.
(7) The population update is finished.
After the groups are established, different data forwarding strategies are respectively adopted in the transmission modes in the groups and between the groups.
When a message carried in a node u meets a node v:
(1) if the target node D of the message, the u of the carried message and the encountered node v belong to the same group, measuring whether the data is forwarded or not by using local activity; if the local activity of u is larger than v, the message is forwarded, otherwise, the message is forwarded to v.
(2) And if the target node D and the nodes u and v are not in the same group, using the global activity to measure whether the message is forwarded or not. And if the global activity of the current u node of the carried message is greater than the node v, not forwarding, otherwise, forwarding the message to the node v.
(3) If the target node D and the node u are not in the same group but belong to the same group as the node v, the u forwards the message to the v.
(4) If the target node and the u node of the carried message are in the same group and the encountered node v is in a different group, u does not forward the message.
And forwarding the message according to the above conditions until the target node is met, and submitting the message.
In summary, the invention provides a terminal vehicle communication method based on a wireless protocol, which is suitable for the condition that the topological structure of a vehicle-mounted network is frequently changed, improves the throughput of the network, and reduces the network congestion.
It will be apparent to those skilled in the art that the modules or steps of the present invention described above may be implemented in a general purpose computing system, centralized on a single computing system, or distributed across a network of computing systems, and optionally implemented in program code that is executable by the computing system, such that the program code is stored in a storage system and executed by the computing system. Thus, the present invention is not limited to any specific combination of hardware and software.
It is to be understood that the above-described embodiments of the present invention are merely illustrative of or explaining the principles of the invention and are not to be construed as limiting the invention. Therefore, any modification, equivalent replacement, improvement and the like made without departing from the spirit and scope of the present invention should be included in the protection scope of the present invention. Further, it is intended that the appended claims cover all such variations and modifications as fall within the scope and boundaries of the appended claims or the equivalents of such scope and boundaries.

Claims (2)

1. A method for wireless protocol-based end-vehicle communication, comprising:
arranging tour vehicle-mounted nodes, driving along a predefined route, continuously sending messages in the driving process, broadcasting the received messages by roadside nodes, and receiving corresponding messages when the vehicle nodes pass through the network coverage range of the tour nodes;
(1) each node u in the vehicle-mounted network initializes a respective local colony set CuFrequent access set FuTime duration W (u, v) of encounter of nodes u and v and local population frequent visit set Lu；
(2) When the nodes u and v meet, the nodes exchange local information mutually, wherein the local information comprises a group set, a frequent access set and a local group frequent access set; judging whether the node v belongs to CuIf the jump (7) is performed, if the jump is not performed, the turn (3) is not performed;
(3) statistical node v frequent visit set FvNumber of nodes num common to u group set, if common nodeNumber num>K-1, wherein K is a preset threshold value, adding a node v into a u group set, and v frequently accessing a set FvJoining u local population frequent Access set Lu(ii) a If num<K-1 rotation (6);
(4) taking out the ith node v in the node v colony setiStatistical node i frequent visit set FviAnd u population set CuCommon node InumIf I isnumMore than or equal to K-1, node viAdd u population set, viFrequent access set FviJoining u local population frequent Access set Lu(ii) a If Inum<K-1 is converted to (5);
(5) judging whether i is larger than the size of the group set of the node v, if so, turning to (7); if not, turning to (4);
(6) calculating the cumulative encounter duration W (u, v) of the nodes u and v, and judging whether W (u, v) exists or not>T and T are preset threshold values, if yes, the node v is added into the u group set, and v frequently visits the set FvJoining u local population frequent Access set Lu(ii) a If not, turning to (7);
(7) the population update is finished.
2. The method of claim 1, further comprising:
the messages in the network all have unique message id numbers, and after the target node R receives the messages, if the target node R judges that the messages are not received before, the id numbers of the messages are stored in a broadcast table; if the target node R finds the id number which is the same as the received information in the broadcast table, the message is received, the message is determined to be a redundant message and is directly discarded, otherwise, the target node R processes the data as follows;
according to the position information acquired by the GPS, the vehicle node judges whether the vehicle node is located in a vehicle node dense area; if target node R is located in a dense area of vehicle nodes or R belongs to a roadside node, R is delayed WD1Then, the received message is forwarded; if the location of the target node R is not in the vehicle node dense area but the source node S is in the vehicle node dense area, then R discards the message; if the source node S is not a vehicle node dense area node, then R will be its own direction DRDirection D to last hop source node SSContinuing the comparison, if their moving directions are the same, at delay WD2Then, sending the message, and if the direction of the message is opposite, giving up forwarding;
wherein WD1＝(1-Pd)×Tp
WD2＝(1-Pd)×2Tp
TpRepresents a minimum duration between one-hop broadcasts;
Pd＝ds-r/dmaxas probability related to distance, ds-rDistance between source node and target node for the last forwarding, dmaxIs the maximum value within the node coverage.
CN201610630896.0A 2016-08-03 2016-08-03 Terminal vehicle communication method based on wireless protocol Active CN106304237B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610630896.0A CN106304237B (en) 2016-08-03 2016-08-03 Terminal vehicle communication method based on wireless protocol

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610630896.0A CN106304237B (en) 2016-08-03 2016-08-03 Terminal vehicle communication method based on wireless protocol

Publications (2)

Publication Number Publication Date
CN106304237A CN106304237A (en) 2017-01-04
CN106304237B true CN106304237B (en) 2020-02-18

Family

ID=57664968

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610630896.0A Active CN106304237B (en) 2016-08-03 2016-08-03 Terminal vehicle communication method based on wireless protocol

Country Status (1)

Country Link
CN (1) CN106304237B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107889077B (en) * 2017-11-01 2020-06-09 浙江如新智能科技有限公司 Rapid data transmission method based on Internet of vehicles technology
CN111886823A (en) * 2018-03-08 2020-11-03 诺基亚技术有限公司 Method, apparatus and computer program

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103763785A (en) * 2013-12-31 2014-04-30 哈尔滨工业大学 VANET message broadcasting method based on distances
US9852637B2 (en) * 2014-01-10 2017-12-26 Regents Of The University Of Minnesota Vehicle-to-vehicle congestion monitoring using ad hoc control
WO2015124746A1 (en) * 2014-02-20 2015-08-27 Nec Europe Ltd. Method for performing delay-aware forwarding in a wireless ad hoc network
CN105592138B (en) * 2015-10-19 2018-08-28 中山大学 A kind of city vehicle-mounted road of crossing ad hoc nodes auxiliary is by protocol method

Also Published As

Publication number Publication date
CN106304237A (en) 2017-01-04

Similar Documents

Publication Publication Date Title
CN108600942B (en) Routing method of unmanned aerial vehicle ad hoc network
Jarupan et al. PROMPT: A cross-layer position-based communication protocol for delay-aware vehicular access networks
Li et al. A distance-based directional broadcast protocol for urban vehicular ad hoc network
Chen et al. A connectivity-aware intersection-based routing in VANETs
US8208382B2 (en) Method for estimating and signalling the density of mobile nodes in a road network
CN107302576B (en) Adaptive service data distribution method based on opportunistic communication under car networking environment
CN105376152B (en) A kind of more candidate compound relay data transmission methods in In-vehicle networking
CN109474897B (en) Hidden Markov model-based vehicle networking safety message single-hop cooperative broadcasting method
Leal et al. Information-centric opportunistic data dissemination in vehicular ad hoc networks
Chitra et al. Efficient broadcasting mechanisms for data dissemination in vehicular ad hoc networks
KR20140068591A (en) Network system for vehicle
Han et al. Speed and position aware dynamic routing for emergency message dissemination in VANETs
Najafzadeh et al. Broadcasting in connected and fragmented vehicular ad hoc networks
Kuai et al. Delay-tolerant forwarding strategy for named data networking in vehicular environment
Wang et al. Delay-aware relay selection with heterogeneous communication range in VANETs
CN106304237B (en) Terminal vehicle communication method based on wireless protocol
CN106254250B (en) Car networking short-distance networking method
Khan et al. Data collection from smart-city sensors through large-scale urban vehicular networks
Sakthipriya et al. A reliable communication scheme for VANET communication environments
CN106850553B (en) A kind of implementation method of the improvement DSDP service discovery protocol suitable for vehicle-mounted short distance communication network
Wahid et al. Software-Defined Networks and Named Data Networks in Vehicular Ad Hoc Network Routing: Comparative Study and Future Directions
KR20090056072A (en) Emergency warning message broadcasting method using range-based relay node selecting method for vehicular ad-hoc network
Kwon Improving multi-channel wave-based V2X communication to support advanced driver assistance system (ADAS)
Ksouri et al. Hybrid routing for safety data with intermittent V2I connectivity
Fotros et al. A timely VANET multi-hop routing method in IoT

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
PE01 Entry into force of the registration of the contract for pledge of patent right
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Wireless protocol-based terminal vehicle communication method

Effective date of registration: 20200619

Granted publication date: 20200218

Pledgee: Bank of Chengdu science and technology branch of Limited by Share Ltd.

Pledgor: CHENGDU ZHIDA TECHNOLOGY Co.,Ltd.

Registration number: Y2020980003275