CN111866181B - Block chain-based task unloading optimization method in fog network - Google Patents

Block chain-based task unloading optimization method in fog network Download PDF

Info

Publication number
CN111866181B
CN111866181B CN202010796536.4A CN202010796536A CN111866181B CN 111866181 B CN111866181 B CN 111866181B CN 202010796536 A CN202010796536 A CN 202010796536A CN 111866181 B CN111866181 B CN 111866181B
Authority
CN
China
Prior art keywords
smes
resource
block chain
task
unloading
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
CN202010796536.4A
Other languages
Chinese (zh)
Other versions
CN111866181A (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.)
Nanjing Qingke Liangu Technology Service Co ltd
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 CN202010796536.4A priority Critical patent/CN111866181B/en
Publication of CN111866181A publication Critical patent/CN111866181A/en
Application granted granted Critical
Publication of CN111866181B publication Critical patent/CN111866181B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/12Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/02Arrangements for optimising operational condition
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/53Allocation or scheduling criteria for wireless resources based on regulatory allocation policies

Abstract

The invention relates to a task unloading optimization method in a fog network based on a block chain, and belongs to the technical field of mobile communication. There are two unloading modes in this method: off-load to the fog server FS and off-load to the D2D group of devices to achieve optimization of compute-intensive task processing latency and energy consumption. The FS and D2D device groups are incentivized to provide task offload services for SMEs through incentives such as resource coin awards. A stock right entrusting and proving mechanism DPoS based on SMEs voting is provided, wherein a block chain carries out stock right voting on an FS through SMEs in the mechanism, and an FS verification set is selected. The manager FS is responsible for packaging transaction transactions to generate new blocks, and the new blocks are added into the block chain after verification and audit of the verifier FS. The method can realize the effectiveness of resource allocation by jointly optimizing the task execution cost of the system and the consensus cost of the block chain system on the premise of ensuring the safety of SMEs data.

Description

