Loading...

On the Capacity and Cooperative Strategies in Information Networks

Akhbari, Bahareh | 2011

618 Viewed
  1. Type of Document: Ph.D. Dissertation
  2. Language: Farsi
  3. Document No: 42578 (05)
  4. University: Sharif University of Technology
  5. Department: Electrical Engineering
  6. Advisor(s): Aref, Mohammad Reza
  7. Abstract:
  8. Due to the remarkable growth in using communication networks such as ad-hoc, wireless and sensor networks, studying the building blocks of these networks (e.g., relay channel and interference channel) from information theoretic viewpoint and investigating cooperative strategies have recently received considerable attention. Also, owing to wide range of applications, state-dependent channels have been widely studied. In this dissertation, at first, we consider a state-dependent relay channel (SD-RC). For the cases wherein channel states are available causally or non-causally at different nodes, we propose new achievable rates for this channel using compress-and-forward strategy. Also we discuss the conditions for which these new achievable rates outperform the available ones. Then, we assume a generalization of SD-RC in which the source node also sends a private message intended for the relay node. This model is regarded as state-dependent Partially Cooperative Relay Broadcast Channel (PC-RBC). For this channel with partial causal Channel State Information (CSI) we derive an achievable rate region. Then, we establish the capacity region of the degraded PC-RBC with partial causal CSI, and also PC-RBC with feedback and partial causal CSI. Moreover, for the Fully Cooperative RBC (FC-RBC) with partial causal CSI we obtain the same results as for the state-dependent PC-RBC. Then we introduce a unified model in which the relay is both a source and a sink of data. We call it State Dependent Relay Channel with Private Messages (SD-RCPM), and derive new achievable rate regions for this channel. In another section of this dissertation we consider cooperation in the networks with more than one relay node. In this regard, we consider reliable transmission of a discrete memoryless source over multi-relay networks with correlated Side Information (SI) available at the relay nodes and the receiver. Then, we obtain a necessary condition for the reliable source transmission over a multi-terminal network with SI, which results in a necessary condition for a multi-relay network with SI, as a special case. We also propose a separate source-channel coding scheme, and based on it, a sufficient condition for a multi-relay network with SI is derived. We show that these proposed schemes which are based on operational separation, achieve the same rates as the joint source-channel codes and these sufficient conditions are indeed necessary conditions for the degraded relay networks with degraded SI. At the end, we consider another network with more than one relay node. We introduce interference channel with two relays as two interfering transmitter-receiver pairs that are aided by the two relays. We propose two different coding strategies for this channel to derive new achievable rate regions. We also show that our derived achievable rate regions can be specialized to new achievable rate regions for discrete memoryless IFC with a relay
  9. Keywords:
  10. Side Information ; Relay Channel ; Cooperation Strategies ; Achievable Rate Region ; Interference Channel ; Channel State ; Causal and Non Cousal Cchannel State Information

 Digital Object List

 Bookmark

No TOC