CN108966153A - A kind of car networking efficient broadcast algorithm based on more delay optimizations - Google Patents

A kind of car networking efficient broadcast algorithm based on more delay optimizations Download PDF

Info

Publication number
CN108966153A
CN108966153A CN201810863075.0A CN201810863075A CN108966153A CN 108966153 A CN108966153 A CN 108966153A CN 201810863075 A CN201810863075 A CN 201810863075A CN 108966153 A CN108966153 A CN 108966153A
Authority
CN
China
Prior art keywords
node
delay
car networking
time slot
slot
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
Application number
CN201810863075.0A
Other languages
Chinese (zh)
Other versions
CN108966153B (en
Inventor
胡曦
柳葳
吴涛
张斌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Northeastern University Qinhuangdao Branch
Original Assignee
Northeastern University Qinhuangdao Branch
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Northeastern University Qinhuangdao Branch filed Critical Northeastern University Qinhuangdao Branch
Priority to CN201810863075.0A priority Critical patent/CN108966153B/en
Publication of CN108966153A publication Critical patent/CN108966153A/en
Application granted granted Critical
Publication of CN108966153B publication Critical patent/CN108966153B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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/02—Services making use of location information
    • H04W4/023—Services making use of location information using mutual or relative location information between multiple location based services [LBS] targets or of distance thresholds
    • 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]

Landscapes

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

Abstract

The present invention provides a kind of car networking efficient broadcast algorithm based on more delay optimizations, comprising: the calculating of the delay-slot based on heterogeneous networks state and adaptive forward delay time calculate two steps.The present invention, which realizes the car networking efficient broadcast algorithm based on more delay optimizations, can adapt to car networking environment complicated and changeable, suitable network state parameters can be adaptive selected when change of network environment and carry out broadcast optimization, not only keep higher node up to rate, and it is significant reduce broadcasting redundant and transmission delay, there is stronger adaptability.

Description