Block chain-based task unloading optimization method in fog network
Technical Field
The invention belongs to the technical field of mobile communication, and relates to a task unloading optimization method in a fog network based on a block chain.
Background
The internet of things market is experiencing an unprecedented period of rapid development. Gartner forecasts that the number of terminals of the internet of things reaches 208 hundred million by 2020, and the composite growth rate is 34%. In accordance with a report issued in the united states on the trend of 2016 + 2045 emerging technology, over 1000 billion devices were connected to the Internet by 2045. Although there are many application scenarios for the internet of things, the security and privacy issues have not been adequately addressed. The internet of things will penetrate the aspects of people's lives and enter various industries, thereby creating a variety of application scenarios, such as smart cities, smart homes, wearable devices and automobile internet. The internet has turned to a cloud-based architecture, with cloud computing providing outsourced computing and storage functions for end users. However, with the rapid increase of traffic in recent years, the data with ultra-large capacity is transmitted to the cloud server, which not only brings heavy burden to communication bandwidth, but also causes intolerable transmission delay, reduces the satisfaction degree of the terminal user on the service quality, and a large number of internet of things terminals bring great challenges to network capacity and centralized platform performance. However, attractive numbers are hidden in huge challenges and crisis, while at the same time more demands are focused on large internet terminal devices with access information security risks, such as terminal-to-counterfeit, node control, data manipulation and DDoS attacks. According to statistics, the number of network attacks on internet equipment is increased by 280% in the last half of 2017. By 2021, the business' expenditure in information security would increase from 835 billion dollars today to 1199 billion dollars. Because the computing power and the storage capacity of the terminal equipment of the internet of things are insufficient, the traditional network security protection technology cannot meet the security requirement of the internet of things, and therefore a new internet of things security protection technology is urgently needed to solve the increasingly serious problems of the security and the privacy of the internet of things. The unique technical characteristics of the block chain can effectively solve the problems of safety and privacy faced by the development of the Internet of things, and provide support such as trust, transparency and distributed storage for the Internet of things, so that a high-efficiency, reliable and safe distributed Internet of things network is constructed, and the safety and privacy of the Internet of things user are effectively guaranteed.
In conclusion, the invention designs a task unloading optimization model in the fog network based on the block chain. Under this model, SMEs can offload compute-intensive tasks to other nodes with idle resources. The nodes with idle resources may be FSs or a D2D group of devices nearby. In addition, according to the scheme, a corresponding optimization algorithm is provided according to an application scene of the unloading model, and the improvement of the system performance is realized through the joint optimization of the task execution cost and the block chain system consensus cost on the premise of guaranteeing the system security and the user data privacy.
Disclosure of Invention
In view of the above, the present invention provides a method for optimizing task offloading in a fog network based on a block chain.
In order to achieve the purpose, the invention provides the following technical scheme:
a task unloading optimization method in a fog network based on a block chain comprises the following steps:
s1: two offload modes based on blockchain techniques;
s2: D2D device group decision scheme;
s3: a DPoS consensus mechanism based on SMEs voting;
s4: a block chain based fog network performance optimization algorithm;
in step S1, the proposed model of the present scheme includes three layers: the first layer is an equipment layer (front end) which comprises a smart phone, smart wearable equipment, a smart vehicle and the like; the second layer is a fog service layer (near end) comprising FSs and various APs; the third layer is a core cloud service layer (far end), and powerful central cloud computing services are provided at the far end.
SMEs at the front end provide better interactivity and responsiveness for the user. However, due to limited SME computing power and capacity, the compute-intensive tasks must be offloaded to FSs and idle D2D devices that can provide computing resources nearby. According to the signal-to-noise ratio threshold, the D2D devices idle nearby the SMEs to be unloaded form a D2D device group, and the SMEs can be selectively unloaded to a nearby FSs or D2D device group.
The near end FSs may support most traffic in the network as well as resource requests such as real-time data processing, data caching and computation forking. FSs thus provides better communication quality and performance for data delay time sensitive users. Since FSs has sufficient computational and storage resources, FSs can perform computational offloading and blockchain consensus tasks simultaneously and thus can act as blockchain nodes.
The remote core cloud server provides more powerful computing power (e.g., big data processing). The goal of this model is to execute the compute-intensive and delay-sensitive part of the application in the edge network and communicate with the core cloud for data synchronization.
In step S2, the computation-intensive task a of SMEk in cell nn,kUsing parameter tuples < Dn,kn,kX > is represented by Dn,kThe size of the task is represented, and the unit is bit; tau isn,kRepresenting the maximum tolerated delay for task completion; x represents the CPU cycle consumed to complete 1bit of data, and the unit is (CPU cycles/bit). When S isn,kRequest to offload to D2D device group because SMEs in D2D device group can be calculated individuallyForce fn,k'Different and there is also a gap in the channel conditions between them and the SMEs to be offloaded, i.e. Sn,kTransmission rate with SMEs in D2D device group
Figure GDA0003529514600000021
And also different. Defining a vector α ═ αn,1n,2,...,αn,k',...,αn,K'},k'=1,2,...,K',αn,k'∈[0,1]To characterize the fraction of computation offload tasks offloaded by SMEs in the D2D group of devices. By assuming Sn,kEqual to the sum of the transmission phase delay and the execution phase delay of SMEs in the D2D device group, that is:
Figure GDA0003529514600000031
simultaneous alphan,1n,2+...+α n,k'1, α ═ α can be obtainedn,k'The solution of.
Further, in step S3, the present invention proposes a DPoS consensus mechanism based on SMEs voting. The block uplink can be divided into three stages, namely a block production stage, a block sharing stage and a block verification stage.
In the block production phase, FSs is responsible for collecting transaction transactions for SMEs in each cell, and then broadcasting to the whole network, manager
Figure GDA0003529514600000032
Responsible for packing transaction and producing blocks, the input data size of transaction is DpExpressed in units of bit; manager
Figure GDA0003529514600000033
Is calculated by fw'Means that the CPU power consumption of the manager is Pw'=xw'(fw')3Wherein x isw'Presentation manager
Figure GDA0003529514600000034
Can be calculatedThe coefficient of mass efficiency. The latency and energy consumption of the block production phase can be expressed as:
Figure GDA0003529514600000035
Figure GDA0003529514600000036
in the block sharing stage, the manager
Figure GDA0003529514600000037
The new block is signed and then broadcasted to all verifiers in the block chain system
Figure GDA0003529514600000038
Block size SbExpressed in units of bit; manager
Figure GDA0003529514600000039
And verifier
Figure GDA00035295146000000310
With R betweenw',wExpressed in units of (bit/s); manager
Figure GDA00035295146000000311
A transmission power of
Figure GDA00035295146000000312
The latency and energy consumption of the block sharing phase can be expressed as:
Figure GDA00035295146000000313
Figure GDA00035295146000000314
Figure GDA00035295146000000315
in the block verification stage, a verifier receiving a new block
Figure GDA00035295146000000316
Comparing the hash value calculated by the hash algorithm with the digital signature to verify the accuracy of the new block, and if the hash value is equal to the digital signature, indicating that the new block is not tampered and returning a feedback message for block verification; otherwise, no response is made. Finally, if all the audit results are correct, the new block is added to the block chain according to the timestamp. Assume that the input data size of the verification phase is DvThe unit is bit; verifying device
Figure GDA0003529514600000041
Is calculated by fwPresentation, verification device
Figure GDA0003529514600000042
CPU power consumption of Pw=xw(fw)3Wherein x iswPresentation verifier
Figure GDA0003529514600000043
The calculated energy efficiency coefficient. The latency and energy consumption of the block verification stage can be expressed as:
Figure GDA00035295146000000410
Figure GDA0003529514600000044
Figure GDA0003529514600000045
in summary, the total delay and total energy consumption of the blockchain system can be expressed as:
Figure GDA0003529514600000046
Figure GDA0003529514600000047
further, in step S4, the present solution considers a task unloading model in a block chain-based fog network, and the system task execution cost can be expressed as
Figure GDA0003529514600000048
Wherein λ is0,λ1Respectively representing scalar weights, characterizing Sn,kI.e., the relative importance of latency and energy consumption to the system task execution. The consensus cost of the blockchain system can be expressed as
Figure GDA0003529514600000049
Wherein λ2Indicating the relative preference of the blockchain system for the consensus process latency and energy consumption. Assume that the weighting factor between the system task execution cost and the blockchain system consensus cost is ζ1ζ and2the objective function model to be optimized can be expressed as U ═ ζ1U1n,kn,k'k,s)+(1-ζ12U2(fn,fw,fw')。
The invention has the beneficial effects that: the present invention offloads compute-intensive tasks to other nodes with idle resources. In particular, the present invention contemplates two offloading modes, one to nearby FSs and the other to the D2D group of devices. The system performance is improved by the joint optimization of the system task execution cost and the block chain system consensus cost.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention may be realized and attained by the means of the instrumentalities and combinations particularly pointed out hereinafter.
Drawings
For the purposes of promoting a better understanding of the objects, aspects and advantages of the invention, reference will now be made to the following detailed description taken in conjunction with the accompanying drawings in which:
FIG. 1 is a diagram of a model for task offloading in a block chain based fog network;
FIG. 2 is a diagram of a DPoS consensus mechanism model based on SMEs voting;
Detailed Description
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It should be noted that the drawings provided in the following embodiments are only for illustrating the basic idea of the present invention in a schematic way, and the features in the following embodiments and examples may be combined with each other without conflict.
Wherein the showings are for the purpose of illustrating the invention only and not for the purpose of limiting the same, and in which there is shown by way of illustration only and not in the drawings in which there is no intention to limit the invention thereto; to better illustrate the embodiments of the present invention, some parts of the drawings may be omitted, enlarged or reduced, and do not represent the size of an actual product; it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted.
The same or similar reference numerals in the drawings of the embodiments of the present invention correspond to the same or similar components; in the description of the present invention, it should be understood that if there is an orientation or positional relationship indicated by terms such as "upper", "lower", "left", "right", "front", "rear", etc., based on the orientation or positional relationship shown in the drawings, it is only for convenience of description and simplification of description, but it is not an indication or suggestion that the referred device or element must have a specific orientation, be constructed in a specific orientation, and be operated, and therefore, the terms describing the positional relationship in the drawings are only used for illustrative purposes, and are not to be construed as limiting the present invention, and the specific meaning of the terms may be understood by those skilled in the art according to specific situations.
Referring to fig. 1, the model in fig. 1 combines two offloading manners, FC offloading and D2D offloading, and uses a blockchain technique to maintain a continuous tamper-resistant ledger database, so as to prevent malicious nodes from tampering transaction information, and ensure security of the entire network and privacy of user data. To meet the latency requirements of SMEs for performing compute-intensive tasks, SMEs choose to offload compute tasks to nearby FSs or groups of D2D devices. The proposal adopts a DPoS consensus mechanism and a manager based on SMEs voting
Figure GDA0003529514600000051
Responsible for packaging transactions to generate new blocks and broadcast them to W-1 validators
Figure GDA0003529514600000055
Then passes through a verifier
Figure GDA0003529514600000052
If the verification result is correct, the new block is managed by the manager
Figure GDA0003529514600000053
Added to the blockchain.
1. Network communication model
Consider an OFDMA system with S uplink subcarriers, a total system bandwidth of B, and a bandwidth of S subcarriers
Figure GDA0003529514600000054
The present scheme assumes that each subcarrier can only be allocated to one SME to avoid interference between SMEs.
Figure GDA0003529514600000061
Respectively, S on a subcarrier Sn,kChannel gain with SME k' in the D2D device group, and S on subcarrier Sn,kAnd the channel gain of FSn. Using vector β ═ βk,1k,2,...,βk,s,...,βk,SDenotes Sn,kTransmission power allocated on subcarrier S, Sn,kP for total transmission powern,kIs expressed as σ2And ak,s E 0,1 represents the noise power and subcarrier allocation indication parameters, respectively. I.e. when subcarrier S is allocated to Sn,kThen a isk,s1 is ═ 1; otherwise ak,s=0。
1) Offloading to D2D device group (offloading mode 0):
assume that the number of SMEs K' in the D2D device group is less than or equal to the number of subcarriers S. Sn,kThe transmission rate offloaded to SME k' over subcarrier s can be expressed as:
Figure GDA0003529514600000062
Sn,kthe uplink transmission rate offloaded to SME k' can be expressed as:
Figure GDA0003529514600000063
2) offloading to a mist server (offloading mode 1):
Sn,koffloading to FS over subcarrier snThe transmission rate of (d) may be expressed as:
Figure GDA0003529514600000064
Sn,kthe uplink transmission rate offloaded to FS n can be expressed as:
Figure GDA0003529514600000065
2. computational offload model
Suppose Sn,kBoth the nearby FSs and D2D groups of devices have computing power to provide task execution services. Compute intensive task An,kMay be offloaded to FSs or a group of D2D devices.
1) Offloading to D2D device group (offloading mode 0):
the time delay of the unloading mode 0 comprises two parts of time delay of a transmission phase and time delay of an execution phase, and the time of a result acquisition phase is omitted. Since for some typical fog calculation services the results sent back in the downlink are small, approximately equal to 1/30 where the results were sent in the uplink, the downlink delay is negligible.
Transmission phase delay: in the unloading mode, Sn,kSelecting to request an offload task from a nearby D2D device group, Sn,kThe transmission power with SME k' is expressed as
Figure GDA0003529514600000071
The transmission delay and power consumption at this stage can be expressed as:
Figure GDA0003529514600000072
Figure GDA0003529514600000073
Figure GDA0003529514600000074
and (3) executing stage time delay: in this offload model, SMEs in the D2D device group have their respective computational capabilities fn,k'In a different sense, with xn,k'Representing the calculated energy efficiency coefficients of SMEs in the D2D device group. In this offload mode, compute task An,kThe execution phase latency and energy consumption in SMEs in the D2D device group may be expressed as:
Figure GDA0003529514600000075
Figure GDA0003529514600000076
Figure GDA0003529514600000077
In summary, the total time delay under the unloading mode 0 can be obtained
Figure GDA0003529514600000078
And total energy consumption
Figure GDA0003529514600000079
Can be expressed as:
Figure GDA00035295146000000710
Figure GDA00035295146000000711
2) offloading to fog server (offloading mode 1):
the delay of SME selection unloading to the fog server comprises three parts of transmission phase delay, execution phase delay and queue phase delay.
Transmission phase delay: in the unloading mode, Sn,kSelect to FS in the vicinitynAn offload task is requested. Sn,kThe transmission power with FSn is expressed as
Figure GDA0003529514600000081
The transmission delay and power consumption at this stage can be expressed as:
Figure GDA0003529514600000082
Figure GDA0003529514600000083
and (3) executing stage time delay: modeling computational power consumption as Pn=xn(fn)3Wherein x isnRepresenting the calculated energy efficiency coefficient of the fog server, fnRepresents FSnThe unit of the computing power of (1) is (CPU cycles/s). f. ofnCan be flexibly adjusted by DVS technology to meet the requirements of users, and uses a vector F ═ F1,f2,...,fn,...,fNN, denotes FS, 1,2nIs Sn,kThe allocated computing resources. Under this offload mode, compute intensive task An,kThe execution latency and energy consumption in SMEs in the D2D device group can be expressed as:
Figure GDA0003529514600000084
Figure GDA0003529514600000085
delay of queuing stage: when decisions are made taking into account SMEs, the task buffer waits for queuing delays introduced by the tasks. Suppose in FSnIs Q of the total number of CPU cycles processed in the task buffern. By using
Figure GDA0003529514600000086
Represents FSnThe static circuit power of (1). Then compute task An,kThe queuing phase delay and energy consumption of (a) can be expressed as:
Figure GDA0003529514600000087
Figure GDA0003529514600000088
in summary, the total time delay under the unloading mode 1 can be obtained
Figure GDA0003529514600000089
And total energy consumption
Figure GDA00035295146000000810
Expressed as:
Figure GDA00035295146000000811
Figure GDA0003529514600000091
3. optimization problem modeling
The optimization objective of the invention is to jointly optimize the task execution cost and the block chain system consensus cost under the condition of meeting the requirements of Quality of service (QoS) of system task execution and a block chain system so as to realize the improvement of the system performance. Thus, the optimization problem can be modeled as:
Figure GDA0003529514600000092
constraint C1 ensures that the task offload mode decision is valid, and C2 indicates that the sum of the task allocation proportions in offload mode 0 is equal to 1. C3 denotes Sn,kThe sum of the transmission power allocation ratios over S subcarriers is equal to 1. C4 indicates that the total delay for task completion in either offload mode 0 or offload mode 1 does not exceed the maximum delay limit τn,kC5 shows that the sum of the total energy consumption of the system task execution and the total energy consumption of the block chain system consensus process is not more than the maximum energy consumption EmaxC6 indicates that the computational power allocated to FS by the system cannot exceed the total computational power
Figure GDA0003529514600000093
4. System flow
Fig. 2 is a flow chart of task offloading in a block chain-based fog network, specifically including the following steps:
step 201: initializing a system;
step 202: SMEs register as legal entity at LBS, LBS grants identity address In,kAnd certificate Cn,kThey may uniquely represent SME k. Then, the public key PKn,kAnd a private key SKn,k,<PKn,k,SKn,k>. and wallet address { WAL) for implementing resource currency transactionsn,kSending the data to SMEs;
step 203: SMEs apply for LBS to join a block chain network;
step 204: LBS verifies whether the SMEs node is effective, if the SMEs node passes the verification, the SMEs node agrees to join the network, otherwise, no response is made;
step 205: after the authentication of the LBS is verified, the SMEs send the resource requirement to the LBS, the FSs send the available resource and the QoS constraint to the LBS, and the LBS writes the available resource, the resource requirement and the QoS constraint into an intelligent contract of resource transaction;
step 206: automatically triggering intelligent contracts, and selecting by SMEs to offload tasks to FSs or D2D device groups nearby;
step 207: sn,kSelecting to unload to the D2D equipment group, namely unloading mode 0;
step 208: sn,kSelecting a nearby D2D device group to offload request message Rn,kDigitally signing Rn,kAnd S for digital signaturen,kThe private key is encrypted and sent to the D2D device group;
step 209: D2D equipment group uses Sn,kDecrypting and verifying the digital signature and the transaction by the public key, and executing the computing task A if the verification is passedn,kOtherwise, not responding to the uninstall request message;
step 210: the D2D equipment group executes the calculation task and returns the calculation result to the Sn,k
Step 211: deriving resource prices, S, from intelligent contracts for resource transactionsn,kPaying a number of resource coins to the D2D device group by price;
step 212: s. then,kFSs for selecting unloading to the vicinity, namely unloading mode 1;
step 213: sn,kSelecting a fog server FSnFor the offload request message Rn,kDigitally signing Rn,kAnd S for digital signaturen,kThe private key is encrypted and sent to the FSn
Step 214: FS (file system)nWith Sn,kDecrypting and verifying the digital signature and the transaction by the public key, and executing an uninstalling task A if the verification is passedn,kOtherwise, not responding to the uninstall request message;
step 215: FS (file system)nExecuting the calculation task and returning the calculation result to Sn,k
Step 216: resource price, S, derived from intelligent contracts for resource transactionsn,kPaying FS by pricenA quantity of resource coins from Sn,kWallet address transfer to FSnThe wallet address of;
step 217: SMEs vote FSs in their covered area, one person for one vote, the weight of SME voting is independent of the share weight value;
step 218: FSs of top M names of ticket number as verification set, which includes a manager
Figure GDA0003529514600000101
And M-1 verifiers
Figure GDA0003529514600000102
Step 219: m FSs in the authentication set act as managers in turn
Figure GDA0003529514600000103
Step 220: sn,kSending transaction records to an associated FSn
Step 221: FS (file system)nBroadcasting the transaction record;
step 222: manager
Figure GDA0003529514600000111
Constructing a new block consisting of all transactions, signing and broadcasting to the verifier in the blockchain system
Figure GDA0003529514600000112
Step 223: verifier for receiving new block
Figure GDA0003529514600000113
The correctness of the hash value and the digital signature are verified;
step 224: manager
Figure GDA0003529514600000114
From more than two-thirds of the verifiers
Figure GDA0003529514600000115
Receiving a submit message;
step 225: manager
Figure GDA0003529514600000116
Putting the new block adding timestamp into a block chain;
step 226: verifying device
Figure GDA0003529514600000117
Only returning the block header content including the last block hash value, the current block hash value, the timestamp and the Merkel root value to the SMEs so as to save the storage space of the SMEs;
step 227: the algorithm ends.
Finally, the above embodiments are only intended to illustrate the technical solutions of the present invention and not to limit the present invention, and although the present invention has been described in detail with reference to the preferred embodiments, it will be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions, and all of them should be covered by the claims of the present invention.

