Foreword
. -- Acknowledgments
. -- Acronyms
. -- 1 An Easy Introduction To The Shared Wireless Medium
. -- 1.1 How To Build a Simple Model For Wireless Communication
. -- 1.1.1 Which Features We Want From The Model
. -- 1.1.2 Communication Channel With Collisions
. -- 1.1.3 Trade-Offs In The Collision Model
. -- 1.2 The First Contact
. -- 1.2.1 Hierarchy Helps To Establish Contact
. -- 1.2.2 Wireless Rendezvous Without Help
. -- 1.2.3 Rendezvous With Full-Duplex Devices
. -- 1.3 Multiple Access With Centralized Control
. -- 1.3.1 a Frame For Time Division
. -- 1.3.2 Frame Header For Flexible Time Division
. -- 1.3.3 a Simple Two-Way System That Works Under The Collision Model
. -- 1.3.4 Still Not a Practical Tdma System
. -- 1.4 Making Tdma Dynamic
. -- 1.4.1 Circuit-Switched Versus Packet-Switched Operation
. -- 1.4.2 Dynamic Allocation Of Resources To Users
. -- 1.4.3 Short Control Packets And The Idea Of Reservation
. -- 1.4.4 Half-Duplex Versus Full-Duplex In Tdma
. -- 1.5 Chapter Summary
. -- 1.6 Further Reading
. -- 1.7 Problems And Reflections
. -- 2 Random Access: How To Talk In Crowded Dark Room
. -- 2.1 Framed Aloha
. -- 2.1.1 Randomization That Maximizes The Aloha Throughput
. -- 2.2 Probing
. -- 2.2.1 Combining Aloha And Probing
. -- 2.3 Carrier Sensing
. -- 2.3.1 Randomization And Spectrum Sharing
. -- 2.3.2 An Idle Slot Is Cheap
. -- 2.3.3 Feedback To The Transmitter
. -- 2.4 Random Access And Multiple Hops
. -- 2.4.1 Use Of Reservation Packets In Multi-Hop
. -- 2.4.2 Multiple Hops And Full-Duplex
. -- 2.5 Chapter Summary
. -- 2.6 Further Reading
. -- 2.7 Problems And Reflections
. -- 3 Access Beyond The Collision Model
. -- 3.1 Distance Gets Into The Model
. -- 3.1.1 Communication Degrades As The Distance Increases
. -- 3.1.2 How To Make The Result Of a Collision Dependent On The Distance
. -- 3.2 Simplified Distance Dependence: a Double Disk Model
. -- 3.3 Downlink Communication With The Double Disk Model
. -- 3.3.1 a Cautious Example Of a Design That Reaches The Limits Of The Model
. -- 3.4 Uplink Communication With The Double Disk Model
. -- 3.4.1 Uplink That Uses Multi-Packet Reception
. -- 3.4.2 Buffered Collisions For Future Use
. -- 3.4.3 Protocols That Use Packet Fractions
. --
. -- 3.5 Unwrapping The Packets
. -- 3.6 Chapter Summary
. -- 3.7 Further Reading
. -- 3.8 Problems And Reflections
. -- 4 The Networking Cake: Layering And Slicing
. -- 4.1 Layering For a One-Way Link
. -- 4.1.1 Modules And Their Interconnection
. -- 4.1.2 Three Important Concepts In Layering
. -- 4.1.3 An Example Of a Two-Layer System
. -- 4.2 Layers And Cross-Layer
. -- 4.3 Reliable And Unreliable Service From a Layer
. -- 4.4 Black Box Functionality For Different Communication Models
. -- 4.5 Standard Layering Models
. -- 4.5.1 Connection Versus Connectionless
. -- 4.5.2 Functionality Of The Standard Layers
. -- 4.5.3 a Very Brief Look At The Network Layer
. -- 4.6 An Alternative Wireless Layering
. -- 4.7 Cross-Layer Design For Multiple Hops
. -- 4.8 Slicing Of The Wireless Communication Resources
. -- 4.8.1 Analog, Digital, Sliced
. -- 4.8.2 a Primer On Wireless Slicing
. -- 4.8.2.1 Orthogonal Wireless Slicing
. -- 4.8.2.2 Non-Orthogonal Wireless Slicing
. -- 4.9 Chapter Summary
. -- 4.10 Further Reading
. -- 4.11 Problems And Reflections
. -- 5 Packets Under The Looking Glass: Symbols And Noise
. -- 5.1 Compression, Entropy, And Bit
. -- 5.1.1 Obtaining Digital Messages By Compression
. -- 5.1.2 a Bit Of Information
. -- 5.2 Baseband Modules Of The Communication System
. -- 5.2.1 Mapping Bits To Baseband Symbols Under Simplifying Assumptions
. -- 5.2.2 Challenging The Simplifying Assumptions About The Baseband
. -- 5.3 Signal Constellations And Noise
. -- 5.3.1 Constellation Points And Noise Clouds
. -- 5.3.2 Constellations With Limited Average Power
. -- 5.3.3 Beyond The Simple Setup For Symbol Detection
. -- 5.3.4 Signal-To-Noise Ratio (Snr)
. -- 5.4 From Bits To Symbols
. -- 5.4.1 Binary Phase Shift Keying (Bpsk)
. -- 5.4.2 Quaternary Phase Shift Keying (Qpsk)
. -- 5.4.3 Constellations Of Higher Order
. -- 5.4.4 Generalized Mapping To Many Symbols
. -- 5.5 Symbol-Level Interference Models
. -- 5.5.1 Advanced Treatment Of Collisions Based On a Baseband Model
. -- 5.6 Weak And Strong Signals: New Protocol Possibilities
. -- 5.6.1 Randomization Of Power
. -- 5.6.2 Other Goodies From The Baseband Model
. -- 5.7 How To Select The Data Rate
. -- 5.7.1 a Simple Relation Between Packet Errors And Distance
. -- 5.7.2 Adaptive Modulation
. -- 5.8 Superposition Of Baseband Symbols
. -- 5.8.1 Broadcast And Non-Orthogonal Access
. -- 5.8.2 Unequal Error Protection (Uep)
. -- 5.9 Communication With Unknown Channel Coefficients
. -- 5.10 Chapter Summary
. -- 5.11 Further Reading
. -- 5.12 Problems And Reflections
. -- 6 a Mathematical View On a Communication Channel
. -- 6.1 a Toy Example: The Pigeon Communication Channel
. -- 6.1.1 Specification Of a Communication Channel
. -- 6.1.2 Comparison Of The Information Carrying Capability Of Mathematical Channels
. -- 6.1.3 Assumptions And Notations
. -- 6.2 Analog Channels With Gaussian Noise
. -- 6.2.1 Gaussian Channel
. -- 6.2.2 Other Analog Channels Based On The Gaussian Channel
. -- 6.3 The Channel Definition Depends On Who Knows What
. -- 6.4 Using Analog To Create Digital Communication Channels
. -- 6.4.1 Creating Digital Channels Through Gray Mapping
. -- 6.4.2 Creating Digital Channels Through Superposition
. -- 6.5 Transmission Of Packets Over Communication Channels
. -- 6.5.1 Layering Perspective Of The Communication Channels
. -- 6.5.2 How To Obtain Throughput That Is Not Zero
. -- 6.5.3 Asynchronous Packets And Transmission Of "Nothing"
. -- 6.5.4 Packet Transmission Over a Ternary Channel
. -- 6.6 Chapter Summary
. -- 6.7 Further Reading
. -- 6.8 Problems And Reflections
. -- 7 Coding For Reliable Communication
. -- 7.1 Some Coding Ideas For The Binary Symmetric Channel
. -- 7.1.1 a Channel Based On Repetition Coding
. -- 7.1.2 Channel Based On Repetition Coding With Erasures
. -- 7.1.3 Coding Beyond Repetition
. -- 7.1.4 An Illustrative Comparison Of The Bsc Based Channels
. -- 7.2 Generalization Of The Coding Idea
. -- 7.2.1 Maximum Likelihood (Ml) Decoding
. -- 7.3 Linear Block Codes For The Binary Symmetric Channel
. -- 7.4 Coded Modulation As a Layered Subsystem
. -- 7.5 Retransmission As a Supplement To Coding
. -- 7.5.1 Full Packet Retransmission
. -- 7.5.2 Partial Retransmission And Incremental Redundancy
. -- 7.6 Chapter Summary
. -- 7.7 Further Reading
. -- 7.8 Problems And Reflections
. -- 8 Information-Theoretic View On Wireless Channel Capacity
. -- 8.1 It Starts With The Law Of Large Numbers
. -- 8.2 a Useful Digression Into Source Coding
. -- 8.3 Perfectly Reliable Communication And Channel Capacity
. -- 8.4 Mutual Information And Its Interpretations
. -- 8.4.1 From a Local To a Global Property
. -- 8.4.2 Mutual Information In Some Actual Communication Setups
. -- 8.5 The Gaussian Channel And The Popular Capacity Formula
. -- 8.5.1 The Concept Of Entropy In Analog Channels
. -- 8.5.2 The Meaning Of "Shannon’S Capacity Formula"
. -- 8.5.3 Simultaneous Usage Of Multiple Gaussian Channels
. -- 8.6 Capacity Of Fading Channels
. -- 8.6.1 Channel State Information Available At The Transmitter
. -- 8.6.2 Example: Water Filling For Binary Fading
. -- 8.6.3 Water Filling For Continuously Distributed Fading
. -- 8.6.4 Fast Fading And Further Remarks On Channel Knowledge
. -- 8.6.5 Capacity When The Transmitter Does Not Know The Channel
. -- 8.6.5.1 Channel With Binary Inputs And Binary Fading
. -- 8.6.5.2 Channels With Gaussian Noise And Fading
. -- 8.6.6 Channel Estimation And Knowledge
. -- 8.7 Chapter Summary
. -- 8.8 Further Reading
. -- 8.9 Problems And Reflections
. -- 9 Time And Frequency In Wireless Communications
. -- 9.1 Reliable Communication Requires Transmission Of Discrete Values
. -- 9.2 Communication Through a Waveform: An Example
. -- 9.3 Enter The Frequency
. -- 9.3.1 Infinitely Long Signals And True Frequency
. -- 9.3.2 Bandwidth And Time-Limited Signals
. -- 9.3.3 Parallel Communication Channels
. -- 9.3.4 How Frequency Affects The Notion Of Multiple Access
. -- 9.4 Noise And Interference
. -- 9.4.1 Signal Power And Gaussian White Noise
. -- 9.4.2 Interference Between Non-Orthogonal Frequencies
. -- 9.5 Power Spectrum And Fourier Transform
. -- 9.6 Frequency Channels, Finally
. -- 9.6.1 Capacity Of a Bandlimited Channel
. -- 9.6.2 Capacity And Ofdm Transmission
. -- 9.6.3 Frequency For Multiple Access And Duplexing
. -- 9.7 Code Division And Spread Spectrum
. -- 9.7.1 Sharing Synchronized Resources With Orthogonal Codes
. -- 9.7.2 Why Go Through The Trouble Of Spreading?
. -- 9.7.3 Mimicking The Noise And Covert Communication
. -- 9.7.4 Relation To Random Access
. -- 9.8 Chapter Summary
. -- 9.9 Further Reading
. -- 9.10 Problems And Reflections
. -- 10 Space In Wireless Communications
. -- 10.1 Communication Range And Coverage Area
. -- 10.2 The Myth About Frequencies That Propagate Badly In Free Space
. -- 10.3 The World View Of An Antenna
. -- 10.3.1 Antenna Directivity
. -- 10.3.2 Directivity Changes The Communication Models
. -- 10.4 Multipath And Shadowing: Space Is Rarely Free
. -- 10.5 The Final Missing Link In The Layering Model
. -- 10.6 The Time-Frequency Dynamics Of The Radio Channel
. -- 10.6.1 How a Time-Invariant Channel Distorts The Received Signal
. -- 10.6.2 Frequency Selectivity, Multiplexing, And Diversity
. -- 10.6.3 Time-Variant Channel Introduces New Frequencies
. -- 10.6.4 Combined Time-Frequency Dynamics
. -- 10.7 Two Ideas To Deal With Multipath Propagation And delay Spread
. -- 10.7.1 The Wideband Idea: Spread Spectrum And a Rake Receiver
. -- 10.7.2 The Narrowband Idea: Ofdm And a Guard Interval
. -- 10.8 Statistical Modeling Of Wireless Channels
. -- 10.8.1 Fading Models: Rayleigh And Some Others
. -- 10.8.2 Randomness In The Path Loss
. -- 10.9 Reciprocity And How To Use It
. -- 10.10 Chapter Summary
. -- 10.11 Further Reading
. -- 10.12 Problems And Reflections
. -- 11 Using Two, More, Or a Massive Number Of Antennas
. -- 11.1 Assumptions About The Channel Model And The Antennas
. -- 11.2 Receiving Or Transmitting With a Two-Antenna Device
. -- 11.2.1 Receiver With Two Antennas
. -- 11.2.2 Using Two Antennas At a Knowledgeable Transmitter
. -- 11.2.3 Transmit Diversity
. -- 11.3 Introducing Mimo
. -- 11.3.1 Spatial Multiplexing
. -- 11.4 Multiple Antennas For Spatial Division Of Multiple Users
. -- 11.4.1 Digital Interference-Free Beams: Zero Forcing
. -- 11.4.2 Other Schemes For Precoding And Digital Beamforming
. -- 11.5 Beamforming And Spectrum Sharing
. -- 11.6 What If The Number Of Antennas Is Scaled Massively?
. -- 11.6.1 The Base Station Knows The Channels Perfectly
. -- 11.6.2 The Base Station Has To Learn The Channels
. -- 11.7 Chapter Summary
. -- 11.8 Further Reading
. -- 11.9 Problems And Reflections
. -- 12 Wireless Beyond a Link: Connections And Networks
. -- 12.1 Wireless Connections With Different Flavors
. -- 12.1.1 Coarse Classification Of The Wireless Connections
. -- 12.1.2 The Complex, Multidimensional World Of Wireless Connectivity
. -- 12.2 Fundamental Ideas For Providing Wireless Coverage
. -- 12.2.1 Static Or Moving Infrastructure
. -- 12.2.2 Cells And a Cellular Network
. -- 12.2.3 Spatial Reuse
. -- 12.2.4 Cells Come In Different Sizes
. -- 12.2.5 Two-Way Coverage And Decoupled Access
. -- 12.3 no Cell Is An Island
. -- 12.3.1 Wired And Wireless Backhaul
. -- 12.3.2 Wireless One-Way Relaying And The Half-Duplex Loss
. -- 12.3.3 Wireless Two-Way Relaying: Reclaiming The Half-Duplex Loss
. -- 12.4 Cooperation And Coordination
. -- 12.4.1 Artificial Multipath: Treating The Bs As Yet Another Antenna
. -- 12.4.2 Distributing And Networking The Mimo Concept
. -- 12.4.3 Cooperation Through a Wireless Backhaul
. -- 12.5 Dissolving The Cells Into Clouds And Fog
. -- 12.5.1 The Unattainable Ideal Coverage
. -- 12.5.2 The Backhaul Links Must Have a Finite Capacity
. -- 12.5.3 Noisy Cooperation With a Finite Backhaul
. -- 12.5.4 Access Through Clouds And Fog
. -- 12.6 Coping With External Interference And Other Questions About The Radio Spectrum
. -- 12.6.1 Oblivious Rather Than Selfish
. -- 12.6.2 License To Control Interference
. -- 12.6.3 Spectrum Sharing And Caring
. -- 12.6.4 Duty Cycling, Sensing, And Hopping
. -- 12.6.5 Beyond The Licensed And Unlicensed And Some Final Words
. -- 12.7 Chapter Summary
. -- 12.8 Further Reading
. -- 12.9 Problems And Reflections
. -- Bibliography
. -- Index