Applications of Connectivity Graph Processes in Networked Sensing and Control
This paper concerns the problem of controlling mobile nodes in a network in such a way that the resulting graph-encoding of the inter-node information flow exhibits certain desirable properties. As a sequence of such transitions between different graphs occurs, the result is a graph process. In this paper, we not only characterize the reachability properties of these graph processes, but also put them to use in a number of applications, ranging from multi-agent formation control, to optimal collaborative beamforming in sensor networks.
KeywordsSensor Network Mobile Node Connectivity Graph Linear Matrix Inequality Beam Pattern
Unable to display preview. Download preview PDF.