CN115623449A - Internet of vehicles relay node switching mechanism applied to two-dimensional and three-dimensional scenes - Google Patents
Internet of vehicles relay node switching mechanism applied to two-dimensional and three-dimensional scenes Download PDFInfo
- Publication number
- CN115623449A CN115623449A CN202211004742.2A CN202211004742A CN115623449A CN 115623449 A CN115623449 A CN 115623449A CN 202211004742 A CN202211004742 A CN 202211004742A CN 115623449 A CN115623449 A CN 115623449A
- Authority
- CN
- China
- Prior art keywords
- dimensional
- hop
- node
- relay
- relay node
- 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.)
- Pending
Links
- 230000007246 mechanism Effects 0.000 title claims abstract description 24
- 238000000034 method Methods 0.000 claims abstract description 43
- 238000004891 communication Methods 0.000 claims abstract description 31
- 238000010187 selection method Methods 0.000 claims abstract description 26
- 238000004364 calculation method Methods 0.000 claims abstract 3
- 230000004888 barrier function Effects 0.000 claims description 8
- 230000006855 networking Effects 0.000 claims description 5
- 230000008569 process Effects 0.000 claims description 4
- 230000005540 biological transmission Effects 0.000 claims description 3
- 238000005562 fading Methods 0.000 claims description 3
- 230000007613 environmental effect Effects 0.000 abstract description 4
- 238000011160 research Methods 0.000 abstract description 2
- 230000002349 favourable effect Effects 0.000 abstract 1
- 239000011435 rock Substances 0.000 description 2
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000000644 propagated effect Effects 0.000 description 1
- 238000012876 topography Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W4/46—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for vehicle-to-vehicle communication [V2V]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/24—Reselection being triggered by specific parameters
- H04W36/30—Reselection being triggered by specific parameters by measured or perceived connection quality data
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The method is applied to a relay node switching mechanism of the Internet of vehicles in two-dimensional and three-dimensional scenes, the influence of road height difference and environmental obstacles on a V2V communication range is considered, and whether a two-dimensional relay node selection method used in a general situation is suitable for a current scene or not is judged by combining the distribution of nodes in a two-hop range, so that a node switching strategy is completed. Calculating a two-hop communication range along the length of the road obtained by a GPSR method and a traversal method; judging whether the calculation result of the GPSR is smaller than the maximum value of the traversal result; if the calculation result of the GPSR is larger, the two-dimensional relay method is continuously adopted. The invention dynamically estimates the communication range of the current relay node and researches when a trigger and exit mechanism of a key three-dimensional area is adopted to match a corresponding relay node selection method. The method is more favorable for ensuring the characteristics of ultra-low time delay and high reliability of V2V communication by combining with an actual scene, thereby improving the emergency message propagation efficiency.
Description
Technical Field
The invention relates to a V2V communication technology in a vehicle self-organizing network, in particular to a vehicle relay node switching mechanism applied to two-dimensional and three-dimensional scenes.
Background
The Internet of vehicles is used as an important component of modern intelligent traffic and is widely applied to the aspect of intelligent traffic. The emergency message broadcast is applied as the safety of the Internet of vehicles, so that a high-efficiency and safe driving environment can be provided, casualties are effectively avoided, and economic loss is reduced.
The existing relay node selection method focuses on research under a two-dimensional scene, adopts a fixed communication range, only considers the message propagation performance of one hop, and selects the next hop relay node of a source node. The three-dimensional road has a complex structure and has the characteristics different from a two-dimensional road. The barriers between layers enable the communication ranges of the transmitting nodes in different layers to have larger difference, and the effective height of the V2V base station antenna can be changed along with the fluctuation of the terrain, so that the change of the actual communication range is influenced. Due to the difference of the communication ranges, the connectivity and hop count increasing probability of the relay node performance are often affected, and therefore, the two-dimensional scene relay node selection method cannot be simply expanded and applied to a three-dimensional scene.
Disclosure of Invention
The invention aims to provide a switching mechanism of a relay node in an internet of vehicles aiming at the problem that a relay node selection method under a two-dimensional scene is not suitable for a current key three-dimensional area in consideration of the influence of road elevation difference and environmental obstacles (such as vegetation, rocks and the like) on the communication range of the relay node.
In order to solve the problems, the invention adopts the following technical scheme:
a source node sends a request to a destination node;
each node collects the position (longitude, latitude and altitude) of the vehicle through a GPS and a sensor, and acquires the surrounding environment information through GIS assistance;
the source node obtains the position information of other nodes through the Beacon;
obtaining the height h of the vehicle antenna from the ground Rx ；
Calculating the effective height h of the source node antenna according to the position of the vehicle and the height of the vehicle from the ground Tx And the Euclidean distance between vehicles;
h Tx = ground altitude of source node-ground altitude of location of mobile node + vehicle antenna off-ground height;
calculating the path loss PL (d) between the source node and other nodes by adopting the corrected IEEE802.16d model, wherein the path loss PL (d) is shown as (1);
wherein d is 0 For reference distance, γ = a-bh Tx +c/h Tx A, b, C are parameters, C f As a factor related to the carrier frequency, C Rx Are coefficients associated with the receive antennas.
Shadow fading can be brought to the networking relay node vehicle of getting off in the three-dimensional road scene because of topography, barrier, adjacent oversize vehicle.
Shadow fading, which describes the slowly varying nature of the median of the signal level in the mesoscale interval (hundreds of wavelengths), can be characterized by a random variable of a lognormal distribution, i.e.:
PL'(d)＝PL(d)+X σ (2)
X σ is a random variable with zero mean value Gaussian distribution, and the type, density and width of the environmental barrier influence X σ The value of (c).
Taking the minimum value D of the allowable path loss of the uplink and downlink transmission lines of two nodes in a common scene as a reference;
judging whether the total value loss PL' (D) of the source node and a certain arbitrary node is smaller than the value D, thereby obtaining an alternative relay node in the communication range of the source node;
finding the next hop relay node of the source node according to the greedy algorithm GPSR, and recording the road Length from the source node R1 ；
Finding the second hop relay node of the source node by the repeated greedy algorithm, and recording the road Length of the second hop relay node from the first hop relay node R2 ；
Calculating the total length W of the two-hop road for message propagation under the GPSR algorithm GPSR ；
W GPSR ＝Length R1 +Length R2 (3)
Calculating the road length of other alternative nodes in the communication range of the source node from the source node;
and traversing the alternative nodes of the source node, assuming that the alternative nodes are first-hop relay nodes of the source node, and finding second-hop alternative nodes of the communication range of the alternative nodes. Taking the node with the longest road in the second hop candidate nodes as a second hop relay, and calculating the road length of the second hop relay from the first hop relay node;
calculating the total length of two-hop roads of the traversal method (W) 2 ,W 3 ,W i, ...,Wn}；
Taking the maximum value of the traversal result as the total length of the two-hop road of the dynamic three-dimensional relay method;
W dynamic three-dimensional relay ＝MAX{W 2 ,W 3 ,W i ,...,Wn} (4)
Judgment of W GPSR Whether or not less than W Dynamic three-dimensional relay If the judgment condition is met, the area triggers a two-dimensional switching to three-dimensional relay node selection mechanism, the first relay node entering the area is switched to a relay node selection method under a three-dimensional road scene, and if the judgment condition is not met, the previous two-dimensional road scene relay node selection method is continued to be used. If the relay node selection method under the three-dimensional road scene is switched from two-dimensional to the three-dimensional road scene before, but the Nth relay node is found not to meet the switching threshold value condition, the Nth node exits the three-dimensional road relay node selection method, a proper two-dimensional road scene relay node selection method is selected, and the switching algorithm is completed.
The method is applied to switching judgment of the relay node selection method of the two-dimensional road and the three-dimensional road, can effectively judge key characteristics of the road needing to be selected by the relay node of the three-dimensional scene, provides a switching threshold value and a switching mechanism, and can judge a more reasonable relay node selection method according to a specific scene.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below.
Fig. 1 is a flowchart illustrating a triggering or exiting process of a relay node switching mechanism in a vehicle networking system applied to two-dimensional and three-dimensional scenes according to an embodiment of the present invention;
FIG. 2 is a detailed flowchart of step S200 in FIG. 1;
fig. 3 is a schematic diagram of two-hop selection by a GPSR method and two-hop selection by a three-dimensional dynamic relay method applied to a two-dimensional and three-dimensional scene car networking relay node switching mechanism according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The invention has been described in detail with reference to fig. 1 for the switching threshold and mechanism of relay nodes in internet of vehicles applied to two-dimensional and three-dimensional scenes, and includes the following steps:
s100, acquiring self three-dimensional position coordinates including longitude, latitude and altitude by the source node and other vehicles on the message propagation direction road through a GPS; acquiring a target environment barrier parameter by means of a GIS;
s200, finding all alternative nodes in the actual communication range of the source node according to the three-dimensional position information and the barrier parameters acquired in the S100;
s300, obtaining respective two-hop communication distance sum of a greedy algorithm GPSR and a three-dimensional traversal method;
s400, taking the two-hop result of the GPSR method as a switching threshold value, and defining the maximum value of the result obtained by the three-dimensional traversal method as the total length of the two-hop road of the dynamic three-dimensional relay method. And comparing the two results, and if the two-hop distance of the dynamic three-dimensional relay method is greater than the current threshold value, triggering a relay node switching mechanism.
And S500, starting the three-dimensional road relay node selection method by the first relay node meeting the threshold judgment condition, and not switching or exiting the three-dimensional road relay node selection method if the judgment condition is not met. If the relay node selection method under the three-dimensional road scene is switched from the two-dimensional mode to the three-dimensional mode, but the Nth relay node is found not to meet the switching condition, the Nth node exits the three-dimensional road relay node selection method, the appropriate two-dimensional road scene relay node selection method is selected, and the switching mechanism is completed.
In step S100 of this example, the target environmental obstacle may be vegetation, rock, or mountain, and the specific attenuation rate caused by the vegetation depends on the kind, density, and wide range of density of the vegetation;
referring to fig. 2, in step S200 of the present example, the source node may obtain three-dimensional position coordinates of other vehicles through Beacon, and calculate their relative height difference, euclidean distance. The height of the receiving antenna is the height of the vehicle antenna from the ground, the height of the transmitting antenna is the relative height difference of the two nodes and the height of the vehicle from the ground antenna, the path loss of the two vehicles is calculated according to an IEEE802.16d wireless communication model, and the final total loss is obtained by adding the barrier attenuation factor loss obtained by the GIS. Calculating the maximum allowable path loss of an uplink and a downlink according to the base station wireless equipment parameters selected by engineering, antenna feeder performance and other indexes, generally taking the smaller allowable path loss of an uplink and downlink transmission line as a reference, and obtaining a next-hop relay alternative set node of a source node by judging whether the final path loss between two nodes is smaller than the reference;
in step S300 of this example, a node that is farthest along the road length and is propagated in the candidate nodes of the source node is selected as a relay node of the first hop according to a greedy algorithm, the second hop also selects a node that is farthest along the road length within the communication range of the first hop, the road length of the second hop node from the source node is calculated, and this is used as a result of two hops in the GPSR method; traversing the alternative set nodes of the source node, respectively calculating the road lengths of the alternative set nodes from the source node, using the alternative set nodes as a sending end, finding out second-hop alternative nodes in the communication range of the alternative set nodes, selecting the node with the longest road edge in the second-hop alternative nodes as a second-hop relay, calculating the road lengths of the alternative set nodes from the sending end, and calculating the total length { W of a two-hop road obtained by a three-dimensional traversal method 2 ,W 3 ,W i ,...,Wn}。
Further, the GPSR and three-dimensional traversal method of the present invention are described with reference to fig. 3. For example, in fig. 3, S1 is used as a source node, S2, S3, and S4 are all next-hop candidate nodes thereof, S4 is farthest along the road length, S5, and S6 are candidate nodes within the communication range thereof, and S4, S5, S6, and S7 are all within the communication range of S3;
in step S400 of this example, the two-hop result of the GPSR method is compared with the maximum two-hop value of the three-dimensional traversal method, and if the two-hop result of the three-dimensional traversal method is greater than the two-hop result of the GPSR method, it is described that the relay node selection method in the two-dimensional scene is not necessarily optimal due to the influence of an obstacle or an elevation difference on the communication range, and the two-hop distance that the two-hop distance of the dynamic three-dimensional relay method is greater than the two-hop distance of the GPSR method is used as a threshold condition for triggering the switching of the relay node selection method;
in step S500 of this embodiment, whether to start the relay node switching mechanism is determined according to the determination result of step S400, and if the determination condition of step S400 is satisfied, the first node meeting the condition starts the switching mechanism, and a new three-dimensional road relay node selection scheme is selected. If not, a switching mechanism does not need to be started or the node exits from the current three-dimensional road relay node selection method. Therefore, a reasonable and effective switching mechanism can be provided for different road characteristics matching different relay node selection methods.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the scope of the present invention, and all equivalent structural changes made by using the contents of the present specification and the drawings, or any other related technical fields, which are directly or indirectly applied to the present invention, are included in the scope of the present invention.
Claims (5)
1. A switching mechanism of relay nodes in Internet of vehicles applied to two-dimensional and three-dimensional scenes is characterized by comprising the following processes:
1) Acquiring current three-dimensional position information of a vehicle through a vehicle-mounted GPS, wherein the information comprises longitude, latitude and altitude; acquiring surrounding environment barrier parameters by a GIS (geographic information system) of a vehicle;
2) Calculating the next hop available alternative node in the source node communication area according to the vehicle coordinates and the barrier parameters;
3) Calculating to obtain the next hop farthest communicable position of the available alternative node of the source node, and obtaining the two-hop communication distance of the GPSR method and the three-dimensional traversal method, wherein the farthest communicable position and the communication distance are both defined along the length of the road;
4) Defining the maximum value of the result obtained by the three-dimensional traversal method as the total length of the two-hop road of the dynamic three-dimensional relay method, and taking the two-hop distance obtained by the calculation of the GPSR (general packet radio service) as the threshold condition for switching the relay nodes of the internet of vehicles, wherein the two-hop distance is smaller than that of the dynamic three-dimensional relay method;
5) And determining whether to start the three-dimensional road relay node selection method or not according to whether the current node meets the threshold condition or not.
2. The vehicle networking relay node switching mechanism applied to two-dimensional and three-dimensional scenes as claimed in claim 1, wherein in step 2), considering high level differences and obstacles, the communication ranges of different nodes are greatly different, the communication range of a V2V vehicle is no longer fixed, and the specific process of obtaining the next-hop available alternative node in the source node communication area is as follows:
the source node acquires the position information of other vehicles by using Beacon;
the height of the vehicle antenna from the ground is h Rx ，h Tx = ground altitude of source node-ground altitude of position where mobile node is located + vehicle antenna off-ground height;
calculating the path loss PL (d) between the source node and other nodes by adopting the corrected IEEE802.16d model, as shown in (1);
shadow fading, which describes the slowly varying nature of the median of the signal level in the mesoscale interval (hundreds of wavelengths), can be characterized by a random variable of a lognormal distribution, i.e.:
PL'(d)＝PL(d)+X σ (2)
X σ is a random variable with zero mean value Gaussian distribution;
taking the minimum value D of the allowable path loss of the uplink and downlink transmission lines of two nodes in a general scene as a reference;
and judging whether the total value loss PL' (D) of the source node and any node is less than the value D or not, thereby obtaining the alternative relay node in the communication range of the source node.
3. The vehicle networking relay node switching mechanism applied to two-dimensional and three-dimensional scenes as claimed in claim 1, wherein in step 3), the specific process of obtaining the two-hop communication distance of the GPSR method and the three-dimensional traversal method is as follows:
finding the next hop relay node of the source node according to the greedy algorithm GPSR, and recording the road Length of the next hop relay node from the source node R1 ；
Finding the second hop relay node of the source node by the repeated greedy algorithm, and recording the road Length of the second hop relay node from the first hop relay node R2 ；
Calculating the total length W of the two-hop road for message propagation under the GPSR algorithm GPSR ；
W GPSR ＝Length R1 +Length R2 (3)
Calculating the road length of other alternative nodes in the communication range of the source node from the source node;
traversing the alternative nodes of the source node, assuming that the alternative nodes are first-hop relay nodes of the source node, finding second-hop alternative nodes in the communication range of the alternative nodes, taking the node with the longest road edge in the second-hop alternative nodes as a second-hop relay, and calculating the road length of the second-hop alternative nodes from the first-hop relay nodes;
calculating the total length of the two-hop road (W) obtained by the three-dimensional traversal method 2 ,W 3 ,W i ,...,Wn}。
4. The switching mechanism of the relay node in the internet of vehicles applied to the two-dimensional and three-dimensional scenes as claimed in claim 1, wherein in the step 4), a maximum value is selected from the two-hop distance sets obtained by the three-dimensional traversal method in the step 3), and the maximum value is used as the total length of the two-hop road of the dynamic three-dimensional relay method, that is:
W dynamic three-dimensional relay ＝MAX{W 2 ,W 3 ,W i ,...,Wn} (4)
And taking the two-hop result of the GPSR method as a switching threshold, wherein the two-hop distance obtained by the GPSR method is smaller than the two-hop distance of the dynamic three-dimensional relay method and is used as a threshold condition for switching the relay nodes of the two-dimensional scene and the three-dimensional scene.
5. The switching mechanism of the relay node in the internet of vehicles applied to the two-dimensional and three-dimensional scenes as claimed in claim 1, wherein in step 5), the switching mechanism of the relay node between the two-dimensional scene and the three-dimensional scene is provided. When the relay node meets the threshold condition of the step 4), and the two-hop distance obtained by the GPSR method is smaller than the two-hop distance of the dynamic three-dimensional relay method, switching to a relay node selection method under the three-dimensional road scene from the first relay node entering the area, and if the two-hop distance does not meet the two-hop distance, continuing to use the previous two-dimensional road scene relay node selection. If the relay node selection method under the three-dimensional road scene is switched from the two-dimensional mode to the three-dimensional mode, but the Nth relay node is found not to meet the switching threshold value condition, the Nth node exits the three-dimensional road relay node selection method, a proper two-dimensional road scene relay node selection method is selected, and the switching mechanism is completed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211004742.2A CN115623449A (en) | 2022-08-22 | 2022-08-22 | Internet of vehicles relay node switching mechanism applied to two-dimensional and three-dimensional scenes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211004742.2A CN115623449A (en) | 2022-08-22 | 2022-08-22 | Internet of vehicles relay node switching mechanism applied to two-dimensional and three-dimensional scenes |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115623449A true CN115623449A (en) | 2023-01-17 |
Family
ID=84856583
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211004742.2A Pending CN115623449A (en) | 2022-08-22 | 2022-08-22 | Internet of vehicles relay node switching mechanism applied to two-dimensional and three-dimensional scenes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115623449A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107690169A (en) * | 2017-09-22 | 2018-02-13 | 广州大学 | A kind of retransmission method of GPSR Routing Protocols suitable for car networking |
| CN110446179A (en) * | 2019-07-02 | 2019-11-12 | 长沙理工大学 | The choosing method of relay node optimal location applied to car networking bend scene |
| CN111683351A (en) * | 2020-06-09 | 2020-09-18 | 重庆邮电大学 | Three-dimensional vehicle-mounted self-organizing network routing method based on packet receiving probability |
-
2022
- 2022-08-22 CN CN202211004742.2A patent/CN115623449A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107690169A (en) * | 2017-09-22 | 2018-02-13 | 广州大学 | A kind of retransmission method of GPSR Routing Protocols suitable for car networking |
| CN110446179A (en) * | 2019-07-02 | 2019-11-12 | 长沙理工大学 | The choosing method of relay node optimal location applied to car networking bend scene |
| CN111683351A (en) * | 2020-06-09 | 2020-09-18 | 重庆邮电大学 | Three-dimensional vehicle-mounted self-organizing network routing method based on packet receiving probability |
Non-Patent Citations (2)
| Title |
|---|
| JIN-WOO KIM: "A Cooperative Communication Protocol for Qos Provisioning in IEEE 802.11p/Wave Vehicular Networks", SENSORS, 25 October 2018 (2018-10-25) * |
| 解荧;韩阳龙;赵刚;于富财;胡光岷;: "伪三维的地理位置无线传感器网络路由算法", 计算机工程与应用, no. 22, 21 November 2012 (2012-11-21) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Al-Rabayah et al. | A new scalable hybrid routing protocol for VANETs | |
| Chen et al. | A connectivity-aware intersection-based routing in VANETs | |
| Slavik et al. | Spatial distribution and channel quality adaptive protocol for multihop wireless broadcast routing in VANET | |
| Yang et al. | ACAR: Adaptive connectivity aware routing protocol for vehicular ad hoc networks | |
| Sood et al. | Clustering in MANET and VANET: A survey | |
| Zemouri et al. | A fast, reliable and lightweight distributed dissemination protocol for safety messages in urban vehicular networks | |
| CN109640369B (en) | Vehicle-mounted network reliable communication method based on adaptive power | |
| CN107171965A (en) | Car networking cross-layer chance method for routing based on Distributed Congestion Control Mechanisms | |
| Sohail et al. | Routing protocols in vehicular adhoc networks (vanets): A comprehensive survey | |
| CN107231670A (en) | Alarm relay selection algorithm based on neighbours' vehicle information with alarm direction | |
| Chakroun et al. | LAMD: Location-based Alert Message Dissemination scheme for emerging infrastructure-based vehicular networks | |
| US8526444B2 (en) | Method for distributing data packets in a mobile node network and associated node | |
| Wu et al. | MBR: A map-based relaying algorithm for reliable data transmission through intersection in VANETs | |
| Senouci et al. | An efficient weight-based clustering algorithm using mobility report for IoV | |
| Sharma et al. | A contemporary proportional exploration of numerous routing protocol in VANET | |
| US11201649B2 (en) | Base station device, terminal device, communication system, and communication control method | |
| KR101601774B1 (en) | Routing method for vanet | |
| CN110493843B (en) | 3D-GPSR routing method based on circular omnidirectional antenna model | |
| Ksouri et al. | Hybrid routing for safety data with intermittent V2I connectivity | |
| CN115623449A (en) | Internet of vehicles relay node switching mechanism applied to two-dimensional and three-dimensional scenes | |
| Soua et al. | Broadcast-based directional routing in vehicular ad-hoc networks | |
| Cao et al. | Efficient urban broadcast protocol for v2v communications with relay control | |
| Kasana et al. | Multimetric next hop vehicle selection for geocasting in vehicular ad-hoc networks | |
| Takahashi et al. | Shadowing-fading-based intersection geographic opportunistic routing protocol for urban VANETs | |
| CN108391249A (en) | A kind of traffic perception route method applied to car networking |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |