中国科学院深圳先进技术研究院机构知识库(SIAT OpenIR): Single and Group Agent Migration: Algorithms, Bounds, and Optimality Issues
SIAT OpenIR  > 数字所
Single and Group Agent Migration: Algorithms, Bounds, and Optimality Issues
Tziritas, Nikos; Khan, Samee Ullah; Loukopoulos, Thanasis; Lalis, Spyros; Xu, Cheng-Zhong; Lampsas, Petros
2014
Source PublicationIEEE TRANSACTIONS ON COMPUTERS
Subtype期刊论文
AbstractRecent embedded middleware platforms enable the structuring of an application as a set of collaborating agents deployed on various nodes of the underlying wireless sensor network (WSN). Of particular importance is the network cost incurred due to agent communication, which in turn depends on how the agents are placed within the WSN system. In this paper, we present two agent migration algorithms with the aim of minimizing the total network overhead. The first one takes independent single agent migration decisions, while the second one considers groups of agents for migration. Both algorithms work in a fully distributed fashion based on the knowledge available locally at each node, and can be used both for one-shot initial application deployment as well as for the continuous updating of agent placement. We also propose two methodologies to tackle the problem when WSN nodes have limited capacity. We show through theoretical analysis that one of our algorithms (called GRAL*) always results in an optimal placement, while for the rest of the algorithms, we derive approximation ratios pertaining to their performance. We evaluate the performance of our algorithms through a series of simulation experiments. Results show that group migration algorithms are superior compared to single agent migration algorithms with the performance difference reaching 34% for some settings.
URL查看原文
Indexed BySCI
Language英语
Department云计算研究中心
Document Type期刊论文
Identifierhttp://ir.siat.ac.cn/handle/172644/6008
Collection数字所
AffiliationIEEE TRANSACTIONS ON COMPUTERS
Recommended Citation
GB/T 7714
Tziritas, Nikos,Khan, Samee Ullah,Loukopoulos, Thanasis,et al. Single and Group Agent Migration: Algorithms, Bounds, and Optimality Issues[J]. IEEE TRANSACTIONS ON COMPUTERS,2014.
APA Tziritas, Nikos,Khan, Samee Ullah,Loukopoulos, Thanasis,Lalis, Spyros,Xu, Cheng-Zhong,&Lampsas, Petros.(2014).Single and Group Agent Migration: Algorithms, Bounds, and Optimality Issues.IEEE TRANSACTIONS ON COMPUTERS.
MLA Tziritas, Nikos,et al."Single and Group Agent Migration: Algorithms, Bounds, and Optimality Issues".IEEE TRANSACTIONS ON COMPUTERS (2014).
Files in This Item: Download All
File Name/Size DocType Version Access License
数字-云计算2014003.pdf(3613KB) 开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Tziritas, Nikos]'s Articles
[Khan, Samee Ullah]'s Articles
[Loukopoulos, Thanasis]'s Articles
Baidu academic
Similar articles in Baidu academic
[Tziritas, Nikos]'s Articles
[Khan, Samee Ullah]'s Articles
[Loukopoulos, Thanasis]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Tziritas, Nikos]'s Articles
[Khan, Samee Ullah]'s Articles
[Loukopoulos, Thanasis]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: 数字-云计算2014003.pdf
Format: Adobe PDF
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.