# Mobile Internet of Things Dynamic Grid QoS Service Matching Mechanism and Simulation Analysis

Authors: Xuemei Fan
Journal: Complexity
 (2021)

---

## Abstract

With the development of the mobile Internet of Things, people have higher and higher requirements for services, and how to provide high-quality services that meet the needs of users has also become a hot issue of current research. This article is also in the context of the mobile Internet of Things, researching the solution to the service matching problem. In order to provide high-quality grid services, the grid system needs the support of quality of service (QoS). Based on the existing QoS matching strategy, a service matching strategy based on dynamic grid QoS is proposed. This paper combines semantic information, considers service quality QoS and user preferences, and improves the success rate of service matching through hierarchical matching, so as to provide users with high-quality services. At the same time, the classic Max-Min algorithm in grid task scheduling is analysed, and on this basis, the impact of QoS on task scheduling is fully considered, and combined with the concept of execution cost, a grid task based on QoS constraints (MOS) is proposed. Through simulation verification and analysis, the strategy in this paper not only achieved higher matching performance, but also improved the success rate of task execution, and the effect of system load balancing was also significantly improved.


---

## Body

## 1. Introduction

Internet of Things (IoT) is based on a large number of microdevices (such as actuators and sensors), combining traditional and emerging industry applications, with a new generation of Internet as the backbone, and is a ubiquitous and global network [1–3]. The emergence of the IoT provides a good basic platform for the realization of a pervasive computing environment. Therefore, the IoT is another wave of technology and economy brought by the global information industry after computers, mobile communication networks, and the Internet. It has brought great opportunities and challenges to the modern and fast-developing information digital life [4, 5]. Mobile IoT provides a good platform for ubiquitous computing. The purpose of pervasive computing is to establish an environment full of perception, communication, and computing capabilities, and gradually integrate this environment with people’s lives [6]. An important direction in pervasive computing-service discovery [7] has become an important aspect of the mobile IoT. For service discovery, the key is the service matching method, so how to perform service matching and how to provide users with high-quality services have become the hotspot and the most important research topic.Since there are multiple grid resources with similar service functions in the grid system, the QoS of resources has gradually become one of the important factors that users need to refer to when selecting services [8]. Grid service is a service registered in the grid system by the resource provider in the description form of service or resource binding. Service matching based on QoS is the focus of research in resource management. Currently, there is no unified standard for the description, parameter definition, and service evaluation of grid services. Literature [9] studied the description of QoS parameters between service requesters and providers and used the method of sequential comparison for service matching. However, the matching process of this method is complicated and it is difficult to match high-quality services. Literature [10] analysed the QoS attributes of the service, combined the representative attributes in the service into a matrix form, and obtained high-quality services through a local optimal selection algorithm. This algorithm has a faster matching speed, but the shortcomings are obtained. The service cannot be guaranteed to be optimal. Literature [11] uses a global optimization algorithm to obtain services with better service quality on the basis of considering global QoS factors, but the algorithm is slower and runs heavy.On the basis of studying the existing QoS-based matching strategy, this paper proposes a service matching strategy based on dynamic grid QoS. This article combines semantic information to improve the success rate of service matching through hierarchical matching. At the same time, a grid task group scheduling algorithm (MOS) based on QoS constraints is proposed. The simulation results show that the strategy in this paper not only achieves higher matching performance, but also improves the success rate of task execution, and the effect of system load balancing has also been significantly improved.


## 2. Related Knowledge

