Cooperative communications and networking 0521895138, 9780521895132, 9780511465482
Presenting the fundamentals of cooperative communications and networking, this book treats the concepts of space, time,
270 82 34KB
English Pages 643 Year 2009
Table of contents :
Half-title......Page 3
Title......Page 5
Copyright......Page 6
Dedication......Page 7
Contents......Page 9
Preface......Page 13
Part I Background and MIMO systems......Page 17
1 Introduction......Page 19
1.1.2 Large-scale propagation effects......Page 20
1.1.3 Small-scale propagation effects......Page 21
1.1.4 Power delay profile......Page 23
1.1.5 Uniform scattering environment models......Page 30
1.1.6 Other channel coefficients models......Page 36
1.2 Characterizing performance through channel capacity......Page 38
1.3 Orthogonal frequency division multiplexing (OFDM)......Page 41
1.4 Diversity in wireless channels......Page 45
1.4.1 Time diversity......Page 47
1.4.3 MIMO systems......Page 49
1.4.3.1 Two motivated examples......Page 50
1.4.3.2 MIMO capacity......Page 53
1.4.3.3 Diversity–multiplexing tradeoff......Page 55
1.5 Cooperation diversity......Page 56
1.6 Bibliographical notes......Page 58
2.1 System model and performance criteria......Page 59
2.2.1 Cyclic and unitary ST codes......Page 63
2.2.2 ST codes from orthogonal designs......Page 65
2.2.2.1 ST codes from orthogonal designs......Page 67
2.2.2.2 ST Codes from quasi-orthogonal designs......Page 69
2.2.3 Diagonal algebraic ST codes......Page 74
2.3 Chapter summary and bibliographical notes......Page 76
Exercises......Page 77
3.1.1 MIMO-OFDM system model......Page 80
3.1.1.1 General performance criteria......Page 82
3.1.1.2 Performance criteria......Page 83
3.1.2.1 SF code design via mapping......Page 85
3.1.2.2 Coding advantage......Page 90
3.1.2.3 Code design examples and performance comparisons......Page 93
3.1.3 Full-rate full-diversity SF code design......Page 96
3.1.3.1 Code structure......Page 97
3.1.3.2 Maximizing the “intrinsic” diversity product......Page 100
3.1.3.3 Maximizing the coding advantage by permutations......Page 101
3.1.3.4 Maximizing the “extrinsic” diversity product......Page 103
3.1.3.5 Code design examples and performance comparisons......Page 106
3.2.1 STF-coded MIMO-OFDM system model......Page 114
3.2.2 Performance criteria and maximum achievable diversity......Page 116
3.2.3.1 Repetition-based STF code design......Page 119
3.2.3.2 Full-rate STF code design......Page 120
3.2.3.3 STF code design examples and performance comparisons......Page 125
3.3 Chapter summary and bibliographical notes......Page 129
Exercises......Page 130
Part II Cooperative communications......Page 133
4.1 Cooperative communications......Page 135
4.2 Cooperation protocols......Page 137
4.2.1.1 Fixed amplify-and-forward relaying protocol......Page 138
4.2.1.2 Fixed decode-and-forward relaying protocol......Page 142
4.2.1.3 Other cooperation strategies......Page 144
4.2.2.1 Selective DF relaying......Page 149
4.2.2.2 Incremental relaying......Page 150
4.3.1 Network model......Page 154
4.3.2 Hierarchical cooperation protocol description......Page 155
4.3.2.1 Phase I: Setting up transmit cooperation......Page 156
4.3.2.3 Phase III: Cooperate to decode......Page 158
4.3.3 Protocol analysis......Page 159
4.3.4 Linear capacity scaling......Page 163
4.4 Chapter summary and bibliographical notes......Page 164
Exercises......Page 166
5.1 System model......Page 168
5.2.1 Closed-form SER analysis......Page 171
5.2.2 SER upper bound and asymptotic approximation......Page 174
5.2.3 Optimum power allocation......Page 178
5.2.4 Some special scenarios......Page 182
5.2.5 Simulation examples......Page 183
5.3.1 SER analysis by MGF approach......Page 186
5.3.2 Simple MGF expression for the harmonic mean......Page 188
5.3.3 Asymptotically tight approximation......Page 190
5.3.4 Optimum power allocation......Page 194
5.3.5 Simulation examples......Page 195
5.4 Comparison of DF and AF cooperation gains......Page 197
5.5 Trans-modulation in relay communications......Page 202
5.6 Chapter summary and bibliographical notes......Page 206
Exercises......Page 208
6.1.1 System model and protocol description......Page 210
6.1.2 Exact SER performance analysis......Page 213
6.1.3.1 SER approximation for general cooperative protocol......Page 218
6.1.3.2 Diversity order and cooperation gain......Page 222
6.1.3.3 Bandwidth efficiency versus diversity gain......Page 224
6.1.4 Optimal power allocation......Page 226
6.1.4.1 Numerical examples......Page 232
6.2.1.1 System model and protocol description......Page 233
6.2.1.2 SER performance analysis......Page 234
6.2.2.1 System model and protocol description......Page 238
6.2.2.2 Performance analysis......Page 239
6.2.3 Outage analysis and optimum power allocation......Page 241
6.2.3.1 Outage analysis......Page 243
6.2.3.2 Optimal power allocation......Page 246
6.3 Chapter summary and bibliographical notes......Page 250
Exercises......Page 251
7.1 Distributed space–time coding (DSTC)......Page 254
7.1.1.1 System model......Page 255
7.1.1.2 Performance analysis......Page 256
7.1.2.1 System model......Page 261
7.1.2.2 Performance analysis......Page 262
7.1.3 Synchronization-aware distributed DSTC......Page 265
7.1.3.1 System model......Page 266
7.1.3.2 Performance Analysis......Page 267
7.2 Distributed space–frequency coding (DSFC)......Page 272
7.2.1.1 System model......Page 273
7.2.1.3 Source node coding......Page 275
7.2.1.4 Relay Nodes Coding......Page 278
7.2.2.1 System model......Page 280
7.2.2.2 Performance analysis......Page 281
7.2.2.3 PEP Analysis for L=1......Page 283
7.2.2.4 PEP analysis for L=2......Page 284
7.2.3 Code design and remarks......Page 288
7.3 Chapter summary and bibliographical notes......Page 289
Appendix......Page 290
Exercises......Page 291
8.1 Motivation and relay-selection protocol......Page 294
8.1.1 Conventional cooperation scenario......Page 295
8.1.2 Relay-selection criterion......Page 296
8.1.3 Single-relay decode-and-forward protocol......Page 297
8.2.1 Average bandwidth efficiency analysis......Page 298
8.2.2 SER analysis and upper bound......Page 299
8.3 Multi-node scenario......Page 305
8.3.1 Bandwidth efficiency......Page 306
8.3.2 SER analysis and upper bound......Page 309
8.4 Optimum power allocation......Page 311
8.5 Chapter summary and bibliographical notes......Page 317
Exercises......Page 318
9.1 Differential modulation......Page 322
9.2.1.1 Signal model and protocol description for the DiffDF scheme......Page 324
9.2.1.2 Performance Analysis......Page 328
9.2.1.3 Upper bound and lower bound......Page 338
9.2.1.4 Optimum decision threshold and power allocation......Page 342
9.2.1.5 Examples for single-relay DiffDF scheme......Page 344
9.2.2.1 Signal models for multi-node DiffDF scheme......Page 349
9.2.2.2 BER Analysis......Page 352
9.2.2.3 Optimizing power allocation and thresholds......Page 358
9.2.2.4 Examples for the multi-node DiffDF scheme......Page 359
9.3.1.1 Signal model and protocol description for the DiffAF scheme......Page 363
9.3.1.2 Performance analysis and discussions......Page 365
9.3.1.3 Examples for single-relay DiffAF scheme......Page 368
9.3.2.1 Signal model and protocol description......Page 372
9.3.2.2 BER analysis......Page 374
9.3.2.3 Optimum power allocation......Page 378
9.3.2.4 Examples for the multi-relay DiffAF scheme......Page 382
9.4 Chapter summary and bibliographical notes......Page 386
Exercises......Page 388
10.1 System model......Page 390
10.2.1 Direct transmission......Page 393
10.2.2 Cooperative transmission......Page 394
10.3 Multi-relay scenario......Page 397
10.4 Experimental results......Page 399
10.4.1 Numerical examples......Page 401
10.5 Chapter summary and bibliographical notes......Page 406
Exercises......Page 407
Part III Cooperative networking......Page 409
11 Cognitive multiple access via cooperation......Page 411
11.1 System model......Page 412
11.2 Cooperative cognitive multiple access (CCMA) protocols......Page 415
11.2.2 CCMA-multiple frames......Page 416
11.3.1.1 The two-terminals case......Page 417
11.3.1.2 The symmetric M-terminals case......Page 426
11.3.2 Stability analysis of CCMA-M......Page 427
11.3.2.1 Enhanced protocol CCMA-Me......Page 430
11.3.3 Existing cooperation protocols: stability analysis......Page 432
11.3.3.1 Stability region for selection decode-and-forward......Page 433
11.3.3.2 Stability region for incremental decode-and-forward......Page 434
11.3.4 Numerical examples......Page 436
11.4 Throughput region......Page 439
11.5.1 Delay performance for CCMA-S......Page 440
11.5.2 Delay performance of CCMA-Me......Page 442
11.5.3 Numerical examples for delay performance......Page 443
Exercises......Page 445
12 Content-aware cooperative multiple access......Page 448
12.1.1 speech source model......Page 449
12.1.2 Network model......Page 450
12.1.3 Channel model......Page 452
12.2 Content-aware cooperative multiple access protocol......Page 453
12.3 Dynamic state model......Page 454
12.3.1 State transition probabilities......Page 457
12.4 Performance analysis......Page 458
12.4.1 Network throughput......Page 459
12.4.2 Multiple access delay......Page 460
12.4.3 Packet dropping probability......Page 462
12.4.4 Subjective voice quality......Page 467
12.5 Access contention–cooperation tradeoff......Page 468
12.6 Chapter summary and bibliographical notes......Page 471
Exercises......Page 472
13 Distributed cooperative routing......Page 473
13.1.1 Network model......Page 474
13.1.2 Direct and cooperative transmission modes......Page 475
13.2 Link analysis......Page 477
13.3 Cooperation-based routing algorithms......Page 479
13.3.1 Performance analysis: regular linear networks......Page 481
13.3.2 Performance analysis: regular grid networks......Page 482
13.4 Simulation examples......Page 485
13.5 Chapter summary and bibliographical notes......Page 490
Exercises......Page 491
14.1 Joint source–channel coding bit rate allocation......Page 494
14.2 Joint source–channel coding with user cooperation......Page 496
14.3 The Source–channel–cooperation tradeoff problem......Page 498
14.4 Source codec......Page 500
14.4.1 Practical source codecs......Page 501
14.5 Channel codec......Page 504
14.6 Analysis of source–channel–cooperation performance......Page 506
14.6.1 Amplify-and-forward cooperation......Page 507
14.6.2 Decode-and-forward cooperation......Page 514
14.6.3 No use of cooperation......Page 516
14.7 Validation of D-SNR characterization......Page 520
14.8 Effects of source–channel–cooperation tradeoffs......Page 521
14.9 Chapter summary and bibliographical notes......Page 526
Exercises......Page 528
15 Asymptotic performance of distortion exponents......Page 530
15.1 Systems setup for source–channel diversity......Page 531
15.2.1.1 Single relay......Page 535
15.2.1.2 Multiple relays......Page 539
15.2.1.3 Optimal channel coding diversity with two relays......Page 541
15.2.1.4 Source coding diversity with two relays......Page 543
15.2.2 Multi-hop decode-and-forward protocol......Page 544
15.2.2.1 Optimal channel coding diversity with two relays......Page 545
15.3.1.1 Single relay......Page 548
15.3.1.2 Optimal channel coding diversity with two relays......Page 551
15.3.1.3 Source coding diversity with two relays......Page 557
15.3.2 Decode-and-forward relay channel......Page 560
15.4 Discussion......Page 561
15.5 Chapter summary and bibliographical notes......Page 563
Exercises......Page 564
16.1 System model......Page 566
16.2.2 Cooperative transmission: conditional outage probability......Page 569
16.2.3.1 MRC case......Page 571
16.2.3.2 No-MRC case......Page 572
16.3.1 Nearest-neighbor protocol......Page 573
16.3.2 Fixed relays strategy......Page 575
16.3.3 Lower bound: the Genie-aided algorithm......Page 577
16.4 Numerical results......Page 579
Exercises......Page 582
17.1 System model......Page 585
17.2 Cooperative protocol and relay-assignment scheme......Page 587
17.3 Performance analysis......Page 589
17.3.1 Outage probability......Page 590
17.4 Performance lower bound......Page 593
17.5 Optimum relay location......Page 594
17.6 Chapter summary and bibliographical notes......Page 596
Exercises......Page 597
18.1 Introduction......Page 599
18.2.1 Non-cooperative wireless networks......Page 600
18.2.2 Cooperative DF protocol......Page 602
18.3 Lifetime maximization by employing a cooperative node......Page 604
18.3.1 Problem formulation......Page 605
18.3.2.1 Non-cooperative transmission among nodes......Page 606
18.3.2.2 Cooperative transmission when one node helps the other node......Page 607
18.3.2.3 Cooperative transmission when both nodes help each other......Page 609
18.3.3 Multi-node wireless network......Page 610
18.4 Deploying relays to improve device lifetime......Page 613
18.5 Simulation examples......Page 617
18.6 Chapter summary and bibliographical notes......Page 621
Exercises......Page 623
References......Page 625
Index......Page 639
Half-title......Page 3
Title......Page 5
Copyright......Page 6
Dedication......Page 7
Contents......Page 9
Preface......Page 13
Part I Background and MIMO systems......Page 17
1 Introduction......Page 19
1.1.2 Large-scale propagation effects......Page 20
1.1.3 Small-scale propagation effects......Page 21
1.1.4 Power delay profile......Page 23
1.1.5 Uniform scattering environment models......Page 30
1.1.6 Other channel coefficients models......Page 36
1.2 Characterizing performance through channel capacity......Page 38
1.3 Orthogonal frequency division multiplexing (OFDM)......Page 41
1.4 Diversity in wireless channels......Page 45
1.4.1 Time diversity......Page 47
1.4.3 MIMO systems......Page 49
1.4.3.1 Two motivated examples......Page 50
1.4.3.2 MIMO capacity......Page 53
1.4.3.3 Diversity–multiplexing tradeoff......Page 55
1.5 Cooperation diversity......Page 56
1.6 Bibliographical notes......Page 58
2.1 System model and performance criteria......Page 59
2.2.1 Cyclic and unitary ST codes......Page 63
2.2.2 ST codes from orthogonal designs......Page 65
2.2.2.1 ST codes from orthogonal designs......Page 67
2.2.2.2 ST Codes from quasi-orthogonal designs......Page 69
2.2.3 Diagonal algebraic ST codes......Page 74
2.3 Chapter summary and bibliographical notes......Page 76
Exercises......Page 77
3.1.1 MIMO-OFDM system model......Page 80
3.1.1.1 General performance criteria......Page 82
3.1.1.2 Performance criteria......Page 83
3.1.2.1 SF code design via mapping......Page 85
3.1.2.2 Coding advantage......Page 90
3.1.2.3 Code design examples and performance comparisons......Page 93
3.1.3 Full-rate full-diversity SF code design......Page 96
3.1.3.1 Code structure......Page 97
3.1.3.2 Maximizing the “intrinsic” diversity product......Page 100
3.1.3.3 Maximizing the coding advantage by permutations......Page 101
3.1.3.4 Maximizing the “extrinsic” diversity product......Page 103
3.1.3.5 Code design examples and performance comparisons......Page 106
3.2.1 STF-coded MIMO-OFDM system model......Page 114
3.2.2 Performance criteria and maximum achievable diversity......Page 116
3.2.3.1 Repetition-based STF code design......Page 119
3.2.3.2 Full-rate STF code design......Page 120
3.2.3.3 STF code design examples and performance comparisons......Page 125
3.3 Chapter summary and bibliographical notes......Page 129
Exercises......Page 130
Part II Cooperative communications......Page 133
4.1 Cooperative communications......Page 135
4.2 Cooperation protocols......Page 137
4.2.1.1 Fixed amplify-and-forward relaying protocol......Page 138
4.2.1.2 Fixed decode-and-forward relaying protocol......Page 142
4.2.1.3 Other cooperation strategies......Page 144
4.2.2.1 Selective DF relaying......Page 149
4.2.2.2 Incremental relaying......Page 150
4.3.1 Network model......Page 154
4.3.2 Hierarchical cooperation protocol description......Page 155
4.3.2.1 Phase I: Setting up transmit cooperation......Page 156
4.3.2.3 Phase III: Cooperate to decode......Page 158
4.3.3 Protocol analysis......Page 159
4.3.4 Linear capacity scaling......Page 163
4.4 Chapter summary and bibliographical notes......Page 164
Exercises......Page 166
5.1 System model......Page 168
5.2.1 Closed-form SER analysis......Page 171
5.2.2 SER upper bound and asymptotic approximation......Page 174
5.2.3 Optimum power allocation......Page 178
5.2.4 Some special scenarios......Page 182
5.2.5 Simulation examples......Page 183
5.3.1 SER analysis by MGF approach......Page 186
5.3.2 Simple MGF expression for the harmonic mean......Page 188
5.3.3 Asymptotically tight approximation......Page 190
5.3.4 Optimum power allocation......Page 194
5.3.5 Simulation examples......Page 195
5.4 Comparison of DF and AF cooperation gains......Page 197
5.5 Trans-modulation in relay communications......Page 202
5.6 Chapter summary and bibliographical notes......Page 206
Exercises......Page 208
6.1.1 System model and protocol description......Page 210
6.1.2 Exact SER performance analysis......Page 213
6.1.3.1 SER approximation for general cooperative protocol......Page 218
6.1.3.2 Diversity order and cooperation gain......Page 222
6.1.3.3 Bandwidth efficiency versus diversity gain......Page 224
6.1.4 Optimal power allocation......Page 226
6.1.4.1 Numerical examples......Page 232
6.2.1.1 System model and protocol description......Page 233
6.2.1.2 SER performance analysis......Page 234
6.2.2.1 System model and protocol description......Page 238
6.2.2.2 Performance analysis......Page 239
6.2.3 Outage analysis and optimum power allocation......Page 241
6.2.3.1 Outage analysis......Page 243
6.2.3.2 Optimal power allocation......Page 246
6.3 Chapter summary and bibliographical notes......Page 250
Exercises......Page 251
7.1 Distributed space–time coding (DSTC)......Page 254
7.1.1.1 System model......Page 255
7.1.1.2 Performance analysis......Page 256
7.1.2.1 System model......Page 261
7.1.2.2 Performance analysis......Page 262
7.1.3 Synchronization-aware distributed DSTC......Page 265
7.1.3.1 System model......Page 266
7.1.3.2 Performance Analysis......Page 267
7.2 Distributed space–frequency coding (DSFC)......Page 272
7.2.1.1 System model......Page 273
7.2.1.3 Source node coding......Page 275
7.2.1.4 Relay Nodes Coding......Page 278
7.2.2.1 System model......Page 280
7.2.2.2 Performance analysis......Page 281
7.2.2.3 PEP Analysis for L=1......Page 283
7.2.2.4 PEP analysis for L=2......Page 284
7.2.3 Code design and remarks......Page 288
7.3 Chapter summary and bibliographical notes......Page 289
Appendix......Page 290
Exercises......Page 291
8.1 Motivation and relay-selection protocol......Page 294
8.1.1 Conventional cooperation scenario......Page 295
8.1.2 Relay-selection criterion......Page 296
8.1.3 Single-relay decode-and-forward protocol......Page 297
8.2.1 Average bandwidth efficiency analysis......Page 298
8.2.2 SER analysis and upper bound......Page 299
8.3 Multi-node scenario......Page 305
8.3.1 Bandwidth efficiency......Page 306
8.3.2 SER analysis and upper bound......Page 309
8.4 Optimum power allocation......Page 311
8.5 Chapter summary and bibliographical notes......Page 317
Exercises......Page 318
9.1 Differential modulation......Page 322
9.2.1.1 Signal model and protocol description for the DiffDF scheme......Page 324
9.2.1.2 Performance Analysis......Page 328
9.2.1.3 Upper bound and lower bound......Page 338
9.2.1.4 Optimum decision threshold and power allocation......Page 342
9.2.1.5 Examples for single-relay DiffDF scheme......Page 344
9.2.2.1 Signal models for multi-node DiffDF scheme......Page 349
9.2.2.2 BER Analysis......Page 352
9.2.2.3 Optimizing power allocation and thresholds......Page 358
9.2.2.4 Examples for the multi-node DiffDF scheme......Page 359
9.3.1.1 Signal model and protocol description for the DiffAF scheme......Page 363
9.3.1.2 Performance analysis and discussions......Page 365
9.3.1.3 Examples for single-relay DiffAF scheme......Page 368
9.3.2.1 Signal model and protocol description......Page 372
9.3.2.2 BER analysis......Page 374
9.3.2.3 Optimum power allocation......Page 378
9.3.2.4 Examples for the multi-relay DiffAF scheme......Page 382
9.4 Chapter summary and bibliographical notes......Page 386
Exercises......Page 388
10.1 System model......Page 390
10.2.1 Direct transmission......Page 393
10.2.2 Cooperative transmission......Page 394
10.3 Multi-relay scenario......Page 397
10.4 Experimental results......Page 399
10.4.1 Numerical examples......Page 401
10.5 Chapter summary and bibliographical notes......Page 406
Exercises......Page 407
Part III Cooperative networking......Page 409
11 Cognitive multiple access via cooperation......Page 411
11.1 System model......Page 412
11.2 Cooperative cognitive multiple access (CCMA) protocols......Page 415
11.2.2 CCMA-multiple frames......Page 416
11.3.1.1 The two-terminals case......Page 417
11.3.1.2 The symmetric M-terminals case......Page 426
11.3.2 Stability analysis of CCMA-M......Page 427
11.3.2.1 Enhanced protocol CCMA-Me......Page 430
11.3.3 Existing cooperation protocols: stability analysis......Page 432
11.3.3.1 Stability region for selection decode-and-forward......Page 433
11.3.3.2 Stability region for incremental decode-and-forward......Page 434
11.3.4 Numerical examples......Page 436
11.4 Throughput region......Page 439
11.5.1 Delay performance for CCMA-S......Page 440
11.5.2 Delay performance of CCMA-Me......Page 442
11.5.3 Numerical examples for delay performance......Page 443
Exercises......Page 445
12 Content-aware cooperative multiple access......Page 448
12.1.1 speech source model......Page 449
12.1.2 Network model......Page 450
12.1.3 Channel model......Page 452
12.2 Content-aware cooperative multiple access protocol......Page 453
12.3 Dynamic state model......Page 454
12.3.1 State transition probabilities......Page 457
12.4 Performance analysis......Page 458
12.4.1 Network throughput......Page 459
12.4.2 Multiple access delay......Page 460
12.4.3 Packet dropping probability......Page 462
12.4.4 Subjective voice quality......Page 467
12.5 Access contention–cooperation tradeoff......Page 468
12.6 Chapter summary and bibliographical notes......Page 471
Exercises......Page 472
13 Distributed cooperative routing......Page 473
13.1.1 Network model......Page 474
13.1.2 Direct and cooperative transmission modes......Page 475
13.2 Link analysis......Page 477
13.3 Cooperation-based routing algorithms......Page 479
13.3.1 Performance analysis: regular linear networks......Page 481
13.3.2 Performance analysis: regular grid networks......Page 482
13.4 Simulation examples......Page 485
13.5 Chapter summary and bibliographical notes......Page 490
Exercises......Page 491
14.1 Joint source–channel coding bit rate allocation......Page 494
14.2 Joint source–channel coding with user cooperation......Page 496
14.3 The Source–channel–cooperation tradeoff problem......Page 498
14.4 Source codec......Page 500
14.4.1 Practical source codecs......Page 501
14.5 Channel codec......Page 504
14.6 Analysis of source–channel–cooperation performance......Page 506
14.6.1 Amplify-and-forward cooperation......Page 507
14.6.2 Decode-and-forward cooperation......Page 514
14.6.3 No use of cooperation......Page 516
14.7 Validation of D-SNR characterization......Page 520
14.8 Effects of source–channel–cooperation tradeoffs......Page 521
14.9 Chapter summary and bibliographical notes......Page 526
Exercises......Page 528
15 Asymptotic performance of distortion exponents......Page 530
15.1 Systems setup for source–channel diversity......Page 531
15.2.1.1 Single relay......Page 535
15.2.1.2 Multiple relays......Page 539
15.2.1.3 Optimal channel coding diversity with two relays......Page 541
15.2.1.4 Source coding diversity with two relays......Page 543
15.2.2 Multi-hop decode-and-forward protocol......Page 544
15.2.2.1 Optimal channel coding diversity with two relays......Page 545
15.3.1.1 Single relay......Page 548
15.3.1.2 Optimal channel coding diversity with two relays......Page 551
15.3.1.3 Source coding diversity with two relays......Page 557
15.3.2 Decode-and-forward relay channel......Page 560
15.4 Discussion......Page 561
15.5 Chapter summary and bibliographical notes......Page 563
Exercises......Page 564
16.1 System model......Page 566
16.2.2 Cooperative transmission: conditional outage probability......Page 569
16.2.3.1 MRC case......Page 571
16.2.3.2 No-MRC case......Page 572
16.3.1 Nearest-neighbor protocol......Page 573
16.3.2 Fixed relays strategy......Page 575
16.3.3 Lower bound: the Genie-aided algorithm......Page 577
16.4 Numerical results......Page 579
Exercises......Page 582
17.1 System model......Page 585
17.2 Cooperative protocol and relay-assignment scheme......Page 587
17.3 Performance analysis......Page 589
17.3.1 Outage probability......Page 590
17.4 Performance lower bound......Page 593
17.5 Optimum relay location......Page 594
17.6 Chapter summary and bibliographical notes......Page 596
Exercises......Page 597
18.1 Introduction......Page 599
18.2.1 Non-cooperative wireless networks......Page 600
18.2.2 Cooperative DF protocol......Page 602
18.3 Lifetime maximization by employing a cooperative node......Page 604
18.3.1 Problem formulation......Page 605
18.3.2.1 Non-cooperative transmission among nodes......Page 606
18.3.2.2 Cooperative transmission when one node helps the other node......Page 607
18.3.2.3 Cooperative transmission when both nodes help each other......Page 609
18.3.3 Multi-node wireless network......Page 610
18.4 Deploying relays to improve device lifetime......Page 613
18.5 Simulation examples......Page 617
18.6 Chapter summary and bibliographical notes......Page 621
Exercises......Page 623
References......Page 625
Index......Page 639
- Author / Uploaded
- K. J. Ray Liu
- Ahmed K. Sadek
- Weifeng Su
- Andres Kwasinski
- Similar Topics
- Technique
- Electronics: Telecommunications
![Data Communications and Networking [4 ed.]
9780072967753, 0072967757](https://ebin.pub/img/200x200/data-communications-and-networking-4nbsped-9780072967753-0072967757.jpg)
![Cooperative wireless communications [1 ed.]
142006469X, 9781420064698](https://ebin.pub/img/200x200/cooperative-wireless-communications-1nbsped-142006469x-9781420064698.jpg)
![Data Communications and Networking [5 ed.]
0073376221, 9780073376226](https://ebin.pub/img/200x200/data-communications-and-networking-5nbsped-0073376221-9780073376226.jpg)
![Advanced Wireless Communications: 4G Cognitive and Cooperative Broadband Technology [2 ed.]
9780470059777, 047005977X](https://ebin.pub/img/200x200/advanced-wireless-communications-4g-cognitive-and-cooperative-broadband-technology-2nbsped-9780470059777-047005977x.jpg)
![Wireless Communications & Networking [1 ed.]
9780123735805, 0123735807](https://ebin.pub/img/200x200/wireless-communications-amp-networking-1nbsped-9780123735805-0123735807.jpg)
![Cloud Native Networking Deep-Dive (River Publishers Rapids Series in Communications and Networking) [1 ed.]
8770040214, 9788770040211](https://ebin.pub/img/200x200/cloud-native-networking-deep-dive-river-publishers-rapids-series-in-communications-and-networking-1nbsped-8770040214-9788770040211.jpg)
![Data Communications Networking Devices: Operation, Utilization and LAN and WAN Internetworking [4 ed.]
9780471975151, 047197515X](https://ebin.pub/img/200x200/data-communications-networking-devices-operation-utilization-and-lan-and-wan-internetworking-4nbsped-9780471975151-047197515x.jpg)