Response to Tasks of Dynamical Arrival in Sensor Resource Allocation with the Shortest Augmenting Path Algorithm

Author

Wang, Jianguo ; He, Peikun ; Yuan, Qi ; Huang, Peikang

Author_Institution

Dept. of Electron. Eng., Beijing Inst. of Technol.

Volume

4

fYear

2006

fDate

16-20 2006

Abstract

A shortest augmenting path (SAP) based sensitivity analysis approach is developed to respond to tasks of dynamical arrival in this paper. The sensor resource allocation problem is formulated as a linear programming problem. Its dual problem and the complementary slackness conditions are given. The SAP algorithm with its computational steps, data structure and computational complexity is presented. The sensitivity analysis of workload is discussed. The computational results show that sensitivity analysis method via SAP is superior to the straightforward method via SAP from scratch in computational performance

Keywords

computational complexity; linear programming; sensitivity analysis; sensors; complementary slackness conditions; computational complexity; data structure; dynamical arrival; linear programming problem; sensitivity analysis; sensor resource allocation problem; shortest augmenting path algorithm; Aerospace electronics; Aerospace engineering; Aerospace industry; Capacitive sensors; Electronics industry; Helium; Industrial electronics; Linear programming; Resource management; Sensitivity analysis;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing, 2006 8th International Conference on

Conference_Location

Beijing

Print_ISBN

0-7803-9736-3

Electronic_ISBN

0-7803-9736-3

Type

conf

DOI

10.1109/ICOSP.2006.346062

Filename

4129754