| Preface | p. xiii |
| Introduction | p. 1 |
| Networking as Resource Allocation | p. 1 |
| A Taxonomy of Current Practice | p. 3 |
| Technical Elements | p. 9 |
| Summary and Our Way Forward | p. 12 |
| Wireless Communication: Concepts, Techniques, Models | p. 15 |
| Digital Communication over Radio Channels | p. 16 |
| Simple Binary Modulation and Detection | p. 17 |
| Getting Higher Bit Rates | p. 20 |
| Channel Coding | p. 23 |
| Delay, Path Loss, Shadowing, and Fading | p. 25 |
| Channel Capacity | p. 32 |
| Channel Capacity without Fading | p. 32 |
| Channel Capacity with Fading | p. 35 |
| Diversity and Parallel Channels: MIMO | p. 36 |
| Wideband Systems | p. 42 |
| CDMA | p. 42 |
| OFDMA | p. 45 |
| Additional Reading | p. 48 |
| Application Models and Performance Issues | p. 53 |
| Network Architectures and Application Scenarios | p. 54 |
| Types of Traffic and QoS Requirements | p. 56 |
| Real-Time Stream Sessions: Delay Guarantees | p. 60 |
| CBR Speech | p. 60 |
| VBR Speech | p. 61 |
| Speech Playout | p. 63 |
| QoS Objectives | p. 65 |
| Network Service Models | p. 67 |
| Elastic Transfers: Feedback Control | p. 67 |
| Dynamic Control of Bandwidth Sharing | p. 69 |
| Control Mechanisms: MAC and TCP | p. 70 |
| TCP Performance over Wireless Links | p. 72 |
| Notes on the Literature | p. 78 |
| Cellular FDM-TDMA | p. 81 |
| Principles of FDM-TDMA Cellular Systems | p. 81 |
| SIR Analysis: Keeping Cochannel Cells Apart | p. 86 |
| Channel Reuse Analysis: Hexagonal Cell Layout | p. 92 |
| Cochannel Cell Groups | p. 93 |
| Calculating N[subscript reuse] | p. 94 |
| D/R Ratio: Simple Analysis, Cell Sectorization | p. 96 |
| Spectrum Efficiency | p. 99 |
| Channel Allocation and Multicell Erlang Models | p. 101 |
| Reuse Constraint Graph | p. 101 |
| Feasible Carrier Requirements | p. 103 |
| Carrier Allocation Strategies | p. 103 |
| Call Blocking Analysis | p. 104 |
| Comparison of FCA and MPA | p. 106 |
| Handovers: Techniques, Models, Analysis | p. 112 |
| Analysis of Signal Strength Based Handovers | p. 112 |
| Handover Blocking, Call Dropping: Channel Reservation | p. 115 |
| The GSM System for Mobile Telephony | p. 117 |
| Notes on the Literature | p. 119 |
| Cellular CDMA | p. 125 |
| The Uplink SINR Inequalities | p. 126 |
| A Simple Case: One Call Class | p. 130 |
| Example: Two BSs and Collocated MSs | p. 130 |
| Multiple BSs and Uniformly Distributed MSs | p. 131 |
| Other Cell Interference: Hard and Soft Handover | p. 134 |
| System Capacity for Voice Calls | p. 139 |
| Admission Control of Multiclass Calls | p. 140 |
| Hard and Soft Admission Control | p. 141 |
| Soft Admission Control Using Chemoff's Bound | p. 141 |
| Association and Power Control for Guaranteed QoS Calls | p. 145 |
| Scheduling Elastic Transfers | p. 149 |
| CDMA-Based 2G and 3G Cellular Systems | p. 154 |
| Notes on the Literature | p. 155 |
| Appendix: Perron-Frobenius Theory | p. 156 |
| Cellular OFDMA-TDMA | p. 161 |
| The General Model | p. 162 |
| Resource Allocation over a Single Carrier | p. 163 |
| Power Control for Optimal Service Rate | p. 165 |
| Power Control for Optimal Power Constrained Delay | p. 171 |
| Multicarrier Resource Allocation: Downlink | p. 178 |
| Single MS Case | p. 178 |
| Multiple MSs | p. 181 |
| WiMAX: The IEEE 802.16 Broadband Wireless Access Standard | p. 183 |
| Notes on the Literature | p. 183 |
| Random Access and Wireless LANs | p. 187 |
| Preliminaries | p. 188 |
| Random Access: From Aloha to CSMA | p. 189 |
| Protocols without Carrier Sensing: Aloha and Slotted Aloha | p. 190 |
| Carrier Sensing Protocols | p. 199 |
| CSMA/CA and WLAN Protocols | p. 201 |
| Principles of Collision Avoidance | p. 201 |
| The IEEE 802.11 WLAN Standards | p. 204 |
| HIPERLAN | p. 211 |
| Saturation Throughput of a Colocated IEEE 802.11-DCF Network | p. 213 |
| Service Differentiation and IEEE 802.11e WLANs | p. 222 |
| Data and Voice Sessions over 802.11 | p. 225 |
| Data over WLAN | p. 226 |
| Voice over WLAN | p. 230 |
| Association in IEEE 802.11 WLANs | p. 234 |
| Notes on the Literature | p. 235 |
| Mesh Networks: Optimal Routing and Scheduling | p. 243 |
| Network Topology and Link Activation Constraints | p. 244 |
| Link Activation Constraints | p. 244 |
| Link Scheduling and Schedulable Region | p. 247 |
| Stability of Queues | p. 250 |
| Link Flows and Link Stability Region | p. 254 |
| Routing and Scheduling a Given Flow Vector | p. 257 |
| Maximum Weight Scheduling | p. 264 |
| Routing and Scheduling for Elastic Traffic | p. 273 |
| Fair Allocation for Single Hop Flows | p. 277 |
| Fair Allocation for Multihop Flows | p. 280 |
| Notes on the Literature | p. 287 |
| Mesh Networks: Fundamental Limits | p. 291 |
| Preliminaries | p. 292 |
| Random Graph Models for Wireless Networks | p. 293 |
| Spatial Reuse, Network Capacity, and Connectivity | p. 296 |
| Connectivity in the Random Geometric Graph Model | p. 297 |
| Finite Networks in One Dimension | p. 298 |
| Networks in Two Dimensions: Asymptotic Results | p. 302 |
| Connectivity in the Interference Model | p. 309 |
| Capacity and Spatial Reuse Models | p. 315 |
| Transport Capacity of Arbitrary Networks | p. 318 |
| Transport Capacity of Randomly Deployed Networks | p. 322 |
| Protocol Model | p. 322 |
| Discussion | p. 331 |
| Notes on the Literature | p. 333 |
| Ad Hoc Wireless Sensor Networks (WSNs) | p. 337 |
| Communication Coverage | p. 339 |
| Sensing Coverage | p. 341 |
| Localization | p. 348 |
| Routing | p. 353 |
| Function Computation | p. 359 |
| Scheduling | p. 368 |
| S-MAC | p. 369 |
| IEEE 802.15.4 (Zigbee) | p. 370 |
| Notes on the Literature | p. 372 |
| Appendices | p. 375 |
| Notation and Terminology | p. 377 |
| Miscellaneous Operators and Mathematical Notation | p. 377 |
| Vectors and Matrices | p. 377 |
| Asymptotics: The O, o, and [tilde] Notation | p. 377 |
| Probability | p. 379 |
| A Review of Some Mathematical Concepts | p. 381 |
| Limits of Real Number Sequences | p. 381 |
| A Fixed Point Theorem | p. 382 |
| Probability and Random Processes | p. 382 |
| Useful Inequalities and Bounds | p. 382 |
| Convergence Concepts | p. 384 |
| The Borel-Cantelli Lemma | p. 385 |
| Laws of Large Numbers and Central Limit Theorem | p. 385 |
| Stationarity and Ergodicity | p. 386 |
| Notes on the Literature | p. 387 |
| Convex Optimization | p. 389 |
| Convexity | p. 389 |
| Local and Global Optima | p. 389 |
| The Karush-Kuhn-Tucker Conditions | p. 390 |
| Duality | p. 391 |
| Discrete Event Random Processes | p. 393 |
| Stability Analysis of Discrete Time Markov Chains (DTMCs) | p. 393 |
| Continuous Time Markov Chains | p. 394 |
| Renewal Processes | p. 398 |
| Renewal Reward Processes | p. 398 |
| The Excess Distribution | p. 399 |
| Markov Renewal Processes | p. 399 |
| Some Topics in Queuing Theory | p. 401 |
| Little's Theorem | p. 401 |
| Poisson Arrivals See Time Averages (PASTA) | p. 402 |
| Some Important Queuing Models | p. 403 |
| The M/G/c/c Queue | p. 403 |
| The Processor Sharing Queue | p. 404 |
| Notes on the Literature | p. 405 |
| Bibliography | p. 407 |
| Index | p. 417 |
| Table of Contents provided by Ingram. All Rights Reserved. |
