Resource Allocation in Edge-Computing Based Wireless Networks Based on Differential Game and Feedback Control

In this paper,we have proposed a differential game model to optimally solve the resource allocation problems in the edge-computing based wireless networks.In the proposed model,a wireless network with one cloud-computing center(CC)and lots of edge services providers(ESPs)is investigated.In order to provide users with higher services quality,the ESPs in the proposed wireless network should lease the computing resources from the CC and the CC can allocate its idle cloud computing resource to the ESPs.We will try to optimally allocate the edge computing resources between the ESPs and CC using the differential game and feedback control.Based on the proposed model,the ESPs can choose the amount of computing resources from the CC using feedback control,which is affected by the unit price of computing resources controlled by the CC.In the simulation part,the optimal allocated resources for users’services are obtained based on the Nash equilibrium of the proposed differential game.The effectiveness and correctness of the proposed scheme is also verified through the numerical simulations and results.

A Data-Semantic-Conflict-Based Multi-Truth Discovery Algorithm for a Programming Site

With the extensive application of software collaborative development technology,the processing of code data generated in programming scenes has become a research hotspot.In the collaborative programming process,different users can submit code in a distributed way.The consistency of code grammar can be achieved by syntax constraints.However,when different users work on the same code in semantic development programming practices,the development factors of different users will inevitably lead to the problem of data semantic conflict.In this paper,the characteristics of code segment data in a programming scene are considered.The code sequence can be obtained by disassembling the code segment using lexical analysis technology.Combined with a traditional solution of a data conflict problem,the code sequence can be taken as the declared value object in the data conflict resolution problem.Through the similarity analysis of code sequence objects,the concept of the deviation degree between the declared value object and the truth value object is proposed.A multi-truth discovery algorithm,called the multiple truth discovery algorithm based on deviation(MTDD),is proposed.The basic methods,such as Conflict Resolution on Heterogeneous Data,Voting-K,and MTRuths_Greedy,are compared to verify the performance and precision of the proposed MTDD algorithm.

Dynamic Resource Pricing and Allocation in Multilayer Satellite Network

The goal of delivering high-quality service has spurred research of 6G satellite communication networks.The limited resource-allocation problem has been addressed by next-generation satellite communication networks,especially multilayer networks with multiple low-Earth-orbit(LEO)and nonlow-Earth-orbit(NLEO)satellites.In this study,the resource-allocation problem of a multilayer satellite network consisting of one NLEO and multiple LEO satellites is solved.The NLEO satellite is the authorized user of spectrum resources and the LEO satellites are unauthorized users.The resource allocation and dynamic pricing problems are combined,and a dynamic gamebased resource pricing and allocation model is proposed to maximize the market advantage of LEO satellites and reduce interference between LEO and NLEO satellites.In the proposed model,the resource price is formulated as the dynamic state of the LEO satellites,using the resource allocation strategy as the control variable.Based on the proposed dynamic game model,an openloop Nash equilibrium is analyzed,and an algorithm is proposed for the resource pricing and allocation problem.Numerical simulations validate the model and algorithm.

Random Forests Algorithm Based Duplicate Detection in On-Site Programming Big Data Environment

On-site programming big data refers to the massive data generated in the process of software development with the characteristics of real-time,complexity and high-difficulty for processing.Therefore,data cleaning is essential for on-site programming big data.Duplicate data detection is an important step in data cleaning,which can save storage resources and enhance data consistency.Due to the insufficiency in traditional Sorted Neighborhood Method(SNM)and the difficulty of high-dimensional data detection,an optimized algorithm based on random forests with the dynamic and adaptive window size is proposed.The efficiency of the algorithm can be elevated by improving the method of the key-selection,reducing dimension of data set and using an adaptive variable size sliding window.Experimental results show that the improved SNM algorithm exhibits better performance and achieve higher accuracy.

Design of Ka-Band Phased Array Antenna with Calibration Function

In this paper,we have proposed a novel structure of Ka-band based phased array antenna with calibration function.In the design of Kaband antenna,the active phased array system is adopted and the antenna would work in the dual polarization separation mode.We have given out the schematic diagram for the proposed Ka-band antenna,where the Kaband antenna is in the form of waveguide slot array antenna,with 96 units in azimuth and 1 unit in distance.Each group of units is driven by a singlechannel Transmitter/Receiver(T/R)component,and the whole array contains 192 T/R components in total.The size of the T/R component is 55mm(length)×50mm(width)×5.8mm(height),3 Sub-micro Sub-Miniature Push-on(SSMP)blind sockets and a 21-core low-frequency socket are designed on the two sides of the T/R component.In order to meet the technical specifications of phased array antenna,the Ka-band transceiver component is designed based on Low Temperatrue Co-fired Ceramic(LTCC)technology to achieve miniaturization and lightweight.In our approach,the feed network includes two parts:transceiver network and calibration network.The transceiver network consists of 241:8 time-delay power dividers,12 two-way power dividers and 2 six-way time-delay power dividers.The power supply required by theKaband antenna unit is provided to each active component by the power module after Ka band wavelet control distribution.Simulation and measurement results are given in the form of standing wave and scanning capability.

A Novel Design of Antenna Array with Two K-Band Circularly Polarized Antenna

As an important part of phased array system,the research on phased array antenna is very necessary.The phased array antenna achieves the scanning beam adaptively by regulating the phase difference between each array element.In this paper,a dual K-band circularly polarized antenna with high broadband,broadband beam,wide axial ratio bandwidth and high radiation efficiency is designed.We combine with the advantages of slot antenna and aperture antenna,use multimode waveguide cavity structure to design an aperture antenna,which is fed to waveguide circular polarizer by slot coupling in order to realize circular polarization radiation.Meanwhile,it has the characteristics of broadband,broadband beam,wide axial ratio bandwidth and high radiation efficiency.A slit antenna is designed by using a multimode waveguide cavity structure and a slit coupling feed to a waveguide circular polarizer is used to achieve circularly polarized radiation.The designed antenna consists of two K-band circularly polarized antenna units,and the spacing between the two units is 9.5 mm,which is fed by aK-band T/R module(Transmitter/Receiver module).In order to study the performance of the pattern in the case of the research group,the 2-unit structure is established.The simulation results of frequency–axial ratio bandwidth are given,and the simulation result of the antenna array is shown.The practical results of antenna design and test are also given.