Abstract
The major contribution of this chapter is that it proposes a novel QoS-based sensor cloud service composition framework using the power of the service paradigm. Two major components are involved in this framework. The first component is a sensor cloud service management framework that comprises a service model and an indexing model of sensor cloud services. Therefore, we present a new service model which aims to abstract a sensor cloud service by conceptualizing the spatio-temporal aspect of the service as its functional attributes and the qualitative aspects of the service as its non-functional attributes. The indexing model aims to spatio-temporally index sensor cloud services to enable an effective and efficient search of the services. We also define novel QoS attributes for evaluating sensor cloud services based on dynamic features of the sensor cloud. The composition combines sensor cloud services to provide a new sensor cloud service. Therefore, the second component of the proposed framework is a spatio-temporal linear composition algorithm which enables users to select optimal composition plans based on their own functional and non-functional requirements.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
Mahdi Abdelguerfi, Julie Givaudan, Kevin Shaw, and Roy Ladner. The 2-3tr-tree, a trajectory-oriented index structure for fully evolving valid-time spatio-temporal datasets. In Proceedings of the 10th ACM international symposium on Advances in geographic information systems, pages 29–34. ACM, 2002.
Hussein Al-Helal and Rose Gamble. Introducing replaceability into web service composition. IEEE Transactions on Services Computing, 7(2):198–209, 2014.
Michael Armbrust, Armando Fox, Rean Griffith, Anthony D Joseph, Randy Katz, Andy Konwinski, Gunho Lee, David Patterson, Ariel Rabkin, Ion Stoica, et al. A view of cloud computing. Communications of the ACM, 53(4):50–58, 2010.
Gerardo Canfora, Massimiliano Di Penta, Raffaele Esposito, and Maria Luisa Villani. A framework for qos-aware binding and re-binding of composite web services. Journal of Systems and Software, 81(10):1754–1769, 2008.
Ji-Dong Chen and Xiao-Feng Meng. Indexing future trajectories of moving objects in a constrained network. Journal of Computer Science and Technology, 22(2):245–251, 2007.
Ali Frihida, Danielle J Marceau, and Marius Theriault. Spatio-temporal object-oriented data model for disaggregate travel behavior. Transactions in GIS, 6(3):277–294, 2002.
Betsy George and Shashi Shekhar. Time-aggregated graphs for modeling spatio-temporal networks. In Journal on Data Semantics XI, pages 191–212. Springer, 2008.
Peter E Hart, Nils J Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2):100–107, 1968.
Bonggi Jun, Bonghee Hong, and Byunggu Yu. Dynamic splitting policies of the adaptive 3dr-tree for indexing continuously moving objects. In Database and expert systems applications, pages 308–317. Springer, 2003.
Youn Chul Jung, Hee Yong Youn, and Eun Seok Lee. Boundary-based time partitioning with flattened r-tree for indexing ubiquitous objects. In Mobile Ad-hoc and Sensor Networks, pages 804–814. Springer, 2005.
Sven Koenig and Maxim Likhachev. D* lite. In AAAI/IAAI, pages 476–483, 2002.
Sven Koenig and Maxim Likhachev. Improved fast replanning for robot navigation in unknown terrain. In IEEE International Conference on Robotics and Automation, 2002 (ICRA’02), volume 1, pages 968–975. IEEE, 2002.
Sven Koenig and Maxim Likhachev. Real-time adaptive a*. In Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, pages 281–288. ACM, 2006.
Sven Koenig, Maxim Likhachev, and David Furcy. Lifelong planning a-star. Artificial Intelligence, 155(1):93–146, 2004.
Richard E Korf. Real-time heuristic search. Artificial intelligence, 42(2):189–211, 1990.
Ying Li, Xiaorong Zhang, Yu Yu Yin, and Yuanlei Lu. Towards functional dynamic reconfiguration for service-based applications. In 2011 IEEE World Congress on Services (SERVICES), pages 467–473. IEEE, 2011.
Maxim Likhachev, David I Ferguson, Geoffrey J Gordon, Anthony Stentz, and Sebastian Thrun. Anytime dynamic a*: An anytime, replanning algorithm. In ICAPS, pages 262–271, 2005.
Kwei-Jay Lin, Jing Zhang, Yanlong Zhai, and Bin Xu. The design and implementation of service process reconfiguration with end-to-end QoS constraints in SOA. Service Oriented Computing and Applications, 4(3):157–168, 2010.
Nebil Ben Mabrouk, Sandrine Beauche, Elena Kuznetsova, Nikolaos Georgantas, and Valérie Issarny. QoS-aware service composition in dynamic service oriented environments. In Middleware 2009, pages 123–142. Springer, 2009.
Khaled Mahbub and Andrea Zisman. Replacement policies for service-based systems. In 2009 Workshops of Service-Oriented Computing (ICSOC/ServiceWave), pages 345–357. Springer, 2010.
Yannis Manolopoulos, Alexandros Nanopoulos, Apostolos N Papadopoulos, and Yannis Theodoridis. R-Trees: Theory and Applications. Springer Science & Business Media, 2010.
Mohamed F. Mokbel, Thanaa M. Ghanem, and Walid G. Aref. Spatio-temporal access methods. IEEE Data Eng. Bull., 26(2):40–49, 2003.
Matteo Mordacchini, Andrea Passarella, Marco Conti, Stuart M Allen, Martin J Chorley, Gualtiero B Colombo, Vlad Tanasescu, and Roger M Whitaker. Crowdsourcing through cognitive opportunistic networks. ACM Transactions on Autonomous and Adaptive Systems (TAAS), 10(2):13, 2015.
Mario A Nascimento and Jefferson RO Silva. Towards historical r-tree s. In Proceedings of the 1998 ACM symposium on Applied Computing, pages 235–240. ACM, 1998.
Luis Henrique Oliveira Rios and Luiz Chaimowicz. A survey and classification of a* based best-first heuristic search algorithms. In Advances in Artificial Intelligence–SBIA 2010, pages 253–262. Springer, 2011.
Hadi Saboohi, Amineh Amini, and Hassan Abolhassani. Failure recovery of composite semantic web services using subgraph replacement. In International Conference on Computer and Communication Engineering ICCCE 2008, pages 489–493. IEEE, 2008.
Simonas Å altenis, Christian S Jensen, Scott T Leutenegger, and Mario A Lopez. Indexing the positions of continuously moving objects, volume 29. ACM, 2000.
Anthony Stentz. Optimal and efficient path planning for partially-known environments. In Proceedings of 1994 IEEE International Conference on Robotics and Automation, pages 3310–3317. IEEE, 1994.
Yufei Tao and Dimitris Papadias. The mv3r-tree: A spatio-temporal access method for timestamp and interval queries. In Proceedings of Very Large Data Bases Conference (VLDB), 11–14 September, Rome, 2001.
Y Theoderidis, Michael Vazirgiannis, and Timos Sellis. Spatio-temporal indexing for large multimedia applications. In Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems, pages 441–448. IEEE, 1996.
Calvin P Tribby and Paul A Zandbergen. High-resolution spatio-temporal modeling of public transit accessibility. Journal of Applied Geography, 34:345–355, 2012.
Donggen Wang and Tao Cheng. A spatio-temporal data model for activity-based transport demand modelling. International Journal of Geographical Information Science, 15(6):561–585, 2001.
Liangzhao Zeng, Boualem Benatallah, Anne H. H. Ngu, Marlon Dumas, Jayant Kalagnanam, and Henry Chang. QoS-aware middleware for web services composition. IEEE Transactions on Software Engineering, 30(5):311–327, 2004.
Yanlong Zhai, Jing Zhang, and Kwei-Jay Lin. SOA middleware support for service process reconfiguration with end-to-end QoS constraints. In IEEE International Conference on Web Services (ICWS 2009), pages 815–822. IEEE, 2009.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Ghari Neiat, A., Bouguettaya, A. (2018). Spatio-Temporal Linear Composition of Sensor Cloud Services. In: Crowdsourcing of Sensor Cloud Services. Springer, Cham. https://doi.org/10.1007/978-3-319-91536-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-91536-4_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91535-7
Online ISBN: 978-3-319-91536-4
eBook Packages: Computer ScienceComputer Science (R0)