Claims (1)

1. A task unloading optimization method in a fog network based on a block chain is characterized in that: the method comprises the following steps:
establishing a block chain-based fog network, which consists of an equipment layer, a fog service layer and a cloud service layer;
the device layer consists of SMEs and comprises a smart phone, smart wearable devices and smart vehicles;
the fog service layer comprises N FSs units with set omegaa={F1,F2,...,Fn,...,FNN is 1,2, N denotes; in FSnHas K SMEs in the coverage range, using the set Ψa={Sn,1,Sn,2,...,Sn,k,...,Sn,KK is 1,2, ·, K denotes; sn,kRepresents FSnSME k within the coverage area;
two unloading modes exist in the fog network, namely unloading to an FS or D2D equipment group; using vector δ ═ δn,1n,2,...,δn,k,...,δn,KK1, 2, K, at FSnHas K SMEs, deltan,kE {0,1} represents the unload mode, δn,k0 represents Sn,kOffloading to D2D device group, i.e., offloading mode 0; deltan,k1 represents Sn,kUnloading to FS, namely unloading mode 1;
step 201: initializing a system;
step 202: SMEs register as legal entity at LBS, LBS grants identity address In,kAnd certificate Cn,kCan uniquely represent SMEk; then, the public key PKn,kAnd a private key SKn,k,<PKn,k,SKn,k>. and wallet address { WAL) for implementing resource currency transactionsn,kSending the data to SMEs;
step 203: SMEs apply for LBS to join a block chain network;
step 204: LBS verifies whether the SMEs node is effective, if the SMEs node passes the verification, the SMEs node agrees to join the network, otherwise, no response is made;
step 205: after the authentication of the LBS is verified, the SMEs send the resource requirement to the LBS, the FSs send the available resource and the QoS constraint to the LBS, and the LBS writes the available resource, the resource requirement and the QoS constraint into an intelligent contract of resource transaction;
step 206: automatically triggering intelligent contracts, and selecting by SMEs to offload tasks to FSs or D2D device groups nearby;
step 207: sn,kSelecting to unload to the D2D equipment group, namely unloading mode 0;
step 208: sn,kSelecting a nearby D2D device group to offload request message Rn,kDigitally signing Rn,kAnd S for digital signaturen,kThe private key is encrypted and sent to the D2D device group;
step 209: D2D equipment group uses Sn,kDecrypting and verifying the digital signature and the transaction by the public key, and executing the computing task A if the verification is passedn,kOtherwise, not responding to the uninstall request message;
step 210: the D2D equipment group executes the calculation task and returns the calculation result to the Sn,k
Step 211: deriving resource prices, S, from intelligent contracts for resource transactionsn,kPaying a number of resource coins to the D2D device group by price;
step 212: sn,kFSs for selecting unloading to the vicinity, namely unloading mode 1;
step 213: sn,kSelective fog server FSnFor the offload request message Rn,kDigitally signing Rn,kAnd S for digital signaturen,kThe private key is encrypted and sent to the FSn
Step 214: FS (file system)nWith Sn,kDecrypting and verifying the digital signature and the transaction by the public key, and executing an uninstalling task A if the verification is passedn,kOtherwise, not responding to the unloading request message;
step 215: FS (file system)nExecuting the calculation task and returning the calculation result to Sn,k
Step 216: resource price, S, derived from intelligent contracts for resource transactionsn,kPaying FS by pricenA quantity of resource coins from Sn,kWallet address transfer to FSnThe wallet address of;
step 217: SMEs vote FSs in their covered area, one person for one vote, the weight of SME voting is independent of the share weight value;
step 218: FSs of top M names of ticket number as verification set, which includes a manager
Figure FDA0003575439050000021
And M-1 verifiers
Figure FDA0003575439050000022
Step 219: m FSs in the authentication set act as managers in turn
Figure FDA0003575439050000023
Step 220: sn,kSending transaction records to an associated FSn
Step 221: FS (file system)nBroadcasting the transaction record;
step 222: manager
Figure FDA0003575439050000024
Constructing a new block consisting of all transactions, signing and broadcasting to the verifier in the blockchain system
Figure FDA0003575439050000025
Step 223: verifier for receiving new block
Figure FDA0003575439050000026
The correctness of the hash value and the digital signature are verified;
step 224: manager
Figure FDA0003575439050000027
From more than two-thirds of verifiers
Figure FDA0003575439050000028
Receiving a submit message;
step 225: manager
Figure FDA0003575439050000029
Putting the new block adding timestamp into a block chain;
step 226: verifying device
Figure FDA00035754390500000210
Only returning the block header content including the last block hash value, the current block hash value, the timestamp and the Merkel root value to the SMEs so as to save the storage space of the SMEs;
step 227: and (6) ending.
CN202010796536.4A 2020-08-10 2020-08-10 Block chain-based task unloading optimization method in fog network Active CN111866181B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010796536.4A CN111866181B (en) 2020-08-10 2020-08-10 Block chain-based task unloading optimization method in fog network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010796536.4A CN111866181B (en) 2020-08-10 2020-08-10 Block chain-based task unloading optimization method in fog network

Publications (2)

Publication Number Publication Date
CN111866181A CN111866181A (en) 2020-10-30
CN111866181B true CN111866181B (en) 2022-05-13

Family

ID=72971858

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010796536.4A Active CN111866181B (en) 2020-08-10 2020-08-10 Block chain-based task unloading optimization method in fog network

Country Status (1)

Country Link
CN (1) CN111866181B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113242553B (en) * 2021-06-22 2022-05-20 重庆邮电大学 Malicious node detection method based on block chain fragmentation
CN113672911B (en) * 2021-07-15 2023-12-15 华南理工大学 Body area network task unloading method and system based on block chain

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109951873A (en) * 2019-02-28 2019-06-28 华北电力大学 A kind of Internet of Things mist calculate in information asymmetry do not know lower task unloading mechanism
CN110098969A (en) * 2019-05-21 2019-08-06 重庆邮电大学 A kind of mist calculating task discharging method of internet of things oriented
CN110187964A (en) * 2019-05-07 2019-08-30 南京邮电大学 The deadline minimizes mist computation migration method in scenes of internet of things
CN110234127A (en) * 2019-06-11 2019-09-13 重庆邮电大学 A kind of mist network task discharging method based on SDN
CN110392079A (en) * 2018-04-20 2019-10-29 上海无线通信研究中心 The node calculating task dispatching method and its equipment calculated towards mist

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111010434B (en) * 2019-12-11 2022-05-27 重庆工程职业技术学院 Optimized task unloading method based on network delay and resource management
CN111507601B (en) * 2020-04-12 2022-06-07 北京工业大学 Resource optimization allocation decision method based on deep reinforcement learning and block chain consensus

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110392079A (en) * 2018-04-20 2019-10-29 上海无线通信研究中心 The node calculating task dispatching method and its equipment calculated towards mist
CN109951873A (en) * 2019-02-28 2019-06-28 华北电力大学 A kind of Internet of Things mist calculate in information asymmetry do not know lower task unloading mechanism
CN110187964A (en) * 2019-05-07 2019-08-30 南京邮电大学 The deadline minimizes mist computation migration method in scenes of internet of things
CN110098969A (en) * 2019-05-21 2019-08-06 重庆邮电大学 A kind of mist calculating task discharging method of internet of things oriented
CN110234127A (en) * 2019-06-11 2019-09-13 重庆邮电大学 A kind of mist network task discharging method based on SDN

Also Published As

Publication number Publication date
CN111866181A (en) 2020-10-30

Similar Documents

Publication Publication Date Title
CN112532676B (en) Vehicle calculation task unloading method based on block chain data sharing
CN112132447B (en) Block chain-based algorithm for evaluating and guaranteeing trust of computing power network
Dai et al. Blockchain and deep reinforcement learning empowered intelligent 5G beyond
WO2020168937A1 (en) Block chain multi-party witness method, apparatus and device, and computer-readable storage medium
CN109493050B (en) Transfer method based on block chain main chain and parallel multiple sub-chains
CN111132175B (en) Cooperative computing unloading and resource allocation method and application
CN111464335B (en) Intelligent service customization method and system for endogenous trusted network
Xue et al. Fog-aided verifiable privacy preserving access control for latency-sensitive data sharing in vehicular cloud computing
CN112134959B (en) Heterogeneous edge resource sharing method based on block chain
CN112073222B (en) Air-ground network mobile management architecture based on block chain cross-chain technology
Jiang et al. Joint transaction relaying and block verification optimization for blockchain empowered D2D communication
Seng et al. User matching on blockchain for computation offloading in ultra-dense wireless networks
CN111866181B (en) Block chain-based task unloading optimization method in fog network
CN111556089A (en) Resource joint optimization method based on enabling block chain mobile edge computing system
CN112637822B (en) Cellular network safe transaction platform based on block chain
CN111770148B (en) Fog calculation unloading model optimization method based on block chain technology
Liu et al. Resource allocation for video transcoding and delivery based on mobile edge computing and blockchain
CN112751936A (en) Alliance chain system and alliance chain system deployment method
CN115379581A (en) Method, system, equipment and storage medium for unloading edge cloud server traffic
CN109905863B (en) Relay access method of distributed cooperative communication based on block chain storage
CN116669111A (en) Mobile edge computing task unloading method based on blockchain
CN116806038A (en) Decentralizing computer data sharing method and device
Bai et al. Blockchain-based Authentication and Proof-of-Reputation Mechanism for Trust Data Sharing in Internet of Vehicles.
Peng et al. A task assignment scheme for parked-vehicle assisted edge computing in iov
CN113742048B (en) Hotel cloud service system and service method thereof

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
TR01 Transfer of patent right

Effective date of registration: 20231107

Address after: 210003 Room 101, 4th Floor, Building A3, Innovation Plaza, Gulou District, Nanjing City, Jiangsu Province

Patentee after: Nanjing Qingke liangu Technology Service Co.,Ltd.

Address before: 400065 Chongqing Nan'an District huangjuezhen pass Chongwen Road No. 2

Patentee before: CHONGQING University OF POSTS AND TELECOMMUNICATIONS

TR01 Transfer of patent right