메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색

논문 기본 정보

자료유형
학위논문
저자정보

Deepak Kumar Singh (경희대학교, 경희대학교 대학원)

지도교수
서덕영
발행연도
2014
저작권
경희대학교 논문은 저작권에 의해 보호받습니다.

이용수0

표지
AI에게 요청하기
추천
검색

이 논문의 연구 히스토리 (2)

초록· 키워드

오류제보하기
In wireless communication, source and destination nodes communicate with each other when they are within their transmission range. In network condition where the source and destination nodes are out of transmission range and are not able to perform successful communication, relay nodes are used for successful communication. The network that consists of source node,destination node and relay node(s) is called as relay network. There are different relaying schemes available to handle the relay. The conventional popular relaying schemes are Amplify and Forward (AaF) and Decode and Forward (DaF).
Raptor Q is the systematic fountain code and most advanced forward error correction (FEC) codes for data networks. Raptor Q is used in relay network for recovering the lost source packets. If the communication between source and destination node is successful such that destination node receive at least the minimum number of packets required by Raptor Q to perform successful decoding.In this case relay node is not needed. While in bad channel condition between source and destination node, relay network is used to assist Raptor Q to perform successful decoding. However when using relaying schemes like AaF, we have the problem of duplicity or ambiguity of packets in the destination node. As packets are received from both source and relay, there is a high probability of having duplicated packets. Duplicity affects the failure distribution of Raptor Q and the failure distribution affects the quality of service.
In this thesis, we propose a novel relaying scheme for relay network. The proposed scheme is “Simply Merge and Forward” (SMaF) which merge packets in relay node and forward them to client as new parity packets. These parity packets are used by Raptor Q to regenerate the lost source packets in a destination. In the conventional relaying scheme like Amplify and Forward (AaF), there is a higher probability of duplicate packets in a destination. This affects the failure distribution of Raptor Q and deteriorate the quality of service. The cooperative communication between server and relay node is done by time sharing.
Simulation results show that SMaF reduces the duplicity and provide better failure distribution and quality of service than AaF.

목차

1 Introduction 1
2 Relay Network and Relay Scheme 3
2.1 Relay Network 3
2.2 Relay Scheme 4
3 RaptorQ 5
3.1 Introduction 5
3.2 Overview of Raptor 5
3.3 Overview of Raptor Q 6
4 Resource Sharing 9
5 Raptor Q as single matrix 10
6 Novel Relay Scheme using Raptor Q 14
7 Simulation Environment 18
7.1 Raptor Q as single matrix 18
7.2 SMaF 19
8 Results and Analysis 24
8.1 Raptor Q as single matrix 24
8.2 SMaF 26
9 Conclusion and Future Research 31
9.1 Raptor Q as single matrix 31
9.2 Novel Relay Scheme using Raptor Q 31
References 32
Appendix I 35

최근 본 자료

전체보기

댓글(0)

0