A kind of car networking efficient broadcast algorithm based on more delay optimizations
Technical field
The present invention relates to vehicle networking technical field more particularly to a kind of car networking efficient broadcast calculations based on more delay optimizations Method.
Background technique
Car networking is to utilize wireless communication technique, the mobile network of formation using vehicle on the move and means of transportation as node Network.Data transfer mode in car networking has unicast, multicast and broadcast.Wherein, broadcast has extensive important in car networking Using network state information can be updated by broadcast between vehicle and vehicle or between vehicle and infrastructure, traffic be gathered around Plug detection, transmission emergence message, raising drive safety etc..But broadcast will cause the height in car networking data transmission procedure The serious problems such as redundancy, high conflict and high latency, and then broadcasting efficiency is reduced, influence the performance of data transmission.Meanwhile car networking In vehicle node movement speed it is fast, moving direction is changeable；Network environment is complicated, such as urban environment building stand in great numbers, and node is close Degree is big, and suburban environment is open high, and node density is low etc..Therefore, car networking data transmission in broadcast optimization problem always It is concerned.But existing broadcast optimisation technique is optimized just for a certain network parameter (such as distance, area or density), And seldom consider the influence of reality factor (such as subjective factors of traffic rules, people).Although also, prior art can be in net It is definitely adjusted when network state change, but faces car networking environment complicated and changeable, the applicability of the technology still can not It is guaranteed.
Adaptive broadcasting scheme is a kind of broadcasting scheme based on counting.Each node when receiving data packet for the first time with Machine distributes a delay time T, and initialization S=0 carries out data packet forwarding for deciding whether, and records and receive repetition every time Data packet and the difference DELTA t for receiving packet time for the first time.After delay time, when τ/3 Δ t- < 0, S subtract 1 otherwise S add 1, finally decided whether to carry out data packet forwarding according to S value size, be forwarded as S > 0, otherwise packet discard.
The broadcasting scheme is that the quantity and timestamp based on the message received decide whether to carry out data packet forwarding.It is deposited In the deficiency of the following aspects:
In the biggish scene environment of node density, reduction redundancy effect is unobvious, and it is close cannot to well adapt to node Spend biggish scene environment；
The average end-to-end delay time is longer between node: since in density, compared in overall situation, more node is postponed Forwarding, so will increase the end-to-end delay time of node.
Based on area coverage dynamic adjustment probabilistic algorithm be a kind of broadcasting scheme based on distance, by present node with Distance and broadcast radius between neighbor node calculate the extra area of neighbor node, and the bigger node of additional areas turns Hair probability is bigger, and details are provided below:
1) the distance d between following formula calculate node is passed through by the power that detection receives signal energy:
Wherein, PRAnd PTIt is energy when node is received and sent, λ indicates wavelength, then d is the distance between two nodes.
2) extra area of calculate node broadcast:
Wherein r indicates that the transmission radius of node, d indicate the distance between two nodes.
3) the forwarding probability of calculate node:
Wherein EC indicates extra area, the value of k author's setting.
A random delay time is set after node receives data packet for the first time, is received again by data packet in timing period Afterwards, it updates euclidean distance between node pair d and recalculates forwarding probability P, calculating process is as follows:
Data packet forwarding is carried out with probability P after delay.
The shortcoming of the broadcasting scheme is as follows:
Vehicle Speed influence caused by broadcast is not accounted for, due to preferentially carrying out with the node close to broadcasting edge Broadcast, therefore node accessibility can be reduced under the higher scene of node motion speed；
In conclusion having broadcast optimisation technique only considers that single network state is designed, when in face of complicated and changeable When car networking environment, the characteristics of current car networking environment cannot have been reflected by the network state considered, in turn result in excellent Changing effect reduces, even without optimization function.
Summary of the invention
It is an object of the invention to solve the problems of the above-mentioned prior art, in face of car networking complicated and changeable When environment, it is efficient to provide a kind of car networking based on more delay optimizations for the low problem of the adaptability of existing broadcast optimisation technique Flooding algorithm.
A kind of car networking efficient broadcast algorithms based on more delay optimizations, comprising: when delay based on heterogeneous networks state The calculating of gap and adaptive forward delay time calculate two steps.
Further, the car networking efficient broadcast algorithm as described above based on more delay optimizations, the delay-slot Calculating includes: based on safety driving distance computing relay time slot, is based on interstitial content computing relay time slot, based on node opposite side Three kinds of time slot of computing relay of position.
Further, the car networking efficient broadcast algorithm as described above based on more delay optimizations, it is described based on driving peace Full distance computing relay time slot the following steps are included:
Step 1: obtaining present node distance D between upper hop nodeSP:
Wherein, (Sx,Sy) indicate upper hop node position coordinates, (Px,Py) indicate present node position coordinates.
Step 2: obtaining the forward delay time slot Slot of present nodeminSecD:
Wherein R indicates that the communication radius of vehicle, minSecD are the minimum safe distance on Liang Gai highway when driving.
Further, the car networking efficient broadcast algorithm as described above based on more delay optimizations, it is described to be based on number of nodes Mesh computing relay time slot includes:
Step 1: neighbor node density is calculated according to the neighbor node number of upper hop node:
Wherein, NeigDens indicates neighbor node density, and NeigNum indicates the neighbor node number of upper hop node, The area of AreaR expression node communication range.
Step 2: calculate the timeslot number that present node should distribute:
SlotDens=NeigNum-AreaD × NeigDens
Wherein AreaD indicates that the above hop node is the center of circle, using present node and upper hop euclidean distance between node pair as radius institute The area of the circle of formation；
Step 3: neighbor node density formula will be calculated and bring the timeslot number calculation formula that present node should distribute into,
It can obtain:
Wherein, DSPFor present node between upper hop node at a distance from；The communication radius of R expression vehicle.
Further, the car networking efficient broadcast algorithm as described above based on more delay optimizations, is based on node opposite side Position computing relay time slot include:
Step 1: calculating source node A, neighbor node B and dummy node C and be formed by triangle area SABC, wherein C is located at 0 degree of direction of GPS system and at a distance from A be R:
Step 2: deviation angle of the B relative to A at this time is acquired by above formula:
Wherein, DAB、DAC、DBCThe respectively distance of AB, AC and BC, SABCIt is acquired according to Heron's formula:
Here,
Step 3: the deviation angle computing relay time slot according to neighbor node B relative to source node A:
Further, the car networking efficient broadcast algorithm as described above based on more delay optimizations, the adaptive forwarding The calculating of delay time includes:
Suitable forwarding is adaptive selected using following formula then according to place network environment for computing relay time slot first Delay-slot:
Finally forward delay time is calculated using following formula:
DelayTime=(SlotDelay+SlotDirect)×τ
Wherein τ indicates the unit time.
The utility model has the advantages that
The present invention, which realizes the car networking efficient broadcast algorithm based on more delay optimizations, can adapt to vehicle connection complicated and changeable Net environment can be adaptive selected suitable network state parameters when change of network environment and carry out broadcast optimization, not only protect Higher node is held up to rate, and it is significant reduce broadcasting redundant and transmission delay, there is stronger adaptability.
Detailed description of the invention
Fig. 1 is node relative bearing schematic diagram of the present invention；
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, the technical solution below in the present invention carries out clear Chu is fully described by, it is clear that described embodiments are some of the embodiments of the present invention, instead of all the embodiments.It is based on Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other Embodiment shall fall within the protection scope of the present invention.
The present invention provides a kind of car networking efficient broadcast algorithms based on more delay optimizations.In the algorithm, node passes through Cycle H ELLO data packet broadcast collects information of neighbor nodes (position coordinates, movement speed and direction etc.).When source node initiates number According to broadcast, neighbor node utilizes the nodal information calculating forward delay time collected, difference base after receiving the data packet for the first time Three network parameters of relative bearing devise three kinds of broadcast forward delays and calculate between safety driving distance, node density and node Method, node can be adaptive selected suitable delay according to the network state of different scenes and carry out broadcast forwarding.The algorithm It is divided into 2 steps: (1) calculating of the delay-slot based on heterogeneous networks state；(2) adaptive forward delay time calculates.
The calculating of the delay-slot includes: to calculate based on safety driving distance computing relay time slot, based on interstitial content Delay-slot is based on three kinds of node relative bearing computing relay time slot.
Based on safety driving distance computing relay time slot
In normal driving process, front vehicle is kept in order to avoid accident collision occurs with front vehicles with front truck Necessary spacing distance be known as safe distance.Driver perceives front truck situation and the shortest time interval avoided collision that takes measures It is 3s, the safe distance that vehicle braking be kept when stopping is 5m.If therefore Vehicle Speed is Vm/s, it and front truck Safe distance be 3V.Delay-slot calculation method based on safety driving distance is as follows:
The speed restrictive block of She Moutiao highway is [Vmin, Vmax] (m/s), then minimum safe of the vehicle on the highway when driving Distance minSecD are as follows:
MinSecD=3Vmin (1)
Calculate present node distance D between upper hop nodeSP:
Wherein, (Sx,Sy) indicate upper hop node position coordinates, (Px,Py) indicate present node position coordinates.
Calculate the forward delay time slot Slot of present nodeminSecD:
Wherein R indicates the communication radius of vehicle.
By formula (3) it is found that SlotminSecDIt can be required according to the speed limit of different sections of highway and euclidean distance between node pair is moved State adjustment.
Based on interstitial content computing relay time slot
In random network environment, neighbor node density changes at random with the mobile generation of node.And based on safety The delay setting of distance is not applied for the network scenarios of different densities, therefore proposes according to interstitial content computing relay time slot Method, calculating process is as follows:
Firstly, calculating neighbor node density according to the neighbor node number of upper hop node:
Wherein, NeigDens indicates neighbor node density, and NeigNum indicates the neighbor node number of upper hop node, The area of AreaR expression node communication range.
Secondly, calculating the timeslot number that present node should distribute:
SlotDens=NeigNum-AreaD × NeigDens (5)
Wherein AreaD indicates that the above hop node is the center of circle, using present node and upper hop euclidean distance between node pair as radius institute The area of the circle of formation.
Finally, bringing formula (4) into formula (5) can obtain:
Based on node relative bearing computing relay time slot
As shown in Figure 1, A is source node, B, D, E are its neighbor node and identical as the distance between A, if according to formula (3) and (6) computing relay time slot, then B, D, E forward delay having the same, in turn result in broadcast collision.For this purpose, proposing one kind Delay optimized calculation method based on node relative bearing, detailed process is as follows:
Firstly, calculating source node A, neighbor node B and dummy node C is formed by triangle area SABC, wherein C is located at 0 degree of direction of GPS system and at a distance from A be R:
Secondly, can deviation angle in the hope of B at this time relative to A by formula (7):
Wherein, DAB、DAC、DBCThe respectively distance of AB, AC and BC, SABCIt can be acquired by Heron's formula:
Here,
Finally, the deviation angle computing relay time slot according to neighbor node B relative to source node A:
The calculating of the adaptive forward delay time is as follows:
After node receives broadcast data for the first time, two kinds of delay-slots are calculated separately using formula (3) and (6) first, so Afterwards according to place network environment, suitable forward delay time slot is adaptive selected using formula (10):
Finally forward delay time is calculated using formula (11):
DelayTime=(SlotDelay+SlotDirect)×τ (11)
Wherein τ indicates the unit time.
Finally, it should be noted that the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although Present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: it still may be used To modify the technical solutions described in the foregoing embodiments or equivalent replacement of some of the technical features； And these are modified or replaceed, technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution spirit and Range.

