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