| We consider a wireless network where each node has' a finite amount of energy. We focus on the ease where all the nodes collaborate to perform a combined task, for example, in wireless sensor networks. This thesis considers the design of resource allocation algorithms for point-to-point transmission networks and cooperative diversity networks. For point-to-point transmission schemes with additive white Gaussian noise (AWGN) channels, we consider resource allocation to optimize different network objectives. In particular, we consider the minimization of total average power consumption, maximizing minimum node lifetime, and maximizing a concave function of node lifetimes. Optimal resource allocation involves the joint optimization of the physical, medium access control (MAC), and routing layers. We derive efficient distributed algorithms to compute routing schemes, and computationally efficient algorithms to obtain optimal cross-layer schemes in time division multiple access (TDMA) networks. For a general MAC layer, suboptimal, but energy-efficient crosslayer schemes are computed. We use similar optimization methods to compute an optimal transmission scheme in a relay network that exploits cooperative diversity to combat shadowing and fading. We exploit the separable nature of the problem for the computation; the resulting scheme satisfies a pre-specified maximum outage criterion, and minimizes the total power consumption, including that for obtaining channel state information. |
