Marian Codreanu

Many natural signals possess only a few degrees of freedom. For instance, the occupied radio spectrum may be intermittently concentrated to only a few frequency bands of the system bandwidth. This special structural feature - signal sparsity - is conducive in designing efficient signal processing techniques for wireless networks. In particular, the signal sparsity can be leveraged by the recently emerged joint sampling and compression paradigm, compressed sensing (CS). This monograph reviews several recent CS advancements in wireless networks with an aim to improve the quality of signal reconstruction or detection while reducing the use of energy, radio, and computation resources. The monograph covers a diversity of compressive data reconstruction, gathering, and detection frameworks in cellular, cognitive, and wireless sensor networking systems. The monograph first gives an overview of the principles of CS for the readers unfamiliar with the topic. For the researchers knowledgeable in CS, the monograph provides in-depth reviews of several interesting CS advancements in designing tailored CS reconstruction techniques for wireless applications. The monograph can serve as a basis for the researchers intended to start working in the field, and altogether, lays a foundation for further research in the covered areas.

The weighted sum-rate maximization (WSRMax) problem plays a central role in many network control and optimization methods, such as power control, link scheduling, cross-layer control, network utility maximization. The problem is NP-hard in general. This is a cohesive discussion of the existing solution methods associated with the WSRMax problem, including global, fast local, as well as decentralized methods is presented. In addition, general optimization approaches, such as branch and bound methods, complementary geometric programming, and decomposition methods, are discussed in depth to address the problem. Through a number of numerical examples, the applicability of the resulting algorithms in various application domains is demonstrated. The presented algorithms and the associated numerical results can be very useful for network engineers or researchers with an interest in network design.