Claims (6)

1. a kind of car networking efficient broadcast algorithm based on more delay optimizations characterized by comprising be based on heterogeneous networks state Delay-slot calculating and adaptive forward delay time calculate two steps.
2. the car networking efficient broadcast algorithm according to claim 1 based on more delay optimizations, which is characterized in that described to prolong The calculating of slow time slot includes: based on safety driving distance computing relay time slot, is based on interstitial content computing relay time slot, based on section Three kinds of relative bearing computing relay time slot of point.
3. the car networking efficient broadcast algorithm according to claim 2 based on more delay optimizations, which is characterized in that the base In safety driving distance computing relay time slot the following steps are included:
Step 1: obtaining present node distance D between upper hop nodeSP:
Wherein, (Sx,Sy) indicate upper hop node position coordinates, (Px,Py) indicate present node position coordinates.
Step 2: obtaining the forward delay time slot Slot of present nodeminSecD:
Wherein R indicates that the communication radius of vehicle, minSecD are the minimum safe distance on Liang Gai highway when driving.
4. the car networking efficient broadcast algorithm according to claim 2 based on more delay optimizations, which is characterized in that the base Include: in interstitial content computing relay time slot
Step 1: neighbor node density is calculated according to the neighbor node number of upper hop node:
Wherein, NeigDens indicates neighbor node density, and NeigNum indicates the neighbor node number of upper hop node, AreaR table Show the area of node communication range.
Step 2: calculate the timeslot number that present node should distribute:
SlotDens=NeigNum-AreaD × NeigDens
Wherein AreaD indicates that the above hop node is the center of circle, is formed with upper hop euclidean distance between node pair by radius using present node Circle area；
Step 3: neighbor node density formula will be calculated and bring the timeslot number calculation formula that present node should distribute into,
It can obtain:
Wherein, DSPFor present node between upper hop node at a distance from；The communication radius of R expression vehicle.
5. the car networking efficient broadcast algorithm according to claim 2 based on more delay optimizations, which is characterized in that based on section Putting relative bearing computing relay time slot includes:
Step 1: calculating source node A, neighbor node B and dummy node C and be formed by triangle area SABC, wherein C is located at GPS 0 degree of direction of system and at a distance from A be R:
Step 2: deviation angle of the B relative to A at this time is acquired by above formula:
Wherein, DAB、DAC、DBCThe respectively distance of AB, AC and BC, SABCIt is acquired according to Heron's formula:
Here,
Step 3: the deviation angle computing relay time slot according to neighbor node B relative to source node A:
6. the car networking efficient broadcast algorithm according to claim 3 or 4 based on more delay optimizations, which is characterized in that institute The calculating for stating adaptive forward delay time includes:
Suitable forward delay is adaptive selected using following formula then according to place network environment for computing relay time slot first Time slot:
Finally forward delay time is calculated using following formula:
DelayTime=(SlotDelay+SlotDirect)×τ
Wherein τ indicates the unit time.
CN201810863075.0A 2018-08-01 2018-08-01 Internet of vehicles efficient broadcasting algorithm based on multi-delay optimization Active CN108966153B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810863075.0A CN108966153B (en) 2018-08-01 2018-08-01 Internet of vehicles efficient broadcasting algorithm based on multi-delay optimization

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810863075.0A CN108966153B (en) 2018-08-01 2018-08-01 Internet of vehicles efficient broadcasting algorithm based on multi-delay optimization

Publications (2)

Publication Number Publication Date
CN108966153A true CN108966153A (en) 2018-12-07
CN108966153B CN108966153B (en) 2021-02-26

Family

ID=64465523

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810863075.0A Active CN108966153B (en) 2018-08-01 2018-08-01 Internet of vehicles efficient broadcasting algorithm based on multi-delay optimization

Country Status (1)

Country Link
CN (1) CN108966153B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8289186B2 (en) * 2005-11-18 2012-10-16 Hitachi, Ltd. Method and apparatus for ad-hoc network broadcast communication
CN107645417A (en) * 2017-10-09 2018-01-30 天津理工大学 Towards the adaptive routing method of expressway car networking scene

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8289186B2 (en) * 2005-11-18 2012-10-16 Hitachi, Ltd. Method and apparatus for ad-hoc network broadcast communication
CN107645417A (en) * 2017-10-09 2018-01-30 天津理工大学 Towards the adaptive routing method of expressway car networking scene

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
JAMTHE,DV等: "Secure Technique for Collision Avoidance in Inter-Vehicular Adhoc Network", 《 5TH INTERNATIONAL CONFERENCE ON EMERGING TRENDS IN ENGINEERING AND TECHNOLOGY》 *
王芳: "车载自组网路由算法的研究", 《硕士学位论文》 *

