Advanced wireless networks : 4G technologies / 2nd ed.

Contents 9
Preface to the Second Edition 21
1 Fundamentals 25
1.1 4G Networks and Composite Radio Environment 25
1.2 Protocol Boosters 31
1.2.1 One-element error detection booster for UDP 33
1.2.2 One-element ACK compression booster for TCP 33
1.2.3 One-element congestion control booster for TCP 33
1.2.4 One-element ARQ booster for TCP 33
1.2.5 A forward erasure correction booster for IP or TCP 34
1.2.6 Two-element jitter control booster for IP 34
1.2.7 Two-element selective ARQ booster for IP or TCP 35
1.3 Green Wireless Networks 35
References 35
2 Opportunistic Communications 39
2.1 Multiuser Diversity 39
2.2 Proportional Fair Scheduling 40
2.3 Opportunistic Beamforming 43
2.4 Opportunistic Nulling in Cellular Systems 44
2.5 Network Cooperation and Opportunistic Communications 46
2.5.1 Performance example 49
2.6 Multiuser Diversity in Wireless Ad Hoc Networks 51
2.6.1 Multiple-output and multiple-input link diversity 53
2.6.2 Localized opportunistic transmission 54
2.6.3 Multiuser diversity-driven clustering 55
2.6.4 Opportunistic MAC with timeshare fairness 58
2.6.5 CDF-based K-ary opportunistic splitting algorithm 58
2.6.6 Throughput 61
2.6.7 Optimal opportunistic MAC 61
2.6.8 Contention resolution between clusters 62
2.6.9 Performance examples 64
2.7 Mobility-Assisted Opportunistic Scheduling (MAOS) 70
2.7.1 Mobility models 72
2.7.2 Optimal MAOS algorithm 73
2.7.3 Suboptimum MAOS algorithm 75
2.7.4 Mobility estimation and prediction 75
2.7.5 Estimation of Lagrange multipliers 76
2.7.6 Performance examples 76
2.8 Opportunistic and Cooperative Cognitive Wireless Networks 77
2.8.1 The system model 77
2.8.2 The outage probability 81
2.8.3 Cellular traffic shaping 82
2.8.4 User mobility modeling 83
2.8.5 Absorbing Markov chain system model 85
2.8.6 Throughput analysis 86
2.8.7 Collision resolution 89
2.8.8 Opportunistic transmission with intercell interference awareness 89
2.8.9 Performance examples 92
References 94
3 Relaying and Mesh Networks 97
3.1 Relaying Strategies in Cooperative Cellular Networks 97
3.1.1 The system model 97
3.1.2 System optimization 99
3.1.3 Relay strategy selection optimization 103
3.1.4 Performance example 108
3.2 Mesh/Relay Networks 109
3.2.1 The system model 110
3.2.2 Exhaustive sleep 112
3.2.3 Practical applications 118
3.2.4 Performance example 119
3.3 Opportunistic Ad Hoc Relaying For Multicast 121
3.3.1 The system model 122
3.3.2 Proxy discovery and route interference 123
3.3.3 Near-optimal multicast and approximations 125
3.3.4 Performance examples 127
References 131
4 Topology Control 137
4.1 Local Minimum Spanning Tree (LMST) Topology Control 139
4.1.1 Basics of MST topology control 139
4.1.2 Performance examples 142
4.2 Joint Topology Control, Resource Allocation and Routing 142
4.2.1 JTCR algorithm 145
4.3 Fault-Tolerant Topology 147
4.3.1 The system model 148
4.3.2 Fault-tolerant topology design 148
4.3.3 a-Approximation algorithms 151
4.3.4 Performance examples 156
4.4 Topology Control in Directed Graphs 156
4.4.1 The system model 157
4.4.2 Minimum-weight-based algorithms 157
4.4.3 Augmentation-based algorithms 159
4.4.4 Performance examples 162
4.5 Adjustable Topology Control 162
4.5.1 The system model 164
4.5.2 The r-neighborhood graph 166
4.6 Self-Configuring Topologies 167
4.6.1 SCT performance 169
References 172
5 Adaptive Medium Access Control 181
5.1 WLAN Enhanced Distributed Coordination Function 181
5.2 Adaptive MAC for WLAN with Adaptive Antennas 184
5.2.1 Description of the protocols 184
5.3 MAC for Wireless Sensor Networks 190
5.3.1 S-MAC protocol design 191
5.3.2 Periodic listen and sleep 192
5.3.3 Collision avoidance 192
5.3.4 Coordinated sleeping 193
5.3.5 Choosing and maintaining schedules 193
5.3.6 Maintaining synchronization 194
5.3.7 Adaptive listening 194
5.3.8 Overhearing avoidance and message passing 196
5.3.9 Overhearing avoidance 196
5.3.10 Message passing 196
5.4 MAC for Ad Hoc Networks 198
5.4.1 Carrier sense wireless networks 200
5.4.2 Interaction with upper layers 203
References 204
6 Teletraffic Modeling and Analysis 207
6.1 Channel Holding Time in PCS Networks 207
References 215
7 Adaptive Network Layer 217
7.1 Graphs and Routing Protocols 217
7.1.1 Elementary concepts 217
7.1.2 Directed graph 217
7.1.3 Undirected graph 218
7.1.4 Degree of a vertex 218
7.1.5 Weighted graph 219
7.1.6 Walks and paths 219
7.1.7 Connected graphs 219
7.1.8 Trees 220
7.1.9 Spanning tree 221
7.1.10 MST computation 223
7.1.11 Shortest path spanning tree 225
7.2 Graph Theory 236
7.3 Routing with Topology Aggregation 238
7.4 Network and Aggregation Models 239
7.4.1 Line segment representation 241
7.4.2 QoS-aware topology aggregation 244
7.4.3 Mesh formation 244
7.4.4 Star formation 245
7.4.5 Line-segment routing algorithm 246
7.4.6 Performance measure 248
7.4.7 Performance example 249
References 252
8 Effective Capacity 259
8.1 Effective Traffic Source Parameters 259
8.1.1 Effective traffic source 261
8.1.2 Shaping probability 262
8.1.3 Shaping delay 262
8.1.4 Performance example 265
8.2 Effective Link Layer Capacity 267
8.2.1 Link-layer channel model 268
8.2.2 Effective capacity model of wireless channels 270
8.2.3 Physical layer vs link-layer channel model 273
8.2.4 Performance examples 275
References 278
9 Adaptive TCP Layer 281
9.1 Introduction 281
9.1.1 A large bandwidth-delay product 282
9.1.2 Buffer size 283
9.1.3 Round-trip time 284
9.1.4 Unfairness problem at the TCP layer 285
9.1.5 Noncongestion losses 286
9.1.6 End-to-end solutions 286
9.1.7 Bandwidth asymmetry 287
9.2 TCP Operation and Performance 288
9.2.1 The TCP transmitter 288
9.2.2 Retransmission timeout 289
9.2.3 Window adaptation 289
9.2.4 Packet loss recovery 289
9.2.5 TCP-OldTahoe (timeout recovery) 289
9.2.6 TCP-Tahoe (fast retransmit) 289
9.2.7 TCP-Reno fast retransmit, fast (but conservative) recovery 289
9.2.8 TCP-NewReno (fast retransmit, fast recovery) 290
9.2.9 Spurious retransmissions 291
9.2.10 Modeling of TCP operation 291
9.3 TCP for Mobile Cellular Networks 292
9.3.1 Improving TCP in mobile environments 293
9.3.2 Mobile TCP design 294
9.3.3 The SH-TCP client 296
9.3.4 The M-TCP protocol 297
9.3.5 Performance examples 299
9.4 Random Early Detection Gateways for Congestion Avoidance 300
9.4.1 The RED algorithm 300
9.4.2 Performance example 301
9.5 TCP for Mobile Ad Hoc Networks 304
9.5.1 Effect of route recomputations 304
9.5.2 Effect of network partitions 304
9.5.3 Effect of multipath routing 304
9.5.4 ATCP sublayer 305
9.5.5 ATCP protocol design 306
9.5.6 Performance examples 311
References 311
10 Network Optimization Theory 313
10.1 Introduction 313
10.2 Layering as Optimization Decomposition 314
10.2.1 TCP congestion control 314
10.2.2 TCP Reno/RED 315
10.2.3 TCP Vegas/Drop Tail 316
10.2.4 Optimization of the MAC protocol 316
10.2.5 Utility optimal MAC protocol/social optimum 319
10.3 Crosslayer Optimization 322
10.3.1 Congestion control and routing 322
10.3.2 Congestion control and physical resource allocation 325
10.3.3 Congestion and contention control 327
10.3.4 Congestion control, routing and scheduling 330
10.4 Optimization Problem Decomposition Methods 331
10.4.1 Decoupling coupled constraints 331
10.4.2 Dual decomposition of the basic NUM 332
10.4.3 Coupling constraints 334
10.4.4 Decoupling coupled objectives 334
10.4.5 Alternative decompositions 337
10.4.6 Application example of decomposition techniques to distributed crosslayer optimization 339
10.5 Optimization of Distributed Rate Allocation for Inelastic Utility Flows 343
10.5.1 Nonconcave utility flows 343
10.5.2 Capacity provisioning for convergence of the basic algorithm 346
10.6 Nonconvex Optimization Problem in Network with QoS Provisioning 347
10.6.1 The system model 347
10.6.2 Solving the nonconvex optimization problem for joint congestion\u2013contention control 349
10.7 Optimization of Layered Multicast by Using Integer and Dynamic Programming 350
10.7.1 The system model 351
10.7.2 Lagrangian relaxation for integer programs 353
10.7.3 Group profit maximization by dynamic programming 353
10.8 QoS Optimization in Time-Varying Channels 355
10.8.1 The system model 355
10.8.2 Dynamic control algorithm 356
10.9 Network Optimization by Geometric Programming 361
10.9.1 Power control by geometric programming: high SNR 362
10.9.2 Power control by geometric programming: low SNR 364
10.10 QoS Scheduling by Geometric Programming 364
10.10.1 Optimization of OFDM system by GP 368
10.10.2 Maximum weight matching scheduling by GP 368
10.10.3 Opportunistic scheduling by GP 369
10.10.4 Rescue scheduling by GP 369
References 370
11 Mobility Management 375
11.1 Introduction 375
11.1.1 Mobility management in cellular networks 377
11.1.2 Location registration and call delivery in 4G 379
11.2 Cellular Systems with Prioritized Handoff 398
11.2.1 Channel assignment priority schemes 401
11.2.2 Channel reservation \u2013 CR handoffs 401
11.2.3 Channel reservation with queueing \u2013 CRQ handoffs 402
11.2.4 Performance examples 406
11.3 Cell Residing Time Distribution 407
11.4 Mobility Prediction in Pico- and MicroCellular Networks 412
11.4.1 PST-QoS guarantees framework 414
11.4.2 Most likely cluster model 415
Appendix: Distance Calculation in an Intermediate Cell 422
References 427
12 Cognitive Radio Resource Management 431
12.1 Channel Assignment Schemes 431
12.1.1 Different channel allocation schemes 433
12.1.2 Fixed channel allocation 434
12.1.3 Channel borrowing schemes 434
12.1.4 Simple channel borrowing schemes 435
12.1.5 Hybrid channel borrowing schemes 436
12.1.6 Dynamic channel allocation 438
12.1.7 Centralized DCA schemes 439
12.1.8 Cell-based distributed DCA schemes 441
12.1.9 Signal strength measurement-based distributed DCA schemes 443
12.1.10 One-dimensional cellular systems 444
12.1.11 Reuse partitioning (RUP) 446
12.2 Dynamic Channel Allocation with SDMA 450
12.2.1 Single-cell environment 450
12.2.2 Resource allocation 454
12.2.3 Performance examples 459
12.3 Packet-Switched SDMA/TDMA Networks 459
12.3.1 The system model 461
12.3.2 Multibeam SDMA/TDMA capacity and slot allocation 463
12.3.3 SDMA/TDMA slot allocation algorithms 465
12.3.4 SDMA/TDMA performance examples 469
12.4 SDMA/OFDM Networks with Adaptive Data Rate 470
12.4.1 The system model 470
12.4.2 Resource allocation algorithm 472
12.4.3 Impact of OFDM/SDMA system specifications on resource allocations 474
12.4.4 Performance examples 477
12.5 Intercell Interference Cancellation \u2013 SP Separability 478
12.5.1 Channel and cellular system model 479
12.5.2 Turbo space\u2013time multiuser detection for intracell communications 481
12.5.3 Multiuser detection in the presence of intercell interference 483
12.5.4 Performance examples 484
12.6 Intercell Interference Avoidance in SDMA Systems 485
12.6.1 The BOW scheme 491
12.6.2 Generating beam-off sequences 492
12.6.3 Constrained QRA-IA 492
12.7 Multilayer RRM 494
12.7.1 The SRA protocol 495
12.7.2 The ESRA protocol 497
12.8 Resource Allocation with Power Preassignment (RAPpA) 499
12.8.1 Resource assignment protocol 500
12.8.2 Analytical modeling of RAPpA 503
12.9 Cognitive and Cooperative Dynamic Radio Resource Allocation 508
12.9.1 Signal-to-interference ratio 510
12.9.2 System performance 512
12.9.3 Multicell operation 515
12.9.4 Performance examples 516
Appendix 12A: Power Control, CD Protocol, in the Presence of Fading 518
Appendix 12B: Average Intercell Throughput 522
References 523
13 Ad Hoc Networks 529
13.1 Routing Protocols 529
13.1.1 Routing protocols 531
13.1.2 Reactive protocols 536
13.2 Hybrid routing protocol 548
13.2.1 Loop-back termination 550
13.2.2 Early termination 551
13.2.3 Selective broadcasting (SBC) 552
13.3 Scalable Routing Strategies 555
13.3.1 Hierarchical routing protocols 555
13.3.2 Performance examples 557
13.3.3 FSR (fisheye routing) protocol 558
13.4 Multipath Routing 561
13.5 Clustering Protocols 563
13.5.1 Introduction 563
13.5.2 Clustering algorithm 565
13.5.3 Clustering with prediction 566
13.6 Cashing Schemes for Routing 573
13.6.1 Cache management 573
13.7 Distributed QoS Routing 582
13.7.1 Wireless links reliability 582
13.7.2 Routing 582
13.7.3 Routing information 583
13.7.4 Token-based routing 583
13.7.5 Delay-constrained routing 584
13.7.6 Tokens 585
13.7.7 Forwarding the received tokens 586
13.7.8 Bandwidth-constrained routing 586
13.7.9 Forwarding the received tickets 586
13.7.10 Performance example 588
References 591
14 Sensor Networks 597
14.1 Introduction 597
14.2 Sensor Networks Parameters 599
14.2.1 Pre-deployment and deployment phase 600
14.2.2 Post-deployment phase 600
14.2.3 Re-deployment of additional nodes phase 601
14.3 Sensor networks architecture 601
14.3.1 Physical layer 602
14.3.2 Data link layer 602
14.3.3 Network layer 605
14.3.4 Transport layer 609
14.3.5 Application layer 610
14.4 Mobile Sensor Networks Deployment 611
14.5 Directed Diffusion 614
14.5.1 Data propagation 615
14.5.2 Reinforcement 617
14.6 Aggregation in Wireless Sensor Networks 617
14.7 Boundary Estimation 620
14.7.1 Number of RDPs in P 622
14.7.2 Kraft inequality 622
14.7.3 Upper bounds on achievable accuracy 623
14.7.4 System optimization 624
14.8 Optimal Transmission Radius in Sensor Networks 626
14.8.1 Back-off phenomenon 630
14.9 Data Funneling 631
14.10 Equivalent Transport Control Protocol in Sensor Networks 634
References 637
15 Security 647
15.1 Authentication 647
15.1.1 Attacks on simple cryptographic authentication 649
15.1.2 Canonical authentication protocol 653
15.2 Security Architecture 655
15.3 Key Management 659
15.3.1 Encipherment 661
15.3.2 Modification detection codes 661
15.3.3 Replay detection codes 661
15.3.4 Proof of knowledge of a key 661
15.3.5 Point-to-point key distribution 662
15.4 Security management in GSM networks 663
15.5 Security management in UMTS 667
15.6 Security architecture for UMTS/WLAN Interworking 669
15.7 Security in Ad Hoc Networks 671
15.7.1 Self-organized key management 675
15.8 Security in Sensor Networks 676
References 678
16 Active Networks 683
16.1 Introduction 683
16.2 Programable Networks Reference Models 685
16.2.1 IETF ForCES 686
16.2.2 Active networks reference architecture 686
16.3 Evolution to 4G Wireless Networks 689
16.4 Programmable 4G Mobile Network Architecture 691
16.5 Cognitive Packet Networks 694
16.5.1 Adaptation by cognitive packets 696
16.5.2 The random neural networks-based algorithms 697
16.6 Game Theory Models in Cognitive Radio Networks 699
16.6.1 Cognitive radio networks as a game 702
16.7 Biologically Inspired Networks 706
16.7.1 Bio-analogies 706
16.7.2 Bionet architecture 708
References 710
17 Network Deployment 717
17.1 Cellular Systems with Overlapping Coverage 717
17.2 Imbedded Microcell in CDMA Macrocell Network 722
17.2.1 Macrocell and microcell link budget 723
17.2.2 Performance example 726
17.3 Multitier Wireless Cellular Networks 727
17.3.1 The network model 728
17.3.2 Performance example 732
17.4 Local Multipoint Distribution Service 733
17.4.1 Interference estimations 735
17.4.2 Alternating polarization 735
17.5 Self-Organization in 4G Networks 737
17.5.1 Motivation 737
17.5.2 Networks self-organizing technologies 739
References 741
18 Network Management 745
18.1 The Simple Network Management Protocol 745
18.2 Distributed Network Management 749
18.3 Mobile Agent-Based Network Management 750
18.3.1 Mobile agent platform 752
18.3.2 Mobile agents in multioperator networks 752
18.3.3 Integration of routing algorithm and mobile agents 754
18.4 Ad Hoc Network Management 759
18.4.1 Heterogeneous environments 759
18.4.2 Time varying topology 759
18.4.3 Energy constraints 760
18.4.4 Network partitioning 760
18.4.5 Variation of signal quality 760
18.4.6 Eavesdropping 760
18.4.7 Ad hoc network management protocol functions 760
18.4.8 ANMP architecture 762
References 767
19 Network Information Theory 771
19.1 Effective Capacity of Advanced Cellular Networks 771
19.1.1 4G cellular network system model 773
19.1.2 The received signal 774
19.1.3 Multipath channel: near\u2013far effect and power control 776
19.1.4 Multipath channel: pointer tracking error, rake receiver and interference canceling 777
19.1.5 Interference canceler modeling: nonlinear multiuser detectors 779
19.1.6 Approximations 781
19.1.7 Outage probability 781
19.2 Capacity of Ad Hoc Networks 785
19.2.1 Arbitrary networks 786
19.2.2 Random networks 788
19.2.3 Arbitrary networks: an upper bound on transport capacity 789
19.2.4 Arbitrary networks: lower bound on transport capacity 792
19.2.5 Random networks: lower bound on throughput capacity 793
19.3 Information Theory and Network Architectures 797
19.3.1 Network architecture 797
19.3.2 Definition of feasible rate vectors 799
19.3.3 The transport capacity 800
19.3.4 Upper bounds under high attenuation 800
19.3.5 Multihop and feasible lower bounds under high attenuation 801
19.3.6 The low-attenuation regime 802
19.3.7 The Gaussian multiple-relay channel 803
19.4 Cooperative Transmission in Wireless Multihop Ad Hoc Networks 804
19.4.1 Transmission strategy and error propagation 807
19.4.2 OLA flooding algorithm 808
19.4.3 Simulation environment 808
19.5 Network Coding 811
19.5.1 Max-flow min-cut theorem (mfmcT) 812
19.5.2 Achieving the max-flow bound through a generic LCM 813
19.5.3 The transmission scheme associated with an LCM 816
19.5.4 Memoryless communication network 817
19.5.5 Network with memory 818
19.5.6 Construction of a generic LCM on an acyclic network 818
19.5.7 Time-invariant LCM and heuristic construction 819
19.6 Capacity of Wireless Networks Using MIMO Technology 822
19.6.1 Capacity metrics 824
19.7 Capacity of Sensor Networks with Many-to-One Transmissions 829
19.7.1 Network architecture 829
19.7.2 Capacity results 831
References 833
20 Energy-efficient Wireless Networks 837
20.1 Energy Cost Function 837
20.2 Minimum Energy Routing 839
20.3 Maximizing Network Lifetime 840
20.4 Energy-efficient MAC in Sensor Networks 845
20.4.1 Staggered wakeup schedule 845
References 847
21 Quality-of-Service Management 851
21.1 Blind QoS Assessment System 851
21.1.1 System modeling 853
21.2 QoS Provisioning in WLAN 855
21.2.1 Contention-based multipolling 855
21.2.2 Polling efficiency 856
21.3 Dynamic Scheduling on RLC/MAC Layer 859
21.3.1 DSMC functional blocks 861
21.3.2 Calculating the high service rate 862
21.3.3 Heading-block delay 864
21.3.4 Interference model 865
21.3.5 Normal delay of a newly arrived block 865
21.3.6 High service rate of a session 866
21.4 QoS in OFDMA-Based Broadband Wireless Access Systems 866
21.4.1 Iterative solution 870
21.4.2 Resource allocation to maximize capacity 872
21.5 Predictive Flow Control and QoS 873
21.5.1 Predictive flow control model 874
References 878
Index 883