Name
Abstract | ||
|---|---|---|
Given an application structured as a set of communicating mobile agents and a set of wireless nodes with sensing/actuating capabilities and agent hosting capacity constraints, the problem of deploying the application consists of placing all the agents on appropriate nodes without violating the constraints. This paper describes distributed algorithms that perform agent migrations until a "good" mapping is reached, the optimization target being the communication cost due to agent-level message exchanges. All algorithms are evaluated using simulation experiments and the most promising approaches are identified. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-15291-7_46 | Euro-Par (2) |
Keywords | Field | DocType |
communication cost,agent application,simulation experiment,actuating capability,agent migration,optimization target,message exchange,networked embedded system,promising approach,mobile agent,deploying tree,capacity constraint,appropriate node,embedded system,tree structure,distributed algorithm | Wireless,Computer science,Mobile agent,Computer network,Distributed algorithm,Wireless sensor network,Distributed computing | Conference |
Volume | ISSN | ISBN |
6272 | 0302-9743 | 3-642-15290-2 |
Citations | PageRank | References |
8 | 0.49 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikos Tziritas | 1 | 230 | 21.85 |
| Thanasis Loukopoulos | 2 | 293 | 30.66 |
| Spyros Lalis | 3 | 208 | 35.55 |
| Petros Lampsas | 4 | 85 | 9.10 |