CN106714115B - A kind of security message single-hop in car networking cooperates broadcasting method - Google Patents
A kind of security message single-hop in car networking cooperates broadcasting method Download PDFInfo
- Publication number
- CN106714115B CN106714115B CN201611190492.0A CN201611190492A CN106714115B CN 106714115 B CN106714115 B CN 106714115B CN 201611190492 A CN201611190492 A CN 201611190492A CN 106714115 B CN106714115 B CN 106714115B
- Authority
- CN
- China
- Prior art keywords
- node
- cooperation
- oneself
- data packet
- message
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 25
- 230000006855 networking Effects 0.000 title claims abstract description 14
- 238000004891 communication Methods 0.000 claims abstract description 11
- 230000004044 response Effects 0.000 claims abstract description 11
- 238000012790 confirmation Methods 0.000 claims description 12
- 238000005562 fading Methods 0.000 claims description 3
- 230000001360 synchronised effect Effects 0.000 claims description 2
- 235000013399 edible fruits Nutrition 0.000 claims 1
- 230000005540 biological transmission Effects 0.000 description 7
- 206010039203 Road traffic accident Diseases 0.000 description 3
- 230000003044 adaptive effect Effects 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 230000007423 decrease Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000003912 environmental pollution Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 241000208340 Araliaceae Species 0.000 description 1
- 101001093748 Homo sapiens Phosphatidylinositol N-acetylglucosaminyltransferase subunit P Proteins 0.000 description 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 description 1
- 235000003140 Panax quinquefolius Nutrition 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 235000008434 ginseng Nutrition 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000002085 persistent effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
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
- 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/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
-
- 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)
- Mobile Radio Communication Systems (AREA)
Abstract
A kind of security message single-hop in car networking cooperates broadcasting method, belongs to in-vehicle wireless communication field.Security message single-hop cooperation broadcasting method in the car networking for improving the successful receiving rate of message under the premise of guaranteeing security message time delay is provided.Establish neighbor channel quality table；Initialization broadcast；Select cooperative node；Cooperation is broadcasted again；The neighbor channel quality table for setting up oneself to each car first, records the channel situation of oneself and each neighbor node in real time；Secondly, carry out initialization broadcast, when vehicle in case of emergency, just security message is broadcasted in the time slot of oneself；Then, cooperative node selection is carried out, source node selects optimal cooperative node according to the speed that each alternative cooperative node sends cooperation response message；Finally, carrying out cooperative retransmission, selected cooperative node and source node retransmit data packet in the time slot of source node together.
Description
Technical field
The invention belongs to in-vehicle wireless communication fields, cooperate more particularly, to the security message single-hop in a kind of car networking wide
Broadcasting method.
Background technique
With the development of economy and society, vehicle has become an inseparable important component of people's life.
But vehicle also brings traffic accident, congestion in road, energy waste and environmental pollution etc. while bringing people's convenience
Persistent ailment.According to incompletely statistics, about 1,200,000 people die of traffic accident every year in the whole world, injured more than 20,000,000 people, caused by
Direct economic loss is more than 5 trillion dollars.To solve the above-mentioned problems, car networking is just come into being.Car networking passes through wireless
The communication technology realizes that the traffic such as vehicle and vehicle, vehicle and road equipment, vehicle and people participate in being in communication with each other between entity and information sharing,
Reach the purpose of reducing traffic accident, alleviating congestion in road and mitigate environmental pollution, has become domestic and international each colleges and universities, research aircraft
One of the research hotspot that structure and vehicular manufacturer pay close attention to jointly.
Car networking can support a variety of different types of business.In general, these business can be divided into following three classes: peace
The relevant application of application (such as: lane change auxiliary, anti-collision warning and blind area alarm), the traffic administration of total correlation is (such as: automatic to receive
Take, traffic condition acquisition and crossroad management etc.) and entertain relevant application (such as: game, Email and Internet are accessed
Deng).Wherein, security-related application by the acquisition of security message, propagation and is shared, and is reached precognition and is evaded danger, mentions
It is also most characteristic a kind of application that the purpose of high traffic safety, which is most important in car networking, is the original intention institute for developing car networking
?.Different from other message, security message has very strong sudden, and time delay to transmission and reliability have strictly
Requirement.In addition, most security message is all each vehicle node being transmitted in target area by the mode of broadcast.
Therefore, reliably and timely security message broadcasting method is one of key technology of car networking.
Q.Xu, T.Mak, J.Ko, R.Sengupta et al. are in document " Vehicle-to-Vehicle Safety
In Messaging in DSRC ", a kind of security message broadcasting method based on re-transmission is proposed.This method is by the life of message
Period is divided into n time slot, and source node selects k time slot repeated broadcast with fixed or random manner.This will increase
The chance of destination node received data packet, to improve successful receiving rate.But if two adjacent nodes are in same a period of time
Quarter is broadcasted, and be will result in collision, and this mode remains redundant broadcast, is affected the performance of agreement.In order to
The generation of collision is reduced, H.Alshaer, E.Horlait et al. are in document " An optimized adaptive broadcast
In scheme for inter-vehiclecommunication ", a kind of adaptive heavy flooding algorithm is proposed, node can
To be determined to execute the probability broadcasted according to the quantity of two-hop neighbors around it again.In addition K.Tang, M.Gerla et al. are in document
In " MAC Reliable Broadcast in Ad Hoc Networks ", multiple unicast transmissions are resolved into broadcast transmission.It is right
Each unicast transmission, source node are all handled using RTS/CTS/DATA/ACK mode, to guarantee that destination node successfully connects
Receive the data packet.But this method considerably increases the signaling overheads and redundant data transmissions of agreement.In order to overcome these weak
Point, M.T.Sun, L.Huang, A.Arora, T.H.Lai et al. are in document " Reliable MAC Layer Multicast in
A kind of multicast protocol is proposed in IEEE 802.11Wireless Networks ".Firstly, source node RTS/CTS and each
A destination node connection；Then, a data packet is sent；Finally, being wrapped again with RAK (Request for ACK) from each purpose
Node collects ACK packet.In conclusion the existing broadcasting method based on re-transmission or passback affirmation mechanism is all to pass through source node
Itself weighs the method for broadcast data packet repeatedly to improve successful receiving rate, these methods can not be fought well due to wireless channel
Reception failure caused by declining.Therefore, the single-hop broadcasting method of wireless channel decline can be fought as car networking by studying one kind
The task of top priority of middle security message reliable transmission.
Summary of the invention
The present invention is directed to which the deficiency of wireless channel decline can not be fought for the prior art, provide when guaranteeing security message
The security message single-hop cooperation broadcasting method in the car networking of the successful receiving rate of message is improved under the premise of prolonging.
The present invention the following steps are included:
1) neighbor channel quality table is established
In step 1), the specific method for establishing neighbor channel quality table can are as follows:
(1) on the road of multilane, each car is all assigned to unique ID, and each car has identical communication radius
RTIf the distance between two cars are less than RT, then between them can with direct communication, be known as mutually a hop neighbor node or
Person's neighbor node；
(2) each car is equipped with GPS signal receiver, and under the assistance of GPS clock signal, the system clock of each car is all
It may be implemented to synchronize, channel is divided into continuous time frame, and each time frame includes F (1,2,3 ..., F) a isometric
Time slot, each car is all assigned to fixed time slot in every frame, and accesses channel on the time slot of oneself；
(3) for any one vehicle node a on road, as its occupied time slot SaWhen arrival, if there is information
It sends, then accessing channel in this timeslot, the information of oneself is sent；If to be sent without information,
An empty data packet is sent on the time slot of oneself, so that the neighbor node of oneself listens to the presence of oneself, and measure it
Between channel conditions, channel domain is used to send oneself channel quality information neighbor node between, cooperates domain for sending out
It send and broadcasts relevant information again to cooperation, asked including ACK (Acknowledge) information to security message reception result, cooperation
Ask information, cooperation response message and cooperation confirmation message；
(4) any vehicle node a on road safeguards a neighbor node channel quality table Ta, section is had recorded in the table
The channel quality condition of point a and surrounding neighbours node, when node a receives the data packet that node b is sended overAfterwards, a
The reception power of the data packet is measured immediately, and in table TaMiddle update respective items；Until the time slot S of oneselfaWhen arrival, it just will
TaIn data be placed in the channel domain of data packet and send, since all nodes can all access primary letter in each frame
Road sends the data packet of oneself, therefore table TaIn all items all can once be updated in each frame, to guarantee data
Real-time, then each node on road both knows about oneself Real-time Channel situation between neighbor node.
2) initialization broadcast, the specific method is as follows:
(1) for any vehicle a on road, if it on road traveling encounter urgent or danger when, vehicle
Upper corresponding security application produces a security message immediately
(2) the occupied time slot S of a is waited untilaWhen arrival, it just willIt sends in this timeslot.
3) cooperative node is selected；
In step 3), the specific method of the selection cooperative node can are as follows:
(1) whenAfter sending, the node having in the neighbor node of a has been properly received the message, some nodes then by
Success is not received in the reasons such as noise or channel fading, successful node is not received and is known as the destination node to cooperate, and
Received successful node is then known as alternative cooperative node；
(2) for any one neighbor node b of a, if it has been properly received data packetSo oneself
Next data packetCooperation domain in increase by one forSuccessful ACK message is received, and in the time slot S of oneselfbIt arrives
When, by data packetIt sends；
(3) all to be properly received data packet in all neighbor nodes of aNode, all in the next of oneself
It is added in data packet pairACK message, when next time slot of aBefore arrival, a is just aware of all neighbor nodes
Reception condition；
(4) in time slotIn, the ID (d with cooperation target nodes is requested in cooperation by node a1,d2,…dn), oneself to association
Make the reception power of destination nodeIt sends；
(5) for arbitrary alternative cooperative node c, when it receives cooperation request and a the connecing to cooperation target of node a
It after receiving power, is calculated after oneself participating in cooperation immediately, the expected of all cooperation target nodes receives power
The expected power that receives of all cooperation target nodes can be made to be both greater than threshold level value P if c participates in cooperationth, then c is vertical
Calculate the overall power gain for oneself participating in cooperation
(6) when next time slot of cWhen arrival, data packet is not sent immediately, but first opens a timer, timing
The expiration time of deviceWith overall power gainIt is inversely proportional, indicates are as follows:
Wherein, PMAXIt is the maximum power that this system interior joint can receive, TMINIt is shortest delay time, TMAXIt is longest
Delay time；
(7) after timer expires, alternative cooperative node sends the data packet of oneself immediately, and wherein includes association
Response information, and according to formula (1), the overall power gain of alternative cooperative node is bigger, and it is shorter to send delay；When continuous F-1
After time slot, source node can receive the data packet comprising cooperation response message of all alternative teamworkers, then, therefrom
The smallest node of time delay is selected as cooperative node；
4) cooperation is broadcasted again, and the specific method is as follows:
(1) when the next time slot of source nodeWhen arriving again, source node does not send data packet immediately, but sends out first
Cooperation confirmation message is sent, which includes the node ID chosen and the time for starting re-transmission；
(2) after alternate node receives cooperation confirmation message, selected node is according to the time indicated in the message
Cooperative retransmission is executed, and not selected node does not do any movement then.
The present invention sets up the neighbor channel quality table of oneself to each car first, records oneself and each neighbours section in real time
The channel situation of point；Secondly, carry out initialization broadcast, when vehicle in case of emergency, just will be safe in the time slot of oneself
Message is broadcasted；Then, cooperative node selection is carried out, source node sends cooperation response message according to each alternative cooperative node
Speed selects optimal cooperative node；Finally, carrying out cooperative retransmission, selected cooperative node and source node are together in source node
Time slot in retransmit data packet.
Detailed description of the invention
Fig. 1 is the road scene of the embodiment of the present invention.
Fig. 2 is the frame structure of the embodiment of the present invention.
Fig. 3 is the pack arrangement of the embodiment of the present invention.
Fig. 4 is the competition cooperative node of the embodiment of the present invention.
Fig. 5 is that the cooperation of the embodiment of the present invention is broadcasted again.
Fig. 6 is the network structure of the embodiment of the present invention.
Specific embodiment
It to make the objectives, technical solutions, and advantages of the present invention clearer, below will be by following embodiment to this hair
It is bright to be described in further detail.
Step 1) establishes neighbor channel quality table
1.1 as shown in Figure 1, each car is all assigned to unique ID on the road of multilane, and each car has phase
Same communication radius RT.If the distance between two cars are less than RT, then, between them can with direct communication, mutually referred to as one
Hop neighbor node or neighbor node.
1.2 each cars are equipped with GPS signal receiver, and under the assistance of GPS clock signal, the system clock of each car is all
It may be implemented to synchronize.As shown in Fig. 2, channel is divided into continuous time frame, each time frame include F (1,2,3 ...,
F) a isometric time slot, each car is all assigned to fixed time slot in every frame, and accesses channel on the time slot of oneself.
1.3 for any one vehicle node a on road, as its occupied time slot SaWhen arrival, if there is information
It sends, it just accesses channel in this timeslot, and the information of oneself is sent；If to send without information, it is also wanted
An empty data packet is sent on the time slot of oneself, so that the neighbor node of oneself listens to the presence of oneself, and measures them
Between channel conditions.The format of data packet is as shown in Figure 3, wherein channel domain is used to send oneself between neighbor node
Channel quality information, cooperation domain is used to send broadcasts relevant information to cooperation again, including the ACK to security message reception result
(Acknowledge) information, cooperation solicited message, cooperation response message and cooperation confirmation message.
Any vehicle node a on 1.4 roads safeguards a neighbor node channel quality table Ta, section is had recorded in the table
The channel quality condition of point a and surrounding neighbours node.When node a receives the data packet that node b is sended overAfterwards, a
The reception power of the data packet is measured immediately, and in table TaMiddle update respective items.Until the time slot S of oneselfaWhen arrival, it just will
TaIn data be placed in the channel domain of data packet and send.Since all nodes are in each frame, can all access primary
Channel sends the data packet of oneself, therefore, table TaIn all items all can once be updated in each frame, with guarantee
The real-time of data.So, each node on road both knows about oneself Real-time Channel situation between neighbor node.
Step 2 initialization broadcast
2.1 for any vehicle a on road, if it on road when driving, when encountering urgent or danger,
Corresponding security application produces a security message immediately on vehicle
2.2 wait until the occupied time slot S of aaWhen arrival, it just willIt sends in this timeslot.
Step 3 selects cooperative node
3.1 working asAfter sending, the node having in the neighbor node of a has been properly received the message, some nodes then by
Success is not received in the reasons such as noise or channel fading.It does not receive successful node and is known as the destination node to cooperate, and
Received successful node is then known as alternative cooperative node.
3.2 for any one neighbor node b of a, if it has been properly received data packetIt just oneself
Next data packetCooperation domain in increase by one forSuccessful ACK message is received, and in the time slot S of oneselfbIt arrives
When, by data packetIt sends.
3.3 in all neighbor nodes of a, all to be properly received data packetNode, all in the next of oneself
It is added in data packet pairACK message.Therefore, when next time slot of aBefore arrival, a is just aware of all neighbours
The reception condition of node.
3.4 in time slotIn, the ID (d with cooperation target nodes is requested in cooperation by node a1,d2,…dn), oneself to association
Make the reception power of destination nodeIt sends.
3.5 for arbitrary alternative cooperative node c, when it receives cooperation request and a the connecing to cooperation target of node a
It after receiving power, is calculated after oneself participating in cooperation immediately, the expected of all cooperation target nodes receives power
The expected power that receives of all cooperation target nodes can be made to be both greater than threshold level value P if c participates in cooperationth, then c is vertical
Calculate the overall power gain for oneself participating in cooperation
3.6 work as next time slot of cWhen arrival, it does not send data packet immediately, but first opens a timer, fixed
When device expiration timeWith overall power gainIt is inversely proportional, indicates are as follows:
Wherein, PMAXIt is the maximum power that this system interior joint can receive, TMINIt is shortest delay time, TMAXIt is longest
Delay time.
3.7 as shown in figure 4, alternative cooperative node sends the data packet of oneself immediately, and at it after timer expires
In include cooperation response message.According to (1), the overall power gain of alternative cooperative node is bigger, and it is shorter to send delay.When even
After continuous F-1 time slot, source node can receive the data packet comprising cooperation response message of all alternative teamworkers, so
Afterwards, it therefrom selects the smallest node of time delay as cooperative node.
Step 4 cooperation is broadcasted again
4.1 as shown in figure 5, work as the next time slot of source nodeWhen arriving again, source node does not send data immediately
Packet, but cooperation confirmation message is sent first, which includes the following contents: the node ID chosen and the time for starting re-transmission.
4.2 after alternate node receives cooperation confirmation message, and selected node is according to the time indicated in the message
Cooperative retransmission is executed, and not selected node does not do any movement then.
Specific embodiment is given below:
Step 1 establishes neighbor channel quality table
1.1 as shown in fig. 6, one share 7 vehicle nodes in the present embodiment, this 7 vehicle nodes have unique ID (1,
2 ..., 7) it, is distributed in above the road that one has 3 lanes.All vehicles have identical communication radius 500m, if two
The distance between vehicle is less than 500m, then they become a hop neighbor node mutually, is connected each other with straight line.
7 vehicle nodes on 1.2 roads are assembled with GPS receiver, and realize with the help of GPS clock signal
Clock is synchronous.Channel is divided into the continuous time frame that length is 10ms, each frame be divided into again 100 it is isometric when
Gap, the length of each time slot are 0.1ms.
7 vehicles that 1.3 ID are 1~7 occupy the 11st of each frame the, 13,19,22,24,33 and No. 35 time slot respectively.When it
Corresponding time slot arrive when, if there is information will be sent, just access channel in this timeslot, the information of oneself sent out
It goes；If to send without information, an empty data packet is sent, on the time slot of oneself also so that the neighbor node of oneself is detectd
It hears the presence of oneself, and measures the channel conditions between them.
7 vehicle nodes on 1.4 roads respectively safeguard oneself a neighbor node channel quality table.We are with node
It is illustrated for 5.As shown in fig. 6, the neighbor node of node 5 has 2,3,4 and 6, and therefore, the table T of node 55In one share 8
Project, be respectively (5,2,25dbm), (5,3,26dbm), (5,4,30dbm), (5,6,10dbm), (2,5,26dbm), (3,5,
25dbm), (4,5,28dbm) and (6,5,11dbm), have recorded respectively node 5 to neighbor node and neighbor node to node 5 it
Between information status.More new technological process is as follows for it: on the 13rd time slot of each frame, if node 5 is received from node 2
Data packet, and measure the reception power 23dbm of the data packet immediately, then, node 5 update immediately the respective items in table be (2,
5,23dbm), meanwhile, the reception power that node 5 to 2 is had recorded in the channel domain of 2 data packet of node is 24dbm, then, it updates
Respective items are (5,2,24dbm) in table；If node 5 is not received by the data packet from node 2, illustrate channel quality at this time
It is poor, therefore updating respective items in table is (2,5,0dbm).And so on, node 5 is after the arrival of time slot 19,22 and 33, respectively
Update table in node 3,4 and 6 related items.
Step 2 initialization broadcast
Vehicle 5 casts anchor on road suddenly, and the application for being responsible for stopping in emergency at this time generates a security message immediately
Until 5 occupied No. 24 time slots (the 10th frame) are arrived, it just sends the message.
Step 3 selects cooperative node
3.1 working asAfter sending, the neighbor node 2,3 and 4 of node 5 has been properly received the message, and node 6 due to
Channel quality is poor, does not receive success.Then, node 2,3 and 4 becomes the alternative cooperative node that cooperation is broadcasted again, node 6
Become cooperation target node.
3.2 for the neighbor node 2,3 and 4 of node 5, since they have received data packetThey just exist respectively
When the next time slot of oneself arrives, sending one includes pairThe data packet of the ACK message of confirmation；And node 6 is not due to having
Receive data packetACK message is not added in the data packet of oneself.
3.3 before No. 24 time slots of the 11st frame arrive, and node 5 is just aware of node 2,3 and 4 and has been successfully received number
According to packetAnd node 6 is not received by data packet
3.4 on No. 24 time slots of the 11st frame, and node 5 is by cooperation request, cooperation target node ID (6) and oneself arrives cooperation
The reception power ID (10dbm) of destination node is added to data packetCooperation domain on send.
3.5 for alternative 2,3 and 4 institute of cooperative node, when they receive data packetAfterwards, oneself ginseng is calculated immediately
After cooperating, the expected of destination node receives power, is respectively as follows: 18dbm, 25dbm and 30dbm.Due to expected increasing obtained
Benefit is less than threshold level value 20dbm, and node 2 is abandoned participating in cooperation competition, and remaining node 3 and 4 item determines to participate in cooperation competition.
3.6 when No. 19 time slots of the 12nd frame arrive, and node 3 does not send data packet immediately, but first opens a timing
Device, the expiration time of timerFor
When No. 22 time slots of the 12nd frame arrive, the timer expiration time that node 4 calculates oneself is 16.7 μ s.
3.7 after the timer of node 3 and 4 expires, and node 3 and 4 sends the data of oneself after protection interval immediately
Packet, and wherein include pairThe cooperation response message of data packet.Transmission delay size of the source node according to node 3 and 4, choosing
Egress 4 is selected as cooperative node.
Step 4 cooperation is broadcasted again
4.1 when No. 24 time slots of the 12nd frame arrive, and source node 5 does not send data packet immediately, but sends association first
Make confirmation message, which includes the following contents: the cooperative node 4 chosen and the 50 μ s of time for starting re-transmission.
4.2 after node 4 receives cooperation confirmation message, according to the requirement of message, postpones after 50 μ s and source node 5 one
It rises and retransmits broadcast packetAnd other nodes do not do any movement.
Claims (1)
- The broadcasting method 1. the security message single-hop in a kind of car networking cooperates, it is characterised in that the following steps are included:1) neighbor channel quality table is established, method particularly includes:(1) on the road of multilane, each car is all assigned to unique ID, and each car has identical communication radius RT, such as The distance between fruit two cars are less than RT, then direct communication between them, is known as mutually a hop neighbor node or neighbours' section Point；(2) each car is equipped with GPS signal receiver, and under the assistance of GPS clock signal, the system clock of each car is all realized Synchronous, channel is divided into continuous time frame, and each time frame includes F isometric time slots, and each car is in every frame It is all assigned to fixed time slot, and accesses channel on the time slot of oneself；(3) for any one vehicle node a on road, as its occupied time slot SaWhen arrival, if there is information will be sent out It send, then accessing channel in this timeslot, the information of oneself is sent；It, also will be if to be sent without information An empty data packet is sent on the time slot of oneself, so that the neighbor node of oneself listens to the presence of oneself, and measure them it Between channel conditions, channel domain is used to send oneself channel quality information neighbor node between, cooperation domain be used to send and Relevant information is broadcasted in cooperation again, including the ACK information to security message reception result, cooperation solicited message, cooperation response letter Breath and cooperation confirmation message；(4) any vehicle node a on road safeguards a neighbor node channel quality table Ta, have recorded in the table node a with The channel quality condition of surrounding neighbours node, when node a receives the data packet that node b is sended overAfterwards, a is surveyed immediately The reception power of the data packet is measured, and in table TaMiddle update respective items；Until the time slot S of oneselfaWhen arrival, it is just by TaIn Data are placed in the channel domain of data packet and send, since all nodes can all access a secondary channel in each frame, hair Give the data packet of oneself, therefore table TaIn all items all can once be updated in each frame, to guarantee the reality of data Shi Xing, then each node on road both knows about oneself Real-time Channel situation between neighbor node；2) initialization broadcast, the specific method is as follows:(1) corresponding on vehicle if it is when traveling encounters urgent or dangerous on road for any vehicle a on road Security application generates a security message immediately(2) the occupied time slot S of a is waited untilaWhen arrival, it just willIt sends in this timeslot；3) cooperative node is selected, method particularly includes:(1) whenAfter sending, the node having in the neighbor node of a has been properly received the message, and some nodes are then due to making an uproar Sound or channel fading reason do not receive success, do not receive successful node and are known as the destination node to cooperate, and have connect It receives successful node and is then known as alternative cooperative node；(2) for any one neighbor node b of a, if it has been properly received data packetSo in the next of oneself A data packetCooperation domain in increase by one forSuccessful ACK message is received, and in the time slot S of oneselfbWhen arrival, By data packetIt sends；(3) in all neighbor nodes of a, all successful data reception packetsNode, all in the next data packet of oneself Middle addition pairACK message, when next time slot of aBefore arrival, a just knows the reception condition of all neighbor nodes；(4) in time slotIn, the ID:d with cooperation target nodes is requested in cooperation by node a1,d2,…,dn, oneself to cooperation mesh Mark the reception power of nodeIt sends；(5) for arbitrary alternative cooperative node c, when it receives the reception function of the cooperation request and a to cooperation target of node a It after rate, is calculated after oneself participating in cooperation immediately, the expected of all cooperation target nodes receives powerIf c Cooperation is participated in so that the expected power that receives of all cooperation target nodes is both greater than threshold level value Pth, then c is calculated certainly immediately Oneself participates in the overall power gain of cooperation(6) when next time slot of cWhen arrival, data packet is not sent immediately, but first opens a timer, timer Expiration timeWith overall power gainIt is inversely proportional, indicates are as follows:Wherein, PMAXIt is the maximum power that this system interior joint receives, TMINIt is shortest delay time, TMAXWhen being longest delay Between；(7) after timer expires, alternative cooperative node sends the data packet of oneself immediately, and wherein includes that cooperation is answered Information is answered, according to formula (1), the overall power gain of alternative cooperative node is bigger, and it is shorter to send delay；When continuous F-1 time slot Later, then the data packet comprising cooperation response message that source node receives all alternative teamworkers therefrom selects time delay most Small node is as cooperative node；4) cooperation is broadcasted again, and the specific method is as follows:(1) when the next time slot of node aWhen arriving again, node a does not send data packet immediately, but sends cooperation first Confirmation message, the message include the node ID chosen and the time for starting re-transmission；(2) after alternate node receives cooperation confirmation message, selected node is executed according to the time indicated in the message Cooperative retransmission, and not selected node does not do any movement then.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611190492.0A CN106714115B (en) | 2016-12-21 | 2016-12-21 | A kind of security message single-hop in car networking cooperates broadcasting method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611190492.0A CN106714115B (en) | 2016-12-21 | 2016-12-21 | A kind of security message single-hop in car networking cooperates broadcasting method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106714115A CN106714115A (en) | 2017-05-24 |
| CN106714115B true CN106714115B (en) | 2019-06-14 |
Family
ID=58938478
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611190492.0A Expired - Fee Related CN106714115B (en) | 2016-12-21 | 2016-12-21 | A kind of security message single-hop in car networking cooperates broadcasting method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106714115B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109996342B (en) * | 2017-12-31 | 2023-05-23 | 上海无线通信研究中心 | Channel resource allocation method and device in wireless self-organizing network |
| US20190246300A1 (en) * | 2018-02-05 | 2019-08-08 | Mediatek Inc. | Communication link checking method |
| CN109474897B (en) * | 2019-01-10 | 2020-01-07 | 厦门大学 | Hidden Markov model-based vehicle networking safety message single-hop cooperative broadcasting method |
| CN112235733B (en) * | 2020-09-29 | 2023-06-23 | 京东科技信息技术有限公司 | Multi-mobile robot cooperation method, device, system and medium |
| CN115278553B (en) * | 2022-07-12 | 2023-12-05 | 南通大学 | Internet of vehicles safety message broadcasting method based on RSU cooperation |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106131765A (en) * | 2016-06-22 | 2016-11-16 | 江苏迪纳数字科技股份有限公司 | Collaboration communication method towards the emergency message of car networking |
-
2016
- 2016-12-21 CN CN201611190492.0A patent/CN106714115B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106131765A (en) * | 2016-06-22 | 2016-11-16 | 江苏迪纳数字科技股份有限公司 | Collaboration communication method towards the emergency message of car networking |
Non-Patent Citations (1)
| Title |
|---|
| Multi-hop delay reduction for safety-related message broadcasting in vehicle-to-vehicle communications;Xiaohuan Li等;《IET Communications 》;20150226;第9卷(第2期);全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106714115A (en) | 2017-05-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106714115B (en) | A kind of security message single-hop in car networking cooperates broadcasting method | |
| Shao et al. | Performance analysis of connectivity probability and connectivity-aware MAC protocol design for platoon-based VANETs | |
| Zheng et al. | Heterogeneous vehicular networking: A survey on architecture, challenges, and solutions | |
| Ghafoor et al. | Enabling efficient coexistence of DSRC and C-V2X in vehicular networks | |
| Bi et al. | Efficient and reliable broadcast in intervehicle communication networks: A cross-layer approach | |
| Tseng et al. | A vehicle-density-based forwarding scheme for emergency message broadcasts in VANETs | |
| Shahen Shah et al. | CB‐MAC: a novel cluster‐based MAC protocol for VANETs | |
| WO2017076056A1 (en) | Service forwarding method and apparatus | |
| Barradi et al. | Establishing strict priorities in IEEE 802.11 p WAVE vehicular networks | |
| Zemouri et al. | A fast, reliable and lightweight distributed dissemination protocol for safety messages in urban vehicular networks | |
| Pressas et al. | Contention-based learning MAC protocol for broadcast vehicle-to-vehicle communication | |
| US20160374054A1 (en) | Method for controlling dsrc resource allocation, base station, and vehicle communications terminal | |
| CN103763076B (en) | Cooperative MAC protocol implementation method on basis of multiple asynchronous channels in vehicular vdhoc networks | |
| Liu et al. | Receiver consensus: on-time warning delivery for vehicular ad-hoc networks | |
| CN103259741A (en) | Minimum competition window adjusting method based on neighbor node number estimation in vehicle-mounted network | |
| Stanica et al. | Reverse back-off mechanism for safety vehicular ad hoc networks | |
| Maia et al. | Traffic aware video dissemination over vehicular ad hoc networks | |
| Wu et al. | Improving RSU service time by distributed sorting mechanism | |
| CN109474897A (en) | Car networking security message single-hop cooperation broadcasting method based on hidden Markov model | |
| Chen et al. | On the enhancements to IEEE 802.11 MAC and their suitability for safety‐critical applications in VANET | |
| Chitra et al. | Selective epidemic broadcast algorithm to suppress broadcast storm in vehicular ad hoc networks | |
| Stanica et al. | Broadcast communication in vehicular ad-hoc network safety applications | |
| CN104754746A (en) | Cluster based multi-channel coordination MAC protocol achievement method of vehicle-mounted self-organizing network | |
| WO2017028603A1 (en) | Telematics information transmission method, apparatus and system | |
| Samara et al. | Dynamic safety message power control in VANET using PSO |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190614 |