Computing mobile agent routes with node-wise constraints in distributed communication systems

Authors:
Amir Elalouf;Eugene Levner;T. C. Edwin Cheng
Affiliations:
Bar Ilan University, Ramat Gan, Israel;Bar Ilan University, Ramat Gan, Israel;The Hong Kong Polytechnic University, Hong Kong
Venue:
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Year:
2011

Citing 9
Cited 0

Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
Applications of intelligent agents

Agent technology
Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
Introduction to Algorithms

Introduction to Algorithms
An improved FPTAS for restricted shortest path

Information Processing Letters
Finding a path subject to many additive QoS constraints

IEEE/ACM Transactions on Networking (TON)
On Computing Mobile Agent Routes for Data Fusion in Distributed Sensor Networks

IEEE Transactions on Knowledge and Data Engineering
Multiresolution data integration using mobile agents in distributedsensor networks

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A simple efficient approximation scheme for the restricted shortest path problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A basic problem in the quality-of-service (QoS) analysis of multiagent distributed systems is to find optimal routes for the mobile agents that incrementally fuse the data as they visit hosts in the distributed system. The system is modeled as a directed acyclic graph in which the nodes represent hosts and the edges represent links between them. Each edge is assigned a cost (or benefit) and weights that represent link delay, reliability, or other QoS parameters. The agent scheduling problem is viewed as a constrained routing problem in which a maximum-benefit (or minimum-cost) route connecting the source and the destination subject to QoS constraints is to be found. We study approximation algorithms called ‘fully polynomial time approximation schemes' (FPTAS) for solving the problem. We suggest an accelerating technique that improves known FPTAS, e.g., Hassin's (1992); Camponogara & Shima's (2010); and Elalouf et al. (2011) algorithms, and present new FPTASs.