Discrete Optimization Problem in Local Networks and Data Alignment
IEEE Transactions on Computers
Routing a vehicle of capacity greater than one
Discrete Applied Mathematics
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Lifespan-aware routing for wireless sensor networks
KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part II
| Hi-index | 0.00 |
In the presented paper, we propose to exploit routing organization for the purpose of managing network resources. According to our assumptions, we have the same quantity of materials, objects, tokens, tools etc. at our disposal in every node of the network. During network operation we must distribute resources between these nodes. It should be carried out as instantaneously and as economically as possible. Multi-Agent Systems are also used to deal with this kind of tasks and the centralised algorithms presented in this paper are to be used to measure the efficiency of the distributed MAS solution. From the logistical point of view, we have a sequence of stages with different states of tokens (objects). The criterion of optimal redeployment among nodes is, as usual, minimal cost and, indirectly, time as well. The levels of resources in nodes change as the node role changes from the supplier to the receiver and inversely. In practice, there are many applications of such tasks in logistics, military regrouping, elaboration of evacuation strategy, warehouse management etc. The distances between nodes can be fixed or may vary. This varied approach does not complicate our problem essentially, however we should remember, that this parameter influences the total redeployment cost.