Wireless Networking (eBook)

Front Cover 1
Wireless Networking 6
Copyright Page 7
Table of Contents 8
Preface 14
Chapter 1. Introduction 20
1.1 Networking as Resource Allocation 20
1.2 ATaxonomy of Current Practice 22
1.3 Technical Elements 28
1.4 Summary and Our Way Forward 31
Chapter 2. Wireless Communication: Concepts, Techniques, Models 34
2.1 Digital Communication over Radio Channels 35
2.1.1 Simple Binary Modulation and Detection 36
2.1.2 Getting Higher Bit Rates 39
2.1.3 Channel Coding 42
2.1.4 Delay, Path Loss, Shadowing, and Fading 44
2.2 Channel Capacity 51
2.2.1 Channel Capacity without Fading 51
2.2.2 Channel Capacity with Fading 54
2.3 Diversity and Parallel Channels: MIMO 55
2.4 Wideband Systems 61
2.4.1 CDMA 61
2.4.2 OFDMA 64
2.5 Additional Reading 67
Chapter 3. Application Models and Performance Issues 72
3.1 Network Architectures and Application Scenarios 73
3.2 Types of Traffic and QoS Requirements 75
3.3 Real-Time Stream Sessions: Delay Guarantees 79
3.3.1 CBR Speech 79
3.3.2 VBR Speech 80
3.3.3 Speech Playout 82
3.3.4 QoS Objectives 84
3.3.5 Network Service Models 86
3.4 Elastic Transfers: Feedback Control 86
3.4.1 Dynamic Control of Bandwidth Sharing 88
3.4.2 Control Mechanisms: MAC andTCP 89
3.4.3 TCP Performance over Wireless Links 91
3.5 Notes on the Literature 97
Chapter 4. Cellular FDM-TDMA 100
4.1 Principles of FDM-TDMA Cellular Systems 100
4.2 SIR Analysis: Keeping Cochannel Cells Apart 105
4.3 Channel Reuse Analysis: Hexagonal Cell Layout 111
4.3.1 Cochannel Cell Groups 112
4.3.2 Calculating Nreuse 113
4.3.3 DRRatio: Simple Analysis, Cell Sectorization 115
4.4 Spectrum Efficiency 118
4.5 Channel Allocation and Multicell Erlang Models 120
4.5.1 Reuse Constraint Graph 120
4.5.2 Feasible Carrier Requirements 122
4.5.3 Carrier Allocation Strategies 122
4.5.4 Call Blocking Analysis 123
4.6 Handovers:Techniques, Models, Analysis 131
4.6.1 Analysis of Signal Strength Based Handovers 131
4.7 The GSM System for Mobile Telephony 136
4.8 Notes on the Literature 138
Chapter 5. Cellular CDMA 144
5.1 The Uplink SINR Inequalities 145
5.2 A Simple Case: One Call Class 149
5.2.1 Example: Two BSs and Collocated MSs 149
5.2.2 Multiple BSs and Uniformly Distributed MSs 150
5.2.3 Other Cell Interference: Hard and Soft Handover 153
5.2.4 System Capacity for Voice Calls 158
5.3 Admission Control of Multiclass Calls 159
5.3.1 Hard and Soft Admission Control 160
5.4 Association and Power Control for Guaranteed QoS Calls 164
5.5 Scheduling ElasticTransfers 168
5.6 CDMA-Based 2G and 3G Cellular Systems 173
5.7 Notes on the Literature 174
5.8 Appendix: Perron-Frobenius Theory 175
Chapter 6. Cellular OFDMA-TDMA 180
6.1 The General Model 181
6.2 Resource Allocation over a Single Carrier 182
6.2.1 Power Control for Optimal Service Rate 184
6.2.2 Power Control for Optimal Power Constrained Delay 190
6.3 Multicarrier Resource Allocation: Downlink 197
6.3.1 Single MS Case 197
6.3.2 Multiple MSs 200
6.4 WiMAX:The IEEE 802.16 Broadband Wireless Access Standard 202
6.5 Notes on the Literature 202
Chapter 7. Random Access and Wireless LANs 206
7.1 Preliminaries 207
7.2 Random Access: From Aloha to CSMA 208
7.2.1 Protocols without Carrier Sensing: Aloha and Slotted Aloha 209
7.2.2 Carrier Sensing Protocols 218
7.3 CSMA/CA and WLAN Protocols 220
7.3.1 Principles of Collision Avoidance 220
7.3.2 The IEEE 802.11 WLAN Standards 223
7.3.3 HIPERLAN 230
7.4 Saturation Throughput of a Colocated IEEE 802.11-DCF Network 232
7.5 Service Differentiation and IEEE 802.11e WLANs 241
7.6 Data and Voice Sessions over 802.11 244
7.6.1 Data over WLAN 245
7.6.2 Voice over WLAN 249
7.7 Association in IEEE 802.11 WLANs 253
7.8 Notes on the Literature 254
Chapter 8. Mesh Networks: Optimal Routing and Scheduling 262
8.1 Network Topology and Link Activation Constraints 263
8.1.1 Link Activation Constraints 263
8.2 Link Scheduling and Schedulable Region 266
8.2.1 Stability of Queues 269
8.2.2 Link Flows and Link Stability Region 273
8.3 Routing and Scheduling a Given Flow Vector 276
8.4 Maximum Weight Scheduling 283
8.5 Routing and Scheduling for ElasticTraffic 292
8.5.1 Fair Allocation for Single Hop Flows 296
8.5.2 Fair Allocation for Multihop Flows 299
8.6 Notes on the Literature 306
Chapter 9. Mesh Networks: Fundamental Limits 310
9.1 Preliminaries 311
9.1.1 Random Graph Models for Wireless Networks 312
9.1.2 Spatial Reuse, Network Capacity, and Connectivity 315
9.2 Connectivity in the Random Geometric GraphModel 316
9.2.1 Finite Networks in One Dimension 317
9.2.2 Networks inTwo Dimensions: Asymptotic Results 321
9.3 Connectivity in the Interference Model 328
9.4 Capacity and Spatial Reuse Models 334
9.5 Transport Capacity of Arbitrary Networks 337
9.6 Transport Capacity of Randomly DeployedNetworks 341
9.6.1 Protocol Model 341
9.6.2 Discussion 350
9.7 Notes on the Literature 352
Chapter 10. Ad Hoc Wireless Sensor Networks (WSNs) 356
10.1 Communication Coverage 358
10.2 Sensing Coverage 360
10.3 Localization 367
10.4 Routing 372
10.5 Function Computation 378
10.6 Scheduling 387
10.6.1 S-MAC 388
10.6.2 IEEE 802.15.4 (Zigbee) 389
10.7 Notes on the Literature 391
Appendices 394
Appendix A. Notation and Terminology 396
A.1 Miscellaneous Operators and Mathematical Notation 396
A.2 Vectors and Matrices 396
A.3 Asymptotics:The O, o, and ~ Notation 396
A.4 Probability 398
Appendix B. A Review of Some Mathematical Concepts 400
B.1 Limits of Real Number Sequences 400
B.2 A Fixed Point Theorem 401
B.3 Probability and Random Processes 401
B.3.1 Useful Inequalities and Bounds 401
B.3.2 Convergence Concepts 403
B.3.3 The Borel-Cantelli Lemma 404
B.3.4 Laws of Large Numbers and Central Limit Theorem 404
B.3.5 Stationarity and Ergodicity 405
B.4 Notes on the Literature 406
Appendix C. Convex Optimization 408
C.1 Convexity 408
C.2 Local and Global Optima 408
C.3 The Karush-Kuhn-Tucker Conditions 409
C.4 Duality 410
Appendix D. Discrete Event Random Processes 412
D.1 Stability Analysis of Discrete Time Markov Chains (DTMCs) 412
D.2 Continuous Time Markov Chains 413
D.3 Renewal Processes 417
D.3.1 Renewal Reward Processes 417
D.3.2 The Excess Distribution 418
D.3.3 Markov Renewal Processes 418
D.4 Some Topics in Queuing Theory 420
D.4.1 Little’sTheorem 420
D.4.2 Poisson Arrivals See Time Averages (PASTA) 421
D.5 Some Important Queuing Models 422
D.5.1 The M/G/c/c Queue 422
D.5.2 The Processor Sharing Queue 423
D.6 Notes on the Literature 424
Bibliography 426
Index 436