In recent years, there has been an upsurge in the research and application of the IoT technology at home and abroad. Its user end extends and extends to any object and between objects for information exchange and communication [12]. With the promotion of users, operators and equipment manufacturers, Internet of Things services [13] appear in large numbers, and users cannot quickly and completely find services that meet their personal needs from a large number of services. This is called service discovery [14]. When faced with a large number of similar services, that is, the result of service discovery, users cannot accurately find the most satisfactory service. This is called service matching.Regarding the algorithm research on service matching, the most influential one is the elastic matching algorithm [15]. The algorithm mainly considers service matching based on functionality, that is, considering the input and output parameters of the matching service. It defines four matching levels, namely, complete matching, plug-in matching, inclusive matching, and matching failure. Since there are multiple grid resources with similar service functions in the grid system, the QoS of the resources has gradually become one of the important factors that users need to refer to when selecting services. The literature [16] states that the scheduling system in the grid environment must adopt a hierarchical structure, which requires multiple scheduling instances to coordinate with each other, and analyses the properties of communication between scheduling instances. Literature [17] analysed the scheduling execution process that divided into three phases: resource discovery phase, system selection phase, and job execution phase. GGF [18] proposed a draft of the service grid scheduling architecture, explaining the relationship between OGSA-based scheduling services and other core grid. At the same time, the algorithm proposes that a complete grid scheduling system should include four functional modules: resource selection, scheduling queue generation, data management and monitoring including I/O transmission and copy. The current resource organization models used in the grid computing environment are mainly as follows:(1)
Hierarchical model: currently, the grid projects that adopt the hierarchical model include Globus [19], Legion [20], and AppLes [21].(2)
Computational market/economy model: the grid computing market provides suitable tools and services to allow resource requesters and resource providers to express their needs. It can be used in conjunction with the hierarchical model to achieve more effective resource management.(3)
Resource pool model: in this model, the information of all resources in the computing environment is recorded on a central server, and the description of the resources in the resource pool is disordered. Therefore, only work-level scheduling is supported in the condor environment, task-level parallelism is not supported, and communication between tasks is not supported.(4)
EVP model of grid resource space: the EVP model proposed in Vega Grid includes three levels: effective resource layer, virtual resource layer, and physical resource layer.(5)
OGSA resource service model: all resources exist in the form of services. Services are distributed in different environments and can be accessed through a universal resource identifier.There are many current researches on service matching, and we can extend these methods to the IoT environment. So in this article, we will study the discovery, selection, and combination on the IoT platform in a semantic environment. The main idea of semantics [22] is to encode resources in a computer-process-able semantic form to expand the current human-readable information. Semantic service [23] is a server terminal in a client-server system that realizes machine-to-machine interaction through the World Wide Web. Semantic-based research will enable more advanced applications and functions. Computers will be able to search, process, and integrate the content of these resources more meaningfully.Jini [24] is an object-oriented service discovery mechanism based on Java inheritance. It can change the hardware or software configuration of the service network that uses it at any time. This provides a perfect mechanism for the hardware or software that joins or exits the service network, and it also conveniently supports the configuration of the ubiquitous computing environment.UPnP [25] is a standard promoted by Microsoft. As long as any device is connected to the network, other devices on the network will immediately know that there is a new device to join, and these devices can communicate with each other.Salutation [26] is an open standard, and this standard has nothing to do with communication protocols, operating systems, and hardware platforms. Its purpose is to break the barriers between different technologies through this open standard, so as to realize “universal computing” in the true sense.Based on the above introduction to the existing service algorithms, it can be found that each has its own advantages and disadvantages in mechanism, and each has its own scope of application [27, 28]. Through analysis, it is concluded that they have the following shortcomings:(1)
No semantic information added(2)
Context-sensitive is not supported(3)
Not suitable for public wide area network(4)
Security and privacyIn order to solve the above problems, this paper combines semantic information, considers service quality QoS and user preference, and proposes a grid task group scheduling algorithm (MOS) based on QoS constraints. Through simulation verification and analysis, the strategy in this paper not only achieved higher matching performance, but also improved the success rate of task execution, and the effect of system load balancing was also significantly improved.


## 3. Dynamic Grid QoS Service Matching Algorithm

### 3.1. System Structure of Mobile Grid

With the gradual popularity of mobile Internet applications and the continuous improvement of mobile search applications, when users need to query some urgently needed, they will increasingly tend to use mobile search [29–34]. The structure of the mobile grid system is shown in Figure 1, which is mainly composed of three modules: a fixed grid site, a mobile terminal group, and a middleware mobile gateway.Figure 1
Structure diagram of mobile grid system.In the mobile grid, mobile terminals have two purposes: one is as a resource to be scheduled; the other is as a resource for providing services. The former uses mobile devices to access grid resources, while the latter uses mobile devices as grid resources to provide services to other grid users. Mobile terminals refer to devices with limited computing resources, excluding notebooks. Mobile terminals continue to shrink in size, become more compact and easy to carry, but their functions are increasingly powerful, and their services continue to expand to integrate multiple functions such as communication, video, and reading. However, mobile terminals have shortcomings, which are manifested in the following points: limited memory and storage resources, usually between 2 and 64 Mbytes; computing resources, battery life, network bandwidth, display, and input capabilities are limited, and there are many kinds of processor and operating system.


### 3.2. Semantic-Based Resource Description Framework

The framework of this article provides grid services through interface definitions, which facilitates the access and combination of grid services. The framework determines the basic functions needed to realize sharing in a virtual organization, and the main relationships that exist between these different functions. However, the current framework does not integrate semantic service technology, so there is a lack of semantic-based service discovery and sharing. Through the current research on grid technology and semantic grid projects, we have summarized the hierarchy of grid systems supporting semantic services under the existing OGSA, as shown in Figure2.Figure 2
Hierarchical structure of OGSA system supporting semantic services.The semantic-based resource description method can introduce clear formal semantics for resource description. By introducing semantics, it can enable grid users and grid applications to have a consistent common understanding of resources in the service grid environment. With the development of the mobile IoT, users will have higher and higher requirements for services. Personalized service matching methods will also have better applications. Therefore, considering the user's preference in the service matching algorithm, it can also better reflect the human-cantered thinking. On this basis, this paper introduces semantic information, considers QoS and user preferences, and adopts hierarchical matching to design a new service matching algorithm for mobile IoT. It is defined as follows:(1)
Exact match: when the request concept is equal to the provided concept(2)
Plug-in matching: when the requested concept is included in the provided concept(3)
Containment matching: when the provided concept is included in the request concept(4)
Matching failure: when it does not fall into the above three casesDefine the serviceS provided by a service provider as the following five-tuple:(1)S=St,Si,So,SQ,SI.Among them,St is the service type provided by the service provider, Si is the input parameter of the service, So is the output parameter of the service, SQ is the QoS parameter of the service, and SI is the user’s preference for the service.To define the service SRE requested by a service requester is also a five-tuple as follows:(2)SRE=SREt,SREi,SREo,SREQ,SREI.Among them, SREt is the service type requested by the service requester, SREi is the input parameter of the service, SREo is the output parameter of the service, SREQ is the QoS parameter of the service, and SREI is the user’s preference for the service.First, the matching of service types can filter out all unmatched services and provide accurate and similar matching services to the next step of matching, that is, matching the input and output of the service. The ontology theory is used here, and the matching of service types is carried out according to the matching of the semantic level. In this matching process, it depends on whether the service request and the service provided by the service provider refer to the same ontology. If not, the candidate service can be directly filtered out. If so, the function is directly applied:(3)result=MatchSREt,St.If it is Fail, filter out the candidate service; otherwise, you can proceed to the next step of matching.


### 3.3. Service Input and Output Matching Degree Calculation

After matching the types, the next step is to calculate the matching degree of service input and output, which is actually the problem of calculating the similarity between the two concepts in the ontology. Introduce the basic theory of ontology, so that semantic information is considered, matching at the semantic level is realized, and ambiguity is avoided. Suppose that, in an ontology concept tree, the parent concept directly contains the child concept. Suppose its root node isG, z1 and z2 are two child nodes, and there is a path {z1, z1a, z1b, …, z2}; then the similarity of concepts z1 and z2 is defined as(4)similar=∑N2∑N1.N1 represents the number of subclasses of z1. N2 represents the number of subcategories of z1i. For multiple inputs and outputs, calculate the average value. In this way, the matching similarity of input and output can be calculated:(5)result=MatchSRE,S=similarSRE,S+1similarSRE,S−1.In this way, the similarity matching degree of service input and output can be obtained through the above method.


### 3.4. QoS Parameter Matching

When there are multiple resource services that meet the requirements in the grid service system, in order to obtain higher-quality services, this article measures the QoS parameters globally from the aspects of grid service cost, execution time, and resource availability. User service preferences are increased to improve user satisfaction with services. Grid service quality is a measure of user satisfaction with the service.Combined with the related requirements of QoS in the grid environment, the following 7 parameters are used to define and describe QoS:(1)
c represents the grid service fee.(2)
t represents the execution time of the grid service.(3)
s represents the available grid resources.(4)
a indicates the availability of grid resources.(5)
r represents the reliability of grid resources. The calculation is shown as follows:(6)r=1N+1∑i=1∞sucSi.Among them,N represents the number of grid services executed and Si is the i-th service called by the user. When the execution is successful, the return value of suc(Si) is 1; when the operation fails, the return value of suc(si) is 0.(6)
sr indicates the demand for various types of resources by grid services.(7)
p is the user’s preference for service parameters, expressed as a set as P = {p1, p2,…, pn}, where n is the number of grid QoS parameters; the larger the value of pi is set, the more the user prefers the parameter, and the better the parameter, the better it can meet the user's requirements.Grid service quality parameter matrix: this refers to a matrixM composed of n grid services and m QoS parameters for each grid service. The representation of M is shown as follows:(7)Mm×n=m11,…,mnm.Among them,mij is a value between [0, 1]; a larger value indicates that the parameter of the grid service is better than the parameters of other services.


### 3.5. Matching of User Preferences

Grid services also have the characteristics of diversity, and different service matching strategies need to be adopted for different services, because users have different preferences for grid QoS parameters, that is,P = {p1, p2,…, pn} is different. Different users may have different preferences pi for the same QoS parameters. Multiply the matrix M and the preference parameter column vector to obtain the preference-based global grid QoS parameter column vector M’. The representation of M′ is shown as follows:(8)M′=P×MT.


### 3.6. Comprehensive Matching of Services

In this way, by combining the matching of the various stages above, a comprehensive matching of the final service can be obtained. The comprehensive matching degree of the service is calculated as follows:(9)result=a×MatchSREt,St+b×MatchSRE,S1−a−b×∑N2/∑N1,where a and b represent weight information.In this way, the comprehensive matching degree of the service is obtained, through which it can be judged which service is more suitable, so as to provide the service with the best service matching degree to the user. In actual matching, the requested service is hierarchically matched with all published services, and only those services that pass the previous level of matching can enter the next level of matching, thereby gradually narrowing the service set, and ultimately satisfying user requests. The service or service collection is fed back to the user.


### 3.7. Task Scheduling of Mobile Grid

In a grid computing environment, there are many independent workstations distributed in different areas, and each workstation is composed of various hosts with different functions. These workstations from different regions are linked to each other through the WAN, sharing the services provided by each other. In order to improve the use efficiency of grid resources and quickly allocate the tasks to be completed to the appropriate resources, we need a suitable task scheduling algorithm. We propose an improved Max-Min algorithm for the grid task scheduling algorithm, and pursue the task scheduling model Makespan Oriented Scheduling (MOS) with the shortest overall task completion time. The algorithm execution process is as follows:Step 1: according to the matrixM′(ti, rj), the tasks to be allocated are sorted in descending order.Step 2: sort and renumber the resources according to the execution cost of the resource host from small to large.Step 3: according to different types of QoS requirements, classifyT and put it into different queues. Assume that Q = 2 means the highest demand, Q = 1 means the second, and Q = 0 means the lowest demand.Step 4: starting from queue Q1, selectti with the largest amount of tasks to start scheduling. Choose the resource rj that can meet ti's QoS requirements and can be completed the fastest. If there are several units with the same completion time, choose the cheapest host.Step 5: delete the taskti from the non-empty queue Q1, and update the matrix at the same time; that is, update the matrix of the remaining tasks waiting to be scheduled on the rj host.Step 6: repeat the above steps to process the tasks in queues Q2 and Q3, respectively, until all tasks in all queues are scheduled, and the program ends.


## 3.1. System Structure of Mobile Grid

With the gradual popularity of mobile Internet applications and the continuous improvement of mobile search applications, when users need to query some urgently needed, they will increasingly tend to use mobile search [29–34]. The structure of the mobile grid system is shown in Figure 1, which is mainly composed of three modules: a fixed grid site, a mobile terminal group, and a middleware mobile gateway.Figure 1
Structure diagram of mobile grid system.In the mobile grid, mobile terminals have two purposes: one is as a resource to be scheduled; the other is as a resource for providing services. The former uses mobile devices to access grid resources, while the latter uses mobile devices as grid resources to provide services to other grid users. Mobile terminals refer to devices with limited computing resources, excluding notebooks. Mobile terminals continue to shrink in size, become more compact and easy to carry, but their functions are increasingly powerful, and their services continue to expand to integrate multiple functions such as communication, video, and reading. However, mobile terminals have shortcomings, which are manifested in the following points: limited memory and storage resources, usually between 2 and 64 Mbytes; computing resources, battery life, network bandwidth, display, and input capabilities are limited, and there are many kinds of processor and operating system.


## 3.2. Semantic-Based Resource Description Framework

