Department of Electrical and Computer Engineering
Ph.D. Thesis Abstract
COOPERATVE Methods For WIRELESS RELAY Systems
The objective of this thesis should be to be aware of mechanisms and potential advantages of relaying and node cooperation in wireless systems. We evaluate specific cooperative schemes, present practical cooperative protocols for giant systems, and derive capacity latest results for systems with limited transmitter cooperation.
Motivated by sensor applications, the start within the thesis views cooperation in large, energy-restricted systems that have to deliver multicast data. We make use of the insights provided by network information theory to propose an accumulative broadcast strategy that enables nodes to gather energy of unreliably received overheard signals. As being a message is forwarded while using network, nodes may have multiple choices to reliably decode the data by collecting energy during each retransmission. We evaluate two problems worried about energy-efficient multicast/broadcast. First, we formulate the minimum-energy accumulative broadcast problem. We show the issue is NP-complete and propose an electric-efficient heuristic formula. You have to address probably the most lifetime multicast problem and supply an MLAB formula that finds the optimum solution. The resulting transmit power levels make sure that lifetimes within the active relays offer a similar experience, causing them to be fail concurrently.
The suggested broadcast plan employs a decode-and-forward (DF) relay strategy. Generally, however, the best relay technique is unknown. Within the second area of the thesis, we appraise the performance of amplify-and-forward (AF) methods for energy-restricted systems.
For almost any single source-destination pair, we characterize the optimum AF bandwidth and supply the optimum power allocation one of the AF relays that might really be a kind of maximum ratio mixing. Motivated by large bandwidth sources we further consider orthogonal signaling inside the nodes. Because for the optimum bandwidth still holds, the relay power solution during this situation has the type of water-filling. In comparison, within the network with unconstrained bandwidth, the DF strategy
are operating inside the wideband regime and needs another option of relays. Thus, within the massive network, a range of a cooperative strategy surpasses exercising a coding plan in the node in addition, it determines the operating bandwidth along with the best distribution within the relay power.
Within the third area of the thesis, we introduce limited transmitter cooperation for that interference funnel with two independent sources and two receivers. Transmitter cooperation enabled by side-funnel links with finite capacities enables for almost any partial message exchange between encoders. After cooperation, each encoder knows a typical message partly describing the very first messages, that is own private message. We first determine the capability region within the compound multiple-access funnel (MAC) by which both common and messages are decoded at both receivers. You have to relax the decoding constraint and think about the interference funnel with common information by which each private message is decoded only by one receiver.
We determine the stronginterference problems that the capability region in the funnel can be found to coincide while using the compound MAC capacity region. Finally, we determine the strong interference conditions for the interference funnel with unidirectional cooperation by which messages sent at one encoder can another encoder, whilst not the opposite way round.
Ph.D. Dissertation Director: Professor Roy D. Yates
Download the Thesis: PDF