Capacity theorems for relay networks and wireless Ad Hoc networks = 릴레이 네트워크와 무선 애드혹 네트워크의 정보이론적 용량에 대한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 437
  • Download : 0
Relaying has received great attention in both academia and industry in being able to enhance the network throughput performance. Nevertheless, the optimal relaying strategies are known only for some limited cases. In the first part of this dissertation, we characterize the capacity of two new classes of three-node relay channels and the multicast capacity of a new class of multicast relay networks. In the first two classes of relay channels, which we call more capable and less noisy relay channels, the channel seen by the relay is stronger than that seen by the destination in a certain sense, which resembles the conditions for the more capable and less noisy broadcast channels. In more capable relay channels, decode-and-forward (DF) is shown to be optimal. The more capable relay channel includes as special cases several examples in the literature where DF is shown to be optimal. In less noisy relay channels, partial decode-and-forward (PDF) is shown to achieve the capacity. This is the third class of relay channels where PDF is shown to be optimal, where two previously known classes are the semideterministic relay channel and the relay channel with orthogonal components at the source. By using the definition of less noisy relay channel, we can easily construct many examples where DF is strictly suboptimal but PDF is capacity achieving. Next, we characterize the multicast capacity of a class of multicast relay networks with a tree topology. This class of multicast tree networks includes the class of diamond networks studied by Kang and Ulukus as a special case, where they showed that the capacity can be strictly lower than the cut-set bound. For achievablity, a novel coding scheme is constructed where some relays employ a combination of DF and compress-and-forward (CF) and the other relays perform a random binning such that codebook constructions and relay operations are independent for each node and do not depend on the network topology. For converse, a new t...
Chung, Sae-Youngresearcher정세영
한국과학기술원 : 전기및전자공학과,
Issue Date
513094/325007  / 020097066

학위논문(박사) - 한국과학기술원 : 전기및전자공학과, 2013.2, [ vii, 85 p. ]


tree topology; compress-and-forward; decode-and-forward; relay; capacity; wireless ad hoc network; 채널 용량; 중계기; 복호 후 전송 방식; 압축 후 전송 방식; 트리 토폴로지; 무선 애드혹 네트워크; 점근적 채널 용량; capacity scaling law

Appears in Collection
Files in This Item
There are no files associated with this item.


  • mendeley


rss_1.0 rss_2.0 atom_1.0