TY  - BOOK
AU  -  Mohamed Hossam Mohamed Salem Hegazy
TI  - Multi-Layer Novel Techniques for Wireless Device to Device Communications / 
U1  - 005 
PY  - 2018///
KW  - Wireless Technologies
KW  - NULIB
KW  - Dissertation, Academic
N1  - Thesis (M.A.)—Nile University, Egypt, 2018; "Includes bibliographical references"; Contents:
Thesis summary………………………………………………… 2
Abstract…………………………………………………………. 3
Preface…………………………………………………………... 4
Arabic Acknowledgment……………………………………….. 5
English Acknowledgment………………………………………. 6
Table of Contents……………………………………………….. 7
List of Abbreviations…………………………………………… 9
List of tables……………………………………………………... 10
List of figures……………………………………………………. 10
Chapter 1:-Introduction............................…………………….. 11
1.1 Thesis Objectives………………………………………………... 11
1.2 Thesis Organization…………………………………………….. 13
Chapter 2:- Literature Survey………………………………… 14
2.1 D2D Communications…………………………………………... 14
2.2 Cooperative Communication (CC)…………………………….. 15
2.2.1 Cooperative Communication at the Physical Layer……………… 17
2.2.1.1 Decode and Forward…………………………………………………… 17
2.2.1.2 Amplify and Forward………………………………………………….. 17
2.2.1.3 Diversity Receiving…………………………………………………….. 18
2.2.1.3.1 Maximum Likelihood (ML) Receiver……………………………………… 18
2.2.1.3.2 Diversity Combining Techniques…………………………………………… 19
2.2.1.3.2.1 Maximum Ratio Combining (MRC)……………………………………………… 19
2.2.1.3.2.2 Equal Gain Combining (EGC)……………………………………………………. 19
2.2.1.3.2.3 Selection Combining (SC)…………………………………………………………. 20
2.2.1.3.2.4 Cooperative Maximum Ratio Combining (C-MRC)…………………………….. 20
2.2.2 Cooperative MAC…………………………………………………… 21
2.2.2.1 When to Use Cooperation………………………………………………. 21
2.2.2.2 Optimal Selection of Cooperating Entities…………………………….. 22
2.2.2.3 Alleviating collisions…………………………………………………….. 22
2.2.3 Cooperative Routing………………………………………………… 23
2.3 Network Coding (NC)…………………………………………… 24
2.3.1 Linear Network Coding…………………………………………….. 24
2.3.2 Physical Layer Network Coding (PNC)……………………………. 26
2.3.3 Analog Network Coding (ANC)…………………………………….. 27
2.4 Network Coded Cooperation (NCC)……………………………. 28
Chapter 3:- CRRP: A novel Cooperative Routing Technique 30
3.1 Introduction……………………………………………………… 30
3.1.1 Previous Work ……………………………………………………… 30
3.1.2 Our Contribution…………………………………………………… 31
3.2 System Model…………………………………………………….. 31
8
3.2.1 Network Model………………………………………………………. 31
3.2.2 Physical Layer Model……………………………………………….. 32
3.2.3 Power Allocation…………………………………………………….. 33
3.3 Cooperative Coverage Analysis…………………………...…….. 34
3.3.1 The Relay Angle Effect……..……………………………………….. 35
3.3.2 SER Requirement Effect……...…………………………………….. 35
3.4 Cooperative Routing for Reliable Paths………………………... 36
3.4.1 Phase 1 (Relay Selection)…………………………….……………... 37
3.4.2 Phase 2 (Determining the forwarder search area)………….…….. 37
3.4.3 Phase 3 (Forwarders Nomination)…………………………………. 38
3.4.4 Phase 4 (Forwarder Selection)……………………………………… 38
3.5 Performance Evaluation and Results Discussion………………. 38
3.5.1 Simulation Setup…………………………………………………….. 39
3.5.2 Numerical Results…………………………………………………… 39
3.6 Conclusion………………………………………………………… 43
Chapter 4:- EGMX: A Novel Network Coded Cooperation Receiver Technique……………………………………………... 44
4.1 Introduction……………………………………………………… 44
4.1.1 Previous Work ……………..………………………………………. 44
4.1.2 Our Contribution……………………………………………………. 44
4.2 System Model…………………………………………………….. 45
4.3 Equal Gain for Mapped XOR (EGMX)……………………….. 46
4.3.1 Analog XOR Mapping……………………………………………… 46
4.3.2 EGMX Receiver…………………………………………………….. 46
4.4 Theoretical BER Analysis………………………………………. 47
4.5 Performance Evaluation………………………………………… 50
4.5.1 Baseline Schemes……………………………………….…………… 50
4.5.2 Simulation Setup……………………………………………………. 51
4.5.3 Results Analysis……………………………………………………… 51
4.6 Conclusion………………………………………………………... 53
Chapter 5:- Conclusion and Future Open Issues…………….. 55
5.1 Conclusions…………………………...…………………….…… 55
5.2 Future Open Issues……………………………………….…….. 55
References………………………………………………………
N2  - Abstract:
In this thesis, we introduce two novel schemes for 5G Device-to-Device communication scenario. First scheme is coined Cooperative Routing for Reliable Paths (CRRP). It is a cooperative routing scheme designed with a prime focus to enhance the routing performance in cooperative communication networks in terms of the path length and reliability. In particular, it introduces novel algorithms for cooperative relay and forwarder selections, which strike the best balance between path length and achieved symbol error rate, compared to prior work in the literature. Moreover, it exhibits the flexibility of deciding cooperative vs. direct communications, on a hop-by-hop basis, depending on the scenario. Our extensive simulation study reveals valuable insights. First, CRRP reduces the path length compared with conventional Greedy Forwarding (GF) routing scheme and the recently introduced Relay Aware Cooperative Routing (RACR) scheme. GF scheme is a direct communication scheme which always selects the closest forwarder to the destination. RACR is a cooperative routing scheme that selects the closest relay to the optimum relay position and similarly selects the closest forwarder to the optimum forwarder position. The superiority of CRRP in path length results in energy saving, crucial for battery operated Device to Device communications. Second, CRRP considerably outperforms GF and RACR with respect to the path failure probability (on the average 56.5% and 50% better than GF and RACR respectively), critical for low density networks, while maintaining the symbol error rate within acceptable limits.
Second scheme is coined Equal Gain for Mapped XOR (EGMX). It introduces a novel technique for Network Coded Cooperation (NCC) receiver for the two way relay channel scenario where two source nodes exchange information through cooperation with an intermediate node (relay). This cooperative relay sends a network coded combined signal to both destinations. Decoding at each destination is achieved through applying an analog XOR mapping operation to the signal received from the relay. Then, Equal Gain Combining (EGC) is applied between the resulted mapped signal and the signal received from the source. Interestingly, the proposed receiver is of much less complexity than the optimum widely used Maximum Likelihood (ML) receiver plus it does not need Channel State Information (CSI) for decoding leading to saving spectrum needed to receive such information. A closed form for EGMX theoretical achieved BER has been derived. Monte-Carlo simulation results show much better BER performance compared with conventional Network Coding (NC) system. Moreover, under error-free relay assumption, achieved BER approaches the optimum ML BER
ER  -