Simultaneous Resource Allocation and Route Optimization in Dynamic Multi-Agent Networks

Amber Srivastava, Srinivasa M Salapaka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The objective of simultaneous resource allocation and route optimization problem is to overlay a network of communication resources on an existing network of sensors (or sites); to facilitate the flow of information packets, originating at each sensor, to a destination center (or central processing unit) such that the total cost of communication is minimized. This is an NP-hard problem and the associated cost function is riddled with multiple poor local minima even for fixed locations of sensors and destination center. In the case when the sensors and the destination center have associated dynamics, determining resource location and routing dynamics adds significantly to the complexity. Here we propose a framework that uses the Maximum-Entropy-Principle and a smooth approximation to the total communication cost as a Lyapunov function, to solve the simultaneous resource allocation and route optimization problem in a dynamic setting. Simulation results demonstrate that the proposed algorithm outperforms the frame-by-frame approach with regards to the practical feasibility of the resource dynamics apart from saving heavily on the computational expense involved in the latter.

Original languageEnglish (US)
Title of host publication2019 5th Indian Control Conference, ICC 2019 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages377-382
Number of pages6
ISBN (Electronic)9781538662465
DOIs
StatePublished - May 14 2019
Event5th Indian Control Conference, ICC 2019 - Delhi, India
Duration: Jan 9 2019Jan 11 2019

Publication series

Name2019 5th Indian Control Conference, ICC 2019 - Proceedings

Conference

Conference5th Indian Control Conference, ICC 2019
CountryIndia
CityDelhi
Period1/9/191/11/19

Fingerprint

Route Optimization
Resource Allocation
Resource allocation
Sensor
Sensors
Resources
Communication
Optimization Problem
Smooth Approximation
Dynamic Routing
Maximum Entropy Principle
Communication Cost
Lyapunov functions
NP-hard Problems
Overlay
Local Minima
Cost functions
Lyapunov Function
Program processors
Cost Function

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Control and Optimization

Cite this

Srivastava, A., & Salapaka, S. M. (2019). Simultaneous Resource Allocation and Route Optimization in Dynamic Multi-Agent Networks. In 2019 5th Indian Control Conference, ICC 2019 - Proceedings (pp. 377-382). [8715605] (2019 5th Indian Control Conference, ICC 2019 - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INDIANCC.2019.8715605

Simultaneous Resource Allocation and Route Optimization in Dynamic Multi-Agent Networks. / Srivastava, Amber; Salapaka, Srinivasa M.

2019 5th Indian Control Conference, ICC 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. p. 377-382 8715605 (2019 5th Indian Control Conference, ICC 2019 - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Srivastava, A & Salapaka, SM 2019, Simultaneous Resource Allocation and Route Optimization in Dynamic Multi-Agent Networks. in 2019 5th Indian Control Conference, ICC 2019 - Proceedings., 8715605, 2019 5th Indian Control Conference, ICC 2019 - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 377-382, 5th Indian Control Conference, ICC 2019, Delhi, India, 1/9/19. https://doi.org/10.1109/INDIANCC.2019.8715605
Srivastava A, Salapaka SM. Simultaneous Resource Allocation and Route Optimization in Dynamic Multi-Agent Networks. In 2019 5th Indian Control Conference, ICC 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. p. 377-382. 8715605. (2019 5th Indian Control Conference, ICC 2019 - Proceedings). https://doi.org/10.1109/INDIANCC.2019.8715605
Srivastava, Amber ; Salapaka, Srinivasa M. / Simultaneous Resource Allocation and Route Optimization in Dynamic Multi-Agent Networks. 2019 5th Indian Control Conference, ICC 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 377-382 (2019 5th Indian Control Conference, ICC 2019 - Proceedings).
@inproceedings{4fb8d9d18b234f808f4c6828ae04dce5,
title = "Simultaneous Resource Allocation and Route Optimization in Dynamic Multi-Agent Networks",
abstract = "The objective of simultaneous resource allocation and route optimization problem is to overlay a network of communication resources on an existing network of sensors (or sites); to facilitate the flow of information packets, originating at each sensor, to a destination center (or central processing unit) such that the total cost of communication is minimized. This is an NP-hard problem and the associated cost function is riddled with multiple poor local minima even for fixed locations of sensors and destination center. In the case when the sensors and the destination center have associated dynamics, determining resource location and routing dynamics adds significantly to the complexity. Here we propose a framework that uses the Maximum-Entropy-Principle and a smooth approximation to the total communication cost as a Lyapunov function, to solve the simultaneous resource allocation and route optimization problem in a dynamic setting. Simulation results demonstrate that the proposed algorithm outperforms the frame-by-frame approach with regards to the practical feasibility of the resource dynamics apart from saving heavily on the computational expense involved in the latter.",
author = "Amber Srivastava and Salapaka, {Srinivasa M}",
year = "2019",
month = "5",
day = "14",
doi = "10.1109/INDIANCC.2019.8715605",
language = "English (US)",
series = "2019 5th Indian Control Conference, ICC 2019 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "377--382",
booktitle = "2019 5th Indian Control Conference, ICC 2019 - Proceedings",
address = "United States",

}

TY - GEN

T1 - Simultaneous Resource Allocation and Route Optimization in Dynamic Multi-Agent Networks

AU - Srivastava, Amber

AU - Salapaka, Srinivasa M

PY - 2019/5/14

Y1 - 2019/5/14

N2 - The objective of simultaneous resource allocation and route optimization problem is to overlay a network of communication resources on an existing network of sensors (or sites); to facilitate the flow of information packets, originating at each sensor, to a destination center (or central processing unit) such that the total cost of communication is minimized. This is an NP-hard problem and the associated cost function is riddled with multiple poor local minima even for fixed locations of sensors and destination center. In the case when the sensors and the destination center have associated dynamics, determining resource location and routing dynamics adds significantly to the complexity. Here we propose a framework that uses the Maximum-Entropy-Principle and a smooth approximation to the total communication cost as a Lyapunov function, to solve the simultaneous resource allocation and route optimization problem in a dynamic setting. Simulation results demonstrate that the proposed algorithm outperforms the frame-by-frame approach with regards to the practical feasibility of the resource dynamics apart from saving heavily on the computational expense involved in the latter.

AB - The objective of simultaneous resource allocation and route optimization problem is to overlay a network of communication resources on an existing network of sensors (or sites); to facilitate the flow of information packets, originating at each sensor, to a destination center (or central processing unit) such that the total cost of communication is minimized. This is an NP-hard problem and the associated cost function is riddled with multiple poor local minima even for fixed locations of sensors and destination center. In the case when the sensors and the destination center have associated dynamics, determining resource location and routing dynamics adds significantly to the complexity. Here we propose a framework that uses the Maximum-Entropy-Principle and a smooth approximation to the total communication cost as a Lyapunov function, to solve the simultaneous resource allocation and route optimization problem in a dynamic setting. Simulation results demonstrate that the proposed algorithm outperforms the frame-by-frame approach with regards to the practical feasibility of the resource dynamics apart from saving heavily on the computational expense involved in the latter.

UR - http://www.scopus.com/inward/record.url?scp=85066624401&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85066624401&partnerID=8YFLogxK

U2 - 10.1109/INDIANCC.2019.8715605

DO - 10.1109/INDIANCC.2019.8715605

M3 - Conference contribution

AN - SCOPUS:85066624401

T3 - 2019 5th Indian Control Conference, ICC 2019 - Proceedings

SP - 377

EP - 382

BT - 2019 5th Indian Control Conference, ICC 2019 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -