Computer Science ›› 2015, Vol. 42 ›› Issue (12): 52-55.

Previous Articles     Next Articles

Pervasive Computing Environment Oriented Service Orchestration Framework for Android

GU Jing-xiao, PENG Xin and ZHAO Wen-yun   

  • Online:2018-11-14 Published:2018-11-14

Abstract: Mobile devices and smart phones are the main carriers of service aggregation and orchestration in pervasive computing environment.Services in pervasive computing environment have diverse forms,including remote Web services,local services within devices (such as local app and sensors inside) and context-aware services provided by the surrounding environment (such as environmental sensors).In addition,changing contexts raise new demands for the adaptive ability of software itself,but service orchestration on mobile devices is limited by computing power and resources.In order to solve the above problems,this paper addressed a pervasive computing environment oriented service orchestration framework on Android platform based on SOA,named ASOF.With the help of ASOF,mobile devices are able to obtain service templates of required business processes and bind services for abstract services in the templates.In this way,the devices can perform lightweight mixed service orchestration and dynamically gain the ability to invoke all types of services in pervasive computing environment.After that,a standard implementation of ASOF based on OSGi Felix framework was given and validated by a concrete case.

Key words: Pervasive Computing,SOA,Android,Service orchestration

[1] Satyanarayanan M.Pervasive computing:Vision and challenges[J].Personal Communications,IEEE,2001,8(4):10-17
[2] OSGi Homepage.http://www.osgi.org
[3] Knoernschild K.Java Application Architecture:Modularity Patterns with Examples Using OSGi[M].Prentice Hall Press,2012
[4] Mokhtar S B,Preuveneers D,Georgantas N,et al.EASY:Efficient semAntic Service discoverY in pervasive computing environments with QoS and context support[J].Journal of Systems and Software,2008,81(5):785-808
[5] 唐磊,淮晓永,李明树.一种基于上下文协商的动态服务组合方法[J].计算机研究与发展,2008,45(11):1902-1910Tang Lei,Huai Xiao-yong,Li Ming-shu.An approach to DynamicService Composition Based on Context Negotiation[J].Journal of Computer Research and Development,2008,45(11):1902-1910
[6] Kalasapur S,Kumar M,Shirazi B.Dynamic service composition in pervasive computing[J].IEEE Transactions on Parallel and Distributed Systems,2007,18(7):907-918
[7] Rouvoy R,Barone P,Ding Y,et al.Music:Middleware support for self-adaptation in ubiquitous and service-oriented environments [M]∥Software engineering for self-adaptive systems.Springer Berlin Heidelberg,2009:164-182
[8] Groba C,Clarke S.Opportunistic composition of sequentially-connected services in mobile computing environments[C]∥2011 IEEE International Conference on International Conference on Web Services (ICWS).IEEE,2011:17-24
[9] Guinard D,Trifa V,Karnouskos S,et al.Interacting with thesoa-based internet of things:Discovery,query,selection,and on-demand provisioning of web services[J].IEEE Transactions on Services Computing,2010,3(3):223-235
[10] 张威,史殿习.OSGi4HSI:普适计算环境下的异构服务集成框架.http://cpfd.cnki.com.cn/Article/CPFDTOTAL-JDMT-201010001006.htm

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] . [J]. Computer Science, 2018, 1(1): 1 .
[2] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[3] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[4] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[5] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[6] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[7] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[8] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[9] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[10] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .