CN114885397A - Method, device and equipment for selecting relay nodes in Internet of vehicles and readable storage medium - Google Patents
Method, device and equipment for selecting relay nodes in Internet of vehicles and readable storage medium Download PDFInfo
- Publication number
- CN114885397A CN114885397A CN202111553016.1A CN202111553016A CN114885397A CN 114885397 A CN114885397 A CN 114885397A CN 202111553016 A CN202111553016 A CN 202111553016A CN 114885397 A CN114885397 A CN 114885397A
- Authority
- CN
- China
- Prior art keywords
- distance
- vehicles
- internet
- relay node
- maximum communication
- 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
- 238000000034 method Methods 0.000 title claims abstract description 46
- 238000004891 communication Methods 0.000 claims abstract description 84
- 230000006855 networking Effects 0.000 claims description 19
- 238000004590 computer program Methods 0.000 claims description 10
- 238000000638 solvent extraction Methods 0.000 claims description 10
- 238000005192 partition Methods 0.000 claims description 5
- 238000012545 processing Methods 0.000 claims description 2
- 230000005540 biological transmission Effects 0.000 abstract description 5
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 230000009471 action Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000010187 selection method Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000012804 iterative process Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
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/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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- 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]
-
- 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
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method for selecting a relay node in an internet of vehicles, which considers that obstacles exist in the internet of vehicles, so that the estimated maximum communication distance of a vehicle is possibly inaccurate, and the possibility that the vehicle beyond the estimated maximum communication distance receives broadcast of a sending node exists, so that after the vehicle receives the broadcast of the sending node, the vehicle can compete with other vehicles in a section to serve as the relay node of the sending node under the condition that the distance between the vehicle and the sending node belongs to the distance section which is larger than the estimated maximum communication distance, and a vehicle farther away can be found to serve as the relay node, thereby improving the efficiency of information transmission. The invention also discloses a device and equipment for selecting the relay node of the Internet of vehicles and a computer readable storage medium, and the device and equipment have the same beneficial effects as the method for selecting the relay node of the Internet of vehicles.
Description
Technical Field
The invention relates to the field of communication, in particular to a method for selecting a relay node in the internet of vehicles, and further relates to a device, equipment and a computer readable storage medium for selecting the relay node in the internet of vehicles.
Background
In the internet of vehicles, each vehicle has a need to communicate with other vehicles in the internet of vehicles, and if a target vehicle is out of its own communication range, a relay node needs to be searched in its own communication range so that the relay node can forward information, and when the target vehicle is far enough, the relay node needs to forward information to the target vehicle many times.
Therefore, how to provide a solution to the above technical problem is a problem that needs to be solved by those skilled in the art.
Disclosure of Invention
The invention aims to provide a method for selecting the relay node of the Internet of vehicles, which can find a vehicle farther away as the relay node, thereby improving the efficiency of information transmission; another object of the present invention is to provide a selection device, an apparatus and a computer readable storage medium including a relay node in an internet of vehicles, which can find a vehicle farther away as a relay node, thereby improving the efficiency of information transfer.
In order to solve the technical problem, the invention provides a method for selecting a relay node in the internet of vehicles, which comprises the following steps:
after receiving a sending node position broadcasted by a sending node and an estimated maximum communication distance of the sending node, dividing an interval from zero to the estimated maximum communication distance into a plurality of distance sections, and taking the interval larger than the estimated maximum communication distance as a distance section;
before the time slot of the first appointed sequence after the distance section division comes, judging whether a target distance section to which the distance between the target distance section and the position of the sending node belongs is the distance section of the first appointed sequence from far to near obtained by the last division;
if yes, broadcasting a mark signal in the Internet of vehicles so that vehicles which do not belong to the distance zone of the vehicles exit the competition of the relay nodes;
under the condition that the distance section corresponding to the self is a distance section larger than the estimated maximum communication distance, randomly generating a back-off time for the self and starting timing;
and if the selected signals broadcast by other vehicles in the Internet of vehicles are not received before the timing time reaches the back-off time, broadcasting the selected signals in the Internet of vehicles so that the sending node can be selected as the relay node.
Preferably, when the distance segment corresponding to the self is a distance segment greater than the estimated maximum communication distance, randomly generating a back-off time for the self and starting timing specifically includes:
judging whether the distance section corresponding to the distance section is a distance section larger than the estimated maximum communication distance;
if the distance is greater than the estimated maximum communication distance, randomly generating a back-off time for the distance and starting timing;
if the distance section is not greater than the estimated maximum communication distance, adding the iteration times of which the initial values are zero together to judge whether the current iteration times reach a preset termination iteration time;
if so, executing the step of randomly generating the back-off time for the self and starting timing;
if not, dividing the distance section corresponding to the distance section into a plurality of distance sections according to a preset partitioning method, and executing the step of judging whether the target distance section to which the distance between the distance section and the position of the sending node belongs is the distance section in the first designated sequence from far to near in the plurality of distance sections obtained by the last partitioning before the time slot in the first designated sequence after the last distance section is divided arrives.
Preferably, if the selected signal broadcasted by other vehicles in the internet of vehicles is not received before the timing time reaches the back-off time, the selected signal is broadcasted in the internet of vehicles, so that the sending node selects itself as the relay node specifically:
judging whether a selected signal broadcasted by other vehicles in the Internet of vehicles is received before the timing time reaches the back-off time;
if not, broadcasting the selected signal in the Internet of vehicles so that the sending node selects the sending node as a relay node;
and if so, quitting the competition of the relay node.
Preferably, after broadcasting the selected signal in the internet of vehicles, the method for selecting a relay node in the internet of vehicles further comprises:
judging whether the distance between the self and the position of the sending node is larger than the estimated maximum communication distance or not;
and if so, recording the distance between the sending node and the sending node.
Preferably, the internet of vehicles is a three-dimensional internet of vehicles.
Preferably, the dividing the interval from zero to the estimated maximum communication distance into a plurality of distance sections specifically includes:
and dividing an interval from zero to the estimated maximum communication distance into a plurality of distance sections according to an exponential partition method.
In order to solve the above technical problem, the present invention further provides a device for selecting a relay node in an internet of vehicles, including:
the system comprises a partitioning module, a receiving module and a processing module, wherein the partitioning module is used for dividing an interval from zero to the estimated maximum communication distance into a plurality of distance sections after receiving the position of a sending node broadcasted by the sending node and the estimated maximum communication distance of the sending node, and taking the interval larger than the estimated maximum communication distance as one distance section;
the judging module is used for judging whether a target distance section to which the distance between the judging module and the position of the sending node belongs is a distance section in a first appointed sequence from far to near obtained by last division before a time slot in the first appointed sequence after distance section division comes, and if so, triggering the first broadcasting module;
the first broadcasting module is used for broadcasting a mark signal in the Internet of vehicles so that vehicles which do not belong to the distance section of the first broadcasting module exit the competition of the relay node;
a generating module, configured to randomly generate a back-off time for the distance segment corresponding to the generating module and start timing when the distance segment is greater than the estimated maximum communication distance;
and the second broadcasting module is used for broadcasting the selected signal in the internet of vehicles so that the sending node can be selected as the relay node if the selected signal broadcasted by other vehicles in the internet of vehicles is not received before the timing time reaches the back-off time.
Preferably, the internet of vehicles is a three-dimensional internet of vehicles.
In order to solve the above technical problem, the present invention further provides a device for selecting a relay node in an internet of vehicles, including:
a memory for storing a computer program;
a processor for implementing the steps of the method for selecting a relay node in the internet of vehicles as described above when executing the computer program.
In order to solve the above technical problem, the present invention further provides a computer-readable storage medium, where a computer program is stored, and the computer program, when executed by a processor, implements the steps of the method for selecting the relay node in the internet of vehicles as described above.
The invention provides a method for selecting a relay node in an internet of vehicles, which considers that obstacles exist in the internet of vehicles, so that the estimated maximum communication distance of a vehicle is possibly inaccurate, and the possibility that the vehicle beyond the estimated maximum communication distance receives broadcast of a sending node exists, so that after the vehicle receives the broadcast of the sending node, under the condition that the distance between the vehicle and the sending node belongs to a distance section which is larger than the estimated maximum communication distance, the vehicle can compete with other vehicles in the section to form the relay node serving as the sending node, and a vehicle farther away can be found to serve as the relay node, thereby improving the efficiency of information transmission.
The invention also provides a device and equipment for selecting the relay node in the Internet of vehicles and a computer readable storage medium, and the device and equipment have the same beneficial effects as the method for selecting the relay node in the Internet of vehicles.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed in the prior art and the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
Fig. 1 is a schematic flow chart of a method for selecting a relay node in the internet of vehicles according to the present invention;
fig. 2 is a schematic flow chart of searching for a relay node within an estimated maximum communication distance according to the present invention;
fig. 3 is a schematic structural diagram of a device for selecting a relay node in the internet of vehicles according to the present invention;
fig. 4 is a schematic structural diagram of a device for selecting a relay node in the internet of vehicles according to the present invention.
Detailed Description
The core of the invention is to provide a method for selecting the relay node of the internet of vehicles, which can find a vehicle farther away as the relay node, thereby improving the efficiency of information transmission; another core of the present invention is to provide a selection device, a device and a computer readable storage medium including a relay node in the internet of vehicles, which can find a vehicle farther away as a relay node, thereby improving the efficiency of information transfer.
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without making any creative effort based on the embodiments in the present invention, belong to the protection scope of the present invention.
Referring to fig. 1, fig. 1 is a schematic flowchart of a method for selecting a relay node in a vehicle networking system, where the method for selecting a relay node in a vehicle networking system includes:
s101: after receiving the position of a sending node broadcasted by the sending node and the estimated maximum communication distance of the sending node, dividing an interval from zero to the estimated maximum communication distance into a plurality of distance sections, and taking the interval greater than the estimated maximum communication distance as a distance section;
specifically, in consideration of the technical problems in the background art as described above, in combination with consideration of the existence of obstacles in the internet of vehicles, the estimated maximum communication distance of the vehicle may be inaccurate, and vehicles other than the estimated maximum communication distance may have a possibility of receiving the broadcast of the transmitting node, so that if a relay node is searched only within the estimated maximum communication distance, vehicles within the actual communication range but outside the estimated maximum communication distance may be missed, and therefore, after receiving the position of the transmitting node broadcasted by the transmitting node and the estimated maximum communication distance of the transmitting node, the present application may divide the interval from zero to the estimated maximum communication distance into several distance segments, and may use the interval greater than the estimated maximum communication distance as a distance segment as a data basis for the subsequent steps.
The sending node may be a source vehicle that is to send information, or may be a relay node selected before that is closer to the source vehicle.
Specifically, the data packet broadcast by the sending node may be a request to broadcast an RTB.
S102: before the time slot of the first appointed sequence after the distance section division comes, judging whether a target distance section to which the distance between the target distance section and the position of the sending node belongs is the distance section of the first appointed sequence from far to near obtained by the last division;
specifically, after the last distance section division, each obtained distance section corresponds to one time slot, and the time slot of the distance section farther away from the sending node is farther forward, the vehicles of each competing relay node need to broadcast the flag signal in the internet of vehicles when the time slot corresponding to the target distance section where the vehicle is located arrives, and similarly, when the vehicles of the competing relay nodes in the other distance sections receive the flag signal, the vehicles can quit the competition of the relay nodes, that is, the vehicles quitting the competition no longer send the flag signal, so that the application needs to judge whether the target distance section to which the distance between the vehicle and the sending node belongs is the first distance section in the last division from far to near, so as to trigger the action in the subsequent step according to the judgment result.
S103: if yes, broadcasting a mark signal in the Internet of vehicles so that vehicles which do not belong to the distance section of the vehicles exit the competition of the relay node;
specifically, when the time slot corresponding to the target distance zone where the vehicle is located arrives, the mark signal can be broadcasted in the internet of vehicles, so that the vehicle which does not belong to the target distance zone where the vehicle belongs exits the competition of the relay node.
The flag signal may be of various types, for example, the flag signal may be an out-of-band blocked channel signal black-burst, and the like, and the embodiment of the present invention is not limited herein.
S104: under the condition that the distance section corresponding to the self is a distance section larger than the estimated maximum communication distance, randomly generating a back-off time for the self and starting timing;
specifically, after the flag signal is broadcasted, there are two cases, one is that the distance zone to which the vehicle broadcasting the flag signal belongs is a distance zone greater than the estimated maximum communication distance, and the other is that the distance zone to which the vehicle broadcasting the flag signal belongs is not a distance zone greater than the estimated maximum communication distance, and for the first case, considering that there are not too many vehicles in the distance zone greater than the estimated maximum communication distance, the selection of the relay node can be directly performed in the vehicle receiving the broadcast of the sending node in the zone.
S105: and if the selected signals broadcast by other vehicles in the Internet of vehicles are not received before the timing time reaches the back-off time, broadcasting the selected signals in the Internet of vehicles so that the sending node selects the sending node as the relay node.
Specifically, all vehicles which are within a distance range greater than the estimated maximum communication distance and receive the broadcast signal of the sending node can start timing, and as long as the selected signal broadcast by other vehicles in the internet of vehicles is not received before the timing time reaches the back-off time, the selected signal is broadcast in the internet of vehicles, that is, the vehicle with the shortest back-off time is selected as the relay node to forward the information.
Wherein the selected signal may be a clear to broadcast CTB.
The invention provides a method for selecting a relay node in an internet of vehicles, which considers that obstacles exist in the internet of vehicles, so that the estimated maximum communication distance of a vehicle is possibly inaccurate, and the possibility that the vehicle beyond the estimated maximum communication distance receives broadcast of a sending node exists, so that after the vehicle receives the broadcast of the sending node, under the condition that the distance between the vehicle and the sending node belongs to a distance section which is larger than the estimated maximum communication distance, the vehicle can compete with other vehicles in the section to form the relay node serving as the sending node, and a vehicle farther away can be found to serve as the relay node, thereby improving the efficiency of information transmission.
For better explaining the embodiment of the present invention, please refer to fig. 2, fig. 2 is a schematic flow chart of the present invention for estimating maximum communication distance and searching for a relay node, based on the embodiment:
as a preferred embodiment, when the distance zone corresponding to the self is a distance zone greater than the estimated maximum communication distance, randomly generating the back-off time for the self and starting timing specifically includes:
judging whether the distance section corresponding to the distance section is a distance section larger than the estimated maximum communication distance;
if the distance is greater than the distance section of the estimated maximum communication distance, randomly generating a back-off time for the distance and starting timing;
if the distance section is not greater than the estimated maximum communication distance, adding the iteration times of which the initial value is zero together with judging whether the current iteration times reach a preset termination iteration time or not;
if so, executing a step of randomly generating a back-off time for the mobile terminal and starting timing;
if not, dividing the distance zone corresponding to the distance zone into a plurality of distance zones according to a preset partitioning method, and executing the step of judging whether the target distance zone to which the distance between the distance zone and the position of the sending node belongs is the first distance zone in the distance from far to near in the plurality of distance zones obtained by the last partitioning before the first time slot in the appointed sequence after the last distance zone division arrives.
Specifically, after the flag signal is broadcasted, if it is found that the distance section corresponding to the flag signal is not the distance section greater than the estimated maximum communication distance, it indicates that the distance between the flag signal and the sending node is smaller than the estimated maximum communication distance, and the distance section divided in the interval from zero to the estimated maximum communication distance is not fine enough, so that the iteration number can be added together to judge whether the current iteration number reaches the preset termination iteration number, if the preset termination iteration number is reached, the back-off time can be randomly generated for the flag signal and timing is started (that is, the relay node selection is performed when the solicitation phase is reached), and if the preset termination iteration number is not reached, the iteration can be continued, that is, the section division is continued and the flag signal is sent in the corresponding time slot of the flag signal.
Specifically, the embodiment of the present invention introduces how to select a relay node within the estimated maximum communication distance in the case where there is no train connection capable of communicating with the sending node in a distance zone greater than the estimated maximum communication distance, which has an advantage of high efficiency.
Of course, if the distance segment first divided within the estimated maximum communication distance is already fine, the method may directly enter the solicitation phase to generate the back-off time and start timing, and the embodiment of the present invention is not limited herein.
Specifically, fig. 2 may be an iterative process of finding a relay node within an estimated maximum communication distance in the embodiment of the present invention, where the scene is a double-layer parking lot scene, Lane1 in the figure is a first layer, and Lane2 is a second layer, each layer can be viewed independently, and it can be seen visually that an interval from zero to the estimated maximum communication distance is divided into three segments in the first iterative process, and is divided into three segments in each subsequent iterative segmentation, and of course, the fixed number of segments divided each time may be preset, for example, may be set to 4 segments, and the embodiment of the present invention is not limited herein.
As a preferred embodiment, if the selected signal broadcasted by other vehicles in the internet of vehicles is not received before the timing time reaches the back-off time, the selected signal is broadcasted in the internet of vehicles, so that the sending node selects itself as the relay node specifically:
judging whether a selected signal broadcasted by other vehicles in the Internet of vehicles is received before the timing time reaches the back-off time;
if not, broadcasting a selected signal in the Internet of vehicles so that the sending node selects the sending node as a relay node;
and if so, quitting the competition of the relay node.
Specifically, since there may be multiple vehicles (located in the same distance zone) that generate the back-off time and start timing at the same time, if the back-off time randomly generated by itself is not the shortest, the selected signal broadcasted by other vehicles in the vehicle network is received before the timing time reaches the back-off time, which means that the timing time of other vehicles reaches the back-off time first, and the selected signal is broadcasted in the vehicle network.
As a preferred embodiment, after broadcasting the selected signal in the internet of vehicles, the method for selecting the relay node in the internet of vehicles further comprises:
judging whether the distance between the self and the position of the sending node is larger than the estimated maximum communication distance or not;
and if so, recording the distance between the sending node and the sending node.
Specifically, considering that if the finally selected relay node is located outside the estimated maximum communication distance, it is proved that the estimated maximum communication distance at this time is biased, and the distance between the selected vehicle and the sending node at this time is more accurate than the estimated maximum communication distance, the present application may determine whether the distance between the sending node and the position of the sending node is greater than the estimated maximum communication distance, and record the distance between the sending node and the sending node if the determination result is yes, so that the staff improves according to the recorded estimation process that the distance is the maximum communication distance.
As a preferred embodiment, the Internet of vehicles is a three-dimensional Internet of vehicles.
In particular, considering that the internet of vehicles is not limited to plane distribution in many scenes, for example, a double-layer parking vehicle is a three-dimensional internet of vehicles, the embodiment of the invention can be applied to such scenes and can also be applied to a two-dimensional internet of vehicles, and the application range is not limited.
As a preferred embodiment, dividing the interval from zero to the estimated maximum communication distance into a plurality of distance sections specifically includes:
the interval from zero to the estimated maximum communication distance is divided into several distance sections according to an exponential partition method.
Specifically, considering that for the sending node, the farther the distance segments with the same length are from the sending node, the larger the area of the distance segments is, the more vehicles are theoretically included, which means that it is unreasonable to divide the distance segments with equal length, so in order to make the area of each segment and the number of vehicles possibly included as uniform as possible, the distance segments are divided by using an exponential partition method in the present application, that is, each distance segment is exponentially distributed from far to near according to the distance from the sending node.
Referring to fig. 3, fig. 3 is a schematic structural diagram of a device for selecting a relay node in a vehicle networking system according to the present invention, where the device for selecting a relay node in a vehicle networking system includes:
the partition module 31 is configured to, after receiving a sending node position broadcasted by a sending node and an estimated maximum communication distance of the sending node, divide an interval from zero to the estimated maximum communication distance into a plurality of distance sections, and use an interval greater than the estimated maximum communication distance as one distance section;
a judging module 32, configured to judge whether a target distance segment to which a distance between the target distance segment and a sending node position belongs is a distance segment in a first designated order from far to near obtained by last division before a time slot in the first designated order after distance segment division arrives, and if so, trigger the first broadcasting module 23;
the first broadcasting module 33 is configured to broadcast the flag signal in the internet of vehicles, so that vehicles not belonging to the distance zone to which the vehicles belong exit the competition of the relay node;
a generating module 34, configured to randomly generate a back-off time for the mobile terminal and start timing when the distance zone corresponding to the mobile terminal is a distance zone greater than the estimated maximum communication distance;
and a second broadcasting module 35, configured to broadcast the selected signal in the internet of vehicles if the selected signal broadcast by other vehicles in the internet of vehicles is not received before the counted time reaches the back-off time, so that the sending node selects itself as the relay node.
As a preferred embodiment, the Internet of vehicles is a three-dimensional Internet of vehicles.
For the introduction of the selection apparatus of the relay node in the internet of vehicles provided in the embodiment of the present invention, please refer to the embodiment of the selection method of the relay node in the internet of vehicles, which is not described herein again.
Referring to fig. 4, fig. 4 is a schematic structural diagram of a device for selecting a relay node in a vehicle networking system, where the device for selecting a relay node in a vehicle networking system includes:
a memory 41 for storing a computer program;
a processor 42 for implementing the steps of the method for selection of a relay node in a vehicle networking system as in the previous embodiments when executing the computer program.
For the introduction of the selection device of the relay node in the internet of vehicles provided in the embodiment of the present invention, please refer to the embodiment of the selection method of the relay node in the internet of vehicles, which is not described herein again.
The present invention also provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method for selecting a relay node in a vehicle networking system as in the previous embodiments.
For the introduction of the computer-readable storage medium provided in the embodiment of the present invention, please refer to the embodiment of the selection method of the relay node in the internet of vehicles, which is not described herein again.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. The device disclosed by the embodiment corresponds to the method disclosed by the embodiment, so that the description is simple, and the relevant points can be referred to the method part for description. It is further noted that, in the present specification, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A method for selecting a relay node in a vehicle networking is characterized by comprising the following steps:
after receiving a sending node position broadcasted by a sending node and an estimated maximum communication distance of the sending node, dividing an interval from zero to the estimated maximum communication distance into a plurality of distance sections, and taking the interval larger than the estimated maximum communication distance as a distance section;
before the time slot of the first appointed sequence after the distance section division comes, judging whether a target distance section to which the distance between the target distance section and the position of the sending node belongs is the distance section of the first appointed sequence from far to near obtained by the last division;
if yes, broadcasting a mark signal in the Internet of vehicles so that vehicles which do not belong to the distance section of the vehicles exit the competition of the relay node;
under the condition that the distance section corresponding to the self is a distance section larger than the estimated maximum communication distance, randomly generating a back-off time for the self and starting timing;
and if the selected signals broadcast by other vehicles in the Internet of vehicles are not received before the timing time reaches the back-off time, broadcasting the selected signals in the Internet of vehicles so that the sending node can be selected as the relay node.
2. The method for selecting a relay node in an internet of vehicles according to claim 1, wherein the randomly generating a back-off time for the relay node and starting timing when the distance zone corresponding to the relay node is a distance zone greater than the estimated maximum communication distance specifically comprises:
judging whether the distance section corresponding to the distance section is a distance section larger than the estimated maximum communication distance;
if the distance is greater than the estimated maximum communication distance, randomly generating a back-off time for the distance and starting timing;
if the distance section is not greater than the estimated maximum communication distance, adding the iteration times of which the initial values are zero together to judge whether the current iteration times reach a preset termination iteration time;
if so, executing the step of randomly generating the back-off time for the self and starting timing;
if not, dividing the distance section corresponding to the distance section into a plurality of distance sections according to a preset partitioning method, and executing the step of judging whether the target distance section to which the distance between the distance section and the position of the sending node belongs is the distance section in the first designated sequence from far to near in the plurality of distance sections obtained by the last partitioning before the time slot in the first designated sequence after the last distance section is divided arrives.
3. The method for selecting the relay node in the internet of vehicles according to claim 2, wherein if the selected signal broadcasted by other vehicles in the internet of vehicles is not received before the timing time reaches the back-off time, the selected signal is broadcasted in the internet of vehicles, so that the sending node selects itself as the relay node specifically:
judging whether a selected signal broadcasted by other vehicles in the Internet of vehicles is received before the timing time reaches the back-off time;
if not, broadcasting the selected signal in the Internet of vehicles so that the sending node selects the sending node as a relay node;
and if so, quitting the competition of the relay node.
4. The method for selecting a relay node in the internet of vehicles according to claim 3, wherein after broadcasting the selected signal in the internet of vehicles, the method for selecting a relay node in the internet of vehicles further comprises:
judging whether the distance between the self and the position of the sending node is larger than the estimated maximum communication distance or not;
and if so, recording the distance between the sending node and the sending node.
5. The method for selecting a relay node in a vehicle networking according to claim 1, wherein the vehicle networking is a three-dimensional vehicle networking.
6. The method for selecting the relay node in the internet of vehicles according to any one of claims 1 to 5, wherein the dividing the interval from zero to the estimated maximum communication distance into a plurality of distance sections is specifically:
and dividing an interval from zero to the estimated maximum communication distance into a plurality of distance sections according to an exponential partition method.
7. A selection device of a relay node in a vehicle networking is characterized by comprising:
the system comprises a partitioning module, a receiving module and a processing module, wherein the partitioning module is used for dividing an interval from zero to the estimated maximum communication distance into a plurality of distance sections after receiving the position of a sending node broadcasted by the sending node and the estimated maximum communication distance of the sending node, and taking the interval larger than the estimated maximum communication distance as one distance section;
the judging module is used for judging whether a target distance section to which the distance between the judging module and the position of the sending node belongs is a distance section in the first appointed sequence from far to near obtained by the last division before the time slot in the first appointed sequence after the distance section division comes, and if so, triggering the first broadcasting module;
the first broadcasting module is used for broadcasting a mark signal in the Internet of vehicles so that vehicles which do not belong to the distance section of the first broadcasting module exit the competition of the relay node;
the generating module is used for randomly generating back-off time for the distance section and starting timing under the condition that the distance section corresponding to the generating module is a distance section larger than the estimated maximum communication distance;
and the second broadcasting module is used for broadcasting the selected signal in the internet of vehicles so that the sending node can be selected as the relay node if the selected signal broadcasted by other vehicles in the internet of vehicles is not received before the timing time reaches the back-off time.
8. The device for selecting a relay node in a vehicle networking of claim 7, wherein the vehicle networking is a three-dimensional vehicle networking.
9. A selection device of a relay node in a vehicle networking, comprising:
a memory for storing a computer program;
a processor for implementing the steps of the method of selection of a relay node in a vehicle networking according to any of claims 1 to 6 when executing the computer program.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored thereon a computer program which, when being executed by a processor, carries out the steps of the method of selection of an in-vehicle networking relay node according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111553016.1A CN114885397A (en) | 2021-12-17 | 2021-12-17 | Method, device and equipment for selecting relay nodes in Internet of vehicles and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111553016.1A CN114885397A (en) | 2021-12-17 | 2021-12-17 | Method, device and equipment for selecting relay nodes in Internet of vehicles and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114885397A true CN114885397A (en) | 2022-08-09 |
Family
ID=82666701
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111553016.1A Pending CN114885397A (en) | 2021-12-17 | 2021-12-17 | Method, device and equipment for selecting relay nodes in Internet of vehicles and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114885397A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106851770A (en) * | 2017-02-28 | 2017-06-13 | 电子科技大学 | Car networking communication means based on link-quality |
| CN107659911A (en) * | 2017-08-16 | 2018-02-02 | 长沙理工大学 | A kind of car networking relay node selecting method of stabilization |
| CN109257792A (en) * | 2018-11-22 | 2019-01-22 | 长沙理工大学 | A kind of general relay node selecting method in intersection applied to car networking |
| CN110446179A (en) * | 2019-07-02 | 2019-11-12 | 长沙理工大学 | The choosing method of relay node optimal location applied to car networking bend scene |
| WO2020259525A1 (en) * | 2019-06-28 | 2020-12-30 | 华为技术有限公司 | Communication method and apparatus |
-
2021
- 2021-12-17 CN CN202111553016.1A patent/CN114885397A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106851770A (en) * | 2017-02-28 | 2017-06-13 | 电子科技大学 | Car networking communication means based on link-quality |
| CN107659911A (en) * | 2017-08-16 | 2018-02-02 | 长沙理工大学 | A kind of car networking relay node selecting method of stabilization |
| CN109257792A (en) * | 2018-11-22 | 2019-01-22 | 长沙理工大学 | A kind of general relay node selecting method in intersection applied to car networking |
| WO2020259525A1 (en) * | 2019-06-28 | 2020-12-30 | 华为技术有限公司 | Communication method and apparatus |
| CN110446179A (en) * | 2019-07-02 | 2019-11-12 | 长沙理工大学 | The choosing method of relay node optimal location applied to car networking bend scene |
Non-Patent Citations (2)
| Title |
|---|
| 曹敦;雷正保;: "一种山区环境下车际网的中继节点选择方法", 计算机工程与科学, no. 02, 15 February 2017 (2017-02-15) * |
| 费凡;郭爱煌;: "V2X网络中基于跨层设计的分区查找广播算法", 通信技术, no. 06, 10 June 2016 (2016-06-10) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104838597B (en) | Adaptive channel reuse mechanism in communication network | |
| US8594123B2 (en) | Method for detecting distributed peer to transmit multimedia data in wireless peer-to-peer network | |
| US7269138B2 (en) | Distributed MAC protocol facilitating collaborative ranging in communications networks | |
| EP2309817A1 (en) | Method and System for Random Access in Small Cell of 3GPP LTE-Advanced System | |
| CN109121096B (en) | Method and apparatus for determining broadcast nodes in a mesh network | |
| US9788344B2 (en) | System and method for random access based on spatial group | |
| CN111132257B (en) | C-V2X communication method and device | |
| US20150264711A1 (en) | Communications method, a communications management method, and associated devices and nodes | |
| CN105323597A (en) | MP4 file playing method, MP4 file processing method, MP4 file playing device, MP4 file processing device and MP4 file playing system | |
| CN109089246A (en) | data transmission method and related product | |
| CN113543359A (en) | Data transmission method, device, system and storage medium based on channel competition | |
| WO2015096065A1 (en) | Information sending method and apparatus | |
| CN114885397A (en) | Method, device and equipment for selecting relay nodes in Internet of vehicles and readable storage medium | |
| KR101646176B1 (en) | Selection of transmission lots of the relaxed deterministic back-off method in the medium access control | |
| CN111246571B (en) | Idle channel searching method and device | |
| CN106507442A (en) | Control method and device that cell is accessed | |
| CN109257792B (en) | Intersection universal relay node selection method applied to Internet of vehicles | |
| US20130205012A1 (en) | Apparatus and method for transmitting node discovery messages | |
| WO2018035801A9 (en) | Message transmission method, related device, and system | |
| CN110831150B (en) | Time difference of arrival determining method, communication equipment and system | |
| CN112566039B (en) | Road condition sharing method, system, equipment and storage medium based on block chain | |
| KR101467310B1 (en) | Method for media access control of vehicular ad hoc network using variable length frame and road side unit using the same | |
| CN109587675B (en) | Shared system information using method and device and user equipment | |
| JP6191107B2 (en) | Information sharing system, information sharing method, and in-vehicle terminal | |
| KR20090043196A (en) | Method for identification and construction of network in sensor network environments |
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 |