Exploiting Sparse Dynamics For Bandwidth Reduction In Cooperative   Sensing Systems
  Recently, there has been a significant interest in developing cooperative sensing systems for certain types of wireless applications. In such systems, a group of sensing nodes periodically collect measurements about the signals being observed in the given geographical region and transmit these measurements to a central node, which in turn processes this information to recover the signals. For example, in cognitive radio networks, the signals of interest are those generated by the primary transmitters and the sensing nodes are the secondary users. In such networks, it is critically important to be able to reliably determine the presence or absence of primary transmitters in order to avoid causing interference. The standard approach to transmit these measurements from sensor the nodes to the fusion center has been to use orthogonal channels. Such an approach quickly places a burden on the control-channel-capacity of the network that would scale linearly in the number of cooperating sensing nodes. In this paper, we show that as long as one condition is satisfied: the dynamics of the observed signals are sparse, i.e., the observed signals do not change their values very rapidly in relation to the time-scale at which the measurements are collected, we can significantly reduce the control bandwidth of the system while achieving the full (linear) bandwidth performance. 
Harish Ganapathy, Constantine Caramanis and Lei Ying
cs.IT math.IT