An efficient algorithm for partially matched services in internet of services
AffiliationUniversity of Derby
MetadataShow full item record
AbstractInternet of Things (IoT) connects billions of devices in an Internet-like structure. Each device encapsulated as a real-world service which provides functionality and exchanges information with other devices. This large-scale information exchange results in new interactions between things and people. Unlike traditional web services, internet of services is highly dynamic and continuously changing due to constant degrade, vanish and possibly reappear of the devices, this opens a new challenge in the process of resource discovery and selection. In response to increasing numbers of services in the discovery and selection process, there is a corresponding increase in number of service consumers and consequent diversity of quality of service (QoS) available. Increase in both sides’ leads to the diversity in the demand and supply of services, which would result in the partial match of the requirements and offers. This paper proposed an IoT service ranking and selection algorithm by considering multiple QoS requirements and allowing partially matched services to be counted as a candidate for the selection process. One of the applications of IoT sensory data that attracts many researchers is transportation especially emergency and accident services which is used as a case study in this paper. Experimental results from real-world services showed that the proposed method achieved significant improvement in the accuracy and performance in the selection process.
CitationAhmed, M. et al (2016), 'An efficient algorithm for partially matched services in internet of services', Personal and Ubiquitous Computing, 20 (3):283
JournalPersonal and Ubiquitous Computing
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as Archived with thanks to Personal and Ubiquitous Computing