Also Published As

Publication number Publication date
CN108966153B (en) 2021-02-26

Similar Documents

Publication Publication Date Title
Bakhouya et al. An adaptive approach for information dissemination in vehicular ad hoc networks
Maslekar et al. A stable clustering algorithm for efficiency applications in VANETs
CN107343024B (en) Centralized vehicle networking MAC layer merging collision prediction and avoidance method
Chiu et al. Cross‐layer design vehicle‐aided handover scheme in VANETs
CN107645417A (en) Towards the adaptive routing method of expressway car networking scene
CN101431468B (en) Greed data forwarding method based on direction in vehicle-mounted network
CN105208616A (en) Road topology based adaptive multi-copy routing method in vehicular ad hoc network
Wang et al. TIBCRPH: traffic infrastructure based cluster routing protocol with handoff in VANET
CN105246119B (en) A kind of the singlecast router retransmission method and device of vehicular ad hoc network
CN109640369B (en) Vehicle-mounted network reliable communication method based on adaptive power
Banikhalaf et al. A simple and robust clustering scheme for large-scale and dynamic VANETs
Sharef et al. Robust and trust dynamic mobile gateway selection in heterogeneous VANET-UMTS network
CN103781141A (en) Unicast routing forwarding method of vehicle ad-hoc network, chip and a communication system
Bi Neighboring vehicle-assisted fast handoff for vehicular fog communications
CN106713482B (en) The method of node automatic adjustment broadcast beacon interval applied to mobile car networking
Wu et al. Opportunistic routing for live video streaming in vehicular ad hoc networks
Nguyen et al. Application of the lowest-ID algorithm in cluster-based TDMA system for VANETs
Lobato et al. Platoon-based driving protocol based on game theory for multimedia transmission over VANET
Hagenauer et al. Vehicular micro cloud in action: On gateway selection and gateway handovers
CN109561392B (en) Self-adaptive dynamic sensing route for driving environment of Internet of vehicles
Syfullah et al. Mobility-based clustering algorithm for multimedia broadcasting over IEEE 802.11 p-LTE-enabled VANET
Wu et al. An adaptive TDMA scheduling strategy based on beacon messages for vehicular ad-hoc network
CN108966153A (en) A kind of car networking efficient broadcast algorithm based on more delay optimizations
Al-Kubati et al. Stable infrastructure-based routing for intelligent transportation systems
Bellaouar et al. QoS based clustering for vehicular networks in smart cities

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