The framework of this article provides grid services through interface definitions, which facilitates the access and combination of grid services. The framework determines the basic functions needed to realize sharing in a virtual organization, and the main relationships that exist between these different functions. However, the current framework does not integrate semantic service technology, so there is a lack of semantic-based service discovery and sharing. Through the current research on grid technology and semantic grid projects, we have summarized the hierarchy of grid systems supporting semantic services under the existing OGSA, as shown in Figure2.Figure 2
Hierarchical structure of OGSA system supporting semantic services.The semantic-based resource description method can introduce clear formal semantics for resource description. By introducing semantics, it can enable grid users and grid applications to have a consistent common understanding of resources in the service grid environment. With the development of the mobile IoT, users will have higher and higher requirements for services. Personalized service matching methods will also have better applications. Therefore, considering the user's preference in the service matching algorithm, it can also better reflect the human-cantered thinking. On this basis, this paper introduces semantic information, considers QoS and user preferences, and adopts hierarchical matching to design a new service matching algorithm for mobile IoT. It is defined as follows:(1)
Exact match: when the request concept is equal to the provided concept(2)
Plug-in matching: when the requested concept is included in the provided concept(3)
Containment matching: when the provided concept is included in the request concept(4)
Matching failure: when it does not fall into the above three casesDefine the serviceS provided by a service provider as the following five-tuple:(1)S=St,Si,So,SQ,SI.Among them,St is the service type provided by the service provider, Si is the input parameter of the service, So is the output parameter of the service, SQ is the QoS parameter of the service, and SI is the user’s preference for the service.To define the service SRE requested by a service requester is also a five-tuple as follows:(2)SRE=SREt,SREi,SREo,SREQ,SREI.Among them, SREt is the service type requested by the service requester, SREi is the input parameter of the service, SREo is the output parameter of the service, SREQ is the QoS parameter of the service, and SREI is the user’s preference for the service.First, the matching of service types can filter out all unmatched services and provide accurate and similar matching services to the next step of matching, that is, matching the input and output of the service. The ontology theory is used here, and the matching of service types is carried out according to the matching of the semantic level. In this matching process, it depends on whether the service request and the service provided by the service provider refer to the same ontology. If not, the candidate service can be directly filtered out. If so, the function is directly applied:(3)result=MatchSREt,St.If it is Fail, filter out the candidate service; otherwise, you can proceed to the next step of matching.


## 3.3. Service Input and Output Matching Degree Calculation

After matching the types, the next step is to calculate the matching degree of service input and output, which is actually the problem of calculating the similarity between the two concepts in the ontology. Introduce the basic theory of ontology, so that semantic information is considered, matching at the semantic level is realized, and ambiguity is avoided. Suppose that, in an ontology concept tree, the parent concept directly contains the child concept. Suppose its root node isG, z1 and z2 are two child nodes, and there is a path {z1, z1a, z1b, …, z2}; then the similarity of concepts z1 and z2 is defined as(4)similar=∑N2∑N1.N1 represents the number of subclasses of z1. N2 represents the number of subcategories of z1i. For multiple inputs and outputs, calculate the average value. In this way, the matching similarity of input and output can be calculated:(5)result=MatchSRE,S=similarSRE,S+1similarSRE,S−1.In this way, the similarity matching degree of service input and output can be obtained through the above method.


## 3.4. QoS Parameter Matching

When there are multiple resource services that meet the requirements in the grid service system, in order to obtain higher-quality services, this article measures the QoS parameters globally from the aspects of grid service cost, execution time, and resource availability. User service preferences are increased to improve user satisfaction with services. Grid service quality is a measure of user satisfaction with the service.Combined with the related requirements of QoS in the grid environment, the following 7 parameters are used to define and describe QoS:(1)
c represents the grid service fee.(2)
t represents the execution time of the grid service.(3)
s represents the available grid resources.(4)
a indicates the availability of grid resources.(5)
r represents the reliability of grid resources. The calculation is shown as follows:(6)r=1N+1∑i=1∞sucSi.Among them,N represents the number of grid services executed and Si is the i-th service called by the user. When the execution is successful, the return value of suc(Si) is 1; when the operation fails, the return value of suc(si) is 0.(6)
sr indicates the demand for various types of resources by grid services.(7)
p is the user’s preference for service parameters, expressed as a set as P = {p1, p2,…, pn}, where n is the number of grid QoS parameters; the larger the value of pi is set, the more the user prefers the parameter, and the better the parameter, the better it can meet the user's requirements.Grid service quality parameter matrix: this refers to a matrixM composed of n grid services and m QoS parameters for each grid service. The representation of M is shown as follows:(7)Mm×n=m11,…,mnm.Among them,mij is a value between [0, 1]; a larger value indicates that the parameter of the grid service is better than the parameters of other services.


