Shortest Paths Based Web Service Selection in Internet of Things
Joint Authors
Source
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-10, 10 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-06-26
Country of Publication
Egypt
No. of Pages
10
Main Subjects
Abstract EN
The connecting of things to the Internet makes it possible for smart things to access all kinds of Web services.
However, smart things are energy-limited, and suitable selection of Web services will consume less resources.
In this paper, we study the problem of selecting some Web service from the candidate set.
We formulate this selection of Web services for smart things as single-source many-target shortest path problem.
We design algorithms based on the Dijkstra and breadth-first search algorithms, propose an efficient pruning algorithm for breadth-first search, and analyze their performance of number of iterations and I/O cost.
Our empirical evaluation on real-life graphs shows that our pruning algorithm is more efficient than the breadth-first search algorithm.
American Psychological Association (APA)
Yin, Xiangdong& Yang, Jie. 2014. Shortest Paths Based Web Service Selection in Internet of Things. Journal of Sensors،Vol. 2014, no. 2014, pp.1-10.
https://search.emarefa.net/detail/BIM-1042994
Modern Language Association (MLA)
Yin, Xiangdong& Yang, Jie. Shortest Paths Based Web Service Selection in Internet of Things. Journal of Sensors No. 2014 (2014), pp.1-10.
https://search.emarefa.net/detail/BIM-1042994
American Medical Association (AMA)
Yin, Xiangdong& Yang, Jie. Shortest Paths Based Web Service Selection in Internet of Things. Journal of Sensors. 2014. Vol. 2014, no. 2014, pp.1-10.
https://search.emarefa.net/detail/BIM-1042994
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1042994