CN110177342A - Method is found based on the car networking neighbors of channel-aware and moveable self-adaption - Google Patents
Method is found based on the car networking neighbors of channel-aware and moveable self-adaption Download PDFInfo
- Publication number
- CN110177342A CN110177342A CN201910439821.8A CN201910439821A CN110177342A CN 110177342 A CN110177342 A CN 110177342A CN 201910439821 A CN201910439821 A CN 201910439821A CN 110177342 A CN110177342 A CN 110177342A
- Authority
- CN
- China
- Prior art keywords
- node
- broadcast
- time
- channel
- neighbors
- 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.)
- Granted
Links
Classifications
-
- 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]
- 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/026—Route selection considering the moving speed of individual devices
-
- 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- 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
- 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/246—Connectivity information discovery
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Method is found based on the car networking neighbors of channel-aware and moveable self-adaption the invention proposes a kind of, high neighbors discovery precision is lower when for solving channel busy of the existing technology and the larger technical problem of overhead, and realize step are as follows: broadcast message: 1) car networking initializes；2) node to surroundings nodes send include the time, ID, position and speed oneself state message, calculate send packet time interval τ；3) node channel perception and surroundings nodes status information in τ；4) node is according to the information update τ perceived in τ；5) it executes 2), until node leaves network；Receive message: node channel perception and surroundings nodes status information in τ are saved if perceiving, and surroundings nodes are the neighbors of the node；Terminate: when node leaves network, broadcast and reception message stop.The present invention considers the mobility of car networking interior joint and the randomness of channel, and the discovery precision of neighbors is high, and overhead is small.
Description
Technical field
The invention belongs to mobile radio telecommunications technical fields, are related to a kind of car networking neighbors discovery method, and in particular to
It is a kind of that method is found based on the car networking neighbors of channel-aware and moveable self-adaption, it can be used in car networking counting between neighbors
According to high efficiency of transmission.
Background technique
Car networking (IOV) is the huge Internet being made of information such as intelligent vehicle position, speed and routes.It can be with
It is interconnected by vehicle and vehicle, Che Yuren, Che Yulu and realizes information sharing, collect vehicle, road environment information, and in Information Network
The information of multi-source acquisition is processed on network platform, is calculated, is shared and safety is issued, according to different functional requirements to vehicle
Effective guidance and supervision are carried out, and multimedia and mobile Internet application service are provided.
Neighbors is the discovery that one of the committed step for realizing that message is sent in car networking, and neighbors discovery refers to logical in equipment
Believe the process of all neighbors of discovery in range, it provides neighborhood information by broadcast discovery messages, final each node
The discovery result of node will all be obtained.In car networking, method is found using neighbors, intelligent vehicle at regular intervals will
One section of message is broadcasted, wherein the useful information of vehicle is contained, including Position, Velocity and Time etc..By receiving neighbors letter
Breath, intelligent vehicle can recognize the information of neighbors, and mutually perception of the cooperative achievement to driving environment around.Usually
The superiority and inferiority of precision and overhead evaluation neighbors discovery method is found using neighbors, the setting at broadcast packet time interval is
The key factor of neighbors discovery method performance is influenced, time interval setting is unreasonable, will lead to discovery message and sends not in time
Or transmission is excessively frequent, the precision of neighbors discovery method is lower and generates excessive overhead.
Traditional neighbors discovery method is that broadcast packet time is set to constant, i.e., at every fixed time between
Every the status information for sending this node to surroundings nodes.This method is simple and easy, but is disadvantageous in that vehicle speed in car networking
Degree, relative position constantly change, and fixed broadcast packet time interval does not adapt to the feature of vehicle high mobility in car networking.
The setting of broadcast packet time gap size is also very difficult simultaneously, and broadcast packet time interval is too short, i.e., relatively frequently sends out
Discovery message is sent, overhead can be greatly increased；And broadcast packet time interval is too long, is likely to appear in the time interval
Originally there are neighbors process but not found situation, the precision of neighbors discovery substantially reduces.
In view of the foregoing drawbacks, B.Karp and H.T.Kung proposes a kind of method for being randomized broadcast packet time interval,
It is not determining at the time of i.e. each node broadcasts are grouped, is the moment arbitrarily chosen in a section.It does so
Benefit is more efficiently to reduce the collision probability of each node broadcasts grouping, and solve broadcast packet time gap size
Difficult problem is set, but does not consider the mobility of each node, broadcast packet time interval cannot be adjusted according to mobility.
In view of the high-speed mobility of car networking interior joint, related scholar has successively done many in neighbors discovery method
Valuable work, each node can be adaptively adjusted broadcast according to the variation of itself and surroundings nodes speed in car networking
Packet time interval.Such as Authorization Notice No. is 102065513 B of CN, entitled " raising Ad Hoc network neighbor node table essence
The Chinese patent of the method for true property " discloses a kind of neighbors discovery method of Ad Hoc network interior joint.This method is specifically real
Apply step are as follows: all node initializings record current neighbor node table, then send HELLO message for the first time；Each node exists
Before nth transmission, neighbor node table is recorded and compared, the ratio of new, old neighbors number is calculated, interval is sent to HELLO message
It is adjusted, and sends HELLO message by the interval after adjusting；Each node receives the node of HELLO message according to the HELLO
The source of message updates neighbor node table, and time-out time and count-down device is arranged；If certain node does not receive it when timing is to 0 yet
The HELLO message of certain neighbors, then delete the neighborhood information in neighbor node table.Each node is according to neighbors in the invention
List content obtains the discovery of neighbors as a result, passing through the ratio adjustment broadcast packet time interval of new, old neighbors number, that is, counts
The mobility that surroundings nodes are considered when evaluation time interval improves neighbors discovery compared to conventional method to a certain extent
Precision, but be disadvantageous in that: this method considers only the mobility of car networking interior joint, does not consider car networking environment
The randomness of lower channel causes in neighbors discovery procedure, and broadcast packet time interval cannot be adapted to channel shape at this time
State, if channel busy at this time, it is possible that channel overload, situations such as packet loss, prevent node from finding adjacent section in time
Point, reduces the precision of neighbors discovery, while increasing overhead.
Summary of the invention
The purpose of the present invention is overcoming the problems of the above-mentioned prior art, propose a kind of based on channel-aware and movement
Adaptive car networking neighbors finds method, and high neighbors finds precision when for solving channel busy of the existing technology
The lower and larger technical problem of overhead.
To realize that above-mentioned target, the technical solution that the present invention takes include each node broadcasts messages step, receive message
Step and termination step:
(1) the step of each node broadcasts message:
(1a) initializes car networking:
Building is using n vehicle as node, and the car networking communicated between node by wireless channel, n > 1, n section
Point is expressed as A1,A2,…,Ai,…,An, AiIndicate that i-th of node, setting initial time are Tini, each node AiID be Ni,
Initial position is Pi 0, initial movement speed is Vi 0, initial broadcast message radius is Ri 0, each node AiIt is set by wireless receiving and dispatching
Fully feel and know initial channel status information, the adjacent lane speed limit V of initial time is perceived by preset maplim 0；
(1b) initial time TiniEach node AiCurrent time T is broadcasted to surroundings nodesini, node ID Ni, initial position
Pi 0With initial movement speed Vi 0；
(1c) sets each node AiJ-th of broadcast packet time between be divided intoIt is located at initial time Tini, j=0, and count
Calculate initial time TiniEach node AiJ-th of the broadcast packet time interval τ of itselfi 0:
Wherein, Δ Vi 0For each node AiInitial movement speed Vi 0The lane speed limit V adjacent with initial timelim 0Between
Relative moving speed, Δ Vi 0=| Vlim 0-Vi 0|, E [X] expression asks expectation to X；
(1d) each node AiIn τi jThe time of the interior perception channel state information of time interval and surroundings nodes broadcast,
ID, position, translational speed information, then in τi jFinish time Ti j, include time T to surroundings nodes broadcasti j, node ID Ni、
Position Pi jWith movement speed Vi jOneself state message, while judging in τi jWhether surroundings nodes broadcast is received in time interval
Status message, if so, calculate relative moving speedOtherwise, relative moving speed Δ V is calculatedi j=|
Vlim j-Vi j|, whereinFor in τiA in j time intervaliThe average value of the surroundings nodes speed of acquisition, Vlim jFor Ti jMoment is adjacent
Lane speed limit；
(1e) each node AiIn Ti jMoment calculating is adapted under itself of channel status and relative moving speed at this time
One broadcast packet time interval
Each node AiIn Ti jMoment obtains the broadcast message radius of the channel state variations with its perceptionThen lead to
Cross Δ Vi j、Ri jAnd Ri j+1Calculating is adapted to Ti j+ 1 broadcast packe of jth of itself of moment channel status and relative moving speed
Time interval τi j+1:
(1f) each node AiJ=j+1 is enabled, and executes step (1d), until AiThe broadcast and reception messaging device of itself are closed
It closes, i.e. AiUntil leaving network, A is obtainediThe j+2 broadcast packet time interval of itself
(2) each node receives the step of message:
(2a) each node AiIn τi 0Interior perception channel state information and surroundings nodes broadcast time, ID, position,
Translational speed information, and persistently judge whether to perceive above- mentioned information, if so, surroundings nodes are AiNeighbors, and save
The time of channel state information and surroundings nodes broadcast, ID, position, translational speed information, otherwise, node AiDo not find
Neighbors；
(2b) each node AiIn Ti 0Moment broadcasts oneself state message, with season j=1, calculates τi j；
(2c) each node AiIn τi jInterior perception channel state information and surroundings nodes broadcast time, ID, position,
Translational speed information, and in τi jInside persistently judge whether to perceive above- mentioned information, if so, surroundings nodes are AiNeighbors,
And save the time of channel state information and surroundings nodes broadcast, ID, position, translational speed information, otherwise, node AiNot yet
It is found neighbors；
(2d) each node AiIn Ti jMoment broadcasts oneself state message, with season j=j+1, calculates τi j, and execute step
(2c), until AiUntil leaving network, A is obtainediThe j+1 broadcast packet time interval of itselfInterior discovery knot
Fruit, withDiscovery result in time interval has collectively constituted j+2 time intervalInterior discovery result；
(3) each node AiTermination step:
Node AiThe broadcast and reception messaging device of itself are closed, i.e. node AiLeave network, node AiIt goes off the air and connects
Receive message.
Compared with the prior art, the invention has the following advantages:
In the present invention broadcast message time interval of each node need before broadcast using the channel status that perceives and
Surroundings nodes velocity information recalculates, that is, calculates and be adapted between channel status and the broadcast packet time of node speed variation
Every, comprehensively considered the mobility feature of the randomness of channel and vehicle in car networking, effectively avoided in channel busy, because when
Between interval the information of unreasonable generation is set receives not in time or the phenomenon that channel overload leads to packet loss, improve neighbors
It was found that precision, while avoiding invalid information and sending, effectively reduce overhead.
Detailed description of the invention
Implementation flow chart Fig. 1 of the invention；
Car networking schematic diagram of a scenario Fig. 2 of the invention.
Specific embodiment
Below in conjunction with the drawings and specific embodiments, present invention is further described in detail.
Referring to Fig.1, method is found based on the car networking neighbors of channel-aware and moveable self-adaption, included the following steps:
Step 1, the step of each node broadcasts message:
Step 1a, car networking initialization:
The present embodiment use car networking, scene as shown in Fig. 2, vehicle in a two-way four-lane highway uplink
The traffic scene sailed.It is arranged in car networking using n vehicle as node, is at least just able to achieve adjacent section there are two node in car networking
Point discovery method, that is, require n > 1, and n node is expressed as A1,A2,…,Ai,…,An, AiI-th of node is indicated, in the present embodiment
N=5.All vehicles can jump within the scope of own broadcast message radius by one passes through the same wireless communication with Adjacent vehicles
Road is communicated.Circle indicates the broadcast packe range of vehicle, and it is wide that other vehicles within this range can receive the vehicle
The grouping broadcast, Ri jIndicate node AiBroadcast packe radius, Ri jIn different moments, i.e. j difference, value is different, and value is with channel
State change.
Setting initial time is Tini, the ID of each node is Ni, initial position Pi 0, initial movement speed is Vi 0, initially
Broadcast message radius is Ri 0, indicate with node AiCentered on, radius Ri 0Node in range can receive node AiBroadcast
Information, each node AiInitial channel status information is perceived by wireless transmitting-receiving equipments, initial time is perceived by preset map
Adjacent lane speed limit Vlim 0。
Step 1b, each node AiT is carved at the beginninginiCurrent time T is broadcasted to surroundings nodesini, node ID Ni, it is initial
Position Pi 0With initial movement speed Vi 0, wherein TiniFor showing when the broadcast message sends.
Step 1c, if each node AiJ-th of broadcast packet time between be divided intoIt is located at initial time Tini, j=0,
And calculate initial time TiniEach node AiJ-th of the broadcast packet time interval τ of itselfi 0:
1c1) calculate relative moving speed Δ Vi 0, indicate each node AiInitial movement speed Vi 0It is adjacent with initial time
Lane speed limit Vlim 0Absolute value of the difference, calculation formula is as follows:
ΔVi 0=| Vlim 0-Vi 0|
1c2) pass through Δ Vi 0And Ri 0Calculate τi 0, calculation formula is as follows:
Wherein, E [X] expression asks expectation to X.
Step 1d, each node AiIn τi jThe time of perception surroundings nodes, ID, position, movement speed letter in time interval
Breath and channel state information, then in τi jFinish time Ti j, include time T to surroundings nodes broadcasti j, node ID Ni, position
Set Pi jWith movement speed Vi jOneself state message.
Step 1e, each node AiIn Ti jMoment calculating is adapted to itself of channel status and relative moving speed at this time
+ 1 broadcast packet time interval of jth
1e1) calculate relative moving speed Δ Vi j:
Judge in τi jEach node A in time intervaliWhether the status message of surroundings nodes broadcast is received, if so, calculating
In τi jA in time intervaliThe average value of the surroundings nodes speed of acquisition and each node AiIn Ti jPhase between the speed at moment
To movement speedOtherwise, T is calculatedi jMoment adjacent lane speed limit and node AiSpeed between it is opposite
Movement speed Δ Vi j=| Vlim j-Vi j|, whereinAs in τi jA in time intervaliThe surroundings nodes speed of acquisition is averaged
Value, Vlim jAs Ti jMoment adjacent lane speed limit.
Relative moving speed embodies the mobility of node, and in car networking, the speed of node can constantly change, and works as node
AiWhen becoming larger with the relative moving speed of surroundings nodes, surroundings nodes can quickly leave node Ai, need to reduce broadcast packe at this time
Time interval increases broadcast message frequency, so as to find the surroundings nodes fast moved in time.As node AiWith surrounding section
When the relative moving speed of point becomes smaller, node will be present in A for a long timeiAround, continually broadcast packe will become to be not intended at this time
Justice needs to increase broadcast packet time interval, reduces broadcast message frequency, avoids ineffectually broadcast packe, reduces overhead.
1e2) each node AiIn Ti jMoment obtains the broadcast message radius R of the channel state variations with its perceptioni j+1。
Broadcast packe radius is the useful variable for characterizing channel status, it changes with the variation of channel status.Therefore it obtains
Take the broadcast packe radius of different moments for calculating broadcast packet time interval, pot life interval is adapted to continually changing
Channel status.
Broadcast packet time interval needs adaptive channel state.When channel is in idle condition, between broadcast packet time
Every the result that finds for neighbors of setting influence it is smaller, but when channel is in a busy state, if between broadcast packet time
Every too small, broadcast packe frequency is excessive, node AiIt is continually broadcast the message by channel to surroundings nodes, channel can not carry such as
This large amount of message, so that the phenomenon that generating channel overload, leads to the increase of broadcast packe time delay or even packet loss, surrounding is saved
Point can not cannot even receive node A in timeiThe message of broadcast cannot find neighbors in time, and neighbors is caused to find precision
It reduces.
1e3) pass through Δ Vi j、Ri jAnd Ri j+1Calculate be adapted to the jth of itself of channel status and relative moving speed at this time+
1 broadcast packet time interval τi j+1:
In above-mentioned calculation formula, on the one hand, Δ Vi jThe moveable self-adaption in this method is embodied, i.e. transmission packet time
Interval follows the speed of surroundings nodes and the variation of itself movement speed to adjust accordingly；On the other hand, Ri jAnd Ri j+1Embody this
Channel-aware in method, due to being influenced by the state randomness variation of channel in car networking, the broadcast of each node disappears
Breath radius is also constantly changing, therefore broadcast packet time interval also follows the randomness variation of channel to be adjusted accordingly.
Step 1f, each node AiJ=j+1 is enabled, and executes step 1d, until AiThe broadcast of itself and reception messaging device
It closes, i.e. AiUntil leaving network, A is obtainediThe j+2 broadcast packet time interval of itself
Step 2, each node receives the step of message:
Step 2a, each node AiIn τi 0The time of interior perception channel state information and surroundings nodes broadcast, ID, position
It sets, translational speed information, and persistently judges whether to perceive above- mentioned information, if so, surroundings nodes are AiNeighbors, and protect
Deposit time, the ID, position, translational speed information of channel state information and surroundings nodes broadcast, otherwise, node AiDo not send out
Existing neighbors.
Step 2b, each node AiIn Ti 0Moment broadcasts oneself state message, with season j=1, calculates τi j。
Step 2c, each node AiIn τi jThe time of interior perception channel state information and surroundings nodes broadcast, ID, position
It sets, translational speed information, and in τi jInside persistently judge whether to perceive above- mentioned information, if so, surroundings nodes are AiAdjacent section
Point, and save the time of channel state information and surroundings nodes broadcast, ID, position, translational speed information, otherwise, node Ai
Do not find neighbors.
Step 2d, each node AiIn Ti jMoment broadcasts oneself state message, with season j=j+1, calculates τi j, and execute
Step 2c, until AiUntil leaving network, A is obtainediThe j+1 broadcast packet time interval of itselfDiscovery knot
Fruit, withDiscovery result in time interval has collectively constituted j+2 time intervalInterior discovery result.
Each node AiThe step of broadcast and reception message is all alternately, to receive and disappear in broadcast packet time interval
It ceases, oneself state message is broadcasted at the end of time interval and calculates next time interval.Time interval be it is continually changing, with
Adapt to the relative moving speed of continually changing channel status and node.
Step 3, each node terminates work step:
As node AiOutage condition occurs or independently closes the broadcast of itself and receives messaging device, i.e. node AiNo longer have
When the standby ability broadcasted and receive message, then it is assumed that node AiLeave network, node AiGo off the air and receive message.
Claims (1)
1. a kind of find method based on the car networking neighbors of channel-aware and moveable self-adaption, which is characterized in that its process packet
Each node broadcasts messages step is included, messages step is received and terminates step:
(1) the step of each node broadcasts message:
(1a) initializes car networking:
Building is using n vehicle as node, and the car networking communicated between node by wireless channel, n > 1, n node table
It is shown as A1,A2,…,Ai,…,An, AiIndicate that i-th of node, setting initial time are Tini, each node AiID be Ni, initially
Position is Pi 0, initial movement speed is Vi 0, initial broadcast message radius is Ri 0, each node AiPass through wireless transmitting-receiving equipments sense
Know initial channel status information, the adjacent lane speed limit V of initial time is perceived by preset maplim 0；
(1b) initial time TiniEach node AiCurrent time T is broadcasted to surroundings nodesini, node ID Ni, initial position Pi 0With it is first
Beginning movement speed Vi 0；
(1c) sets each node AiJ-th of broadcast packet time between be divided intoIt is located at initial time Tini, j=0, and calculate just
Begin moment TiniEach node AiJ-th of the broadcast packet time interval of itself
Wherein, Δ Vi 0For each node AiInitial movement speed Vi 0The lane speed limit V adjacent with initial timelim 0Between phase
To movement speed, Δ Vi 0=| Vlim 0-Vi 0|, E [X] expression asks expectation to X；
(1d) each node Ai?The time of perception channel state information and surroundings nodes broadcast, ID, position in time interval
It sets, translational speed information, then existsFinish time Ti j, include time T to surroundings nodes broadcasti j, node ID Ni, position
Pi jWith movement speed Vi jOneself state message, while judgingWhether the state of surroundings nodes broadcast is received in time interval
Message, if so, calculating relative moving speedOtherwise, relative moving speed Δ V is calculatedi j=| Vlim j-Vi j
|, whereinForA in time intervaliThe average value of the surroundings nodes speed of acquisition, Vlim jFor Ti jMoment it is adjacent lane limit
Speed；
(1e) each node AiIn Ti jMoment calculating is adapted to the next of itself of channel status and relative moving speed at this time
Broadcast packet time interval
Each node AiIn Ti jMoment obtains the broadcast message radius of the channel state variations with its perceptionThen pass through Δ
Vi j、Ri jWithCalculating is adapted to Ti j+ 1 broadcast packet time of jth of itself of moment channel status and relative moving speed
Interval τi j+1:
(1f) each node AiJ=j+1 is enabled, and executes step (1d), until AiThe broadcast and reception messaging device of itself are closed,
That is AiUntil leaving network, A is obtainediThe j+2 broadcast packet time interval of itself
(2) each node receives the step of message:
(2a) each node Ai?The time of interior perception channel state information and surroundings nodes broadcast, ID, position, mobile speed
Information is spent, and persistently judges whether to perceive above- mentioned information, if so, surroundings nodes are AiNeighbors, and save channel shape
The time of state information and surroundings nodes broadcast, ID, position, translational speed information, otherwise, node AiDo not find neighbors；
(2b) each node AiIn Ti 0Moment broadcasts oneself state message, with season j=1, calculates
(2c) each node Ai?The time of interior perception channel state information and surroundings nodes broadcast, ID, position, mobile speed
Degree information, andInside persistently judge whether to perceive above- mentioned information, if so, surroundings nodes are AiNeighbors, and save letter
The time of channel state information and surroundings nodes broadcast, ID, position, translational speed information, otherwise, node AiDo not find neighbour
Node；
(2d) each node AiIn Ti jMoment broadcasts oneself state message, with season j=j+1, calculatesAnd step (2c) is executed,
Until AiUntil leaving network, A is obtainediThe j+1 broadcast packet time interval of itselfInterior discovery as a result, withDiscovery result in time interval has collectively constituted j+2 time intervalInterior discovery result；
(3) each node AiTermination step:
Node AiThe broadcast and reception messaging device of itself are closed, i.e. node AiLeave network, node AiIt goes off the air and reception disappears
Breath.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910439821.8A CN110177342B (en) | 2019-05-24 | 2019-05-24 | Internet of vehicles adjacent node discovery method based on channel perception and mobile self-adaption |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910439821.8A CN110177342B (en) | 2019-05-24 | 2019-05-24 | Internet of vehicles adjacent node discovery method based on channel perception and mobile self-adaption |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110177342A true CN110177342A (en) | 2019-08-27 |
| CN110177342B CN110177342B (en) | 2021-06-08 |
Family
ID=67695650
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910439821.8A Active CN110177342B (en) | 2019-05-24 | 2019-05-24 | Internet of vehicles adjacent node discovery method based on channel perception and mobile self-adaption |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110177342B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111163454A (en) * | 2019-12-16 | 2020-05-15 | 西安电子科技大学 | Method and system for discovering adjacent nodes of Internet of vehicles |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101720059A (en) * | 2009-11-05 | 2010-06-02 | 浙江大学城市学院 | Method for realizing vehicle-mounted mobile self-organized network routing |
| CN104010289A (en) * | 2014-05-21 | 2014-08-27 | 广东工业大学 | Communication method for mutual finding of neighbor nodes in wireless ad hoc network |
| US20150092661A1 (en) * | 2013-09-27 | 2015-04-02 | Institute For Information Industry | Transmission control method and communication apparatus using the same for vehicular ad hoc network system |
| CN106713482A (en) * | 2017-01-10 | 2017-05-24 | 兰州理工大学 | Method for automatic regulation of broadcast beacon intervals through nodes applied to mobile car networking |
| CN109561392A (en) * | 2018-12-04 | 2019-04-02 | 东华大学 | A kind of adaptive dynamic sensing routing of car networking running environment |
-
2019
- 2019-05-24 CN CN201910439821.8A patent/CN110177342B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101720059A (en) * | 2009-11-05 | 2010-06-02 | 浙江大学城市学院 | Method for realizing vehicle-mounted mobile self-organized network routing |
| US20150092661A1 (en) * | 2013-09-27 | 2015-04-02 | Institute For Information Industry | Transmission control method and communication apparatus using the same for vehicular ad hoc network system |
| CN104010289A (en) * | 2014-05-21 | 2014-08-27 | 广东工业大学 | Communication method for mutual finding of neighbor nodes in wireless ad hoc network |
| CN106713482A (en) * | 2017-01-10 | 2017-05-24 | 兰州理工大学 | Method for automatic regulation of broadcast beacon intervals through nodes applied to mobile car networking |
| CN109561392A (en) * | 2018-12-04 | 2019-04-02 | 东华大学 | A kind of adaptive dynamic sensing routing of car networking running environment |
Non-Patent Citations (1)
| Title |
|---|
| LINA ZHU等: "Framework for Cooperative Perception of Intelligent Vehicles: Using Improved Neighbor Discovery", 《2018 IEEE GLOBAL COMMUNICATIONS CONFERENCE》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111163454A (en) * | 2019-12-16 | 2020-05-15 | 西安电子科技大学 | Method and system for discovering adjacent nodes of Internet of vehicles |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110177342B (en) | 2021-06-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104093185B (en) | A kind of multichannel multi-path routing implementation method towards fleet's MANET | |
| Tung et al. | A cluster based architecture for intersection collision avoidance using heterogeneous networks | |
| JP2019533380A (en) | Method and apparatus for transmitting side link channel congestion rate in a wireless communication system | |
| Korkmaz et al. | A cross-layer multihop data delivery protocol with fairness guarantees for vehicular networks | |
| Choi et al. | A solicitation-based IEEE 802.11 p MAC protocol for roadside to vehicular networks | |
| Nguyen et al. | Novel store–carry–forward scheme for message dissemination in vehicular ad-hoc networks | |
| CN109819474B (en) | Cluster-based multi-priority MAC protocol formulation method in vehicle-mounted self-organizing network | |
| EP2811785B1 (en) | Dynamic routing method in ad-hoc network and network device therefor | |
| CN110177342A (en) | Method is found based on the car networking neighbors of channel-aware and moveable self-adaption | |
| Campolo et al. | Full-duplex communications to improve platooning control in multi-channel VANETs | |
| Shrivastava et al. | Joint optimization of energy efficiency and scheduling strategies for side-link relay system | |
| Wu et al. | An adaptive TDMA scheduling strategy based on beacon messages for vehicular ad-hoc network | |
| Wu et al. | A Reliable Self-Adaptive Scheduling Control Protocol for Cellular V2X Mode 4 | |
| Feng et al. | Vehicle-assisted offloading on metropolitan streets: Enhancing geographical fluidity of wireless resources | |
| Ansari et al. | Vehicular safety application identifier algorithm for LTE VANET server | |
| Lee et al. | A seamless Handover Scheme for IEEE WAVE Networks based on multi-way Proactive Caching | |
| Mohammed et al. | Hybrid LTE-VANETs based optimal radio access selection | |
| KR101441528B1 (en) | Method and Apparatus for establishing multi-hop path in a Vehicular Network | |
| Hegde et al. | Cellular-v2x for vulnerable road user protection in cooperative its | |
| Le et al. | Communication protocol for platoon of electric vehicles in mixed traffic scenarios | |
| CN106412995B (en) | A kind of radio data transmission method and device of traffic flow auxiliary | |
| KR101267053B1 (en) | Apparatus and method for executing bi-casting in wireless network | |
| Kusumine et al. | Abiding regional data distribution using relay and random network coding on VANETs | |
| Zheng et al. | Cooperative data delivery in sparse cellular-VANET networks | |
| CN114071421A (en) | Open type unmanned vehicle group model in expressway scene and vehicle group forming process research method |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |