Abstract
Distributed scheduling of sensor networks for identification of spatio-temporal processesAn approach to determine a scheduling policy for a sensor network monitoring some spatial domain in order to identify unknown parameters of a distributed system is discussed. Given a finite number of possible sites at which sensors are located, the activation schedule for scanning sensors is provided so as to maximize a criterion defined on the Fisher information matrix associated with the estimated parameters. The related combinatorial problem is relaxed through operating on the density of sensors in lieu of individual sensor positions. Then, based on the adaptation of pairwise communication algorithms and the idea of running consensus, a numerical scheme is developed which distributes the computational burden between the network nodes. As a result, a simple exchange algorithm is outlined to solve the design problem in a decentralized fashion.
Subject
Applied Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference46 articles.
1. Randomized gossip algorithms;S. Boyd;IEEE Transactions on Information Theory,2006
2. Enforcing consensus while monitoring the environment in wireless sensor network;P. Braca;IEEE Transactions on Signal Processing,2008
3. Sensor networks and cooperative control;C. Cassandras;European Journal of Control,2005
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献