CN108200601A - A kind of multilink selection method based on data priority, link state and traffic current density - Google Patents

A kind of multilink selection method based on data priority, link state and traffic current density Download PDF

Info

Publication number
CN108200601A
CN108200601A CN201711237968.6A CN201711237968A CN108200601A CN 108200601 A CN108200601 A CN 108200601A CN 201711237968 A CN201711237968 A CN 201711237968A CN 108200601 A CN108200601 A CN 108200601A
Authority
CN
China
Prior art keywords
link
data
data message
links
wsm
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201711237968.6A
Other languages
Chinese (zh)
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.)
Dalian University of Technology
Original Assignee
Dalian University of Technology
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 Dalian University of Technology filed Critical Dalian University of Technology
Priority to CN201711237968.6A priority Critical patent/CN108200601A/en
Publication of CN108200601A publication Critical patent/CN108200601A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/0231Traffic management, e.g. flow control or congestion control based on communication conditions
    • H04W28/0236Traffic management, e.g. flow control or congestion control based on communication conditions radio quality, e.g. interference, losses or delay
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/62Queue scheduling characterised by scheduling criteria
    • H04L47/625Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/6275Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Small-Scale Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

A kind of multilink selection method based on data priority, link state and traffic current density belongs to network function virtualization and heterogeneous network converged technical field in car networking.Link selection algorithm based on data priority, link state and traffic current density, the shortcomings that current car networking uses link selection algorithm link utilization too low is overcome, while also solves the problems, such as to ignore WSM transmission demands in the existing research about car networking heterogeneous network converged, cause WSM delays excessively high.Vehicle-carrying communication node can be made to merge a variety of different types of network interfaces using the method for the present invention, realize heterogeneous network converged, simultaneously under the premise of WSM categorical data transmission demands are ensured, reduce the delay of various types data, and the utilization rate of link circuit resource is improved, ensure the QoE of various types service.

Description

A kind of multilink selection based on data priority, link state and traffic current density Method
Technical field
The invention belongs in car networking network function virtualization (Network Functions Virtualization, NFV) and heterogeneous network converged technical field, it is related to a kind of equipment for being suitable for integrating multiple physical network interfaces and is sending net During network message how in data link layer (LLC) according to send content priority level, link state and current flows Density carries out the selection method of certain physical network interface.
Background technology
With the development of wireless access technology, the appearance of the technologies such as LTE, IEEE 802.11p, WiMAX or even 5G, More and more researchers, which begin to focus on, to apply in by various wireless access technologys in car networking.Related protocol standard is also increasingly Maturation, for example, the U.S. propose WAVE standard agreement groups, for transmit security service relevant information, traffic efficiency relevant information, Information etc. in terms of amusement.But single wireless access technology cannot meet the application demand of car networking, two or more nothings Line communication technology, which is combined, builds car networking, is the master of presently relevant research to improve the robustness of car networking network, reliability Want trend.The integrating multi network interface on car networking terminal device merges multiple network resources, can not only provide one and cover The large scale network of a wide range of all vehicles in area of lid, can also meet the transmission and distribution of the real-time security information of this area Demand reduces traffic accident.But at present in heterogeneous network converged, data transmission is mainly or based on TCP/IP frames Frame lacks the strategy that effectively data-oriented content and current traffic flow situation are distributed.How combining environmental factor needle To data priority, improve the transmission rate of Safety related message (WAVE Short Message, WSM) and the QoE of security service (Quality of Experience), while ensure the QoE of non-security service, lack effective technical solution at present.
Invention content
The purpose of the present invention is being to overcome the shortcomings of existing technologies, a kind of a variety of different type physical networks of fusion are provided Interface, and based on the link selection algorithm of data priority, link state and traffic current density, current car networking is overcome to be made With link selection algorithm link utilization it is too low the shortcomings that, while also solve it is existing about car networking heterogeneous network converged study In ignore WSM transmission demands, cause WSM delay it is excessively high the problem of.Its Interface Expanding is as shown in Figure 1.
In a kind of car networking of the present invention towards in more net network integrations based on data priority, link state and The link selection algorithm of traffic current density.In car networking communication process, mobile unit or roadside device, in order to improve network The capacity of communication is often integrated with multiple network interface cards.If being used for transmitting WSM with special network interface card, the network interface card link can be caused Utilization rate is too low.If allowing all-network communication service is indiscriminate to share all network interface cards, WSM communication delay mistakes are may result in It is long.In order to solve problem above, the method for the present invention utilizes the distinctive four kinds of data priorities of car networking (in car networking IEEE802.11p employ enhanced distributed channel access (Enhanced Distributed Channel Access, EDCA) mechanism defines medium access rule, redefined four kinds of different access level (access categories, AC), according to the importance of message content and urgency, a kind of AC is assigned for each frame by the application of establishment information, passes through AC ropes Draw (AC Index, ACI) and determine that AC, ACI mono- are divided into four kinds:0th, 1,2 and 3, four kinds of different urgency levels and excellent are corresponded to respectively The information of first grade, ACI is bigger, and priority is bigger) and the delay and load of each link that obtain in real time, and combine current Traffic current density so as to design a link selection algorithm, is calculated and is selected to current all links, when a datagram Text from upper strata reach data link layer when, most suitable link is selected by the algorithm and is transmitted, reach ensure WSM have compared with Under the premise of low latency, the delay of non-WSM is reduced, while improves the utilization rate of link, enhancing car networking overall transfer effect The purpose of rate.
In order to achieve the above object, the present invention provides it is a kind of towards car networking based on data priority, link state And the link scheduling algorithm of traffic current density, this method are in existing ICP/IP protocol framework on the basis of LLC protocol layers One expansion.During installation, need this method being added in LLC layer.The required data priority of this method, link shape simultaneously State and three parameter informations of traffic current density, are all the data that can be directly obtained in network, without additional specially treated.Its In, data priority can be specified in agreement according to the fixed field information acquisition in data message, this part.Link shape State can be directly obtained according to the physical network interface connected.Traffic current density be also transmitted in car networking agreement it is basic Data can directly obtain in related protocol.This method includes following operative step:
1) when thering is data message to reach data link layer from upper strata, the priority of the data message is extracted, if preferentially Grade is highest, i.e. the type of the data message is WSM, then directly data message is distributed on IEEE802.11p links and carried out Transmission;
2) when data link layer from upper strata receive be the data message of non-WSM types when, need to obtain each link at this time Round trip delay time (Round-Trip Time, RTT) and loading condition, while also to obtain the traffic of current vehicle local environment Current density calculates priority factor using data priority, with RTT and loading condition calculate respectively the delay accounting of each link because Son and the load accounting factor finally calculate the matching degree of data message and link, if what is calculated is with three above parameter The matching degree of data message and IEEE802.11p links will also add traffic current density as parameter, finally by the data message Most matched link is assigned to be transmitted.
3) if above non-WSM data messages are assigned to IEEE802.11p links, the hair according to WSM is needed at this time The load in period, the maximum throughput of IEEE802.11p links and IEEE802.11p links is sent to calculate IEEE802.11p links Current non-WSM maximum distributions frequency recycles newest two non-WSM data messages for reaching IEEE 802.11p links, meter The instantaneous distribution frequency of IEEE 802.11p links at this time is calculated, it, should if (i) instantaneously distribution frequency is smaller than maximum distribution frequency Data message is successfully entered the transmission buffering area of IEEE802.11p links, distributes successfully;(ii) if instantaneously distribution frequency ratio is most Big distribution frequency is big, then distributes and fail, the queue to be distributed which enters LLC layer resumes waiting for distributing.
The beneficial effects of the invention are as follows:The fusion of vehicle-carrying communication node can be made a variety of different types of using the method for the present invention Network interface realizes heterogeneous network converged, while under the premise of WSM categorical data transmission demands are ensured, reduces various types The delay of data, and the utilization rate of link circuit resource is improved, ensure the QoE of various types service.
Description of the drawings
Attached drawing 1 is that a kind of link x selections based on data priority, link state and traffic current density of the present invention are calculated The protocol architecture schematic diagram of method.
Attached drawing 2 is that a kind of link scheduling based on data priority, link state and traffic current density of the present invention is calculated The concrete operation step schematic diagram of method.
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, the present invention is made below in conjunction with the accompanying drawings further Detailed description.
Referring to Fig. 1, a kind of link based on data priority, link state and traffic current density of the present invention is described The protocol architecture of dispatching algorithm realizes multipath concurrence transmission (Multi LLC) in LLC layer, and has merged a variety of differences The MAC layer establishing of type, such as LTE, IEEE802.11p etc. realize heterogeneous network converged, utilize a variety of wireless access technologys Advantage carry out complementary, overcome the limitation of monotechnics, while using the present invention based on data priority, link state And the link scheduling algorithm of traffic current density, while the efficiency of transmission for ensureing all types of data, improve link circuit resource Utilization rate, improve the transmission performance of car networking entirety.
Referring to Fig. 2, with reference to a kind of link selection based on data priority, link state and traffic current density of the present invention Following each concrete operation steps of algorithm:
Step 1, data type is obtained.When vehicle wants transmission data, data message is passed down to up to LLC layer, It is buffered in the data message queue to be sent of LLC layer.LLC layer obtains the first message of data message queue to be sent, root every time The type of data is judged according to the priority of the data message, if the data message is WSM, directly the datagram Text is distributed on IEEE 802.11p links and is transmitted, and distribution is completed.
Step 2, calculate and more each link data priority matching degree (Data Priority Match Degree, DPMD).If be transmitted to LLC layer is the data message of conventional TCP/IP, i.e. non-secure data message, just need to link at this time Current state is judged and is analyzed, and combines data priority and traffic current density, selects to be most suitable for the data message Link is transmitted.
Link state is analyzed by two aspects:RTT and link load.
The 1 delay accounting factor (RTT Factor) is defined for representing the delay at link moment in the DPMD for judging link The weight of Shi Suozhan, uses REi(t) it represents.Its expression formula is as follows
Wherein, Ri(t) represent link i in the RTT of t moment, Ri maxRepresent that the maximum delay response patient time of link i is normal Number, message dropping is considered as beyond this time.By defining it is found that working as Ri(t)≤Ri maxWhen, message is not lost, REi (t)∈(0,1];Work as Ri(t) > Ri maxWhen, message dropping, at this time by REi(t) value is 1.Therefore, REi(t) final value Ranging from (0,1].
It defines the 2 load accounting factors (Load Factor) and represents when being supported on the DPMD for judging link of link moment Shared weight, uses LEi(t) it represents.Expression formula is as follows
Wherein, Li(t) represent link i in the load value of t moment, Li maxThe maximum load value of link i is represented, beyond this Value then shows that the link sends buffering area and expired, congestion situation occurs.According to congestion theorem it is found that sending buffering area uses feelings The variation of condition is generally divided into two stages:Build phase and congestion phases.In build phase, the occupied section of buffering area is sent Increase always, but do not reach peak value, in this stage Li(t) < Li max, 0≤LEi(t) < 1;And in congestion phases, transmission is delayed It rushes area to be otherwise fully engaged, at this time Li(t)=Li max, LEi(t)=1.Therefore, LEi(t) value range is [0,1].
3 data message priority β are defined to represent the urgency level of current data message.Its expression formula is as follows
Wherein, ACI ∈ { 0,1,2,3 } represents the transmission priority of data frame, and numerical value is bigger, and priority is higher.ACNum For the type of ACI, in car networking environment, there are four types of ACI, so ACNum=4, the molecule and denominator of formula add 1 to be to go 0.By definition it is found that the value of ACI is 0,1,2 or 3, ACNum value are 4, therefore ACI < ACNum, data priority β ∈ (0, 1)。
Research shows that the communication requirement of IEEE 802.11p changes with the variation of vehicle mobile environment, vehicle movement Environment affects the protocol capabilities and communication quality of IEEE 802.11p.For more than property, it is proposed that based on traffic current density Car networking node traffic estimation, to ensure the transmission performance of IEEE 802.11p links.Certain vehicle is in t moment and other The traffic estimated value of vehicle can be obtained by the following formula
X (t)=fPR ρ (4)
Wherein, frequencies of the f for IEEE 802.11p protocol broadcast message of vehicular status, current vehicle Network Communication consensus standard The status message broadcasting frequency of defined is 1Hz-10Hz, and frequency is higher, and the Security message exchange of vehicle can be more frequent, and vehicle moves Rotating ring border is safer, therefore f=10 is selected to consider the signal intelligence of vehicle herein;P is each communication truck in current network The average quantity of institute operational safety class application, security classes are using more common, so the numerical value can be obtained directly from system; R is the communication distance of vehicle, and ρ is the traffic current density of current vehicle mobile environment, the two numerical value all can be from car networking It is obtained in related protocol.R ρ are that currently the existing vehicle number in vehicle communication radius, PR ρ are vehicle communication radius model Interior all security classes applications being currently running are enclosed, therefore can show that x is the total logical of security classes application in the range of the communication radius Traffic.
Finally, with reference to above each parameter, the DPMD values of each link are calculated, and are selected.
The data priority matching degree (DPMD) for defining 4 links represents the suitable journey of certain moment link pair current data message Degree.
Wherein, si(t) represent link i in DPMD value of the t moment about data message p, βpIt is non-secure data message p Priority, REi(t) and LEi(t) it is respectively link i in the delay accounting factor of t moment and loads the accounting factor, x (t) is the vehicle Current traffic estimated value, in order to ensure the transmission demand of security information, in the DPMD for calculating IEEE 802.11p links During value, need to subtract the estimated value of the current vehicle traffic in the denominator part of the load accounting factor, as train safety information Interaction and forwarding reserved space, whenWhen, it takesAccording to (5) formula, all links are calculated DPMD values, and choose the link of DPMD values minimum, data message p is distributed to corresponding link is transmitted.If data Message p is distributed to non-IEEE802.11p links, then distributes completion, and algorithm terminates, and comes back to step 1;If data message p IEEE 802.11p links are distributed to, then are also needed to by step 3.
Step 3, the non-secure data message maximum distribution frequency of IEEE802.11p links is calculated.It is walked by two above Suddenly, it if data message p is distributed to IEEE 802.11p links, needs that (7) is utilized to calculate IEEE 802.11p links at this time Non- WSM maximum distributions frequency fu max.According to the regulation of car networking communication protocol standard, the transmission of WSM has periodically, sends frequency Rate is 1-10Hz.Therefore, the non-WSM quantity c that IEEE 802.11p links can be transmitted within a WSM period is
C=kT (6)
Wherein, k is the sending cycle of WSM, can be obtained by car networking related protocol;T is IEEE802.11p links Maximum throughput can be obtained in the physical network interface of IEEE802.11p agreements.
In the ideal situation, after the non-WSM data messages of c sizes have been sent, next WSM can be without waiting for direct It sends, does not interfere with the transmission demand of WSM.Therefore, in practical situations, with MAC layer send buffering area remaining space whether Than c greatly Rule of judgment, the non-WSM maximum distributions frequency of IEEE 802.11p links can be obtained
Wherein, Lmax is the transmission buffer size of IEEE802.11p links, Li(t) it is that IEEE802.11p links are current The transmission buffer size used.By (7) it is found that the non-WSM distributions frequency when IEEE 802.11p links reaches fu max When, WSM and non-WSM reach Pareto optimality, and both sides obtain maximum transmission benefit.
Then, using newest two non-WSM data messages for being distributed to IEEE 802.11p links, IEEE at this time is calculated The instantaneous distribution frequency f of 802.11p linksu
Wherein, t1And t2At the time of being that two non-WSM messages are distributed to IEEE 802.11p links respectively.
Finally, using fuWith fu maxIt is compared, if fu≤fu max, distribute successfully, algorithm terminates, and re-executes step 1;If fu> fu max, distribute failure, the queue to be distributed which enters LLC layer resumes waiting for distributing, and algorithm terminates, and holds again Row step 1.

Claims (1)

1. a kind of multilink selection method based on data priority, link state and traffic current density, it is characterised in that:
(1) data type is obtained:When thering is data message to reach data link layer from upper strata, the preferential of the data message is extracted Grade, if priority is highest, i.e., the type of the data message is WSM, then data message is directly distributed to IEEE802.11p It is transmitted on link;
(2) the data priority matching degree of calculating and more each link:What is received from upper strata when data link layer is non-WSM types Data message when, need to obtain the round trip delay time and loading condition of each link, while also to obtain residing for current vehicle at this time The traffic current density of environment calculates priority factor using data priority, is calculated respectively respectively with round trip delay time and loading condition The delay accounting factor of link and the load accounting factor finally calculate the matching journey of data message and link with three above parameter Degree, if what is calculated is the matching degree of data message and IEEE802.11p links, will also plus traffic current density as parameter, The data message finally is assigned to most matched link to be transmitted:
The delay accounting factor is used to represent that the delay at link moment is shared in the data priority matching degree for judging link Weight uses REi(t) it represents;Its expression formula is as follows
Wherein, Ri(t) represent link i in the round trip delay time of t moment, RimaxRepresent that the maximum delay response patient time of link i is normal Number;REi(t) value range for (0,1];
The load accounting factor representation link moment is supported on weight shared during the data priority matching degree for judging link, Use LEi(t) it represents;Expression formula is as follows
Li(t) represent link i in the load value of t moment, LimaxRepresent the maximum load value of link i;LEi(t) value range is [0,1];
For data message priority β to represent the urgency level of current data message, expression formula is as follows
Wherein, ACI ∈ { 0,1,2,3 } represents the transmission priority of data frame;Types of the ACNum for ACI, ACNum=4;Data Message priority β ∈ (0,1);
Certain vehicle is obtained by the following formula in the traffic estimated value of t moment and other vehicles
X (t)=fPR ρ (4)
Wherein, f is the frequency of IEEE 802.11p protocol broadcast message of vehicular status;P is each communication vehicle in current network The average quantity of institute's operational safety class application;R is the communication distance of vehicle, and ρ is the traffic current density of current vehicle mobile environment;
The data priority matching degree of link represents the appropriate level of certain moment link pair current data message.
WhenWhen, it takes
Wherein, si(t) represent that link i matches angle value in t moment about the data priority of the link of data message p;βpIt is non-peace The priority of full data message p, REi(t) it is the delay accounting factors of the link i in t moment, LEi(t) it is link i in t moment The accounting factor that is delayed and the load accounting factor, x (t) is the current traffic estimated value of the vehicle;
According to (5) formula, the data priority matching angle value of all links is calculated, and it is minimum to choose data priority matching angle value Link, data message p is distributed to corresponding link and is transmitted;If data message p is distributed to non-IEEE802.11p chains Completion is then distributed on road, and algorithm terminates, and re-executes step 1;If data message p is distributed to IEEE 802.11p links, also It needs by step 3.
(3) the non-secure data message maximum distribution frequency of IEEE802.11p links is calculated:By two above step, if number IEEE 802.11p links are distributed to according to message p, need to calculate the non-WSM maximum distributions frequency of IEEE 802.11p links at this time Rate fumax
The non-WSM quantity c that IEEE 802.11p links can be transmitted within a WSM period is
C=kT (6)
Wherein, k is the sending cycle of WSM, and T is the maximum throughput of IEEE 802.11p links;
Whether the remaining space for sending buffering area with MAC layer obtains the non-WSM of IEEE 802.11p link than c greatly Rule of judgment Maximum distribution frequency fumax
Wherein, Lmax is the transmission buffer size of IEEE802.11p links, Li(t) be IEEE802.11p links currently The transmission buffer size used;
Then, using newest two non-WSM data messages for being distributed to IEEE 802.11p links, IEEE at this time is calculated The instantaneous distribution frequency f of 802.11p linksu
Wherein, t1And t2At the time of being that two non-WSM messages are distributed to IEEE 802.11p links respectively;
Use fuWith fumaxIt is compared, if fu≤fumax, distribute successfully, algorithm terminates, and re-executes step 1;If fu> fumax, Distribution failure, the queue to be distributed which enters LLC layer resume waiting for distributing, and algorithm terminates, and re-executes step 1.
CN201711237968.6A 2017-11-30 2017-11-30 A kind of multilink selection method based on data priority, link state and traffic current density Pending CN108200601A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711237968.6A CN108200601A (en) 2017-11-30 2017-11-30 A kind of multilink selection method based on data priority, link state and traffic current density

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711237968.6A CN108200601A (en) 2017-11-30 2017-11-30 A kind of multilink selection method based on data priority, link state and traffic current density

Publications (1)

Publication Number Publication Date
CN108200601A true CN108200601A (en) 2018-06-22

Family

ID=62573475

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711237968.6A Pending CN108200601A (en) 2017-11-30 2017-11-30 A kind of multilink selection method based on data priority, link state and traffic current density

Country Status (1)

Country Link
CN (1) CN108200601A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109587052A (en) * 2019-01-30 2019-04-05 展讯通信(上海)有限公司 A kind of multilink data transmission method and device
CN110505601A (en) * 2019-07-30 2019-11-26 大连理工大学 Information transmission frequency optimization method based on vehicle driving situation field model in a kind of car networking
CN112822268A (en) * 2021-01-06 2021-05-18 大连理工大学 IP layer packet scheduling algorithm for multi-service coexistence and deterministic network requirements in industrial Internet of things
CN116887418A (en) * 2023-09-05 2023-10-13 浙江国利信安科技有限公司 Method, device and medium for scheduling high priority messages in EPA network

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8780714B2 (en) * 2007-05-23 2014-07-15 Microsoft Corporation Method for optimizing near field links
CN105745862A (en) * 2013-09-24 2016-07-06 密执安州立大学董事会 Real-time frame authentication using ID anonymization in automotive networks
CN106778894A (en) * 2016-12-29 2017-05-31 大连理工大学 A kind of method of author's cooperative relationship prediction in academic Heterogeneous Information network
CN107332788A (en) * 2017-06-08 2017-11-07 中国电力科学研究院 A kind of support method and system for being used to transmit wide area information in power dispatching center

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8780714B2 (en) * 2007-05-23 2014-07-15 Microsoft Corporation Method for optimizing near field links
CN105745862A (en) * 2013-09-24 2016-07-06 密执安州立大学董事会 Real-time frame authentication using ID anonymization in automotive networks
CN106778894A (en) * 2016-12-29 2017-05-31 大连理工大学 A kind of method of author's cooperative relationship prediction in academic Heterogeneous Information network
CN107332788A (en) * 2017-06-08 2017-11-07 中国电力科学研究院 A kind of support method and system for being used to transmit wide area information in power dispatching center

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
丁男,高壮林,许力,谭国真: "基于数据优先级和交通流密度的异构车联网数据链路层链路调度算法", 《第十五届全国嵌入式系统学术会议(ESTC2017)》 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109587052A (en) * 2019-01-30 2019-04-05 展讯通信(上海)有限公司 A kind of multilink data transmission method and device
US11979773B2 (en) 2019-01-30 2024-05-07 Spreadtrum Communications (Shanghai) Co., Ltd. Method and apparatus for multi-link data transmission, and storage medium
CN110505601A (en) * 2019-07-30 2019-11-26 大连理工大学 Information transmission frequency optimization method based on vehicle driving situation field model in a kind of car networking
WO2021017747A1 (en) * 2019-07-30 2021-02-04 大连理工大学 Information transmission frequency optimization method based on vehicle traveling state field model in internet of vehicles
US11380144B2 (en) 2019-07-30 2022-07-05 Dalian University Of Technology Vehicle running status field model-based information transmission frequency optimization method in internet of vehicles
CN112822268A (en) * 2021-01-06 2021-05-18 大连理工大学 IP layer packet scheduling algorithm for multi-service coexistence and deterministic network requirements in industrial Internet of things
CN112822268B (en) * 2021-01-06 2021-11-16 大连理工大学 Multi-service coexistence and IP layer packet scheduling method in industrial Internet of things
CN116887418A (en) * 2023-09-05 2023-10-13 浙江国利信安科技有限公司 Method, device and medium for scheduling high priority messages in EPA network
CN116887418B (en) * 2023-09-05 2023-12-15 浙江国利信安科技有限公司 Method, device and medium for scheduling high priority messages in EPA network

Similar Documents

Publication Publication Date Title
Peng et al. SDN-based resource management for autonomous vehicular networks: A multi-access edge computing approach
CN107404733A (en) A kind of 5G method of mobile communication and system based on MEC and layering SDN
CN101282324B (en) Method for managing combined wireless resource of self-adaption MIMO-OFDM system based on across layer
CN108200601A (en) A kind of multilink selection method based on data priority, link state and traffic current density
CN101516141B (en) Method and system for communication between mobile terminal and Internet
CN111083634B (en) CDN and MEC-based vehicle networking mobility management method
CN108174397A (en) A kind of multiple gateway Synergistic method of task-driven
CN104902511A (en) Method for alleviating synchronization conflict of control channel
CN101459966A (en) Ad Hoc network MAC layer QoS guarantee method based on IEEE802.16
CN110267228A (en) A kind of V2X car-mounted terminal message adaptive scheduling management system and method
CN106171025A (en) A kind of car networking transport resource regulating method and device
CN107864028A (en) A kind of adaptive frame polymerization in vehicle self-organizing network
CN103607737A (en) Heterogeneous network service flow-dividing method and system
CN111447512A (en) Energy-saving method for edge cloud unloading
CN110505601A (en) Information transmission frequency optimization method based on vehicle driving situation field model in a kind of car networking
CN109819474A (en) Multipriority MAC protocol formulating method in vehicular ad hoc network based on sub-clustering
CN101562841A (en) Service scheduling method, device and system thereof
CN102006670A (en) Dynamic polling medium access control method of emergency response supported sensor network
CN115964178B (en) Internet of vehicles user computing task scheduling method, device and edge service network
CN103220110B (en) The wireless resource allocation methods of OFDMA system under High-speed Circumstance
CN107231224A (en) LTE wlan networks dynamic aggregation decision-making technique under a kind of maximum transmitted time limit
Abdelatif et al. A Virtual Clustering for Data Dissemination in Vehicular Fog Computing
CN102843775A (en) Dispatching method, dispatching device and network equipment
Chen et al. Cross-layer cooperative offloading in vehicular edge computing networks
CN109890007A (en) A kind of intelligence car networking system

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
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20180622