A decentralized H∞ routing control strategy for mobile networked multi-agents

Authors:
F. Abdollahi;K. Khorasani
Affiliations:
Faculty of Electrical Engineering, Amirkabir University of Technology, Tehran, Iran and Department of Electrical and Computer Engineering, Concordia University, Montreal, Quebce, Canada;Department of Electrical and Computer Engineering, Concordia University, Montreal, Canada
Venue:
ACC'09 Proceedings of the 2009 conference on American Control Conference
Year:
2009

Citing 8
Cited 1

Deterministic and Stochastic Time-Delay Systems

Deterministic and Stochastic Time-Delay Systems
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Maximum lifetime routing in wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
An h-infinity dynamic routing control of networked multi-agent systems

An h-infinity dynamic routing control of networked multi-agent systems
Robust stability and controllability of stochastic differential delay equations with Markovian switching

Automatica (Journal of IFAC)
A novel Hα control strategy for design of a robust dynamic routing algorithm in traffic networks

IEEE Journal on Selected Areas in Communications
Distributed-information neural control: the case of dynamic routing in traffic networks

IEEE Transactions on Neural Networks
A Survey of Routing Protocols that Support QoS in Mobile Ad Hoc Networks

IEEE Network: The Magazine of Global Internetworking

On the Robust Stability, Stabilization, and Stability Radii of Continuous-Time Infinite Markov Jump Linear Systems

SIAM Journal on Control and Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel Markovian jump model for developing routing algorithms in mobile networks that encounter variable number of nodes as well as changing number of destinations. The changes in the number of active destination nodes are represented by singular switching systems where a unified H∞ decentralized routing control is proposed and implemented. The resulting optimization problem and the corresponding associated physical constraints are then expressed as Linear Matrix Inequality (LMI) conditions.