By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jianguo Wang ; Dept. of Electron. Eng., Beijing Inst. of Technol. ; Peikun He ; Qi Yuan ; Peikang Huang

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

Published in:

Signal Processing, 2006 8th International Conference on  (Volume:4 )

Date of Conference:

16-20 2006