Hdl Handle:
http://hdl.handle.net/10545/620857
Title:
An efficient algorithm for partially matched services in internet of services
Authors:
Ahmed, Mariwan; Liu, Lu ( 0000-0003-1013-4507 ) ; Hardy, James; Yuan, Bo; Antonopoulos, Nikolaos
Abstract:
Internet 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.
Affiliation:
University of Derby
Citation:
Ahmed, M. et al (2016), 'An efficient algorithm for partially matched services in internet of services', Personal and Ubiquitous Computing, 20 (3):283
Publisher:
Springer
Journal:
Personal and Ubiquitous Computing
Issue Date:
11-May-2016
URI:
http://hdl.handle.net/10545/620857
DOI:
10.1007/s00779-016-0917-9
Additional Links:
http://link.springer.com/10.1007/s00779-016-0917-9
Type:
Article
Language:
en
ISSN:
1617-4909
EISSN:
1617-4917
Appears in Collections:
Department of Electronics, Computing & Maths

Full metadata record

DC FieldValue Language
dc.contributor.authorAhmed, Mariwanen
dc.contributor.authorLiu, Luen
dc.contributor.authorHardy, Jamesen
dc.contributor.authorYuan, Boen
dc.contributor.authorAntonopoulos, Nikolaosen
dc.date.accessioned2016-11-15T12:35:07Z-
dc.date.available2016-11-15T12:35:07Z-
dc.date.issued2016-05-11-
dc.identifier.citationAhmed, M. et al (2016), 'An efficient algorithm for partially matched services in internet of services', Personal and Ubiquitous Computing, 20 (3):283en
dc.identifier.issn1617-4909-
dc.identifier.doi10.1007/s00779-016-0917-9-
dc.identifier.urihttp://hdl.handle.net/10545/620857-
dc.description.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.en
dc.language.isoenen
dc.publisherSpringeren
dc.relation.urlhttp://link.springer.com/10.1007/s00779-016-0917-9en
dc.rightsArchived with thanks to Personal and Ubiquitous Computingen
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/en
dc.subjectEmergency service selectionen
dc.subjectQuality of Serviceen
dc.subjectInternet of Thingsen
dc.subjectPartial matchingen
dc.titleAn efficient algorithm for partially matched services in internet of servicesen
dc.typeArticleen
dc.identifier.eissn1617-4917-
dc.contributor.departmentUniversity of Derbyen
dc.identifier.journalPersonal and Ubiquitous Computingen
This item is licensed under a Creative Commons License
Creative Commons
All Items in UDORA are protected by copyright, with all rights reserved, unless otherwise indicated.