A Centralized Service Discovery Algorithm via Multi-Stage Semantic Service Matching in Internet of Things

2017 ◽  
Author(s):  
Bing Jia ◽  
Wuyungerile Li ◽  
Tao Zhou
Keyword(s):  
Internet Of Things ◽  
Service Discovery ◽  
Service Matching ◽  
Multi Stage ◽  
Semantic Service

scholarly journals Virtualization Based Efficient Service Matching and Discovery in Internet of Things

Electronics ◽  
2020 ◽  
Vol 9 (6) ◽  
pp. 1007
Author(s):  
Zulfiqar Ali Khan ◽  
Israr Ullah ◽  
Muhammad Ibrahim ◽  
Muhammad Fayaz ◽  
Ayman Aljarbouh ◽  
...  
Keyword(s):  
Internet Of Things ◽  
Service Discovery ◽  
Processing Time ◽  
Service Selection ◽  
Geographic Area ◽  
Residual Energy ◽  
Service Matching ◽  
Domain Specific ◽  
Proposed Model ◽  
Iot Devices

Internet of Things (IoT) is getting more popular day by day, which triggers its adoption for solving domain specific problems. Cities are becoming smart by gathering the context knowledge through sensors and controlling specific parameters through actuators. Dynamically discovering and integrating different data streams from different sensors is a major challenge these days. In this paper, a service matchmaking algorithm is presented for service discovery utilizing IoT devices and services in a particular geographic area. It helps us to identify services based on a variety of parameters (location, query size and processing time, etc.). Customization of service selection and discovery are also explored. The conceptual framework is provided for the proposed model along with a matchmaking algorithm based on IoT devices virtualization. The simulation results elaborate the increased complexity of processing time with respect to the increasing pool of available services. The average processing time varies as the number of conditions are multiplied. Query size and complexity increases with additional number of filters and conditions which results in the reduction of the number of matching services. Moreover, upon decreasing the radius of geographic search area, the number of candidate services decreases for service matching algorithm. This is based on the assumption that IoT devices and services are evenly distributed in a given geographic area. Similarly, the remaining energy of IoT devices is also assumed to be uniformly distributed and, therefore, if we are interested in IoT devices or services with more residual energy, then a limited number of IoT devices or services will fulfill this criterion.

The Research of Semantic Web Service Matching Algorithm Based on the Formal Concept Analysis

2013 ◽  
Vol 760-762 ◽  
pp. 1708-1712
Author(s):  
Ying Fang Li ◽  
Ying Jiang Li ◽  
Yan Li ◽  
Yang Bo
Keyword(s):  
Semantic Web ◽  
Web Service ◽  
Formal Concept Analysis ◽  
Service Discovery ◽  
Concept Lattice ◽  
Concept Analysis ◽  
Formal Concept ◽  
Semantic Web Service ◽  
Matching Algorithm ◽  
Service Matching

At present, as the number of web services resources on the network drastically increased, how to quickly and efficiently find the needed services from publishing services has become a problem to resolve. Aiming at the problems of low efficiency in service discovery of traditional web service, the formal concept analysis ( FCA) is introduced into the semantic Web service matching, and a Matching Algorithm based semantic web service is proposed. With considering the concept of limited inheritance,this method introduces the concept of limited inheritance to the semantic similarity calculation based on the concept lattice. It is significant in enhancing the service function matching in practical applications through adjust the calculation.

WikiServe: Using Wikipedia to Match IoT based Services for Situation Response

2021 ◽  
Author(s):  
Sazid Zaman Khan ◽  
Alan Colman ◽  
Iqbal H. Sarker
Keyword(s):  
Internet Of Things ◽  
Natural Disaster ◽  
Smart Devices ◽  
Baseline Method ◽  
Service Matching ◽  
Ontological Model ◽  
Ranked List ◽  
F Measure ◽  
The Web ◽  
Better Than

A large number of smart devices (things) are being deployed with the swift development of Internet of Things (IOT). These devices, owned by different organizations, have a wide variety of services to offer over the web. During a natural disaster or emergency (i.e., a situation), for example, relevant IOT services can be found and put to use. However, appropriate service matching methods are required to find the relevant services. Organizations that manage situation responses and organizations that provide IOT services are likely to be independent of each other, and therefore it is difficult for them to adopt a common ontological model to facilitate the service matching. Moreover, there exists a large conceptual gap between the domain of discourse for situations and the domain of discourse for services, which cannot be adequately bridged by existing techniques. In this paper, we address these issues and propose a new method, WikiServe, to identify IOT services that are functionally relevant to a given situation. Using concepts (terms) from situation and service descriptions, WikiServe employs Wikipedia as a knowledge source to bridge the conceptual gap between situation and service descriptions and match functionally relevant IOT services for a situation. It uses situation terms to retrieve situation related articles from Wikipedia. Then it creates a ranked list of services for the situation using the weighted occurrences of service terms in weighted situation articles. WikiServe performs better than a commonly used baseline method in terms of Precision, Recall and F measure for service matching.

A Practical Approach to Enhancement of Accuracy of Similarity Model Using WordNet towards Semantic Service Discovery

2014 ◽  
pp. 245-265
Author(s):  
Chellammal Surianarayanan ◽  
Gopinath Ganapathy ◽  
Manikandan Sethunarayanan Ramasamy
Keyword(s):  
Web Service ◽  
Service Discovery ◽  
Service Providers ◽  
Computation Time ◽  
Proposed Model ◽  
Similarity Model ◽  
Domain Ontologies ◽  
Semantic Service ◽  
General Ontology ◽  
Semantic Web Service Discovery

Semantic Web service discovery provides high retrieval accuracy. However, it imposes an implicit constraint to service clients that the clients must express their queries with the same domain ontologies as used by the service providers. Fulfilling this criterion is very tedious. Hence, a WordNet (general ontology)-based similarity model is proposed for service discovery, and its accuracy is enhanced to a level comparable to the accuracy of computing similarity using service specific ontologies. This is done by optimizing similarity threshold, which refers to a minimum similarity that is required to decide whether a given pair of services is similar or not. The proposed model is implemented and results are presented. The approach warrants clients to express their queries without specifying any ontology and alleviates the problem of maintaining complex domain ontologies. Moreover, the computation time of WordNet-based model is very low when compared to specific ontology-based model.

CbSSDF

2013 ◽  
pp. 123-145
Author(s):  
Xiaofeng Du ◽  
Malcolm Munro ◽  
William Song
Keyword(s):  
Web Services ◽  
Service Discovery ◽  
Process Management ◽  
Enterprise Application Integration ◽  
Service Description ◽  
Enterprise Application ◽  
Efficiency And Effectiveness ◽  
Description Framework ◽  
Semantic Service ◽  
Service Standards

Web services as a new distributed system technology have been widely adopted by industries in the areas, such as enterprise application integration (EAI), business process management (BPM), and virtual organization (VO). However, lack of semantics in the current Web service standards has become a major barrier in service discovery and composition. To tackle the semantic issues of Web services, this paper proposes a comprehensive semantic service description framework – CbSSDF and a two-step service discovery mechanism based on CbSSDF—to help service users to easily locate their required services. The authors give a detailed explanation of CbSSDF, and then evaluate the framework by comparing it with OWL-S to examine how the proposed framework can improve the efficiency and effectiveness of service discovery and composition. The evaluation is carried out by analysing the different proposed solutions based on these two frameworks for achieving a series of tasks in a scenario.

CbSSDF

2011 ◽  
Vol 2 (4) ◽  
pp. 82-103 ◽  
Author(s):  
Xiaofeng Du ◽  
Malcolm Munro ◽  
William Song
Keyword(s):  
Web Services ◽  
Service Discovery ◽  
Process Management ◽  
Enterprise Application Integration ◽  
Service Description ◽  
Major Barrier ◽  
Enterprise Application ◽  
Efficiency And Effectiveness ◽  
Description Framework ◽  
Semantic Service

Web services as a new distributed system technology have been widely adopted by industries in the areas, such as enterprise application integration (EAI), business process management (BPM), and virtual organization (VO). However, lack of semantics in the current Web service standards has become a major barrier in service discovery and composition. To tackle the semantic issues of Web services, this paper proposes a comprehensive semantic service description framework – CbSSDF and a two-step service discovery mechanism based on CbSSDF—to help service users to easily locate their required services. The authors give a detailed explanation of CbSSDF, and then evaluate the framework by comparing it with OWL-S to examine how the proposed framework can improve the efficiency and effectiveness of service discovery and composition. The evaluation is carried out by analysing the different proposed solutions based on these two frameworks for achieving a series of tasks in a scenario.

Sign in / Sign up

Export Citation Format

Share Document