Wireless Networking
Regular price
13.500 KD
inc. VAT
Couldn't load pickup availability
Table of contents
- Contentsvii
- Prefacexiii
- Chapter 1. Introduction1
- 1.1 Networking as Resource Allocation1
- 1.2 A Taxonomy of Current Practice3
- 1.3 Technical Elements9
- 1.4 Summary and Our Way Forward12
- Chapter 2. Wireless Communication: Concepts, Techniques, Models15
- 2.1 Digital Communication over Radio Channels16
- 2.1.1 Simple Binary Modulation and Detection17
- 2.1.2 Getting Higher Bit Rates20
- 2.1.3 Channel Coding23
- 2.1.4 Delay, Path Loss, Shadowing, and Fading25
- 2.2 Channel Capacity32
- 2.2.1 Channel Capacity without Fading32
- 2.2.2 Channel Capacity with Fading35
- 2.3 Diversity and Parallel Channels: MIMO36
- 2.4 Wideband Systems42
- 2.4.1 CDMA42
- 2.4.2 OFDMA45
- 2.5 Additional Reading48
- Chapter 3. Application Models and Performance Issues53
- 3.1 Network Architectures and Application Scenarios54
- 3.2 Types of Traffic and QoS Requirements56
- 3.3 Real-Time Stream Sessions: Delay Guarantees60
- 3.3.1 CBR Speech60
- 3.3.2 VBR Speech61
- 3.3.3 Speech Playout63
- 3.3.4 QoS Objectives65
- 3.3.5 Network Service Models67
- 3.4 Elastic Transfers: Feedback Control67
- 3.4.1 Dynamic Control of Bandwidth Sharing69
- 3.4.2 Control Mechanisms: MAC andTCP70
- 3.4.3 TCP Performance over Wireless Links72
- 3.5 Notes on the Literature78
- Chapter 4. Cellular FDM-TDMA81
- 4.1 Principles of FDM-TDMA Cellular Systems81
- 4.2 SIR Analysis: Keeping Cochannel Cells Apart86
- 4.3 Channel Reuse Analysis: Hexagonal Cell Layout92
- 4.3.1 Cochannel Cell Groups93
- 4.3.2 Calculating Nreuse94
- 4.3.3 D/R Ratio: Simple Analysis, Cell Sectorization96
- 4.4 Spectrum Efficiency99
- 4.5 Channel Allocation and Multicell Erlang Models101
- 4.5.1 Reuse Constraint Graph101
- 4.5.2 Feasible Carrier Requirements103
- 4.5.3 Carrier Allocation Strategies103
- 4.5.4 Call Blocking Analysis104
- 4.6 Handovers:Techniques, Models, Analysis112
- 4.6.1 Analysis of Signal Strength Based Handovers112
- 4.7 The GSM System for Mobile Telephony117
- 4.8 Notes on the Literature119
- Chapter 5. Cellular CDMA125
- 5.1 The Uplink SINR Inequalities126
- 5.2 A Simple Case: One Call Class130
- 5.2.1 Example: Two BSs and Collocated MSs130
- 5.2.2 Multiple BSs and Uniformly Distributed MSs131
- 5.2.3 Other Cell Interference: Hard and Soft Handover134
- 5.2.4 System Capacity for Voice Calls139
- 5.3 Admission Control of Multiclass Calls140
- 5.3.1 Hard and Soft Admission Control141
- 5.3.2 Soft Admission Control Using Chernoff’s Bound141
- 5.4 Association and Power Control for Guaranteed QoS Calls145
- 5.5 Scheduling ElasticTransfers149
- 5.6 CDMA-Based 2G and 3G Cellular Systems154
- 5.7 Notes on the Literature155
- 5.8 Appendix: Perron-Frobenius Theory156
- Chapter 6. Cellular OFDMA-TDMA161
- 6.1 The General Model162
- 6.2 Resource Allocation over a Single Carrier163
- 6.2.1 Power Control for Optimal Service Rate165
- 6.2.2 Power Control for Optimal Power Constrained Delay171
- 6.3 Multicarrier Resource Allocation: Downlink178
- 6.3.1 Single MS Case178
- 6.3.2 Multiple MSs181
- 6.4 WiMAX:The IEEE 802.16 Broadband Wireless Access Standard183
- 6.5 Notes on the Literature183
- Chapter 7. Random Access and Wireless LANs187
- 7.1 Preliminaries188
- 7.2 Random Access: From Aloha to CSMA189
- 7.2.1 Protocols without Carrier Sensing: Aloha and Slotted Aloha190
- 7.2.2 Carrier Sensing Protocols199
- 7.3 CSMA/CA and WLAN Protocols201
- 7.3.1 Principles of Collision Avoidance201
- 7.3.2 The IEEE 802.11 WLAN Standards204
- 7.3.3 HIPERLAN211
- 7.4 Saturation Throughput of a Colocated IEEE 802.11-DCF Network213
- 7.5 Service Differentiation and IEEE 802.11e WLANs222
- 7.6 Data and Voice Sessions over 802.11225
- 7.6.1 Data over WLAN226
- 7.6.2 Voice over WLAN230
- 7.7 Association in IEEE 802.11 WLANs234
- 7.8 Notes on the Literature235
- Chapter 8. Mesh Networks: Optimal Routing and Scheduling243
- 8.1 Network Topology and Link Activation Constraints244
- 8.1.1 Link Activation Constraints244
- 8.2 Link Scheduling and Schedulable Region247
- 8.2.1 Stability of Queues250
- 8.2.2 Link Flows and Link Stability Region254
- 8.3 Routing and Scheduling a Given Flow Vector257
- 8.4 Maximum Weight Scheduling264
- 8.5 Routing and Scheduling for ElasticTraffic273
- 8.5.1 Fair Allocation for Single Hop Flows277
- 8.5.2 Fair Allocation for Multihop Flows280
- 8.6 Notes on the Literature287
- Chapter 9. Mesh Networks: Fundamental Limits291
- 9.1 Preliminaries292
- 9.1.1 Random Graph Models for Wireless Networks293
- 9.1.2 Spatial Reuse, Network Capacity, and Connectivity296
- 9.2 Connectivity in the Random Geometric Graph Model297
- 9.2.1 Finite Networks in One Dimension298
- 9.2.2 Networks inTwo Dimensions: Asymptotic Results302
- 9.3 Connectivity in the Interference Model309
- 9.4 Capacity and Spatial Reuse Models315
- 9.5 Transport Capacity of Arbitrary Networks318
- 9.6 Transport Capacity of Randomly DeployedNetworks322
- 9.6.1 Protocol Model322
- 9.6.2 Discussion331
- 9.7 Notes on the Literature333
- Chapter 10. Ad Hoc Wireless Sensor Networks (WSNs)337
- 10.1 Communication Coverage339
- 10.2 Sensing Coverage341
- 10.3 Localization348
- 10.4 Routing353
- 10.5 Function Computation359
- 10.6 Scheduling368
- 10.6.1 S-MAC369
- 10.6.2 IEEE 802.15.4 (Zigbee)370
- 10.7 Notes on the Literature372
- Appendices375
- Appendix A. Notation and Terminology377
- A.1 Miscellaneous Operators and Mathematical Notation377
- A.2 Vectors and Matrices377
- A.3 Asymptotics:The O, o, and ~ Notation377
- A.4 Probability379
- Appendix B. A Review of Some Mathematical Concepts381
- B.1 Limits of Real Number Sequences381
- B.2 A Fixed Point Theorem382
- B.3 Probability and Random Processes382
- B.3.1 Useful Inequalities and Bounds382
- B.3.2 Convergence Concepts384
- B.3.3 The Borel-Cantelli Lemma385
- B.3.4 Laws of Large Numbers and Central Limit Theorem385
- B.3.5 Stationarity and Ergodicity386
- B.4 Notes on the Literature387
- Appendix C. Convex Optimization389
- C.1 Convexity389
- C.2 Local and Global Optima389
- C.3 The Karush-Kuhn-Tucker Conditions390
- C.4 Duality391
- Appendix D. Discrete Event Random Processes393
- D.1 Stability Analysis of Discrete Time Markov Chains (DTMCs)393
- D.2 Continuous Time Markov Chains394
- D.3 Renewal Processes398
- D.3.1 Renewal Reward Processes398
- D.3.2 The Excess Distribution399
- D.3.3 Markov Renewal Processes399
- D.4 Some Topics in Queuing Theory401
- D.4.1 Little’sTheorem401
- D.4.2 Poisson Arrivals See Time Averages (PASTA)402
- D.5 Some Important Queuing Models403
- D.5.1 The M/G/c/c Queue403
- D.5.2 The Processor Sharing Queue404
- D.6 Notes on the Literature405
- Bibliography407
- Index417
Over the past decade, the world has witnessed an explosion in the development and deployment of new wireless network technologies. From cellular mobile telephony to the ubiquitous “WiFi networks in coffee-shops and airports, to the emerging WiMAX wireless broadband access networks, the menu of wireless access systems has become so comprehensive that wireline access to user devices may soon become a relic of the past. Wireless Networking serves as a one-stop view of cellular, WiFi, and WiMAX networks, as well as the emerging wireless ad hoc and sensor networks. Rather than provide descriptive accounts of these technologies and standards, the book emphasizes conceptual perspectives on the modeling, analysis, design and optimization of such networks. Furthermore, the authors present wireless networking within the unifying framework of resource allocation, using simple abstractions of the underlying physical wireless communication. In short, Wireless Networking is an in-depth, exhaustive, and invaluable asset to anyone working in this rapidly evolving field.
*Goes beyond descriptive and qualitative treatments, by presenting the foundations underlying the various wireless networking technologies
*Provides abstractions, models and analyses of established and emerging wireless networks, thereby supplying the reader with a conceptual and quantitative treatment, thus ensuring longevity of the learning from this material
*Aids comprehension by including over 120 figures, four appendices on the mathematics of the various models, several inline exercises, and extensive problem sets at the end of each chapter
*Goes beyond descriptive and qualitative treatments, by presenting the foundations underlying the various wireless networking technologies
*Provides abstractions, models and analyses of established and emerging wireless networks, thereby supplying the reader with a conceptual and quantitative treatment, thus ensuring longevity of the learning from this material
*Aids comprehension by including over 120 figures, four appendices on the mathematics of the various models, several inline exercises, and extensive problem sets at the end of each chapter