基于改进蚁群算法的可信服务发现

doi:10.3969/j.issn.1000-436x.2013.10.005

通信学报 ›› 2013, Vol. 34 ›› Issue (10): 37-48.doi: 10.3969/j.issn.1000-436x.2013.10.005

基于改进蚁群算法的可信服务发现

盛国军^1,²,温涛^1,²,郭权²,宋晓莹^1,²

¹ 东北大学软件中心，辽宁沈阳 110004
² 大连东软信息学院辽宁省网络安全与计算技术重点实验室，辽宁大连 116023

出版日期:2013-10-25 发布日期:2017-08-10
基金资助:
国家自然科学基金资助项目;国家自然科学基金资助项目

Trustworthy service discovery based on a modified ant colony algorithm

Guo-jun SHENG^1,²,Tao WEN^1,²,Quan GUO²,Xiao-ying SONG^1,²

¹ Software Center,Northeastern University,Shenyang 110004,China
² Liaoning Key Lab of Network Security and Computing Technology,Dalian Neusof t Information Institute,Dalian 116023,China

Online:2013-10-25 Published:2017-08-10
Supported by:
The National Natural Science Foundation of China;The National Natural Science Foundation of China

摘要/Abstract

摘要：

针对非结构化P2P网络中的服务发现问题，提出了一种基于改进蚁群算法的可信服务发现方法。该方法在传统蚁群算法基础上应用若干新的策略控制蚁群的行为，如动态蚁群策略、子蚂蚁策略、服务节点的信誉评估策略以及蚂蚁的恶意节点惩罚策略等，高信誉服务节点在蚂蚁的推荐下进行邻居更换和自组织。这些策略和方法为蚁群算法在分布式环境下服务发现的应用研究提供了一种新思路。实验结果表明，本算法在各种常见复杂网络环境下仍可保证较高的可信服务查准率和更高的综合服务发现效率,通过对实验数据的分析和解释得到了若干有益的结论，为进一步的研究工作奠定了基础。

关键词: 服务发现, 自组织网络, 可信服务, 动态蚁群策略, 子蚂蚁策略

Abstract:

Aiming at the problem of service discovery in unstructured P2P network,a trustworthy service discovery me-thod based on a modified ant colony algorithm was prop sed.Some novel policies were introduced to control the beha-vior of the ant colony,such as the dynamic ant colony policy,the sub-ant policy,the reputation evaluation policy to ser-vice peers,and the punishment policy to malicious peers.Service peers with high reputation could change their neighbors and make self-organization under the recommendation of ants.These policies and methods provide new ideas for the ap-plication researches of ant colony algorithms in the field of distributed service discovery.The results of experiments show that the proposed algorithm can guarantee higher trust service precision and better integrated service discovery performance in complex network environments,and some useful conclusions were obtained through the alysis and ex-planation of the experimental data,laying a solid foundation for further researches.

Key words: service discovery, self-organizing network, trustworthy service, dynamic ant colony policy, sub-ant policy

盛国军,温涛,郭权,宋晓莹. 基于改进蚁群算法的可信服务发现[J]. 通信学报, 2013, 34(10): 37-48.

Guo-jun SHENG,Tao WEN,Quan GUO,Xiao-ying SONG. Trustworthy service discovery based on a modified ant colony algorithm[J]. Journal on Communications, 2013, 34(10): 37-48.

图/表 8

图1

图2

图3

图4

图5

图6

图7

图8

参考文献 13

[1]	TAVAKOLIFARD M , ALMEROTH K C . A taxonomy to express open challenges in trust and reputation systems[J]. Journal of Communications, 2012,7(7): 538-551.
[2]	KAMVAR S D , SCHLOSSER M T,GARCIA-MOLINA H . The eigentrust algorithm for reputation management in P2P networks[A]. Proceedings of the 12th International Conference on World Wide Web[C]. New York,USA, 2003. 640-651.
[3]	DORIGO M , GAMBARDELLA L M . Ant colony system:a cooperative learning approach in the traveling salesman problem[J]. IEEE Transactions on Evolutionary Computing, 1997,1(1): 53-66.
[4]	MODICA G D , TOMARCHIO O , VITA L . A P2P based architecture for semantic Web service discovery[J]. International Journal of Software Engineering and Knowledge Engineering, 2011,21(7): 1013-1035.
[5]	ADALA A , TABBANE N . Discovery of semantic Web services with an enhanced-chord-based P2P network[J]. International Journal of Communication Systems, 2010,23(11): 1353-1365.
[6]	VAL E D , VASIRANI M , REBOLLO M ,et al. Enhancing decentralized service discovery through structural self-organization[A]. Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems[C]. Valencia,Spain, 2012. 1429-1430.
[7]	潘静, 徐锋, 吕建 . 面向可信服务选取的基于声誉的推荐者发现方法[J]. 软件学报, 2010,21(2): 388-400. PAN J , XU F , LV J . Reputation-based recommender discovery approach for service selection[J]. Journal of Software, 2010,21(2): 388-400.
[8]	谢晓芹, 宋超臣, 张志强 . 一种基于推荐网络和蚁群算法的服务发现方法[J]. 计算机学报, 2010,33(11): 2094-2103. XIE X Q , SONG C C , ZHANG Z Q . A service discovery method based on referral network and ant-colony algorithm[J]. Chinese Jour-nal of Computers, 2010,33(11): 2094-2103.
[9]	郑啸, 罗军舟, 宋爱波 . 基于 Agent和蚁群算法的分布式服务发现[J]. 软件学报, 2010,21(8): 1795-1809. ZHENG X , LUO J Z , SONG A B . Distributed service discovery based on agent and ant colony algorithm[J]. Journal of Software, 2010,21(8): 1795-1809.
[10]	FELIX G M , GREGORIO M P , ANTONIO F G S . TACS,a trust model for P2P networks[J]. Wireless Personal Communications, 2009,51: 153-164.
[11]	JOSANG A , ISMAIL R , BOYD C . A survey of trust and reputation systems for online service provision[J]. Decision Support Systems, 2007,43(2): 618-644.
[12]	COLORNI A , DORIGO M , MANIEZZO V . Distributed optimization by ant colonies[A]. Proceedings of ECAL91-European Conference on Artificial Life[C]. Paris,France, 1991. 134-142.
[13]	Stanford University.Stanford P2P sociology project[EB/OL]. .

[1]	刘辉, 刘鑫衍, 许艳, 仲红, 王梦. 隐私保护的VANET警告消息发布协议[J]. 通信学报, 2021, 42(8): 120-129.
[2]	赵海涛,高士顺,王海军,雍婷,魏急波. 无人机自主通信和组网能力评估方法[J]. 通信学报, 2020, 41(8): 87-98.
[3]	谷志茹,李敏,龙永红,舒小华,荣青. 基于GPCR的车辆自组织网络路由优化方法[J]. 通信学报, 2020, 41(7): 152-164.
[4]	董芳,胡宇翔,李鸥. 基于SDN的自组织网络路由框架及构建方法[J]. 通信学报, 2019, 40(9): 33-44.
[5]	宋彩霞,谭国真,丁男,步俊凌,张福新,刘明剑. 面向应用的车载自组织网络跨层多信道MAC协议[J]. 通信学报, 2016, 37(5): 95-105.
[6]	黄家玮,钟少华,刘联海,王建新. 车载自组网中基于车辆密度的多跳广播协议[J]. 通信学报, 2016, 37(12): 32-41.
[7]	郭显，冯涛，曹来成，王晶，鲁晔. 基于Yaksha密钥托管机制的命名数据网络内容发布/订阅系统[J]. 通信学报, 2015, 36(11): 127-135.
[8]	田浩,樊红,杜武. 基于用户社群关系的Web服务发现研究[J]. 通信学报, 2015, 36(10): 28-36.
[9]	李西洋1,2，范平志2. 移动自组织网络中的多信道MAC调度码的设计与分析[J]. 通信学报, 2014, 35(5): 8-64.
[10]	李西洋,范平志. 移动自组织网络中的多信道MAC调度码的设计与分析[J]. 通信学报, 2014, 35(5): 57-64.
[11]	杨卫东1,2，何云华2,3，孙利民2,3. 车载自组网节点轨迹隐私攻防博弈模型[J]. 通信学报, 2013, 34(Z1): 32-245.
[12]	杨卫东,何云华,孙利民. 车载自组网节点轨迹隐私攻防博弈模型[J]. 通信学报, 2013, 34(Z1): 240-245.
[13]	刘礼才,殷丽华,郭云川,孙燕. 基于CSP方法的移动自组织网络认证协议TAM的分析与改进[J]. 通信学报, 2013, 34(Z1): 58-66.
[14]	刘礼才1,2，殷丽华2，郭云川2，孙燕1,2. 基于CSP方法的移动自组织网络认证协议TAM的分析与改进[J]. 通信学报, 2013, 34(Z1): 8-66.
[15]	丰雷,李文璟,邱雪松. 适应自相似业务的无线网络自主CAC策略[J]. 通信学报, 2013, 34(8): 27-34.

基于改进蚁群算法的可信服务发现

Trustworthy service discovery based on a modified ant colony algorithm

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 8

参考文献 13

相关文章 15

Metrics

推荐阅读 0