Name
Abstract | ||
|---|---|---|
Embedded applications can be structured in terms of mobile agents that are flexibly installed on available nodes. In wireless systems, such nodes typically have limited battery and memory resources; therefore it is important to place agents judiciously. In this paper we tackle the problem of placing a newcomer agent in such a system. The problem has two main components. First, enough memory space must be found or created at some node to place the agent. Second, the placement should be energy efficient. We present heuristics for tackling these two goals in a stepwise fashion, as well as a branch and bound method for achieving both goals at the same time. Our algorithms are centralized assuming a single entry point through which agents are injected into the system, with adequate knowledge of the system state and enough resources to run the proposed algorithms. The algorithms are evaluated under different simulated scenarios, and the tradeoffs across the two metrics (space, energy) are identified. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/IPDPSW.2010.5470786 | Parallel & Distributed Processing, Workshops and Phd Forum |
Keywords | Field | DocType |
mobile agents,mobile computing,software metrics,tree searching,agent placement,branch-and-bound method,energy metric,energy optimization,memory space,mobile agents,space metric,wireless embedded systems,agent placement,bin packing,branch and bound,constrained optimization,embedded systems,knapsack,wireless networks | Mobile computing,Wireless network,Branch and bound,Space technology,Efficient energy use,Computer science,Heuristics,Application software,Bin packing problem,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-1-4244-6533-0 | 7 | 0.46 |
References | Authors | |
12 | 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 |