期刊文献+

移动自组织网络中服务组合方法 被引量:1

Service composition method in mobile Ad Hoc network
原文传递
导出
摘要 为了提高移动自组网中服务组合的成功率,基于新型节点模型和服务可并行执行的概念,提出了一种服务需求分段的服务组合方法.该方法将总的服务组合需求分成多段,每段分别在一组节点中执行,多个节点组协同共同完成服务组合.实验结果表明:所提出的方法和模型能减少服务组合执行的时间并提高服务组合的成功率. In order to improve the success rate of service composition,based on a new type of node model and the concept of service can be executed in parallel,a splitting approach for service requirement of service composition was proposed.This method split the total service composition requirement into service segments,and each service segment is performed in a group of nodes.Multiple nodes groups cooperate to complete the service composition.Experimental results show that the proposed method can reduce the service composition execution time and improve the success rate of service composition.
出处 《华中科技大学学报(自然科学版)》 EI CAS CSCD 北大核心 2013年第S2期10-13,共4页 Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金 国家重点基础研究发展计划资助项目(2012CB315802 2011CB302500 2011CB302704) 国家自然科学基金资助项目(61171102 61132001 61001118 61003067) 新一代宽带无线移动通信网科技重大专项资助项目(2011ZX03002-002-01 2010ZX03004-001 2012ZX03005-008-001) 教育部新世纪优秀人才计划资助项目(NECT-11-0592)
关键词 服务组合 移动自组织网络 新型节点 需求切分 service composition mobile ad hoc network cluster novel node requirement splitting
  • 相关文献

同被引文献15

  • 1Beach A,Gartrell M,Han R.Solutions to security and privacy issues in mobile social networking[C]∥Proc of CSE′09.Vancouver:IEEE,2009,4:1036-1042.
  • 2Li M,Cao N,Yu S,et al.Findu:privacy-preserving personal profile matching in mobile social networks[C]∥Proc of INFOCOM′11.Shanghai:IEEE,2011:2435-2443.
  • 3Du W,Atallah M J.Secure multi-party computation problems and their applications:a review and open problems[C]∥Proceedings of the 2001workshop on New security paradigms.Cloudcroft:ACM,2001:13-22.
  • 4Zhang R,Zhang J,Zhang Y,et al.Privacy-preserving profile matching for proximity-based mobile social networking[J].IEEE Journal on Selected Areas in Communications,2013,31(9):656-668.
  • 5Liang X,Li X,Zhang K,et al.Fully anonymous profile matching in mobile social networks[J].IEEE Journal on Selected Areas in Communications,2013,31(9):641-655.
  • 6Dong W,Dave V,Qiu L,et al.Secure friend discovery in mobile social networks[C]∥Proc of INFOCOM′11.Shanghai:IEEE,2011:1647-1655.
  • 7Lu R,Lin X,Liang X,et al.A secure handshake scheme with symptoms-matching for mhealthcare social network[J].Mobile Networks and Applications,2011,16(6):683-694.
  • 8Freedman M J,Nissim K,Pinkas B.Efficient private matching and set intersection[C]∥Proc of Advances in Cryptology-EUROCRYPT 2004.Berlin Heidelberg:Springer,2004:1-19.
  • 9Lu R,Lin X,Shen X.SPOC:a secure and privacypreserving opportunistic computing framework for mobile-healthcare emergency[J].IEEE Transactions on Parallel and Distributed Systems,2013,24(3):614-624.
  • 10Yang Z,Zhang B,Dai J,et al.E-smalltalker:a distributed mobile system for social networking in physical proximity[C]∥Proc of 2010IEEE 30th International Conference on Distributed Computing Systems(ICDCS).Genova:IEEE,2010:468-477.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部