## 3.5. Matching of User Preferences

Grid services also have the characteristics of diversity, and different service matching strategies need to be adopted for different services, because users have different preferences for grid QoS parameters, that is,P = {p1, p2,…, pn} is different. Different users may have different preferences pi for the same QoS parameters. Multiply the matrix M and the preference parameter column vector to obtain the preference-based global grid QoS parameter column vector M’. The representation of M′ is shown as follows:(8)M′=P×MT.


## 3.6. Comprehensive Matching of Services

In this way, by combining the matching of the various stages above, a comprehensive matching of the final service can be obtained. The comprehensive matching degree of the service is calculated as follows:(9)result=a×MatchSREt,St+b×MatchSRE,S1−a−b×∑N2/∑N1,where a and b represent weight information.In this way, the comprehensive matching degree of the service is obtained, through which it can be judged which service is more suitable, so as to provide the service with the best service matching degree to the user. In actual matching, the requested service is hierarchically matched with all published services, and only those services that pass the previous level of matching can enter the next level of matching, thereby gradually narrowing the service set, and ultimately satisfying user requests. The service or service collection is fed back to the user.


## 3.7. Task Scheduling of Mobile Grid

In a grid computing environment, there are many independent workstations distributed in different areas, and each workstation is composed of various hosts with different functions. These workstations from different regions are linked to each other through the WAN, sharing the services provided by each other. In order to improve the use efficiency of grid resources and quickly allocate the tasks to be completed to the appropriate resources, we need a suitable task scheduling algorithm. We propose an improved Max-Min algorithm for the grid task scheduling algorithm, and pursue the task scheduling model Makespan Oriented Scheduling (MOS) with the shortest overall task completion time. The algorithm execution process is as follows:Step 1: according to the matrixM′(ti, rj), the tasks to be allocated are sorted in descending order.Step 2: sort and renumber the resources according to the execution cost of the resource host from small to large.Step 3: according to different types of QoS requirements, classifyT and put it into different queues. Assume that Q = 2 means the highest demand, Q = 1 means the second, and Q = 0 means the lowest demand.Step 4: starting from queue Q1, selectti with the largest amount of tasks to start scheduling. Choose the resource rj that can meet ti's QoS requirements and can be completed the fastest. If there are several units with the same completion time, choose the cheapest host.Step 5: delete the taskti from the non-empty queue Q1, and update the matrix at the same time; that is, update the matrix of the remaining tasks waiting to be scheduled on the rj host.Step 6: repeat the above steps to process the tasks in queues Q2 and Q3, respectively, until all tasks in all queues are scheduled, and the program ends.


## 4. Results and Discussion

### 4.1. User’s Preferred QoS Service Matching

This section verifies the effectiveness of the above algorithm through experiments. For the QoS service matching process that does not include user preferences, the algorithm in this paper and the calculation methods proposed in literature [11], literature [12], and literature [15] are implemented. The comparison result is shown in Figure 3. It can be seen from Figure 3 that the preference-based QoS matching algorithm, on the premise of more satisfying the demand, takes longer than the matching execution time without adding user preferences; that is, the matching execution efficiency is higher.Figure 3
Grid service matching time comparison chart.


### 4.2. Introducing Semantic QoS Service Matching

The matching algorithm uses a value between [0, 1] to represent the result of each match; as long as it is greater than or equal to the threshold specified by the user, it can be output to the user. The algorithm does not only filter from the service type. It not only considers the matching of the input and output parameters of the service, but also considers the matching of QoS, and more importantly, considers the user's preference. In this way, the found service can not only satisfy the user’s request, but also be close to the user's preferences, thereby more satisfying the user’s needs.Based on the above aspects, the algorithm has an overall improvement in the accuracy of service discovery. After the introduction of semantic ontology, compared with grammar-based service discovery, it can match input and output while also matching related entities. By setting different matching thresholds, the scope of service selection can be scaled. From this point of view, the algorithm increases the range of services that may participate in matching, which also improves the recall rate of services. Figures4 and 5 are comparison charts of the precision and recall of the algorithm in this paper and the comparison matching algorithm. It can be seen that the performance of the algorithm in this paper is the best.Figure 4
Comparison of recall rates.Figure 5
Accuracy comparison chart.


### 4.3. Task Scheduling of Grid Resources

The scheduling process of the MOS algorithm is shown in Figure6. Compare the traditional Max-Min scheduling algorithm and the MOS scheduling algorithm based on QoS constraints, as shown in Figure 7. It is not difficult to see that the overall completion time of the MOS algorithm has been greatly shortened. Compared with Max-Min algorithm, MOS scheduling algorithm also has a great reduction in execution cost.Figure 6
The scheduling process of the MOS algorithm. (a) Q1 queue scheduling situation. (b) Q2 queue scheduling situation. (c) Q3 queue scheduling situation. (d) Q4 queue scheduling situation.Figure 7
Comparison of scheduling between traditional algorithm and MOS algorithm. (a) Scheduling process of max-min. (b) Scheduling process of MOS.
(a)(b)Assume that the number of resources in the same grid domain is selected as 350, and the number of tasks increases from 50 to 500 in steps of 50. According to the above three grouping strategies, after grouping the number of tasks and when they are not grouping, the Min-Min algorithm and the algorithm in this paper are used to simulate, respectively, and the task execution success rate is compared, and the task execution success rate of 4 cases is obtained, as shown in Figure8.Figure 8
Comparison of the success rate of task grouping strategies under different task numbers. (a) Max-min. (b) MOS.
(a)(b)From the analysis in Figure8, it can be concluded that as the number of tasks increases, the success rate of the two algorithms decreases. As the task is successfully executed, the energy of mobile resources is consumed. Because the energy of mobile resources is limited, it is unable to undertake too large tasks, so the more tasks, the lower the success rate of execution.


### 4.4. Performance Comparison with Other Matching Algorithms

In order to evaluate the performance of the dynamic grid QoS service matching algorithm proposed in this paper, a series of experiments are carried out to compare the method proposed in this paper with other methods. Randomly generate 10,000 similar services for each node, and randomly generate QoS attribute values for each service, and convert them into values within a certain range according to the standardization of the attribute values, which is convenient for calculation. In order to improve the accuracy, each experiment was run 500 times, and the most suitable service was selected from 10,000 services each time, compare this method with Improved Genetic Algorithm (IGA) [35] and Artificial Neural Network Algorithm (ANNA) [36].We conduct experiments on the basis that each node has 500 candidate services. Here, user feedback evaluation after use is a standard for us to measure the reliability of the algorithm. After each experiment, the user satisfaction of the service will be recalculated. As the number of trials increases, the user’s satisfaction with the service will become more and more obvious; that is, the reliability of the algorithm will become higher and higher, and eventually become stable. As shown in Figure9(a), we can clearly see that, with the increase of users, the performance advantage of this algorithm will become more and more obvious. To study a single node in the simulation combination, gradually increase the number of candidate services, and the corresponding time consumption will also increase. From Figure 9(b), we can see that the algorithm proposed in this paper is faster than the other two algorithms that have been significantly improved, enabling users to more quickly and accurately find the optimal service that meets their needs and achieve optimal matching.Figure 9
Comparison of algorithm reliability and matching time of a single optimal service. (a) Comparison of algorithm reliability. (b) Comparison of the selection time of a single optimal service.
(a)(b)


## 4.1. User’s Preferred QoS Service Matching

This section verifies the effectiveness of the above algorithm through experiments. For the QoS service matching process that does not include user preferences, the algorithm in this paper and the calculation methods proposed in literature [11], literature [12], and literature [15] are implemented. The comparison result is shown in Figure 3. It can be seen from Figure 3 that the preference-based QoS matching algorithm, on the premise of more satisfying the demand, takes longer than the matching execution time without adding user preferences; that is, the matching execution efficiency is higher.Figure 3
Grid service matching time comparison chart.


## 4.2. Introducing Semantic QoS Service Matching

The matching algorithm uses a value between [0, 1] to represent the result of each match; as long as it is greater than or equal to the threshold specified by the user, it can be output to the user. The algorithm does not only filter from the service type. It not only considers the matching of the input and output parameters of the service, but also considers the matching of QoS, and more importantly, considers the user's preference. In this way, the found service can not only satisfy the user’s request, but also be close to the user's preferences, thereby more satisfying the user’s needs.Based on the above aspects, the algorithm has an overall improvement in the accuracy of service discovery. After the introduction of semantic ontology, compared with grammar-based service discovery, it can match input and output while also matching related entities. By setting different matching thresholds, the scope of service selection can be scaled. From this point of view, the algorithm increases the range of services that may participate in matching, which also improves the recall rate of services. Figures4 and 5 are comparison charts of the precision and recall of the algorithm in this paper and the comparison matching algorithm. It can be seen that the performance of the algorithm in this paper is the best.Figure 4
Comparison of recall rates.Figure 5
Accuracy comparison chart.


## 4.3. Task Scheduling of Grid Resources

The scheduling process of the MOS algorithm is shown in Figure6. Compare the traditional Max-Min scheduling algorithm and the MOS scheduling algorithm based on QoS constraints, as shown in Figure 7. It is not difficult to see that the overall completion time of the MOS algorithm has been greatly shortened. Compared with Max-Min algorithm, MOS scheduling algorithm also has a great reduction in execution cost.Figure 6
The scheduling process of the MOS algorithm. (a) Q1 queue scheduling situation. (b) Q2 queue scheduling situation. (c) Q3 queue scheduling situation. (d) Q4 queue scheduling situation.Figure 7
Comparison of scheduling between traditional algorithm and MOS algorithm. (a) Scheduling process of max-min. (b) Scheduling process of MOS.
(a)(b)Assume that the number of resources in the same grid domain is selected as 350, and the number of tasks increases from 50 to 500 in steps of 50. According to the above three grouping strategies, after grouping the number of tasks and when they are not grouping, the Min-Min algorithm and the algorithm in this paper are used to simulate, respectively, and the task execution success rate is compared, and the task execution success rate of 4 cases is obtained, as shown in Figure8.Figure 8
Comparison of the success rate of task grouping strategies under different task numbers. (a) Max-min. (b) MOS.
(a)(b)From the analysis in Figure8, it can be concluded that as the number of tasks increases, the success rate of the two algorithms decreases. As the task is successfully executed, the energy of mobile resources is consumed. Because the energy of mobile resources is limited, it is unable to undertake too large tasks, so the more tasks, the lower the success rate of execution.


## 4.4. Performance Comparison with Other Matching Algorithms

In order to evaluate the performance of the dynamic grid QoS service matching algorithm proposed in this paper, a series of experiments are carried out to compare the method proposed in this paper with other methods. Randomly generate 10,000 similar services for each node, and randomly generate QoS attribute values for each service, and convert them into values within a certain range according to the standardization of the attribute values, which is convenient for calculation. In order to improve the accuracy, each experiment was run 500 times, and the most suitable service was selected from 10,000 services each time, compare this method with Improved Genetic Algorithm (IGA) [35] and Artificial Neural Network Algorithm (ANNA) [36].We conduct experiments on the basis that each node has 500 candidate services. Here, user feedback evaluation after use is a standard for us to measure the reliability of the algorithm. After each experiment, the user satisfaction of the service will be recalculated. As the number of trials increases, the user’s satisfaction with the service will become more and more obvious; that is, the reliability of the algorithm will become higher and higher, and eventually become stable. As shown in Figure9(a), we can clearly see that, with the increase of users, the performance advantage of this algorithm will become more and more obvious. To study a single node in the simulation combination, gradually increase the number of candidate services, and the corresponding time consumption will also increase. From Figure 9(b), we can see that the algorithm proposed in this paper is faster than the other two algorithms that have been significantly improved, enabling users to more quickly and accurately find the optimal service that meets their needs and achieve optimal matching.Figure 9
Comparison of algorithm reliability and matching time of a single optimal service. (a) Comparison of algorithm reliability. (b) Comparison of the selection time of a single optimal service.
(a)(b)


## 5. Conclusion

Based on the analysis of existing QoS-based matching strategies, a dynamic grid QoS-based service matching algorithm is proposed. This article first combines semantic information, and not only considers the quality of service (QoS), but also considers user preferences, at the same time, fully considering the impact of QoS on task scheduling. A grid task scheduling algorithm (MOS) based on QoS constraints is proposed. Through simulation verification and analysis, the strategy in this paper can meet the needs of users with a higher success rate and shorter scheduling time and achieve precise service matching. At the same time, the task execution success rate is improved, and the system load balancing effect is also significantly improved.



---

*Source: 2884700-2021-06-11.xml*