Title : 
Network lifetime maximization via sensor selection
         
        
            Author : 
Mo, Yilin ; Ling Shi ; Ambrosino, Roberto ; Sinopoli, Bruno
         
        
            Author_Institution : 
Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA
         
        
        
        
        
            Abstract : 
In this paper we consider the state estimation carried over a sensor network. At each time step, only a subset of all sensors are selected to send their observations to the fusion center, where a Kalman filter is implemented to perform the state estimation. The sensors are selected to maximize the lifetime of the network while maintaining a desired quality of state estimation accuracy. We propose a heuristic algorithm, based on convex optimization, for approximately solve the problem. An example of sensor network monitoring a diffusion process is presented to further illustrate the efficiency of the algorithm, comparing it with a greedy maximum energy available first algorithm (MEA) algorithm.
         
        
            Keywords : 
Kalman filters; convex programming; greedy algorithms; sensor fusion; set theory; state estimation; telecommunication network reliability; wireless sensor networks; Kalman filter; convex optimization problem; diffusion process monitoring; greedy MEA algorithm; greedy maximum-energy-available-first algorithm; heuristic algorithm; network lifetime maximization problem; sensor fusion center; sensor subset selection; state estimation quality; wireless sensor network; Application software; Computerized monitoring; Diffusion processes; Fabrication; Heuristic algorithms; Life estimation; Lifetime estimation; Optimal scheduling; Sensor fusion; State estimation;
         
        
        
        
            Conference_Titel : 
Asian Control Conference, 2009. ASCC 2009. 7th
         
        
            Conference_Location : 
Hong Kong
         
        
            Print_ISBN : 
978-89-956056-2-2
         
        
            Electronic_ISBN : 
978-89-956056-9-1