| dc.creator | Tziritas, N. | en |
| dc.creator | Loukopoulos, T. | en |
| dc.creator | Lalis, S. | en |
| dc.creator | Lampsas, P. | en |
| dc.date.accessioned | 2015-11-23T10:52:49Z | |
| dc.date.available | 2015-11-23T10:52:49Z | |
| dc.date.issued | 2010 | |
| dc.identifier | 10.1007/978-3-642-15291-7_46 | |
| dc.identifier.isbn | 3642152902 | |
| dc.identifier.issn | 3029743 | |
| dc.identifier.uri | http://hdl.handle.net/11615/34140 | |
| dc.description.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. © 2010 Springer-Verlag. | en |
| dc.source.uri | http://www.scopus.com/inward/record.url?eid=2-s2.0-78249238821&partnerID=40&md5=c4a73bb9f7267de15c0151fe5c60d85e | |
| dc.subject | Agent migrations | en |
| dc.subject | Communication cost | en |
| dc.subject | Distributed algorithm | en |
| dc.subject | Hosting capacity | en |
| dc.subject | Message exchange | en |
| dc.subject | Networked embedded systems | en |
| dc.subject | Simulation experiments | en |
| dc.subject | Wireless nodes | en |
| dc.subject | Mobile agents | en |
| dc.subject | Embedded systems | en |
| dc.title | On deploying tree structured agent applications in networked embedded systems | en |
| dc.type | other | en |
