CN106131871B - A kind of optimized data transmission method towards car networking - Google Patents

A kind of optimized data transmission method towards car networking Download PDF

Info

Publication number
CN106131871B
CN106131871B CN201610579861.9A CN201610579861A CN106131871B CN 106131871 B CN106131871 B CN 106131871B CN 201610579861 A CN201610579861 A CN 201610579861A CN 106131871 B CN106131871 B CN 106131871B
Authority
CN
China
Prior art keywords
data packet
target vehicle
traffic data
traffic
path
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.)
Active
Application number
CN201610579861.9A
Other languages
Chinese (zh)
Other versions
CN106131871A (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.)
Northwest University
Original Assignee
Northwest University
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 Northwest University filed Critical Northwest University
Priority to CN201610579861.9A priority Critical patent/CN106131871B/en
Publication of CN106131871A publication Critical patent/CN106131871A/en
Application granted granted Critical
Publication of CN106131871B publication Critical patent/CN106131871B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • General Health & Medical Sciences (AREA)
  • Medical Informatics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention proposes a kind of optimized data transmission methods towards car networking, and this method is by the scene founding mathematical models to transmission two types data in car networking, using branch and bound method to the analysis and solution of model；And Optimized model is established after Path selection factor is added, after determining path using heuritic approach, recycle branch and bound method to the analysis and solution of model；Optimized data transmission method proposed by the present invention solves assignment problem when transmitting two kinds of different data packets of priority level in car networking；Simultaneously, Path selection factor is added while proposing data distributing method in the present invention, selects a minimum path of link load to carry out data transmission for all candidate data streams, the delay sensitive and reliability of transmission data packet is effectively guaranteed, improves the efficiency of data transmission.

Description

A kind of optimized data transmission method towards car networking
Technical field
The present invention relates to car networking (VANETs) technical fields, and in particular to a kind of optimization data transmission towards car networking Method.
Background technique
Car networking (automobile motive objects networking technology) is extension of the Internet of Things in the field intelligent transportation (ITS), in recent years The extensive concern of industry and academia has been obtained.As the wireless technologys such as WiFi, RFID are employed for traffic in recent years Transport field intelligent management, car networking technology will be used for various aspects, such as traffic Emergency avoidance in danger, traffic information It obtains, special vehicle information warning is propagated, driving path optimization and merchant advertisement direction and location broadcast and parking on road Field information remote acquisition etc.；In car networking, since the Velicle motion velocity as network node is fast, so as to cause network open up It is fast to flutter variation, the transmission link service life is short between network node；City Building results in vehicle connection to the inhibition etc. of wireless signal Network chain road is frequently broken, thus design a stability and high efficiency data transmission technology be it is necessary, data transmission technology Research is the core technology of network layer in extensive automobile wireless network.Mobile wireless network data transfer mode can be led at present It is divided into following three categories: plane data transfer agreement, hierarchical data transport protocol, location-based Data Transport Protocol.
In plane data transfer agreement, each node data having the same send status, need actively or passively Establish routing table to guiding data to transmit；Node is divided into difference according to different classifying methods by hierarchical data transport protocol The cluster of size is managed collectively cluster interior nodes by cluster head, and data packet sub-clustering is sent；Location-based Data Transport Protocol It is assumed that each node has the ability for knowing oneself position, data packet is during being forwarded to destination node, by each The secondary selection next-hop node nearest away from destination node is forwarded, since car networking is using and position related with positional relationship mostly Confidence breath is easier to obtain, so location-based Data Transport Protocol is more widely applied in vehicle net.
But above Data Transport Protocol is all towards a type of car networking application, i.e. Data Transport Protocol is A kind of transmission towards data；And when certain car networking system needs to combine two kinds of car networking in application, i.e. in car networking Need to carry out two kinds of priority levels it is different data transmission when, above-mentioned Data Transport Protocol will have the defects that certain.
Summary of the invention
In view of the deficiencies of the prior art, the present invention intends to provide a kind of optimization data biography towards car networking Transmission method solves assignment problem when transmitting two kinds of different data packets of priority level in car networking, is balancing two kinds of numbers According to packet transmission while so that target vehicle has been obtained maximum benefit again, improve the timeliness of data transmission and reliable Property.
To realize above-mentioned task, the present invention adopts the following technical scheme:
A kind of optimized data transmission method towards car networking, specifically includes the following steps:
Step 1, founding mathematical models: collect target vehicle around traffic information and environmental information respectively as Traffic data packet and Environment data packet；Traffic data packet and Environment data packet are calculated respectively right The punishment that total cost and system that the buffer area answered generates provides, and calculate target vehicle and send multiple Traffic data packets The system benefit respectively obtained with Environment data packet, finally obtain target vehicle send Traffic data packet and The total revenue that Environment data packet obtains；
Step 2 solves the mathematical model that step 1 obtains using branch and bound method, in the feelings of maximum revenue Under condition, the Traffic data packet of target vehicle transmission and the number of Environment data packet are obtained.
There are also following distinguishing features by the present invention:
Further, specific step is as follows for step 1:
Step 1.1, in moment t, target vehicle collects the traffic related information around it as Traffic data packet；It receives Collect ambient condition information as Environment data packet；
Step 1.2, Traffic data packet and Environment data packet are deposited into corresponding buffering by target vehicle respectively The total cost generated after sector's column are as follows:
C=c* [min { Af,Qf}+min{Ae,Qe}]
Wherein, AfAnd AeRespectively indicate the Traffic data packet and Environment data packet that target vehicle is collected into Number；QfAnd QeRespectively indicate Traffic buffer queue and Environment buffer queue maximum length allowed；c Indicate work factor；
Step 1.3, when the data packet number that target vehicle is collected into is more than buffer queue maximum length allowed When, system provides punishment P:
P=γf*(Af-Qf)++γe*(Ae-Qe)+
Wherein, γfAnd γeRespectively indicate the penalty factor of Traffic data packet and Environment data packet；
Step 1.4, target vehicle sends Traffic data packet and Environment data packet to closest to him data Center, data center feed back to the corresponding income of target vehicle；
Target vehicle sends multiple Traffic data packets and obtains system benefit are as follows:
Wherein, xfIt indicates the Traffic data packet number that target vehicle is sent in advance, is decision variable；K is natural number； deadlinekIndicate that the expiration time of k-th of Traffic data packet, t are the sending time of data packet, βfIt indicates to send one Fundamental system financial value obtained by Traffic data packet；
Target vehicle sends the system benefit that multiple Environment data packets obtain are as follows:
Se=xe*βe
Wherein, xeIt indicates the Environment data packet number that target vehicle is sent in advance, is decision variable；βeIt indicates to send The obtained fundamental system financial value of one Environment data packet；
Step 1.5, the Traffic data packet that target vehicle is sent to data center forms Traffic data flow, Environment data packet forms Environment data flow；Use binary variableIndicate whether data flow i has selected road Diameter j, wherein i ∈ { f, e }, j ∈ Pi, PiIndicate all path candidate collection of the i-th data stream；
Binary variableIndicate link l whether on the j of path, it may be assumed that
Wherein, in i ∈ { f, e }, f indicates Traffic data flow, and e indicates Environment data flow；L indicates any bar Link, l ∈ L；
Step 1.6, it is assumed that data flow i has had selected path j, it may be assumed thatThen target vehicle sends xfIt is a Traffic data packet and xeThe total revenue S that a Environment data packet obtains are as follows:
Data flow will receive the limitation of bandwidth in transmission process, then:
xfaf+xeae≤B
Wherein, B indicates link maximum bandwidth allowed, afAnd aeRespectively indicate each Traffic data packet and each The size of Environment data packet.
Further, specific step is as follows for step 2:
Step 2.1,
Conversion are as follows:
Wherein, ζ=- c* [min { Af,Qf}+min{Ae,Qe}]-γf*(Af-Qf)+-γe*(Ae-Qe)+
Further, above-mentioned expression formula is loosened are as follows:
It enablesIt obtains
xf≤a,xe≤b；0≤xe≤Qe
As b≤QeWhen, go to step 2.2；As b > QeWhen, go to step 2.4；
Step 2.2,
Wherein, it enables
xf≤a,xf≤Qf, carry out Taxonomic discussion:
As a≤QfWhen, enable temp=QfAnd go to step 2.3；As a > QfWhen, it enables temp=a and goes to step 2.3；
Step 2.3, link set L, initialize array s=[0,0,0...], for x are initializedf(xf∈(1,xf)) a model Interior traffic data packet is enclosed, first determines whether deadlinek- t information is calculated when its value is greater than 0's It is worth and is saved in array s；Otherwise, 0 is saved in array s, is repeated the above process, until the number of traffic data packet Increase to temp；
S array element is ranked up, maximum value s is obtained*With corresponding xf *, then by xf *With traffic data packet number For 0 (i.e. xf=0) the case where when, is compared, and obtains maximum value xf *, further obtain resultThat is (xf *, xe *)；
Step 2.4, maxS=f (k) * βf+xe*βe≤f(k)*βf+Qe*βe
Wherein, it enables
xf≤a,xf≤Qf, Taxonomic discussion:
As a≤QfWhen, enable temp=QfAnd carry out step 2.5；As a > QfWhen, it enables temp=a and carries out step 2.5；
Step 2.5, link set L, initialize array s=[0,0,0...] are initialized；For xf(xf∈(1,xf)) a model Interior traffic data packet is enclosed, first determines whether the deadline in traffic data packetk- t information, when its value is greater than 0, meter It calculates the value of f (k) and is saved in array s；Otherwise, 0 is saved in array s；It repeats the above process, until traffic data The number of packet increases to temp；
S array element is ranked up, maximum value s is obtained*With corresponding xf *Again by xf *It is with traffic data packet number 0 (i.e. xf=0) the case where when, is compared, and obtains maximum value xf *, further obtain resultThat is (xf *, xe *)。
A kind of optimized data transmission method towards car networking, specifically includes the following steps:
Path selection condition is added in step 1, establishes corresponding mathematical model: collecting the traffic information around target vehicle With environmental information respectively as Traffic data packet and Environment data packet；Calculate what target vehicle was collected into The punishment that the cost and system that Traffic data packet and Environment data packet are generated in corresponding buffer area provide； According to Path selection condition, calculates the multiple Traffic data packets of target vehicle transmission and Environment data packet respectively obtains Corresponding system benefit, the Traffic data packet and Environment data packet for finally obtaining target vehicle transmission obtain total Income；
Step 2 determines path using heuritic approach；
Step 3, the path obtained according to step 2 are solved using mathematical model of the branch and bound method to step 1, are being received In beneficial maximized situation, the Traffic data packet of target vehicle transmission and the number of Environment data packet are obtained.
There are also following distinguishing features by the present invention:
Further, specific step is as follows for step 1:
Step 1.1, in moment t, target vehicle collects the traffic related information around it as Traffic data packet；It receives Collect ambient condition information as Environment data packet；
Step 1.2, Traffic data packet and Environment data packet are deposited into corresponding buffering by target vehicle respectively The total cost generated after sector's column are as follows:
C=c* [min { Af,Qf}+min{Ae,Qe}]
Wherein, AfAnd AeRespectively indicate the Traffic data packet and Environment data packet that target vehicle is collected into Number；QfAnd QeRespectively indicate Traffic buffer queue and Environment buffer queue maximum length allowed；c Indicate work factor；
Step 1.3, when the data packet number that target vehicle is collected into is more than buffer queue maximum length allowed When, system provides punishment P:
P=γf*(Af-Qf)++γe*(Ae-Qe)+
Wherein, γfAnd γeRespectively indicate the penalty factor of Traffic data packet and Environment data packet；
Step 1.4, the Traffic data packet that target vehicle is sent to data center forms Traffic data flow, Environment data packet forms Environment data flow；Use binary variableIndicate whether data flow i has selected road Diameter j, wherein i ∈ { f, e }, j ∈ Pi, PiIndicate all path candidate collection of the i-th data stream；
Binary variableIndicate link l whether on the j of path, it may be assumed that
It willWithAs variable, then
Wherein, in i ∈ { f, e }, f indicates Traffic data flow, and e indicates Environment data flow；L indicates any bar Link, l ∈ L；
Step 1.5, target vehicle sends Traffic data packet and Environment data packet to closest to him data Center, data center feed back to the corresponding income of target vehicle；
Target vehicle sends multiple Traffic data packets and obtains system benefit are as follows:
Wherein, xfIt indicates the Traffic data packet number that target vehicle is sent in advance, is decision variable；K is natural number； deadlinekIndicate that the expiration time of k-th of Traffic data packet, t are the sending time of data packet, βfIt indicates to send one Fundamental system financial value obtained by Traffic data packet；
Target vehicle sends the system benefit that multiple Environment data packets obtain are as follows:
Wherein, xeIt indicates the Environment data packet number that target vehicle is sent in advance, is decision variable；βeIt indicates to send The obtained fundamental system financial value of one Environment data packet；
Step 1.6, target vehicle sends xfA Traffic data packet and xeTotal receipts that a Environment data packet obtains Beneficial S are as follows:
Data flow will receive the limitation of bandwidth in transmission process, then:
Wherein, xi∈{xf,xe, ai∈{af,ae, clIndicate that any bar link capacity, B indicate that link is allowed most Big bandwidth.
Further, specific step is as follows for step 2:
Initialize the link capacity C of link ll=cl, temp=0, path=0 traverse all times of any bar data flow i Select set of paths PiIn any path candidate j；
Judge all link capacity C by path jl, find out maximum value Clmax, and path j is saved in path；It follows Ring executes the above process, until set of paths PiIn the last item path be accessed to；
The path j saved in final path is exactly the selection path of data flow i, and Li path=1, hi path,l=1
Further, specific step is as follows for step 3:
Step 3.1, the transmission path of its data flow is obtained according to step 2, then the formula of the total revenue in step 1.6 becomes Are as follows:
Wherein, ζ=- c* [min { A is enabledf,Qf}+min{Ae,Qe}]-γf*(Af-Qf)+-γe*(Ae-Qe)+,
Above formula conversion are as follows:
Further, above-mentioned expression formula is loosened are as follows:
It enablesIt obtains
xf≤a,xe≤b；0≤xe≤Qe
As b≤QeWhen, go to step 3.2；As b > QeWhen, go to step 3.4；
Step 3.2,
Wherein, it enables
xf≤a,xf≤Qf, carry out Taxonomic discussion:
As a≤QfWhen, enable temp=QfAnd go to step 3.3；As a > QfWhen, it enables temp=a and goes to step 3.3；
Step 3.3, link set L, initialize array s=[0,0,0...], for x are initializedf(xf∈(1,xf)) a model Interior traffic data packet is enclosed, first determines whether deadlinek- t information is calculated when its value is greater than 0's It is worth and is saved in array s, otherwise, 0 is saved in array s, is repeated the above process, until the number of traffic data packet Increase to temp；
S array element is ranked up, maximum value s is obtained*With corresponding xf *, then by xf *With traffic data packet number For 0 (i.e. xf=0) the case where when, is compared, and obtains maximum value xf *, further obtain resultThat is (xf *, xe *)；
Step 3.4, maxS=f (k) * βf+xe*βe≤f(k)*βf+Qe*βe
Wherein, it enables
xf≤a,xf≤Qf, Taxonomic discussion:
As a≤QfWhen, enable temp=QfAnd carry out step 3.5；As a > QfWhen, it enables temp=a and carries out step 3.5；
Step 3.5, link set L, initialize array s=[0,0,0...] are initialized；For xf(xf∈(1,xf)) a model Interior traffic data packet is enclosed, first determines whether the deadline in traffic data packetk- t information, when its value is greater than 0, meter It calculates the value of f (k) and is saved in array s, otherwise, 0 is saved in array s；It repeats the above process, until traffic data The number of packet increases to temp；
S array element is ranked up, maximum value s is obtained*With corresponding xf *Again by xf *It is with traffic data packet number 0 (i.e. xf=0) the case where when, is compared, and obtains maximum value xf *, further obtain resultThat is (xf *, xe *)
Compared with prior art, the present invention having the following technical effect that
(1) present invention is directed to assignment problem when transmitting two kinds of different data packets of priority level in car networking system, A kind of effective distribution method is proposed, in scene of the present invention, the data packet for transmitting high priority can be obtained compared with high yield, and Transmission lower-priority data Bao Ze obtains lower income, target vehicle for benefit, then can transmission priority as far as possible it is high Data, the low data packet of priority can then be blocked.
(2) Path selection factor is added while proposing data distributing method in the present invention, for the choosing of all candidate data streams It selects the minimum path of link load to carry out data transmission, the delay sensitive of transmission data packet and reliable is effectively guaranteed Property, improve the efficiency of data transmission.
(3) a kind of optimized data transmission method towards car networking proposed by the present invention, effective solution such case Under allocation of packets problem, reduce network congestion while improving system effectiveness.
Detailed description of the invention
Fig. 1 is scene figure of the invention.
Explanation is explained in detail to particular content of the invention below in conjunction with drawings and examples.
Specific embodiment
The present invention to the scene founding mathematical models for transmitting two types data in car networking and carries out analytical derivation first, It show that the problem is a non-linear integer optimization problem, and carries out algorithm design using branch and bound method, solve in blockchain Assignment problem when two types data is transmitted in net；Later since two kinds of data of transmission have delay sensitive and reliable Property, the present invention is further added in above-mentioned model and Path selection factor and establishes data-optimized distribution method model, and design opens Hairdo algorithm carries out Path selection and proposes corresponding data distributing method.
A kind of optimized data transmission method towards car networking, specifically includes the following steps:
Step 1, founding mathematical models: collect target vehicle around traffic information and environmental information respectively as Traffic data packet and Environment data packet；Traffic data packet and Environment data packet are calculated respectively right The punishment that total cost and system that the buffer area answered generates provides, and calculate target vehicle and send multiple Traffic data packets The system benefit respectively obtained with Environment data packet, finally obtain target vehicle send Traffic data packet and The total revenue that Environment data packet obtains；
Step 1.1, in moment t, target vehicle is by the traffic condition around the perception of self-contained sensor and collects letter Breath is used as Traffic data packet, by the environmental aspect around perception and collects information as Environment data packet；It hands over Logical condition information includes that the collision information that may occur of section locating for target vehicle (such as witness target vehicle at a certain moment by certain section Collision accident together), the real-time vehicle speed of service or real-time vehicle orientation etc., such data packet have certain delay sensitive Property；Environmental information include the congestion (number of vehicles i.e. in certain a road section) in section locating for target vehicle, air quality (by The air monitering board in section locating for vehicle obtains the air quality indexes that road sign provides, such as carbon dioxide), Environment Data packet has certain reliable sensibility；
Figure one describes the scene of the model foundation, there is the vehicle much moved, roadside on a highway Sparse disposes AP (wireless access point), and each car is equipped with a wireless transceiver, and GPS receiver and environment receive Device；The information being collected into is forwarded to AP by the communication between vehicle by target vehicle, each AP fixed passes through great Rong Amount cable is directly connected to data center (Internet)；
Step 1.2, the two kinds of data packet being collected into is deposited into corresponding buffer queue by target vehicle respectively, number Certain space can be occupied into buffer area by storing according to packet, generate corresponding cost, work factor is denoted as c, then the total cost generated Are as follows:
C=c* [min { Af,Qf}+min{Ae,Qe}]
Wherein, AfAnd AeRespectively indicate the Traffic data packet and Environment data packet that target vehicle is collected into Number；QfAnd QeRespectively indicate Traffic buffer queue and Environment buffer queue maximum length allowed；c Indicate work factor；The calculating of total cost is serviced for total revenue；
Step 1.3, when the data packet number that target vehicle is collected into is more than buffer queue maximum length allowed When, system limits the number of data packet by providing punishment P,
P=γf*(Af-Qf)++γe*(Ae-Qe)+
Wherein, γfAnd γeRespectively indicate the penalty factor of Traffic data packet and Environment data packet；
A is judged respectivelyfWith Qf, AeWith QeSize, work as Af> QfWhen, show that buffer area has occurred that spilling, then starts The penalty of Traffic data packet；Work as Af≤QfWhen, show that buffer area is not overflowed, does not then start penalty.AeWith QeThe same A of relationshipfWith Qf；
Step 1.4, target vehicle sends Traffic data packet and Environment data packet to closest to him data Center, data center feed back to the corresponding income of target vehicle, significance level master according to the significance level that data packet carries information To be judged by timeliness (i.e. the difference of the expiration time of data packet and sending time), when the expiration time of data packet and transmission Between difference it is bigger, then its timeliness is better, and the income that data center feeds back to target vehicle is more；Conversely, income is fewer；
Target vehicle sends multiple Traffic data packets and obtains system benefit are as follows:
Wherein, xfIt indicates the Traffic data packet number that target vehicle is sent in advance, is decision variable；K is natural number； deadlinekIndicate that the expiration time of k-th of Traffic data packet, t are the sending time of data packet, βfIt indicates to send one Fundamental system financial value obtained by Traffic data packet；
Judge the expiration time deadline of any Traffic data packetkWith the size of data packet sending time t, when deadlinekShow when > t data packet sending time before expiration time, the available guarantee of timeliness, according to The delay sensitive degree target vehicle of Traffic data packet obtains system benefit；
Target vehicle sends the system benefit that multiple Environment data packets obtain are as follows:
Se=xe*βe
Wherein, xeIt indicates the Environment data packet number that target vehicle is sent in advance, is decision variable；βeIt indicates to send The obtained fundamental system financial value of one Environment data packet；
Above-mentioned Traffic data packet and the total income of Environment data packet are the real net profit of system；
Step 1.5, the Traffic data packet that target vehicle is sent to data center forms Traffic data flow, Environment data packet forms Environment data flow；Data flow is faced with during being transferred to data center The selection in path, uses binary variableIndicate whether data flow i has selected path j, wherein i ∈ { f, e }, j ∈ Pi, PiTable Show all path candidate collection of the i-th data stream；
It is similar, binary variableIndicate link l whether on the j of path, it may be assumed that
Wherein, in i ∈ { f, e }, f indicates Traffic data flow, and e indicates Environment data flow；L indicates any bar Link, l ∈ L；
Step 1.6, it is assumed that data flow i has had selected path j, it may be assumed thatThen target vehicle sends xfIt is a Traffic data packet and xeThe total revenue S that a Environment data packet obtains are as follows:
Since data flow will receive the limitation of bandwidth in transmission process, then:
xfaf+xeae≤B
Wherein, B indicates link maximum bandwidth allowed, afAnd aeRespectively indicate each Traffic data packet and each The size of Environment data packet；
Using total income S as objective function, then bound for objective function is xfaf+xeae≤B、0≤xf≤Qf、0 ≤xe≤Qe；Wherein xfAnd xeFor decision variable, the purpose of target vehicle is to maximize the income of oneself and can balance both The transmission of data packet, i.e., find a kind of Traffic data packet while maximizing S and Environment data packet is sent Equalization point between number.
Step 2 solves the mathematical model that step 1 obtains using branch and bound method, in the feelings of maximum revenue Under condition, the Traffic data packet of target vehicle transmission and the number of Environment data packet are obtained, following step is specifically included It is rapid:
Step 2.1, it enables
ζ=- c* [min { Af,Qf}+min{Ae,Qe}]-γf*(Af-Qf)+-γe*(Ae-Qe)+, then
Conversion are as follows:
Further, due to being all constant in ζ expression formula, above-mentioned expression formula can be loosened are as follows:
It enablesFurther, according to xfaf+xeae≤B
Then,
Due to xfAnd xeNonnegativity, then,
xf≤a,xe≤b
According to 0≤xe≤QeWithIt can not judge xeUpper bound size, byIt is available b≤Qe, Taxonomic discussion is carried out below:
As b≤QeWhen, go to step 2.2；As b > QeWhen, go to step 2.4；
Step 2.2, it enablesAccording toWith
It derives:
According to 0≤xf≤QfAnd xf≤a,xe≤ b, due to xf≤a,xf≤Qf, therefore can not judge xfUpper bound size, carry out Taxonomic discussion:
As a≤QfWhen, enable temp=QfAnd go to step 2.3；As a > QfWhen, it enables temp=a and goes to step 2.3；
Step 2.3, link set L, initialize array s=[0,0,0...], for x are initializedf(xf∈(1,xf)) a model Interior traffic data packet is enclosed, first determines whether deadlinek- t information is calculated when its value is greater than 0's It is worth and is saved in array s, otherwise, 0 is saved in array s, is repeated the above process, until the number of traffic data packet Increase to temp；
S array element is ranked up using quick sort, obtains maximum value s*With corresponding xf *, then by xf *With Traffic data packet number is 0 (i.e. xf=0) the case where when, is compared, and obtains maximum value xf *, according to? It arrivesThen further obtain resultThat is (xf *,xe *)；
Step 2.4, it enablesAccording to 0≤xe≤QeWith
It obtains
Max S=f (k) * βf+xe*βe≤f(k)*βf+Qe*βe
According to 0≤xf≤QfAnd xf≤a,xe≤ b, due to xf≤a,xf≤Qf, can not judge xfUpper bound size, therefore carry out Taxonomic discussion:
As a≤QfWhen, enable temp=QfAnd carry out step 2.5；As a > QfWhen, it enables temp=a and carries out step 2.5；
Step 2.5, link set L, initialize array s=[0,0,0...] are initialized；For xf(xf∈(1,xf)) a model Interior traffic data packet is enclosed, first determines whether the deadline in traffic data packetk- t information, when its value is greater than 0, meter It calculates the value of f (k) and is saved in array s；Otherwise, 0 is saved in array s；It repeats the above process, until traffic data The number of packet increases to temp；
S array element is ranked up using quick sort, obtains maximum value s*With corresponding xf *, then by xf *With Traffic data packet number is 0 (i.e. xf=0) the case where when, is compared, and obtains maximum value xf *, according to? It arrivesThen further obtain resultThat is (xf *,xe *)；It is specific to calculate as shown in table 1.
It joined Path selection condition, a kind of optimized data transmission method towards car networking, specifically includes the following steps:
Step 1 after Path selection condition is added, founding mathematical models: collects the traffic information and ring around target vehicle Border information is respectively as Traffic data packet and Environment data packet；Calculate the Traffic number that target vehicle is collected into The punishment that the cost and system generated according to packet and Environment data packet in corresponding buffer area provides；According to path Alternative condition, calculates the multiple Traffic data packets of target vehicle transmission and Environment data packet is respectively accordingly System income finally obtains the Traffic data packet that target vehicle is sent and the total revenue that Environment data packet obtains；
Step 1.1, in moment t, target vehicle is by the traffic condition around the perception of self-contained sensor and collects letter Breath is used as Traffic data packet, by the environmental aspect around perception and collects information as Environment data packet；It hands over Logical condition information includes that the collision information that may occur of section locating for target vehicle (such as witness target vehicle at a certain moment by certain section Collision accident together), the real-time vehicle speed of service or real-time vehicle orientation etc., such data packet have certain delay sensitive Property；Environmental information include the congestion (number of vehicles i.e. in certain a road section) in section locating for target vehicle, air quality (by The air monitering board in section locating for vehicle obtains the air quality indexes that road sign provides, such as carbon dioxide), Environment Data packet has certain reliable sensibility；
Step 1.2, the two kinds of data packet being collected into is deposited into corresponding buffer queue by target vehicle respectively, number Certain space can be occupied into buffer area by storing according to packet, generate corresponding cost, work factor is denoted as c, then the total cost generated Are as follows:
C=c* [min { Af,Qf}+min{Ae,Qe}]
Wherein, AfAnd AeRespectively indicate the Traffic data packet and Environment data packet that target vehicle is collected into Number；QfAnd QeRespectively indicate Traffic buffer queue and Environment buffer queue maximum length allowed；c Indicate work factor；The calculating of total cost is serviced for total revenue；
Step 1.3, when the data packet number that target vehicle is collected into is more than buffer queue maximum length allowed When, system limits the number of data packet by providing punishment P,
P=γf*(Af-Qf)++γe*(Ae-Qe)+
Wherein, γfAnd γeRespectively indicate the penalty factor of Traffic data packet and Environment data packet；
A is judged respectivelyfWith Qf, AeWith QeSize, work as Af> QfWhen, show that buffer area has occurred that spilling, then starts The penalty of Traffic data packet；Work as Af≤QfWhen, show that buffer area is not overflowed, does not then start penalty.AeWith QeThe same A of relationshipfWith Qf；
Step 1.4, the Traffic data packet that target vehicle is sent to data center forms Traffic data flow, Environment data packet forms Environment data flow；Data flow is faced with during being transferred to data center The selection in path, uses binary variableIndicate whether data flow i has selected path j, wherein i ∈ { f, e }, j ∈ Pi, PiTable Show all path candidate collection of the i-th data stream；
Binary variableIndicate link l whether on the j of path, it may be assumed that
It willWithAs variable, then
Show that data flow i can only select a paths as its transmission path in its all path candidate concentration；
Wherein, in i ∈ { f, e }, f indicates Traffic data flow, and e indicates Environment data flow；L indicates any bar Link, l ∈ L；
Step 1.5, target vehicle sends Traffic data packet and Environment data packet to closest to him data Center, data center feed back to the corresponding income of target vehicle, significance level master according to the significance level that data packet carries information To be judged by timeliness (i.e. the difference of the expiration time of data packet and sending time), when the expiration time of data packet and transmission Between difference it is bigger, then its timeliness is better, and the income that data center feeds back to target vehicle is more；Conversely, income is fewer；
Target vehicle sends multiple Traffic data packets and obtains system benefit are as follows:
Wherein, xfIt indicates the Traffic data packet number that target vehicle is sent in advance, is decision variable；K is natural number； deadlinekIndicate that the expiration time of k-th of Traffic data packet, t are the sending time of data packet, βfIt indicates to send one Fundamental system financial value obtained by Traffic data packet；
Judge the expiration time deadline of any Traffic data packetkWith the size of data packet sending time t, when deadlinekShow when > t data packet sending time before expiration time, the available guarantee of timeliness, according to The delay sensitive degree target vehicle of Traffic data packet obtains system benefit；
Target vehicle sends the system benefit that multiple Environment data packets obtain are as follows:
Wherein, xeIt indicates the Environment data packet number that target vehicle is sent in advance, is decision variable；βeIt indicates to send The obtained fundamental system financial value of one Environment data packet；
Above-mentioned Traffic data packet and the total income of Environment data packet are the real net profit of system；
Step 1.6, target vehicle sends xfA Traffic data packet and xeTotal receipts that a Environment data packet obtains Beneficial S are as follows:
Since data flow will receive the limitation of bandwidth in transmission process, then:
Wherein, xi∈{xf,xe, ai∈{af,ae, clIndicate that any bar link capacity, B indicate that link is allowed most Big bandwidth.
Using total income S as objective function, then bound for objective function is 0≤xf≤Qf、0≤xe≤Qe、Wherein xfAnd xeFor certainly Plan variable, the purpose of target vehicle is the transmission for maximizing the income of oneself and capable of balancing both data packets, i.e., in maximum It finds a kind of Traffic data packet while changing S and Environment data packet sends equalization point between number.
Step 2 determines path using heuritic approach；
It is specific as follows: willWithAs variable, then
After the Path selection condition in addition step 1.4,
Conversion are as follows:
Meanwhile xfaf+xeae≤ B conversion are as follows:
Wherein, clIndicate any bar link capacity；
Enable ζ=- c* [min { Af,Qf}+min{Ae,Qe}]-γf*(Af-Qf)+-γe*(Ae-Qe)+, then
Conversion are as follows:
It enablesAverage value be wf, then,
According to βf=μ af,βe=μ ae, it obtains:
Further, maxl∈LS=μ cl, i.e. target vehicle income S obtained and link capacity clBe it is directly proportional, Income S will be with link capacity clIncrease and increase；
Initialize the link capacity C of link ll=cl, temp=0, path=0 traverse all times of any bar data flow i Select set of paths PiIn any path candidate j；
Judge all link capacity C by path jl, find out maximum value Clmax, and path j is saved in path；It follows Ring executes the above process, until set of paths PiIn the last item path be accessed to；
The path j saved in final path is exactly the selection path of data flow i, and
Step 3, the path obtained according to step 2 are solved using mathematical model of the branch definition method to step 1, are obtained The number of Traffic data packet and Environment data packet that target vehicle is sent；
Step 3.1, the transmission path of its data flow has been obtained according to step 2, then the public affairs of the total revenue in step 1.6 Formula becomes:
Wherein, ζ=- c* [min { A is enabledf,Qf}+min{Ae,Qe}]-γf*(Af-Qf)+-γe*(Ae-Qe)+, then above formula converts Are as follows:
Further, due to being all constant in ζ expression formula, above-mentioned expression formula can be loosened are as follows:
It enablesFurther, according to xfaf+xeae≤B
Then,
Due to xfAnd xeNonnegativity, then,
xf≤a,xe≤b
According to 0≤xe≤QeWithIt can not judge xeUpper bound size, carry out Taxonomic discussion below:
As b≤QeWhen, go to step 3.2；As b > QeWhen, go to step 3.4；
Step 3.2, it enablesAccording toWithIt derives:
According to 0≤xf≤QfAnd xf≤a,xe≤ b, due to xf≤a,xf≤Qf, therefore can not judge xfUpper bound size, carry out Taxonomic discussion:
As a≤QfWhen, enable temp=QfAnd go to step 3.3；As a > QfWhen, it enables temp=a and goes to step 3.3；
Step 3.3, link set L, initialize array s=[0,0,0...], for x are initializedf(xf∈(1,xf)) a model Interior traffic data packet is enclosed, first determines whether deadlinek- t information is calculated when its value is greater than 0's It is worth and is saved in array s, otherwise, 0 is saved in array s, is repeated the above process, until the number of traffic data packet Increase to temp；
S array element is ranked up using quick sort, obtains maximum value s*With corresponding xf *, then by xf *With Traffic data packet number is 0 (i.e. xf=0) the case where when, is compared, and obtains maximum value xf *, according to? It arrivesThen further obtain resultThat is (xf *,xe *)；
Step 3.4, it enablesAccording to 0≤xe≤QeWithIt obtains
MaxS=f (k) * βf+xe*βe≤f(k)*βf+Qe*βe
According to 0≤xf≤QfAnd xf≤a,xe≤ b, due to xf≤a,xf≤Qf, can not judge xfUpper bound size, therefore carry out Taxonomic discussion:
As a≤QfWhen, enable temp=QfAnd carry out step 3.5；As a > QfWhen, it enables temp=a and carries out step 3.5；
Step 3.5, link set L, initialize array s=[0,0,0...] are initialized；For xf(xf∈(1,xf)) a model Interior traffic data packet is enclosed, first determines whether the deadline in traffic data packetk- t information, when its value is greater than 0, meter It calculates the value of f (k) and is saved in array s；Otherwise, 0 is saved in array s；It repeats the above process, until traffic data The number of packet increases to temp；
S array element is ranked up using quick sort, obtains maximum value s*With corresponding xf *, then by xf *With Traffic data packet number is 0 (i.e. xf=0) the case where when, is compared, and obtains maximum value xf *, according to? It arrivesThen further obtain resultThat is (xf *,xe *), it is determined that Traffic data packet With the transmission number of Environment data packet；It is specific to calculate as shown in table 2.
A kind of optimized data transmission method towards car networking of table 1
A kind of table 2: optimized data transmission method towards car networking for combining Path selection

Claims (5)

1. a kind of optimized data transmission method towards car networking, which is characterized in that specifically includes the following steps:
Step 1, founding mathematical models: the traffic information and environmental information around collection target vehicle are respectively as Traffic number According to packet and Environment data packet；Traffic data packet and Environment data packet are calculated in corresponding buffering The punishment that provides of total cost and system that area generates, and calculate target vehicle send multiple Traffic data packets and The system benefit that Environment data packet respectively obtains, finally obtain target vehicle send Traffic data packet and The total revenue that Environment data packet obtains:
Step 1.1, in moment t, target vehicle collects the traffic related information around it as Traffic data packet；Collect week Environmental information is enclosed as Environment data packet；
Step 1.2, Traffic data packet and Environment data packet are deposited into corresponding buffering sector by target vehicle respectively The total cost generated after column are as follows:
C=c* [min { Af,Qf}+min{Ae,Qe}]
Wherein, AfAnd AeRespectively indicate the Traffic data packet and Environment data packet number that target vehicle is collected into；Qf And QeRespectively indicate Traffic buffer queue and Environment buffer queue maximum length allowed；C is indicated Work factor；
Step 1.3, when the data packet number that target vehicle is collected into maximum length allowed more than buffer queue, it is System provides punishment P:
P=γf*(Af-Qf)++γe*(Ae-Qe)+
Wherein, γfAnd γeRespectively indicate the penalty factor of Traffic data packet and Environment data packet；
Step 1.4, target vehicle sends Traffic data packet and Environment data packet to closest to him data center, Data center feeds back to the corresponding income of target vehicle；
Target vehicle sends multiple Traffic data packets and obtains system benefit are as follows:
Wherein, xfIt indicates the Traffic data packet number that target vehicle is sent in advance, is decision variable；K is natural number； deadlinekIndicate that the expiration time of k-th of Traffic data packet, t are the sending time of data packet, βfIt indicates to send one Fundamental system financial value obtained by Traffic data packet；
Target vehicle sends the system benefit that multiple Environment data packets obtain are as follows:
Se=xe*βe
Wherein, xeIt indicates the Environment data packet number that target vehicle is sent in advance, is decision variable；βeIt indicates to send one The obtained fundamental system financial value of Environment data packet；
Step 1.5, the Traffic data packet that target vehicle is sent to data center forms Traffic data flow, Environment data packet forms Environment data flow；Use binary variableIndicate whether data flow i has selected road Diameter j, wherein i ∈ { f, e }, j ∈ Pi, PiIndicate all path candidate collection of the i-th data stream；
Binary variableIndicate link l whether on the j of path, it may be assumed that
Wherein, in i ∈ { f, e }, f indicates Traffic data flow, and e indicates Environment data flow；L indicates any bar chain Road, l ∈ L；
Step 1.6, it is assumed that data flow i has had selected path j, it may be assumed thatThen target vehicle sends xfIt is a Traffic data packet and xeThe total revenue S that a Environment data packet obtains are as follows:
Data flow will receive the limitation of bandwidth in transmission process, then:
xfaf+xeae≤B
Wherein, B indicates link maximum bandwidth allowed, afAnd aeRespectively indicate each Traffic data packet and each The size of Environment data packet；
Step 2 solves the mathematical model that step 1 obtains using branch and bound method, in the case where maximum revenue, Obtain the Traffic data packet of target vehicle transmission and the number of Environment data packet.
2. a kind of optimized data transmission method towards car networking as described in claim 1, which is characterized in that the step 2 Specific step is as follows:
Step 2.1,
Conversion are as follows:
Wherein, ζ=- c*[min{Af,Qf}+min{Ae,Qe}]-γf*(Af-Qf)+-γe*(Ae-Qe)+
Further, above-mentioned expression formula is loosened are as follows:
It enablesIt obtains
xf≤a,xe≤b；0≤xe≤Qe
As b≤QeWhen, go to step 2.2；Work as b > QeWhen, go to step 2.4；
Step 2.2,
Wherein, it enables
xf≤a,xf≤Qf, carry out Taxonomic discussion:
As a≤QfWhen, enable temp=QfAnd go to step 2.3；Work as a > QfWhen, it enables temp=a and goes to step 2.3；
Step 2.3, link set L, initialize array s=[0,0,0...], for x are initializedf(xf∈(1,xf)) in a range Traffic data packet, first determine whether deadlinek- t information is calculated when its value is greater than 0Value simultaneously It is saved in array s；Otherwise, 0 is saved in array s, is repeated the above process, until the number of traffic data packet increases To temp；
S array element is ranked up, maximum value s is obtained*With corresponding xf *, then by xf *It is 0 with traffic data packet number (i.e. xf=0) the case where when, is compared, and obtains maximum value xf *, further obtain resultThat is (xf *, xe *)；
Step 2.4, maxS=f (k) * βf+xe*βe≤f(k)*βf+Qe*βe
Wherein, it enables
xf≤a,xf≤Qf, Taxonomic discussion:
As a≤QfWhen, enable temp=QfAnd carry out step 2.5；Work as a > QfWhen, it enables temp=a and carries out step 2.5；
Step 2.5, link set L, initialize array s=[0,0,0...] are initialized；For xf(xf∈(1,xf)) in a range Traffic data packet, first determine whether the deadline in traffic data packetk- t information calculates f when its value is greater than 0 (k) value is simultaneously saved in array s；Otherwise, 0 is saved in array s；It repeats the above process, until traffic data packet Number increases to temp；
S array element is ranked up, maximum value s is obtained*With corresponding xf *Again by xf *It is 0 (i.e. with traffic data packet number xf=0) the case where when, is compared, and obtains maximum value xf *, further obtain resultThat is (xf *,xe *)。
3. a kind of optimized data transmission method towards car networking, which is characterized in that specifically includes the following steps:
Path selection condition is added in step 1, establishes corresponding mathematical model: collecting the traffic information and ring around target vehicle Border information is respectively as Traffic data packet and Environment data packet；Calculate the Traffic number that target vehicle is collected into The punishment that the cost and system generated according to packet and Environment data packet in corresponding buffer area provides；According to path Alternative condition, calculates the multiple Traffic data packets of target vehicle transmission and Environment data packet is respectively accordingly System income finally obtains the Traffic data packet that target vehicle is sent and the total revenue that Environment data packet obtains:
Step 1.1, in moment t, target vehicle collects the traffic related information around it as Traffic data packet；Collect week Environmental information is enclosed as Environment data packet；
Step 1.2, Traffic data packet and Environment data packet are deposited into corresponding buffering sector by target vehicle respectively The total cost generated after column are as follows:
C=c* [min { Af,Qf}+min{Ae,Qe}]
Wherein, AfAnd AeRespectively indicate the Traffic data packet and Environment data packet number that target vehicle is collected into；Qf And QeRespectively indicate Traffic buffer queue and Environment buffer queue maximum length allowed；C is indicated Work factor；
Step 1.3, when the data packet number that target vehicle is collected into maximum length allowed more than buffer queue, it is System provides punishment P:
P=γf *(Af-Qf)++γe*(Ae-Qe)+
Wherein, γfAnd γeRespectively indicate the penalty factor of Traffic data packet and Environment data packet；
Step 1.4, the Traffic data packet that target vehicle is sent to data center forms Traffic data flow, Environment data packet forms Environment data flow；Use binary variableIndicate whether data flow i has selected road Diameter j, wherein i ∈ { f, e }, j ∈ Pi, PiIndicate all path candidate collection of the i-th data stream；
Binary variableIndicate link l whether on the j of path, it may be assumed that
It willWithAs variable, then
Wherein, in i ∈ { f, e }, f indicates Traffic data flow, and e indicates Environment data flow；L indicates any bar chain Road, l ∈ L；
Step 1.5, target vehicle sends Traffic data packet and Environment data packet to closest to him data center, Data center feeds back to the corresponding income of target vehicle；
Target vehicle sends multiple Traffic data packets and obtains system benefit are as follows:
Wherein, xfIt indicates the Traffic data packet number that target vehicle is sent in advance, is decision variable；K is natural number； deadlinekIndicate that the expiration time of k-th of Traffic data packet, t are the sending time of data packet, βfIt indicates to send one Fundamental system financial value obtained by Traffic data packet；
Target vehicle sends the system benefit that multiple Environment data packets obtain are as follows:
Wherein, xeIt indicates the Environment data packet number that target vehicle is sent in advance, is decision variable；βeIt indicates to send one The obtained fundamental system financial value of Environment data packet；
Step 1.6, target vehicle sends xfA Traffic data packet and xeThe total revenue S that a Environment data packet obtains Are as follows:
Data flow will receive the limitation of bandwidth in transmission process, then:
Wherein, xi∈{xf,xe, ai∈{af,ae, clIndicate that any bar link capacity, B indicate link maximum belt allowed It is wide；
Step 2 determines path using heuritic approach；
Step 3, the path obtained according to step 2 solve the mathematical model of step 1 using branch and bound method, income most In the case where bigization, the Traffic data packet of target vehicle transmission and the number of Environment data packet are obtained.
4. a kind of optimized data transmission method towards car networking as claimed in claim 3, which is characterized in that the step 2 Specific step is as follows:
Initialize the link capacity C of link ll=cl, temp=0, path=0, all candidate roads of traversal any bar data flow i Diameter set PiIn any path candidate j；
Judge all link capacity C by path jl, find out maximum value Clmax, and path j is saved in path；Circulation is held The row above process, until set of paths PiIn the last item path be accessed to；
The path j saved in final path is exactly the selection path of data flow i, and
5. a kind of optimized data transmission method towards car networking as claimed in claim 3, which is characterized in that the step 3 Specific step is as follows:
Step 3.1, the transmission path of the data flow obtained according to step 2, then the formula of the total revenue in step 1.6 becomes:
Wherein, ζ=- c* [min { A is enabledf,Qf}+min{Ae,Qe}]-γf*(Af-Qf)+-γe*(Ae-Qe)+, above formula conversion are as follows:
Further, above-mentioned expression formula is loosened are as follows:
It enablesIt obtains
xf≤a,xe≤b；0≤xe≤Qe
As b≤QeWhen, go to step 3.2；Work as b > QeWhen, go to step 3.4；
Step 3.2,
Wherein, it enables
xf≤a,xf≤Qf, carry out Taxonomic discussion:
As a≤QfWhen, enable temp=QfAnd go to step 3.3；Work as a > QfWhen, it enables temp=a and goes to step 3.3；
Step 3.3, link set L, initialize array s=[0,0,0...], for x are initializedf(xf∈(1,xf)) in a range Traffic data packet, first determine whether deadlinek- t information is calculated when its value is greater than 0Value simultaneously It is saved in array s, otherwise, 0 is saved in array s, is repeated the above process, until the number of traffic data packet increases To temp；
S array element is ranked up, maximum value s is obtained*With corresponding xf *, then by xf *It is 0 with traffic data packet number (i.e. xf=0) the case where when, is compared, and obtains maximum value xf *, further obtain resultThat is (xf *, xe *)；
Step 3.4, maxS=f (k) * βf+xe*βe≤f(k)*βf+Qe*βe
Wherein, it enables
xf≤a,xf≤Qf, Taxonomic discussion:
As a≤QfWhen, enable temp=QfAnd carry out step 3.5；Work as a > QfWhen, it enables temp=a and carries out step 3.5；
Step 3.5, link set L, initialize array s=[0,0,0...] are initialized；For xf(xf∈(1,xf)) in a range Traffic data packet, first determine whether the deadline in traffic data packetk- t information calculates f when its value is greater than 0 (k) value is simultaneously saved in array s, and otherwise, 0 is saved in array s；It repeats the above process, until traffic data packet Number increases to temp；
S array element is ranked up, maximum value s is obtained*With corresponding xf *Again by xf *It is 0 (i.e. with traffic data packet number xf=0) the case where when, is compared, and obtains maximum value xf *, further obtain resultThat is (xf *,xe *)。
CN201610579861.9A 2016-07-21 2016-07-21 A kind of optimized data transmission method towards car networking Active CN106131871B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610579861.9A CN106131871B (en) 2016-07-21 2016-07-21 A kind of optimized data transmission method towards car networking

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610579861.9A CN106131871B (en) 2016-07-21 2016-07-21 A kind of optimized data transmission method towards car networking

Publications (2)

Publication Number Publication Date
CN106131871A CN106131871A (en) 2016-11-16
CN106131871B true CN106131871B (en) 2019-05-17

Family

ID=57290694

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610579861.9A Active CN106131871B (en) 2016-07-21 2016-07-21 A kind of optimized data transmission method towards car networking

Country Status (1)

Country Link
CN (1) CN106131871B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108600098B (en) * 2018-03-09 2020-09-04 西北大学 Scheduling method for fixed bandwidth of multiple variable paths in high-performance network
CN108513317A (en) * 2018-04-13 2018-09-07 中南大学 The appraisal procedure of car networking mist computing capability under non-time gang mould formula

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102958109A (en) * 2012-10-26 2013-03-06 合肥工业大学 Node energy self-adaption management strategy of wireless sensor network
CN102984200A (en) * 2012-09-13 2013-03-20 大连理工大学 Method applicable for scene with multiple sparse and dense vehicular ad hoc networks (VANETs)
CN103987103A (en) * 2014-04-30 2014-08-13 重庆邮电大学 Vehicular ad hoc network route selection method based on game theory
CN204515409U (en) * 2015-02-09 2015-07-29 郑莹 A kind of process information vehicle-mounted Sensor Network controller equiment rapidly

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102984200A (en) * 2012-09-13 2013-03-20 大连理工大学 Method applicable for scene with multiple sparse and dense vehicular ad hoc networks (VANETs)
CN102958109A (en) * 2012-10-26 2013-03-06 合肥工业大学 Node energy self-adaption management strategy of wireless sensor network
CN103987103A (en) * 2014-04-30 2014-08-13 重庆邮电大学 Vehicular ad hoc network route selection method based on game theory
CN204515409U (en) * 2015-02-09 2015-07-29 郑莹 A kind of process information vehicle-mounted Sensor Network controller equiment rapidly

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
PIS: A practicalincentive system for multi-hop wireless networks;M. E. Mahmoud and X. Shen;《IEEE Transactions on Vehicular Technology》;20101031;全文

Also Published As

Publication number Publication date
CN106131871A (en) 2016-11-16

Similar Documents

Publication Publication Date Title
Zhang et al. Vehicular communication networks in the automated driving era
US10257695B2 (en) Wireless communication device and wireless communication method
Liu et al. Enhancing the fuel-economy of V2I-assisted autonomous driving: A reinforcement learning approach
CN102271368B (en) Cross-layer-resource-optimization-based space-sky information network information transmission method and system
CN104539738B (en) A kind of vehicle self-organizing network of LED communication
US11073402B2 (en) Method and system for exchanging map data according to a quality measurement
CN105682046A (en) Interest packet forwarding method based on data attributes in vehicle-mounted named data networking
Li et al. Vehicle-mounted base station for connected and autonomous vehicles: Opportunities and challenges
JP2021507424A (en) Target vehicle selection and message delivery in the vehicle system
CN109600715B (en) Internet of vehicles V2X communication auxiliary file downloading method
CN108769926B (en) Group perception layer-based car networking privacy protection method and car networking framework
CN112911551B (en) Vehicle road cloud computing power dynamic distribution system
CN106131871B (en) A kind of optimized data transmission method towards car networking
JP2002261685A (en) Road-vehicle communication system
CN102883402A (en) Vehicular Ad hoc network data transmission method based on position and topological characteristic
CN110505601A (en) Information transmission frequency optimization method based on vehicle driving situation field model in a kind of car networking
CN111510496A (en) Traffic guidance system and method based on block chain information sharing
Lin et al. Low-latency edge video analytics for on-road perception of autonomous ground vehicles
CN106559755B (en) Broadcasting method is identified based on the car networking electronic communication that QoS under collision detection is ensured
Zhang et al. Research on adaptive beacon message broadcasting cycle based on vehicle driving stability
CN116017348B (en) Big data cloud computing real-time distribution operation and maintenance system and method based on 5G communication
Nahar et al. OBQR: orientation-based source QoS routing in VANETs
Er et al. CityView: a vehicle based image and data collection for smart cities
Zhou et al. Augmented informative cooperative perception
CN114915940A (en) Vehicle-road communication link matching method and system based on edge cloud computing

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant