CN113015109B - Wireless virtual network access control method in vehicle fog calculation - Google Patents

Wireless virtual network access control method in vehicle fog calculation Download PDF

Info

Publication number
CN113015109B
CN113015109B CN202110204203.2A CN202110204203A CN113015109B CN 113015109 B CN113015109 B CN 113015109B CN 202110204203 A CN202110204203 A CN 202110204203A CN 113015109 B CN113015109 B CN 113015109B
Authority
CN
China
Prior art keywords
user
calculation
virtual network
wireless virtual
task
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
CN202110204203.2A
Other languages
Chinese (zh)
Other versions
CN113015109A (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.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
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 Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN202110204203.2A priority Critical patent/CN113015109B/en
Publication of CN113015109A publication Critical patent/CN113015109A/en
Application granted granted Critical
Publication of CN113015109B publication Critical patent/CN113015109B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
    • H04W4/08—User group management
    • 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
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/30—Services specially adapted for particular environments, situations or purposes
    • H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00—Road transport of goods or passengers
    • Y02T10/10—Internal combustion engine [ICE] based vehicles
    • Y02T10/40—Engine management systems

Landscapes

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

Abstract

The invention discloses a wireless virtual network access control method in vehicle fog calculation, belonging to the field of wireless communication, which comprises the following steps: firstly, the average computing resource required by users is used for evaluating the resources required by a plurality of groups of wireless virtual network user groups which come at the same time. And then predicting vehicle number information in the user associated time period according to the statistical information, and obtaining the optimal user group matching by using robustness optimization and taking the maximum number of the allowed users as a target. And finally, carrying out task unloading and resource allocation on the admitted user by a block iteration method to obtain the minimum time delay of the user. The invention solves the problem of resource waste caused by random access of the wireless virtual network user group in the vehicle fog calculation.

Description

Wireless virtual network access control method in vehicle fog calculation
Technical Field
The invention belongs to the field of wireless communication, and particularly relates to a wireless virtual network access control method in vehicle fog calculation.
Background
As traffic becomes more heterogeneous with the development of technology, wireless Virtual Network (WVN) technology becomes of paramount importance. The technology improves user experience by fragmenting the network for efficient processing. In future virtual networks, not only may wireless access services be provided to individual users, but also wireless access services may be requested for groups of users. A user group is assigned a Network Virtual slice called a Virtual Network (VN) which a VN customer can serve through a Virtual Network operator. VN customers include taxi operators, police, bus operators, postal companies, secondary service providers, and many other private and public organizations, among others. However, the operator may have insufficient resources to provide services to the customer, so it is necessary to find the auxiliary computing resources.
With the development of auxiliary computing technologies such as edge computing, cloud computing, fog computing, and the like, task offloading and resource utilization using auxiliary computing resources is a common solution. Compared with cloud computing and edge computing, fog computing is more suitable for low-delay applications such as communication, video streaming and games. Vehicle Fog Computing (VFC) has many common functions of Fog Computing, such as geographical distribution and low latency communication. Researchers have considered parked vehicles as an infrastructure and they have proposed the concept of parked vehicle assistance to enable parked vehicles to join a vehicle network as static nodes. Due to the large number of vehicles, long-term parking and location-specific features, it is highly desirable to use parked vehicles as a static backbone and service infrastructure. With vehicles acting as an infrastructure to cooperate together and form a new type of hybrid network, the communication and computing power of urban areas can be greatly increased.
The vehicle fog calculation can aggregate vehicles to have certain calculation capacity and communication capacity, integrate and apply the calculation resources of the vehicles, and can enable the vehicles to become small-sized infrastructures to serve the base station, so that the load pressure of the base station is relieved. VFC is different from Vehicle Cloud Computing (VCC). VCC has bandwidth limitations, is delay sensitive, and is more costly to deploy, while VFC is based on geographical distribution, and has real-time load balancing and local decision-making mechanisms. As noted above, rather than sending information to a remote server, VFCs rely more on the cooperation of nearby vehicles. This greatly reduces deployment costs and time delays. On the other hand, VFC can cope with emergency situations better and more reliably than VCC.
In the research of wireless virtual network technology, random access to a user group leads to the phenomena of resource waste, low income of a service provider and the like, so that access control to a network is very necessary. Work on wireless virtual network admission control research has been actively undertaken in recent years.
In summary, it is feasible to provide services to the wireless virtual network by using vehicle fog calculation, and since the calculation capacity of the vehicle fog calculation increases with the increase of vehicles, the vehicle fog calculation is a good assistant calculation resource for the infrastructure service providers. Existing research has not been temporarily directed to access control for groups of wireless virtual network users in an auxiliary computing environment. In the environment of vehicle fog calculation auxiliary computing, access control of a wireless virtual network becomes important due to the continuous change of resources caused by uncertainty of the number of vehicles. When the user group is allowed to enter, the system receptivity and the service quality requirements of the user need to be considered, and the system resources can be dynamically changed due to the vehicle characteristics when the vehicle fog calculation service is carried out, so that the problem is very difficult to solve.
Disclosure of Invention
The present invention is directed to solving the above problems of the prior art. A wireless virtual network admission control method in vehicle fog calculation is provided. The technical scheme of the invention is as follows:
a wireless virtual network admission control method in vehicle fog calculation comprises the following steps:
s1: estimating total computing resources required by the user groups coming at the same time;
s2: predicting the number information of the vehicles in the associated time according to the associated time of the user;
s3: obtaining an optimal admittance user group by utilizing robustness optimization and taking the maximum admittance number as a target according to the obtained user information and the vehicle information;
s4: the calculation rate of fixed allocation is used for the user group which is already admitted by utilizing a block iteration method, and the unloading position of the task of the user which is already admitted is obtained by taking the minimized communication time delay as a target;
s5: and carrying out calculation resource allocation on the admitted users for the users with the determined unloading positions by taking the minimized user calculation time delay as a target.
Further, the formula of the total computing resources required by the user group in step S1 is represented as:
Figure GDA0003642430710000031
wherein
Figure GDA0003642430710000032
The average minimum computing resource required by each user at every moment is calculated according to the user time delay requirement and the size of a computing task, namely:
Figure GDA0003642430710000033
wherein
Figure GDA0003642430710000034
And
Figure GDA0003642430710000035
respectively the size of the user task and the maximum time delay requirement of the user, F k The number of clocks required per unit data determined for the data type, K = {1,2., K } represents the kth wireless virtual network, I = {1,2., I } represents the kth wireless virtual network ith user, K, I represents a set, and has K wireless virtual networks and I users at most.
Further, the step S2 predicts the number information of the vehicles within the associated time according to the associated time of the user, and specifically includes:
the number of vehicles in the next time period is:
Figure GDA0003642430710000036
wherein
Figure GDA0003642430710000037
Is the number of vehicles that are time-varying,
Figure GDA0003642430710000038
for long-term average number of vehicles, γ > 0 is an effect
Figure GDA0003642430710000039
The parameter of maximum magnitude of uncertainty, θ, is between [ -1,1]Random variable of zero mean value of (a) representing the number of vehiclesB = {1,2., B } represents the B-th base station, B represents a maximum of B base stations.
Further, the step S3: the method for obtaining the optimal access user group by using robustness optimization and taking the maximized access number as a target specifically comprises the following steps:
the robust admission problem for a user group is represented as:
Figure GDA00036424307100000310
Figure GDA00036424307100000311
Figure GDA00036424307100000312
where epsilon is a variable indicating whether a user group is admitted or not, is a binary variable,
Figure GDA00036424307100000313
for its relaxed variables, F denotes the optimization objective function, n is the number of user-associated time periods, C b For the computing resources owned by the base station, C v The owned computational resources are calculated for each time of fog of the vehicle, and Ω is the allowable excess probability of system capacity.
Further, the step S4 firstly fixes the allocated computation rate by using a block iteration method, and obtains the offloading position of the task of the admitted user with the objective of minimizing the communication delay, specifically including:
task offloading is performed on an admitted user, and the problem of obtaining an offloading position of a user task can be expressed as:
Figure GDA0003642430710000041
C1:α∈{0,1}
Figure GDA0003642430710000042
Figure GDA0003642430710000043
Figure GDA0003642430710000044
wherein the rate is calculated
Figure GDA0003642430710000045
All the data are fixed average speed, alpha is a decision variable of a user unloading position, alpha =1 represents that a task is processed by a base station, alpha =0 represents that the task is processed by vehicle fog calculation, and T i,k,b 、
Figure GDA0003642430710000046
Respectively representing the task processing delay and the maximum delay requirement of the user, phi b 、
Figure GDA0003642430710000047
Respectively representing the number of vehicles and the calculated rate of offloading to the base station for allocation to the user,
Figure GDA0003642430710000048
v denotes a calculation rate and a vehicle fog calculation flag assigned to the user for the vehicle fog calculation unloaded into the area b, respectively.
The step S5 of performing calculation resource allocation on the admitted user with the objective of minimizing user calculation delay specifically includes: the resource allocation problem for all users can be expressed as:
Figure GDA0003642430710000049
Figure GDA00036424307100000410
Figure GDA00036424307100000411
Figure GDA00036424307100000412
wherein
Figure GDA00036424307100000413
For each user having its maximum delay requirement, f the calculated rate to be allocated to each user, T i,k,b For the total time delay of the user, when the base station hands over the user calculation task to the local calculation
Figure GDA00036424307100000414
Wherein
Figure GDA00036424307100000415
To calculate the time delay, F k The calculation rate determined for the data type,
Figure GDA00036424307100000416
the calculated rate allocated by the base station for the wireless virtual network user,
Figure GDA00036424307100000417
the size of the task is calculated for the user,
Figure GDA00036424307100000418
down-link data transmission time for user, wherein
Figure GDA00036424307100000419
Amount of data, R, for downlink transmission from a base station to a subscriber i,k,b Is the data transmission rate;
when a user task is offloaded to a vehicle
Figure GDA0003642430710000051
Wherein
Figure GDA0003642430710000052
A transmission rate at the time of communication is calculated for the base station and the vehicle fog,
Figure GDA0003642430710000053
a calculated rate for servicing the wireless virtual network user is calculated for the vehicle fog,
Figure GDA0003642430710000054
is the downlink data transmission time.
The invention has the following advantages and beneficial effects:
the innovation of the invention is mainly that a robust access mechanism is established between S2 and S3 to tolerate the dynamic change of the system by considering the uncertainty of the system resources caused by the dynamic change characteristics of the number of vehicles, so that the access to the user can be more accurate, and the time delay requirement of the user can be better ensured after the user is accessed.
Drawings
FIG. 1 is a flow chart of wireless virtual network admission control in vehicle fog calculation according to the preferred embodiment of the present invention;
FIG. 2 is a diagram of a system model according to the present invention;
Detailed Description
The technical solutions in the embodiments of the present invention will be described in detail and clearly with reference to the accompanying drawings. The described embodiments are only some of the embodiments of the present invention.
The technical scheme for solving the technical problems is as follows:
the invention provides an admission control mechanism which is used for carrying out robustness selection access on a base station according to resources required by a user group and selecting the optimal task unloading position and the optimal calculation rate for the accessed user group in a dynamic calculation resource environment.
The system of the embodiment of the invention comprises a plurality of groups of wireless virtual network user groups for applying admission; one base station per area; a vehicle fog calculation center.
As shown in fig. 1, the present invention provides a method for controlling wireless virtual network admission in vehicle fog calculation, which includes:
s1: estimating total computing resources required by user groups coming at the same time, wherein the total computing resources required by the user groups are expressed as:
Figure GDA0003642430710000061
wherein
Figure GDA0003642430710000062
The average computing resource required by each user at every moment is obtained through the delay requirement of the user and the carried task amount, K = {1,2.. K } represents the kth wireless virtual network, and I = {1,2.. I } represents the ith user of the kth wireless virtual network.
S2: obtaining the prediction information of the number of vehicles in the user-associated time period, wherein the number of vehicles in the next time period is as follows:
Figure GDA0003642430710000063
wherein
Figure GDA0003642430710000064
Is a time-varying number of vehicles and obeys a poisson distribution,
Figure GDA0003642430710000065
for long-term average number of vehicles, γ > 0 is an effect
Figure GDA0003642430710000066
The parameter of maximum magnitude of uncertainty, θ, is between [ -1,1]Represents a possible fluctuation of the number of vehicles, B = {1,2.., B } represents a base station in the B-th zone.
S3: carrying out robust admission on the user group according to the capacity exceeding tolerance rate accepted by the system; the robust admission problem for a user group can be expressed as:
Figure GDA0003642430710000067
Figure GDA0003642430710000068
Figure GDA0003642430710000069
where ε is a variable indicating whether a user group is admitted or not, C b For the computing resources owned by the base station, C v The owned computational resources are calculated for each time of fog of the vehicle, and Ω is the allowable excess probability of system capacity.
S4: task unloading is carried out on the admitted user, and the unloading position of the user task is obtained; task offloading is performed on an admitted user, and the problem of obtaining an offloading position of a user task can be expressed as:
Figure GDA0003642430710000071
C1:α∈{0,1}
Figure GDA0003642430710000072
Figure GDA0003642430710000073
Figure GDA0003642430710000074
wherein the rate is calculated
Figure GDA0003642430710000075
The average speed is fixed, alpha is a decision variable of the unloading position of the user, alpha =1 represents that the task is processed by a base station, and alpha =0 represents that the flow is processed by vehicle fog calculation.
S5: resource allocation is performed on all users according to the time delay requirements of the users, and the resource allocation problem can be expressed as:
Figure GDA0003642430710000076
Figure GDA0003642430710000077
Figure GDA0003642430710000078
Figure GDA0003642430710000079
wherein
Figure GDA00036424307100000710
For each user having its maximum delay requirement, f the calculated rate to be allocated to each user, T i,k,b For the total time delay of user task processing, when the base station hands over the user computing task to local computing
Figure GDA00036424307100000711
Wherein
Figure GDA00036424307100000712
To calculate the time delay, F k The calculation rate (unit: cycle/bit) determined for the data type,
Figure GDA00036424307100000713
the calculated rate allocated by the base station for the wireless virtual network user,
Figure GDA00036424307100000714
the task size is calculated for the user.
Figure GDA00036424307100000715
Downstream data transmission time for the user, wherein
Figure GDA00036424307100000716
Amount of data, R, for downlink transmission from a base station to a subscriber i,k,b Is the data transmission rate.
When a user task is offloaded to a vehicle
Figure GDA00036424307100000717
Wherein
Figure GDA00036424307100000718
A transmission rate at the time of communication is calculated for the base station and the vehicle fog,
Figure GDA00036424307100000719
a calculated rate for servicing the wireless virtual network user is calculated for the vehicle fog,
Figure GDA00036424307100000720
is the downlink data transmission time.
The first flowchart is as follows:
s1: a wireless virtual network user group carries a calculation task application for access;
s2: obtaining computing resources required by a user according to the time delay requirement of the user;
s3: carrying out robustness selection on a user group according to the existing resources;
s4: carrying out task unloading on the accessed user to a base station or vehicle fog calculation;
s5: and carrying out resource allocation on the user after unloading is finished.
The second flow chart is as follows:
s1: each wireless virtual network user group carries a plurality of users and has computing task requirements;
s2: the base station may use the computing resources of the vehicle fog calculation;
s3: the user tasks may be offloaded to a base station or vehicle fog calculation for calculation.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising a … …" does not exclude the presence of another identical element in a process, method, article, or apparatus that comprises the element.
The above examples are to be construed as merely illustrative and not limitative of the remainder of the disclosure. After reading the description of the invention, the skilled person can make various changes or modifications to the invention, and these equivalent changes and modifications also fall into the scope of the invention defined by the claims.

Claims (5)

1. A wireless virtual network admission control method in vehicle fog calculation is characterized by comprising the following steps:
s1: estimating total computing resources required by the user groups coming at the same time;
s2: predicting the number information of vehicles in the associated time according to the associated time of the user;
s3: obtaining an optimal admittance user group by utilizing robustness optimization and taking the maximum admittance number as a target according to the obtained user information and the vehicle information;
s4: the calculation rate of fixed allocation is used for the user group which is already admitted by utilizing a block iteration method, and the unloading position of the task of the user which is already admitted is obtained by taking the minimized communication time delay as a target;
s5: calculating resource allocation is carried out on the users with the unloading positions determined by the method by taking the minimized user calculation time delay as a target;
the step S3: the method for obtaining the optimal access user group by using robustness optimization and taking the maximized access number as a target specifically comprises the following steps:
the robust admission problem for a user group is represented as:
Figure FDA0003764203990000011
Figure FDA0003764203990000012
Figure FDA0003764203990000013
Figure FDA0003764203990000014
where epsilon is a variable indicating whether a user group is admitted or not, is a binary variable,
Figure FDA0003764203990000015
for its relaxed variables, F represents the optimization objective function, n is the number of user-associated time periods, C b Being a computing resource owned by the base station, C v Calculating owned computing resources for vehicle fog at each moment, wherein omega is the probability that the system capacity is allowed to exceed, K = {1,2.. Multidot.,. K } represents the kth wireless virtual network, B = {1,2.., B } represents the B-th base station, B represents that there are B base stations at most, I = {1,2.,. Multidot., I } represents the kth wireless virtual network ith user, K, I represents a set respectively, there are K wireless virtual networks and I users at most, and gamma > 0 has an influence on the fact that K wireless virtual networks and I users exist at most
Figure FDA0003764203990000016
The parameter of the maximum magnitude of uncertainty, t denotes time,
Figure FDA0003764203990000017
representing a fixed average velocity and v representing a vehicle fog calculation signature.
2. The method for controlling wireless virtual network admission in vehicle fog calculation according to claim 1, wherein the formula of the total calculation resources required by the user group in step S1 is represented as follows:
Figure FDA0003764203990000021
wherein
Figure FDA0003764203990000022
The average minimum computing resource required by each user at every moment is calculated according to the user time delay requirement and the size of a computing task, namely:
Figure FDA0003764203990000023
wherein
Figure FDA0003764203990000024
And
Figure FDA0003764203990000025
fk is the clock number required by each unit of data determined by the data type, K = {1,2.,. K } represents a kth wireless virtual network, B = {1,2.,. B } represents a B base station, B represents that there are B base stations at most, I = {1,2.,. I } represents an ith user of the kth wireless virtual network, K, I represents a set respectively, and there are K wireless virtual networks and I users at most.
3. The method for controlling wireless virtual network admission in vehicle fog calculation according to claim 2, wherein the step S2 predicts the number information of vehicles in the associated time according to the associated time of the user, and specifically comprises:
the number of vehicles in the next time period is:
Figure FDA0003764203990000026
wherein
Figure FDA0003764203990000027
Is the number of vehicles that are time-varying,
Figure FDA0003764203990000028
for long-term average number of vehicles, γ > 0 is an effect
Figure FDA0003764203990000029
The parameter of maximum magnitude of uncertainty, θ, is between [ -1,1]B = {1,2., B } represents the B-th base station, B represents a maximum of B base stations.
4. The method as claimed in claim 3, wherein the step S4 of utilizing block iteration to firstly fix the calculation rate allocated to the user and to obtain the unloading location of the task of the admitted user with the goal of minimizing communication delay comprises:
task offloading is performed on an admitted user, and the problem of obtaining an offloading position of a user task can be expressed as:
Figure FDA0003764203990000031
C1:α∈{0,1}
Figure FDA0003764203990000032
Figure FDA0003764203990000033
Figure FDA0003764203990000034
wherein the rate is calculated
Figure FDA0003764203990000035
All the data are fixed average speed, alpha is a decision variable of a user unloading position, alpha =1 represents that a task is processed by a base station, alpha =0 represents that the task is processed by vehicle fog calculation, and T i,k,b 、
Figure FDA0003764203990000036
Respectively representing the task processing delay and the maximum delay requirement of the user, phi b 、
Figure FDA0003764203990000037
Respectively representing the number of vehicles and the calculated rate of offloading to the base station for allocation to the user,
Figure FDA0003764203990000038
v denotes a calculation rate and a vehicle fog calculation flag assigned to the user for the vehicle fog calculation unloaded into the area b, respectively.
5. The method for controlling wireless virtual network admission in vehicle fog calculation according to claim 4, wherein the step S5 allocates calculation resources to the admitted users with the goal of minimizing user calculation delay, specifically comprising: the resource allocation problem for all users can be expressed as:
Figure FDA0003764203990000039
Figure FDA00037642039900000310
Figure FDA00037642039900000311
Figure FDA00037642039900000312
wherein
Figure FDA00037642039900000313
For each user having its maximum delay requirement, f the calculated rate to be allocated to each user, T i,k,b For the total time delay of the user, when the base station hands over the user calculation task to the local calculation
Figure FDA00037642039900000314
Wherein
Figure FDA00037642039900000315
To calculate the time delay, F k The calculation rate determined for the data type,
Figure FDA00037642039900000316
the calculated rate allocated to the base station for the wireless virtual network user,
Figure FDA00037642039900000317
the size of the task is calculated for the user,
Figure FDA00037642039900000318
down-link data transmission time for user, wherein
Figure FDA00037642039900000319
For transmission by base station to userAmount of data, R, of downlink transmission i,k,b Is the data transmission rate;
when a user task is offloaded to a vehicle
Figure FDA00037642039900000320
Wherein
Figure FDA00037642039900000321
Figure FDA00037642039900000322
A transmission rate at the time of communication is calculated for the base station and the vehicle fog,
Figure FDA0003764203990000041
Figure FDA0003764203990000042
a calculated rate for servicing the wireless virtual network user is calculated for the vehicle fog,
Figure FDA0003764203990000043
is the downlink data transmission time.
CN202110204203.2A 2021-02-23 2021-02-23 Wireless virtual network access control method in vehicle fog calculation Active CN113015109B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110204203.2A CN113015109B (en) 2021-02-23 2021-02-23 Wireless virtual network access control method in vehicle fog calculation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110204203.2A CN113015109B (en) 2021-02-23 2021-02-23 Wireless virtual network access control method in vehicle fog calculation

Publications (2)

Publication Number Publication Date
CN113015109A CN113015109A (en) 2021-06-22
CN113015109B true CN113015109B (en) 2022-10-18

Family

ID=76408738

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110204203.2A Active CN113015109B (en) 2021-02-23 2021-02-23 Wireless virtual network access control method in vehicle fog calculation

Country Status (1)

Country Link
CN (1) CN113015109B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113613210B (en) * 2021-07-02 2023-05-26 重庆邮电大学 Internet of vehicles task unloading method based on multi-variable joint optimization

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109347975A (en) * 2018-11-18 2019-02-15 上海无线通信研究中心 Car networking low time delay communication means, terminal and system

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170272365A1 (en) * 2016-03-15 2017-09-21 Hon Hai Precision Industry Co., Ltd Method and appratus for controlling network traffic
CN108430081A (en) * 2018-02-28 2018-08-21 北京科技大学 A kind of switching method in network virtualization mist Radio Access Network
CN109257724B (en) * 2018-11-15 2020-01-10 电子科技大学 Method for constructing safe and reliable vehicle fog in Internet of vehicles environment
CN109951869B (en) * 2019-03-01 2022-04-29 重庆邮电大学 Internet of vehicles resource allocation method based on cloud and mist mixed calculation
CN109947574B (en) * 2019-03-29 2023-05-30 南京邮电大学 Fog network-based vehicle big data calculation unloading method

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109347975A (en) * 2018-11-18 2019-02-15 上海无线通信研究中心 Car networking low time delay communication means, terminal and system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
云计算在智能交通系统中的应用研究;冯婷婷;《萍乡学院学报》;20191231(第06期);全文 *
基于云雾混合计算的车联网联合资源分配算法;唐伦等;《电子与信息学报》;20200815(第08期);全文 *

Also Published As

Publication number Publication date
CN113015109A (en) 2021-06-22

Similar Documents

Publication Publication Date Title
Yadav et al. Energy-latency tradeoff for dynamic computation offloading in vehicular fog computing
Cao et al. Edge federation: Towards an integrated service provisioning model
Hameed et al. Energy-and performance-aware load-balancing in vehicular fog computing
Liu et al. Adaptive multi-resource allocation for cloudlet-based mobile cloud computing system
CN111083634B (en) CDN and MEC-based vehicle networking mobility management method
Li et al. Resource management in fog-enhanced radio access network to support real-time vehicular services
CN109947574B (en) Fog network-based vehicle big data calculation unloading method
CN111711666B (en) Internet of vehicles cloud computing resource optimization method based on reinforcement learning
CN109831522A (en) A kind of vehicle connection cloud and mist system dynamic resource Optimal Management System and method based on SMDP
CN107666448B (en) 5G virtual access network mapping method under time delay perception
Li et al. Energy efficient resource management and task scheduling for IoT services in edge computing paradigm
CN111182495A (en) 5G internet of vehicles partial calculation unloading method
CN112188627B (en) Dynamic resource allocation strategy based on state prediction
CN113347267B (en) MEC server deployment method in mobile edge cloud computing network
CN112153145A (en) Method and device for unloading calculation tasks facing Internet of vehicles in 5G edge environment
CN115209426B (en) Dynamic deployment method for digital twin servers in edge car networking
CN117255368B (en) Edge dynamic integration method for vehicle-mounted edge server and cooperative fixed edge server
CN113015109B (en) Wireless virtual network access control method in vehicle fog calculation
CN1633097A (en) QoS scheduler for voice service in broadband wireless MAN and method thereof
da Costa et al. Combinatorial optimization-based task allocation mechanism for vehicular clouds
Gangadharan et al. Bandwidth optimal data/service delivery for connected vehicles via edges
Siddiqi et al. Dynamic priority-based efficient resource allocation and computing framework for vehicular multimedia cloud computing
Samanta et al. Distributed resource distribution and offloading for resource-agnostic microservices in industrial iot
Globa et al. Architecture and operation algorithms of mobile core network with virtualization
Lovén et al. A dark and stormy night: Reallocation storms in edge computing

Legal Events

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