Wireless networking /

Wireless networking /

Saved in:
Bibliographic Details
Author / Creator:Kumar, Anurag.
Imprint:Amsterdam ; Boston : Morgan Kaufmann/Elsevier, ©2008.
Description:1 online resource (xvii, 427 pages) : illustrations
Language:English
Series:The Morgan Kaufmann series in networking
Morgan Kaufmann series in networking.
Subject:
Wireless LANs.
Wireless communication systems.
Sensor networks.
Sensor networks
Wireless communication systems
Wireless LANs
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/13593812
Hidden Bibliographic Details
Other authors / contributors:Manjunath, D.
Kuri, Joy.
ISBN:9780123742544
0123742544
9780080558301
0080558305
Notes:Includes bibliographical references (pages 407-416) and index.
Print version record.
Summary: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
Other form:Print version: Kumar, Anurag. Wireless networking. Amsterdam ; Boston : Morgan Kaufmann/Elsevier, ©2008 0123742544 9780123742544
Table of Contents:
  • Preface
  • 1. Introduction
  • 1.1. Networking as Resource Allocation
  • 1.2. A Taxonomy of Current Practice
  • 1.3. Technical Elements
  • 1.4. Summary and Our Way Forward
  • 2. Wireless Communication: Concepts, Techniques, Models
  • 2.1. Digital Communication over Radio Channels
  • 2.1.1. Simple Binary Modulation and Detection
  • 2.1.2. Getting Higher Bit Rates
  • 2.1.3. Channel Coding
  • 2.1.4. Delay, Path Loss, Shadowing, and Fading
  • 2.2. Channel Capacity
  • 2.2.1. Channel Capacity without Fading
  • 2.2.2. Channel Capacity with Fading
  • 2.3. Diversity and Parallel Channels: MIMO
  • 2.4. Wideband Systems
  • 2.4.1. CDMA
  • 2.4.2. OFDMA
  • 2.5. Additional Reading
  • 3. Application Models and Performance Issues
  • 3.1. Network Architectures and Application Scenarios
  • 3.2. Types of Traffic and QoS Requirements
  • 3.3. Real-Time Stream Sessions: Delay Guarantees
  • 3.3.1. CBR Speech
  • 3.3.2. VBR Speech
  • 3.3.3. Speech Playout
  • 3.3.4. QoS Objectives
  • 3.3.5. Network Service Models
  • 3.4. Elastic Transfers: Feedback Control
  • 3.4.1. Dynamic Control of Bandwidth Sharing
  • 3.4.2. Control Mechanisms: MAC and TCP
  • 3.4.3. TCP Performance over Wireless Links
  • 3.5. Notes on the Literature
  • 4. Cellular FDM-TDMA
  • 4.1. Principles of FDM-TDMA Cellular Systems
  • 4.2. SIR Analysis: Keeping Cochannel Cells Apart
  • 4.3. Channel Reuse Analysis: Hexagonal Cell Layout
  • 4.3.1. Cochannel Cell Groups
  • 4.3.2. Calculating N[subscript reuse]
  • 4.3.3. D/R Ratio: Simple Analysis, Cell Sectorization
  • 4.4. Spectrum Efficiency
  • 4.5. Channel Allocation and Multicell Erlang Models
  • 4.5.1. Reuse Constraint Graph
  • 4.5.2. Feasible Carrier Requirements
  • 4.5.3. Carrier Allocation Strategies
  • 4.5.4. Call Blocking Analysis
  • 4.5.5. Comparison of FCA and MPA
  • 4.6. Handovers: Techniques, Models, Analysis
  • 4.6.1. Analysis of Signal Strength Based Handovers
  • 4.6.2. Handover Blocking, Call Dropping: Channel Reservation
  • 4.7. The GSM System for Mobile Telephony
  • 4.8. Notes on the Literature
  • 5. Cellular CDMA
  • 5.1. The Uplink SINR Inequalities
  • 5.2. A Simple Case: One Call Class
  • 5.2.1. Example: Two BSs and Collocated MSs
  • 5.2.2. Multiple BSs and Uniformly Distributed MSs
  • 5.2.3. Other Cell Interference: Hard and Soft Handover
  • 5.2.4. System Capacity for Voice Calls
  • 5.3. Admission Control of Multiclass Calls
  • 5.3.1. Hard and Soft Admission Control
  • 5.3.2. Soft Admission Control Using Chemoff's Bound
  • 5.4. Association and Power Control for Guaranteed QoS Calls
  • 5.5. Scheduling Elastic Transfers
  • 5.6. CDMA-Based 2G and 3G Cellular Systems
  • 5.7. Notes on the Literature
  • 5.8. Appendix: Perron-Frobenius Theory
  • 6. Cellular OFDMA-TDMA
  • 6.1. The General Model
  • 6.2. Resource Allocation over a Single Carrier
  • 6.2.1. Power Control for Optimal Service Rate
  • 6.2.2. Power Control for Optimal Power Constrained Delay
  • 6.3. Multicarrier Resource Allocation: Downlink
  • 6.3.1. Single MS Case
  • 6.3.2. Multiple MSs
  • 6.4. WiMAX: The IEEE 802.16 Broadband Wireless Access Standard
  • 6.5. Notes on the Literature
  • 7. Random Access and Wireless LANs
  • 7.1. Preliminaries
  • 7.2. Random Access: From Aloha to CSMA
  • 7.2.1. Protocols without Carrier Sensing: Aloha and Slotted Aloha
  • 7.2.2. Carrier Sensing Protocols
  • 7.3. CSMA/CA and WLAN Protocols
  • 7.3.1. Principles of Collision Avoidance
  • 7.3.2. The IEEE 802.11 WLAN Standards
  • 7.3.3. HIPERLAN
  • 7.4. Saturation Throughput of a Colocated IEEE 802.11-DCF Network
  • 7.5. Service Differentiation and IEEE 802.11e WLANs
  • 7.6. Data and Voice Sessions over 802.11
  • 7.6.1. Data over WLAN
  • 7.6.2. Voice over WLAN
  • 7.7. Association in IEEE 802.11 WLANs
  • 7.8. Notes on the Literature
  • 8. Mesh Networks: Optimal Routing and Scheduling
  • 8.1. Network Topology and Link Activation Constraints
  • 8.1.1. Link Activation Constraints
  • 8.2. Link Scheduling and Schedulable Region
  • 8.2.1. Stability of Queues
  • 8.2.2. Link Flows and Link Stability Region
  • 8.3. Routing and Scheduling a Given Flow Vector
  • 8.4. Maximum Weight Scheduling
  • 8.5. Routing and Scheduling for Elastic Traffic
  • 8.5.1. Fair Allocation for Single Hop Flows
  • 8.5.2. Fair Allocation for Multihop Flows
  • 8.6. Notes on the Literature
  • 9. Mesh Networks: Fundamental Limits
  • 9.1. Preliminaries
  • 9.1.1. Random Graph Models for Wireless Networks
  • 9.1.2. Spatial Reuse, Network Capacity, and Connectivity
  • 9.2. Connectivity in the Random Geometric Graph Model
  • 9.2.1. Finite Networks in One Dimension
  • 9.2.2. Networks in Two Dimensions: Asymptotic Results
  • 9.3. Connectivity in the Interference Model
  • 9.4. Capacity and Spatial Reuse Models
  • 9.5. Transport Capacity of Arbitrary Networks
  • 9.6. Transport Capacity of Randomly Deployed Networks
  • 9.6.1. Protocol Model
  • 9.6.2. Discussion
  • 9.7. Notes on the Literature
  • 10. Ad Hoc Wireless Sensor Networks (WSNs)
  • 10.1. Communication Coverage
  • 10.2. Sensing Coverage
  • 10.3. Localization
  • 10.4. Routing
  • 10.5. Function Computation
  • 10.6. Scheduling
  • 10.6.1. S-MAC
  • 10.6.2. IEEE 802.15.4 (Zigbee)
  • 10.7. Notes on the Literature
  • Appendices
  • A. Notation and Terminology
  • A.1. Miscellaneous Operators and Mathematical Notation
  • A.2. Vectors and Matrices
  • A.3. Asymptotics: The O, o, and [tilde] Notation
  • A.4. Probability
  • B. A Review of Some Mathematical Concepts
  • B.1. Limits of Real Number Sequences
  • B.2. A Fixed Point Theorem
  • B.3. Probability and Random Processes
  • B.3.1. Useful Inequalities and Bounds
  • B.3.2. Convergence Concepts
  • B.3.3. The Borel-Cantelli Lemma
  • B.3.4. Laws of Large Numbers and Central Limit Theorem
  • B.3.5. Stationarity and Ergodicity
  • B.4. Notes on the Literature
  • C. Convex Optimization
  • C.1. Convexity
  • C.2. Local and Global Optima
  • C.3. The Karush-Kuhn-Tucker Conditions
  • C.4. Duality
  • D. Discrete Event Random Processes
  • D.1. Stability Analysis of Discrete Time Markov Chains (DTMCs)
  • D.2. Continuous Time Markov Chains
  • D.3. Renewal Processes
  • D.3.1. Renewal Reward Processes
  • D.3.2. The Excess Distribution
  • D.3.3. Markov Renewal Processes
  • D.4. Some Topics in Queuing Theory
  • D.4.1. Little's Theorem
  • D.4.2. Poisson Arrivals See Time Averages (PASTA)
  • D.5. Some Important Queuing Models
  • D.5.1. The M/G/c/c Queue
  • D.5.2. The Processor Sharing Queue
  • D.6. Notes on the Literature
  • Bibliography
  • Index

Similar Items